%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN709-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 : art02.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/SYN709-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: medium
% detected subclass: long
%
% strategies selected:
% (hyper 57 #f 5 7)
% (binary-unit 28 #f 5 7)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 5 7)
% (binary 28 #t 5 7)
% (hyper 28 #t)
% (hyper 159 #f)
% (binary-posweight-order 85 #f)
% (binary-weightorder 39 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 47 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(83,40,1,166,0,1)
%
%
% START OF PROOF
% 84 [] p47(f31(f33(c62,c63),f25(f28(c64,c65),X)),f25(f28(c64,c65),Y)) | -p47(f31(f33(c62,c63),X),Y).
% 86 [] p47(f31(f33(c62,c63),f34(c66,X)),Y) | -p46(f23(c58,X),f20(c59,Y)).
% 95 [] p30(f31(X,Y),f31(Z,U)) | -p19(Y,U) | -p29(X,Z).
% 106 [] -p47(X,Y) | -p19(Y,Z) | -p30(X,U) | p47(U,Z).
% 107 [] p19(f25(f28(c64,X),f34(c66,Y)),f34(X,Y)).
% 136 [] p46(f23(c58,c56),f20(c59,c60)).
% 144 [] p19(X,X).
% 151 [] p29(X,X).
% 166 [] -p47(f31(f33(c62,c63),f34(c65,c56)),f25(f28(c64,c65),c60)).
% 254 [hyper:86,136] p47(f31(f33(c62,c63),f34(c66,c56)),c60).
% 308 [hyper:84,254] p47(f31(f33(c62,c63),f25(f28(c64,c65),f34(c66,c56))),f25(f28(c64,c65),c60)).
% 320 [hyper:95,107,151] p30(f31(X,f25(f28(c64,Y),f34(c66,Z))),f31(X,f34(Y,Z))).
% 513 [hyper:106,308,144,320,cut:166] 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 5
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 96
% derived clauses: 619
% kept clauses: 27
% kept size sum: 465
% kept mid-nuclei: 271
% kept new demods: 0
% forw unit-subs: 207
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 0.2
% process. runtime: 0.2
% specific non-discr-tree subsumption statistics:
% tried: 12
% length fails: 0
% strength fails: 8
% predlist fails: 4
% 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/SYN709-1+noeq.in")
%
%------------------------------------------------------------------------------