%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN717-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 : art04.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/SYN717-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: big
%
% strategies selected:
% (hyper 30 #f 6 7)
% (binary-unit 30 #f 6 7)
% (binary-double 18 #f 6 7)
% (binary 90 #t 6 7)
% (binary-order 30 #f 6 7)
% (binary-posweight-order 54 #f)
% (binary-order-sos 30 #t)
% (binary-unit-uniteq 30 #f)
% (binary-weightorder 30 #f)
% (binary-weightorder-sos 30 #f)
% (binary-order 30 #f)
% (hyper-order 30 #f)
% (binary 168 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(113,40,1,229,0,1)
%
%
% START OF PROOF
% 132 [] p24(f25(X,Y),f25(Z,U)) | -p22(X,Z) | -p23(Y,U).
% 142 [] -p60(X,Y) | -p20(Y,Z) | -p24(X,U) | p60(U,Z).
% 181 [] p59(f29(c73,f31(f33(c74,c77),c78)),c72).
% 183 [] p60(f25(c75,c79),f21(c76,c78)).
% 189 [] p23(c79,c77).
% 196 [] p20(X,X).
% 197 [] p22(X,X).
% 225 [] -p59(f29(c73,f31(f33(c74,Z),U)),c72) | -p59(f29(c73,f31(f33(c74,X),Y)),c72) | -p60(f25(c75,X),f21(c76,U)).
% 343 [hyper:132,189,197] p24(f25(X,c79),f25(X,c77)).
% 417 [hyper:142,183,196,343] p60(f25(c75,c77),f21(c76,c78)).
% 438 [hyper:225,417,slowcut:181,slowcut:181] 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 6
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 65
% derived clauses: 344
% kept clauses: 32
% kept size sum: 324
% kept mid-nuclei: 161
% kept new demods: 0
% forw unit-subs: 103
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 0
% full unit cutoff: 2
% dbl unit cutoff: 0
% real runtime: 0.1
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 8
% length fails: 0
% strength fails: 3
% predlist fails: 5
% 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/SYN717-1+noeq.in")
%
%------------------------------------------------------------------------------