%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN710-1 : TPTP v3.4.2. Released v2.5.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art06.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
% Comments :
%------------------------------------------------------------------------------
%----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/SYN710-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 4 7)
% (binary-unit 10 #f 4 7)
% (binary-double 16 #f 4 7)
% (binary 54 #t 4 7)
% (binary-order 27 #f 4 7)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(87,40,1,174,0,1)
%
%
% START OF PROOF
% 95 [] -p33(f11(c46,Y),Z) | -p33(f18(c51,X),Y) | p33(f18(c51,X),Z).
% 100 [] p33(f18(c51,X),f13(f16(c48,Y),Z)) | -p33(f18(c51,X),Z).
% 102 [] -p33(f18(c51,f20(f22(c52,X),Y)),Y) | p33(f11(c46,X),Y).
% 103 [] p33(f18(c51,f20(f22(c52,X),Y)),X) | p33(f11(c46,X),Y).
% 125 [] p33(f11(c46,f13(f16(c48,c49),c50)),f9(c47,c43)).
% 174 [] -p33(f11(c46,c50),f9(c47,c43)).
% 454 [hyper:174,103] p33(f18(c51,f20(f22(c52,c50),f9(c47,c43))),c50).
% 496 [hyper:100,454] p33(f18(c51,f20(f22(c52,c50),f9(c47,c43))),f13(f16(c48,X),c50)).
% 538 [hyper:95,496,125] p33(f18(c51,f20(f22(c52,c50),f9(c47,c43))),f9(c47,c43)).
% 604 [hyper:102,538,cut:174] contradiction
% 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 7
% clause depth limited to 4
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 106
% derived clauses: 726
% kept clauses: 37
% kept size sum: 452
% kept mid-nuclei: 333
% kept new demods: 0
% forw unit-subs: 205
% forw double-subs: 20
% forw overdouble-subs: 9
% backward subs: 5
% fast unit cutoff: 3
% full unit cutoff: 1
% dbl unit cutoff: 1
% real runtime: 0.2
% process. runtime: 0.2
% specific non-discr-tree subsumption statistics:
% tried: 79
% length fails: 0
% strength fails: 46
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 33
% full subs fail: 24
%
% ; 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/SYN710-1+noeq.in")
%
%------------------------------------------------------------------------------