%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN691-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/SYN691-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 7 7)
% (binary-unit 28 #f 7 7)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 7 7)
% (binary 28 #t 7 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(67,40,0,134,0,0,280,50,1,347,0,1)
%
%
% START OF PROOF
% 281 [] p3(f7(c41,f10(f13(f15(c42,X),Y),Z)),f10(f13(f15(c42,f17(f19(f21(c47,X),Y),Z)),f26(f28(f30(c48,X),Y),Z)),f34(f36(f38(c49,X),Y),Z))).
% 284 [] p39(f5(c40,f10(f13(f15(c42,X),Y),Z)),U) | -p39(X,U).
% 285 [] -p39(f5(c40,f10(f13(f15(c42,X),Y),Z)),U) | p39(X,U).
% 298 [] p4(f5(X,Y),f5(Z,U)) | -p2(X,Z) | -p3(Y,U).
% 302 [] p39(f5(c40,f7(c41,f10(f13(f15(c42,c43),c44),c45))),c46).
% 303 [] -p39(X,Y) | -p22(Y,Z) | -p4(X,U) | p39(U,Z).
% 304 [] -p39(f17(f19(f21(c47,X),Y),Z),U) | p39(X,U).
% 330 [] p2(X,X).
% 332 [] p22(X,X).
% 347 [] -p39(f5(c40,f10(f13(f15(c42,c43),c44),c45)),c46).
% 375 [hyper:298,281,330] p4(f5(X,f7(c41,f10(f13(f15(c42,Y),Z),U))),f5(X,f10(f13(f15(c42,f17(f19(f21(c47,Y),Z),U)),f26(f28(f30(c48,Y),Z),U)),f34(f36(f38(c49,Y),Z),U)))).
% 508 [hyper:303,375,302,332] p39(f5(c40,f10(f13(f15(c42,f17(f19(f21(c47,c43),c44),c45)),f26(f28(f30(c48,c43),c44),c45)),f34(f36(f38(c49,c43),c44),c45))),c46).
% 516 [hyper:285,508] p39(f17(f19(f21(c47,c43),c44),c45),c46).
% 529 [hyper:304,516] p39(c43,c46).
% 538 [hyper:284,529,slowcut:347] 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 8
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 141
% derived clauses: 616
% kept clauses: 12
% kept size sum: 310
% kept mid-nuclei: 237
% kept new demods: 0
% forw unit-subs: 168
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 0.2
% process. runtime: 0.2
% specific non-discr-tree subsumption statistics:
% tried: 4
% length fails: 0
% strength fails: 2
% predlist fails: 2
% 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/SYN691-1+noeq.in")
%
%------------------------------------------------------------------------------