%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN596-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 : art09.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/SYN596-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 5 7)
% (binary-unit 28 #f 5 7)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 5 7)
% (binary 28 #t 5 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(28,40,0,56,0,0)
%
%
% START OF PROOF
% 29 [] p10(f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24),f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24)).
% 34 [] -p18(X,Y) | -p2(X,Z) | -p10(Y,U) | p18(Z,U).
% 36 [] p18(c20,f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24)).
% 41 [] -p10(X,Z) | -p10(X,Y) | p10(Z,Y).
% 52 [] p2(X,X).
% 55 [] p10(X,X).
% 56 [] -p18(c20,f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24)).
% 91 [hyper:41,29,55] p10(f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24),f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24)).
% 143 [hyper:34,91,36,52,cut:56] 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 5
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 29
% derived clauses: 140
% kept clauses: 1
% kept size sum: 21
% kept mid-nuclei: 68
% kept new demods: 0
% forw unit-subs: 39
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 0.0
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 11
% length fails: 0
% strength fails: 9
% 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/SYN596-1+noeq.in")
%
%------------------------------------------------------------------------------