%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN601-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 40.0s
% Output : Assurance 40.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/SYN601-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(30,40,0,60,0,0,383077,4,4278,383085,50,4300,383085,40,4300,383115,0,4300)
%
%
% START OF PROOF
% 383086 [] p10(f11(X,Y,Z),f11(U,V,W)) | -p2(X,U) | -p9(Y,V) | -p10(Z,W).
% 383087 [] p2(f13(X,Y),f13(Z,U)) | -p12(Y,U) | -p3(X,Z).
% 383088 [] p12(f14(X,Y),f14(Z,U)) | -p3(X,Z) | -p3(Y,U).
% 383091 [] -p19(X,Y) | -p2(X,Z) | -p10(Y,U) | p19(Z,U).
% 383092 [] p19(c21,f11(f13(f15(c21),f14(f4(c21),c22)),c24,c25)).
% 383101 [] p3(f4(X),f4(Y)) | -p2(X,Y).
% 383107 [] p3(c22,c23).
% 383110 [] p2(X,X).
% 383111 [] p3(X,X).
% 383112 [] p9(X,X).
% 383113 [] p10(X,X).
% 383114 [] -p19(c21,f11(f13(f15(c21),f14(f4(c21),c23)),c24,c25)).
% 383135 [binary:383111,383087.3] p2(f13(X,Y),f13(X,Z)) | -p12(Y,Z).
% 383165 [binary:383107,383088.3] p12(f14(X,c22),f14(Y,c23)) | -p3(X,Y).
% 383295 [binary:383114,383091.4] -p10(X,f11(f13(f15(c21),f14(f4(c21),c23)),c24,c25)) | -p2(Y,c21) | -p19(Y,X).
% 383307 [binary:383092,383295.3,cut:383110] -p10(f11(f13(f15(c21),f14(f4(c21),c22)),c24,c25),f11(f13(f15(c21),f14(f4(c21),c23)),c24,c25)).
% 383701 [binary:383086,383307,cut:383112,cut:383113,binarydemod:383101,383165,383135,cut:383110] 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 5
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2494
% derived clauses: 1183538
% kept clauses: 77540
% kept size sum: 6217
% kept mid-nuclei: 29245
% kept new demods: 0
% forw unit-subs: 230332
% forw double-subs: 4
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 3
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 43.3
% process. runtime: 43.1
% specific non-discr-tree subsumption statistics:
% tried: 3134
% length fails: 0
% strength fails: 31
% predlist fails: 2976
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 127
% full subs fail: 127
%
% ; 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/SYN601-1+noeq.in")
%
%------------------------------------------------------------------------------