%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN714-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 : art06.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/SYN714-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 3 9)
% (binary-unit 30 #f 3 9)
% (binary-double 18 #f 3 9)
% (binary 90 #t 3 9)
% (binary-order 30 #f 3 9)
% (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 *********
%
% **** EMPTY CLAUSE DERIVED ****
% By given clause simplification.
%
%
% timer checkpoints: c(105,40,1,210,0,1)
%
%
% START OF PROOF
% 113 [] -p52(f20(f21(c62,c64)),X) | p16(f17(X),c65) | -p50(X,Y,c62) | p50(X,Y,c60) | -p51(X,Y).
% 124 [] p51(X,f25(f27(Y,Z),U)) | -p53(Z,f17(X)) | -p51(X,U).
% 147 [] p50(c66,f25(f27(c59,X),c67),c62) | -p53(X,f17(c66)).
% 182 [] p52(f20(f21(c62,c64)),c66).
% 186 [] p53(c68,f17(c66)).
% 187 [] p51(c66,c67).
% 209 [] -p16(f17(c66),c65).
% 210 [] -p50(c66,f25(f27(c59,c68),c67),c60).
% 303 [hyper:124,186,187] p51(c66,f25(f27(X,c68),c67)).
% 307 [hyper:147,186] p50(c66,f25(f27(c59,c68),c67),c62).
% 778 [hyper:113,307,cut:182,cut:303,cut:210,cut:209] 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 9
% clause depth limited to 3
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 134
% derived clauses: 1217
% kept clauses: 36
% kept size sum: 316
% kept mid-nuclei: 464
% kept new demods: 0
% forw unit-subs: 429
% forw double-subs: 1
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 6
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 0.3
% process. runtime: 0.3
% specific non-discr-tree subsumption statistics:
% tried: 95
% length fails: 5
% strength fails: 35
% predlist fails: 55
% 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/SYN714-1+noeq.in")
%
%------------------------------------------------------------------------------