%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN616-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 : art10.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 19.6s
% Output : Assurance 19.6s
% 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/SYN616-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 6 9)
% (binary-unit 28 #f 6 9)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 6 9)
% (binary 28 #t 6 9)
% (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(32,40,2,64,0,2)
%
%
% START OF PROOF
% 34 [] -p14(X,Y,Z) | p14(U,V,W) | -p2(X,U) | -p2(Y,V) | -p2(Z,W).
% 35 [] p14(f7(c22,f12(f8(c21,f3(f5(c20))),c25)),f3(f5(c20)),f6(c21)).
% 36 [] p2(f7(X,Y),f7(Z,U)) | -p2(Y,U) | -p2(X,Z).
% 37 [] p2(f12(X,Y),f12(Z,U)) | -p2(X,Z) | -p2(Y,U).
% 56 [] p2(c25,c28).
% 59 [] p2(X,X).
% 64 [] -p14(f7(c22,f12(f8(c21,f3(f5(c20))),c28)),f3(f5(c20)),f6(c21)).
% 110 [hyper:37,56,59] p2(f12(X,c25),f12(X,c28)).
% 1114 [hyper:36,110,59] p2(f7(X,f12(Y,c25)),f7(X,f12(Y,c28))).
% 1535924 [hyper:34,1114,35,59,59,cut:64] 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 6
% seconds given: 57
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 545
% derived clauses: 1621683
% kept clauses: 77002
% kept size sum: 0
% kept mid-nuclei: 20407
% kept new demods: 0
% forw unit-subs: 85813
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 2
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 24.30
% process. runtime: 23.81
% specific non-discr-tree subsumption statistics:
% tried: 5047
% length fails: 0
% strength fails: 23
% predlist fails: 1972
% aux str. fails: 33
% by-lit fails: 0
% full subs tried: 3019
% full subs fail: 3019
%
% ; 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/SYN616-1+noeq.in")
%
%------------------------------------------------------------------------------