%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN594-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 : art05.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/SYN594-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 9 7)
% (binary-unit 10 #f 9 7)
% (binary-double 16 #f 9 7)
% (binary 54 #t 9 7)
% (binary-order 27 #f 9 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(27,40,0,54,0,0)
%
%
% START OF PROOF
% 28 [] p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22))))).
% 36 [] p15(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),c19).
% 37 [] -p2(X,Z) | -p2(X,Y) | p2(Z,Y).
% 39 [] -p15(X,Y) | p14(X,Y) | p2(X,Y).
% 45 [] p14(c19,f6(f3(f4(f5(c17))),c16)).
% 46 [] -p14(X,Y) | p15(X,Y).
% 47 [] p14(c18,f3(f4(f5(c17)))).
% 49 [] p2(X,X).
% 51 [] -p14(X,Y) | -p2(X,Y).
% 52 [] -p2(c19,f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17))))).
% 54 [] -p7(c20,f8(f10(f12(f11(f3(f5(c17)))),X),f8(f10(f11(f3(f4(f5(c17)))),Y),f9(f11(Z),f10(f11(f3(f4(f5(c17)))),c22))))) | -p14(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),Z) | -p15(Z,f6(f3(f4(f5(c17))),c16)) | -p14(X,f3(f4(f5(c17)))).
% 97 [hyper:46,45] p15(c19,f6(f3(f4(f5(c17))),c16)).
% 146 [hyper:39,36] p14(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),c19) | p2(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),c19).
% 168 [hyper:54,146,28,cut:97,cut:47] p2(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),c19).
% 187 [hyper:37,146,49,cut:52] p14(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),c19).
% 188 [hyper:51,168,cut:187] 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 9
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 32
% derived clauses: 255
% kept clauses: 12
% kept size sum: 245
% kept mid-nuclei: 101
% kept new demods: 0
% forw unit-subs: 84
% forw double-subs: 1
% forw overdouble-subs: 0
% backward subs: 1
% fast unit cutoff: 8
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 0.0
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 16
% length fails: 0
% strength fails: 9
% predlist fails: 6
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 1
% full subs fail: 1
%
% ; 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/SYN594-1+noeq.in")
%
%------------------------------------------------------------------------------