## TSTP Solution File: SYN053-1 by Gandalf---c-2.6

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN053-1 : TPTP v3.4.2. Released v1.0.0.
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art04.cs.miami.edu
% Model    : i686 unknown
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 1000MB
% OS       : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s

% Result   : Unsatisfiable 0.0s
% Output   : Assurance 0.0s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/SYN/SYN053-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: small
%
% strategies selected:
% (hyper 27 #f 1 5)
% (binary-unit 10 #f 1 5)
% (binary-double 16 #f)
% (binary 16 #t 1 5)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 1 5)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
%
%
% SOS clause
% -big_f(a) | -big_f(b).
% was split for some strategies as:
% -big_f(a).
% -big_f(b).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(5,40,1,10,0,1)
%
%
% START OF PROOF
% 7 [] big_f(b) | p(0) | big_f(X).
% 8 [] p(0) | big_f(X) | big_f(Y).
% 9 [] -p(0).
% 10 [] -big_f(a) | -big_f(b).
% 11 [input:7,factor:cut:9] big_f(b).
% 12 [input:8,factor:cut:9] big_f(X).
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 1
% seconds given: 13
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
%  given clauses:    1
%  derived clauses:   3
%  kept clauses:      2
%  kept size sum:     4
%  kept mid-nuclei:   0
%  kept new demods:   0
%  forw unit-subs:    0
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     3
%  fast unit cutoff:  3
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.1
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics:
%  tried:           0
%  length fails:    0
%  strength fails:  0
%  predlist fails:  0
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 0
%  full subs fail:  0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/SYN/SYN053-1+noeq.in")
%
%------------------------------------------------------------------------------
```