%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN609-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 20.0s
% Output : Assurance 20.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/SYN609-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 8 7)
% (binary-unit 10 #f 8 7)
% (binary-double 16 #f 8 7)
% (binary 54 #t 8 7)
% (binary-order 27 #f 8 7)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(30,40,0,60,0,0,1030751,4,2030,1030775,50,2061,1030775,40,2061,1030805,0,2061)
%
%
% START OF PROOF
% 1030777 [] p17(f9(f10(f14(f4(f9(c19)),c19),f15(f4(f6(f7(f8(c20))))))),f6(f7(f8(c20)))).
% 1030778 [] p3(f12(f15(f4(f6(f7(f8(c20))))),c21),f15(f4(f6(f7(f8(c20)))))).
% 1030781 [] p3(f10(X,Y),f10(Z,U)) | -p3(X,Z) | -p3(Y,U).
% 1030785 [] -p17(X,Y) | -p2(Y,U) | -p2(X,Z) | p17(Z,U).
% 1030786 [] -p3(X,Z) | -p3(X,Y) | p3(Z,Y).
% 1030793 [] p2(f9(X),f9(Y)) | -p3(X,Y).
% 1030799 [] p3(X,X).
% 1030801 [] p2(X,X).
% 1030805 [] -p17(f9(f10(f14(f4(f9(c19)),c19),f12(X,c21))),f6(f7(f8(c20)))).
% 1030834 [binary:1030799,1030786.2] -p3(X,Y) | p3(Y,X).
% 1030849 [binary:1030778,1030834] p3(f15(f4(f6(f7(f8(c20))))),f12(f15(f4(f6(f7(f8(c20))))),c21)).
% 1030898 [binary:1030799,1030781.2] p3(f10(X,Y),f10(X,Z)) | -p3(Y,Z).
% 1031019 [binary:1030801,1030785.2] -p17(X,Y) | -p2(X,Z) | p17(Z,Y).
% 1031034 [binary:1030805,1031019.3] -p2(X,f9(f10(f14(f4(f9(c19)),c19),f12(Y,c21)))) | -p17(X,f6(f7(f8(c20)))).
% 1031071 [binary:1030777,1031034.2,binarydemod:1030898,1030793,slowcut:1030849] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 7
% clause depth limited to 8
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 613
% derived clauses: 1124769
% kept clauses: 77230
% kept size sum: 3015
% kept mid-nuclei: 8393
% kept new demods: 0
% forw unit-subs: 93769
% forw double-subs: 2
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 5
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 20.62
% process. runtime: 20.61
% specific non-discr-tree subsumption statistics:
% tried: 208
% length fails: 0
% strength fails: 11
% predlist fails: 180
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 17
% full subs fail: 17
%
% ; 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/SYN609-1+noeq.in")
%
%------------------------------------------------------------------------------