%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN604-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 : art03.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 20.0s
% Output : Assurance 20.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/SYN604-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 6 7)
% (binary-unit 10 #f 6 7)
% (binary-double 16 #f 6 7)
% (binary 54 #t 6 7)
% (binary-order 27 #f 6 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(30,40,0,60,0,0,64268,4,2064)
%
%
% START OF PROOF
% 31 [] p16(f4(f6(f7(c20,c18),f8(f10(f11(c21))))),f4(f6(f7(c20,c18),X))) | -p16(c19,f4(X)).
% 32 [] p16(f4(f6(f7(c20,c18),c23)),f4(f6(f7(c20,c18),X))) | -p16(f4(X),f12(c19)).
% 35 [] -p16(X,Y) | -p3(Y,U) | -p3(X,Z) | p16(Z,U).
% 37 [] -p16(Z,X) | -p16(X,Y) | p16(Z,Y).
% 39 [] -p3(X,Z) | -p3(X,Y) | p3(Z,Y).
% 50 [] p16(X,f12(Y)) | p16(Y,X).
% 51 [] p16(f10(f11(c21)),f12(X)).
% 52 [] p3(f12(f10(X)),f10(X)).
% 53 [] p3(f4(f8(X)),f12(X)).
% 56 [] p3(X,X).
% 60 [] -p16(f4(f6(f7(c20,c18),X)),f4(f6(f7(c20,c18),f13(X)))).
% 87 [hyper:39,53,56] p3(f12(X),f4(f8(X))).
% 102 [hyper:39,87,52] p3(f10(X),f4(f8(f10(X)))).
% 128 [hyper:32,50] p16(f4(f6(f7(c20,c18),c23)),f4(f6(f7(c20,c18),X))) | p16(c19,f4(X)).
% 286 [hyper:35,102,51,56] p16(f4(f8(f10(f11(c21)))),f12(X)).
% 2325 [hyper:32,286] p16(f4(f6(f7(c20,c18),c23)),f4(f6(f7(c20,c18),f8(f10(f11(c21)))))).
% 2778 [hyper:60,128] p16(c19,f4(f13(c23))).
% 2828 [hyper:31,2778] p16(f4(f6(f7(c20,c18),f8(f10(f11(c21))))),f4(f6(f7(c20,c18),f13(c23)))).
% 65637 [binary:37.3,60] -p16(X,f4(f6(f7(c20,c18),f13(Y)))) | -p16(f4(f6(f7(c20,c18),Y)),X).
% 65638 [binary:2828,65637,cut:2325] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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 6
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 344
% derived clauses: 564301
% kept clauses: 34010
% kept size sum: 732634
% kept mid-nuclei: 28132
% kept new demods: 0
% forw unit-subs: 141955
% forw double-subs: 228495
% forw overdouble-subs: 78187
% backward subs: 57
% fast unit cutoff: 3
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 20.85
% process. runtime: 20.83
% specific non-discr-tree subsumption statistics:
% tried: 3113428
% length fails: 58725
% strength fails: 42144
% predlist fails: 27617
% aux str. fails: 57608
% by-lit fails: 1712
% full subs tried: 2923243
% full subs fail: 2844746
%
% ; 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/SYN604-1+noeq.in")
%
%------------------------------------------------------------------------------