%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN627-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 : art07.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/SYN627-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 13)
% (binary-unit 10 #f 4 13)
% (binary-double 16 #f 4 13)
% (binary 54 #t 4 13)
% (binary-order 27 #f 4 13)
% (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(36,40,1,72,0,1)
%
%
% START OF PROOF
% 45 [] -p16(c17,c20,X,Y,c22) | -p16(c17,c20,X,Z,U) | p3(Y,Z).
% 46 [] p3(f4(X,Y),f4(Z,U)) | -p2(X,Z) | -p3(Y,U).
% 50 [] p16(c17,c20,f9(c19,X),f14(X),c25) | -p15(X,c19).
% 53 [] p3(c24,f4(f7(c17,X),f14(X))) | -p15(X,c19).
% 55 [] -p3(X,Z) | -p3(X,Y) | p3(Z,Y).
% 63 [] p16(c17,c20,f9(c19,c18),c21,c22).
% 64 [] p3(c23,f4(f7(c17,c18),c21)).
% 65 [] p15(c18,c19).
% 66 [] p2(X,X).
% 67 [] p3(X,X).
% 72 [] -p3(c23,c24).
% 132 [hyper:50,65] p16(c17,c20,f9(c19,c18),f14(c18),c25).
% 135 [hyper:53,65] p3(c24,f4(f7(c17,c18),f14(c18))).
% 198 [hyper:55,64,67] p3(f4(f7(c17,c18),c21),c23).
% 981 [hyper:55,135,67] p3(f4(f7(c17,c18),f14(c18)),c24).
% 1784 [hyper:45,132,63] p3(c21,f14(c18)).
% 4582 [hyper:55,1784,67] p3(f14(c18),c21).
% 5046 [hyper:46,4582,66] p3(f4(X,f14(c18)),f4(X,c21)).
% 22729 [hyper:55,5046,981] p3(f4(f7(c17,c18),c21),c24).
% 24518 [hyper:55,22729,198,cut:72] 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 13
% clause depth limited to 4
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 43
% derived clauses: 67175
% kept clauses: 2059
% kept size sum: 64080
% kept mid-nuclei: 22369
% kept new demods: 0
% forw unit-subs: 19435
% forw double-subs: 21087
% forw overdouble-subs: 3
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 1
% dbl unit cutoff: 0
% real runtime: 1.58
% process. runtime: 1.57
% specific non-discr-tree subsumption statistics:
% tried: 1505
% length fails: 0
% strength fails: 86
% predlist fails: 1416
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 3
% 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/SYN627-1+noeq.in")
%
%------------------------------------------------------------------------------