%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN156-1 : TPTP v3.4.2. Released v1.1.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/SYN156-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: big
% detected subclass: long
%
% strategies selected:
% (hyper 25 #t 1 9)
% (binary-unit 25 #f 1 9)
% (binary-double 25 #f 1 9)
% (binary-posweight-order 25 #f 1 9)
% (binary 50 #t 1 9)
% (hyper 25 #t)
% (hyper 116 #f)
% (binary-posweight-order 76 #f)
% (binary-order 25 #f)
% (binary-weightorder 25 #f)
% (binary-posweight-order-sos 76 #t)
% (binary-unit-sos 40 #t)
% (binary 67 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
% **** EMPTY CLAUSE DERIVED ****
% By given clause simplification.
%
%
% timer checkpoints: c(369,40,1,738,0,2,738,50,2,1107,0,2,1107,50,2,1476,0,3,1476,50,3,1845,0,3,1845,50,3,2214,0,4,2214,50,4,2583,0,4,2583,50,4,2952,0,5,2952,50,5,3321,0,5,3321,50,5,3690,0,6,3690,50,6,4059,0,7,4059,50,7,4428,0,7,4428,50,7,4797,0,8,4797,50,8,5166,0,8,5166,50,8,5535,0,8,5535,50,8,5904,0,9,5904,50,9,6273,0,9,6273,50,9,6642,0,10,6642,50,10,7011,0,11,7011,50,11,7380,0,11,7380,50,11,7749,0,11,7749,50,11,8118,0,12,8118,50,12,8118,40,12,8487,0,12)
%
%
% START OF PROOF
% 8119 [] s0(d).
% 8132 [] p0(b,X).
% 8135 [] q0(X,d).
% 8137 [] m0(X,d,Y).
% 8138 [] l0(a).
% 8155 [] n0(b,a).
% 8157 [] -n0(X,Y) | k1(Y).
% 8241 [?] ?
% 8248 [?] ?
% 8262 [] q1(X,X,X) | -s0(X).
% 8280 [?] ?
% 8281 [] -p0(X,X) | s1(X).
% 8282 [?] ?
% 8289 [?] ?
% 8293 [] -p1(X,Y,Z) | n2(Z).
% 8297 [?] ?
% 8311 [?] ?
% 8344 [] -r1(X) | -l0(X) | r2(X).
% 8392 [] m3(X,X,X) | -n2(X).
% 8407 [] -m3(X,Y,Z) | -p2(U,X,Z) | p3(U,X,X).
% 8414 [?] ?
% 8423 [] -p2(X,Y,Z) | r3(X,Z,X).
% 8432 [] k4(e) | -q1(a,a,X) | -r3(Y,e,X) | -q3(Y,Y).
% 8437 [] -p3(X,Y,Y) | -n4(X,X) | n4(X,Y).
% 8440 [] -m3(X,X,X) | n4('X,'X) | -k4('Y).
% 8487 [] -n4(a,e).
% 8508 [binary:8155,8157] k1(a).
% 8529 [binary:8132,8281] s1(b).
% 8560 [binary:8119,8262.2] q1(d,d,d).
% 8578 [binary:8138,8344.2] -r1(a) | r2(a).
% 8857 [input:8241,slowcut:8132] p1(X,X,X).
% 8858 [binary:8293,8857] n2(X).
% 8864 [binary:8392.2,8858] m3(X,X,X).
% 8911 [?] ?
% 8913 [input:8248,slowcut:8132] q1(X,Y,X) | -n0(Z,Y).
% 8918 [binary:8155,8913.2] q1(X,a,X).
% 8921 [input:8282,slowcut:8135,slowcut:8529] s1(X).
% 9061 [input:8280,cut:8119] -q1(d,X,d) | -q0(Y,X) | r1(Y).
% 9062 [binary:8135,9061.2,cut:8560] r1(X).
% 9064 [binary:8578,9062] r2(a).
% 9102 [input:8289,slowcut:8132] -m0(X,Y,Z) | l2(Z,Z) | -s1(Y).
% 9111 [binary:8921,9102.3,slowcut:8137] l2(X,X).
% 9113 [input:8297,cut:8918] p2(X,a,X).
% 9157 [input:8311,slowcut:8508] -p2(e,X,Y) | p2(X,Y,Y).
% 9158 [binary:9113,9157] p2(a,e,e).
% 9424 [binary:9158,8423] r3(a,e,a).
% 9526 [binary:9158,8407.2,slowcut:8864] p3(a,e,e).
% 9598 [input:8414,cut:9111,slowcut:8529] q3(X,X) | -r2(X).
% 9599 [binary:9064,9598.2] q3(a,a).
% 9705 [binary:9424,8432.3,cut:8911,cut:9599] k4(e).
% 9719 [binary:8487,8437.3,cut:9526] -n4(a,a).
% 9744 [input:8440,cut:8864,slowcut:9719,slowcut:9705] 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 9
% clause depth limited to 1
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 716
% derived clauses: 2401
% kept clauses: 858
% kept size sum: 5373
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 895
% forw double-subs: 165
% forw overdouble-subs: 58
% backward subs: 256
% fast unit cutoff: 226
% full unit cutoff: 66
% dbl unit cutoff: 6
% real runtime: 0.24
% process. runtime: 0.23
% specific non-discr-tree subsumption statistics:
% tried: 281
% length fails: 22
% strength fails: 98
% predlist fails: 0
% aux str. fails: 8
% by-lit fails: 16
% full subs tried: 125
% full subs fail: 64
%
% ; 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/SYN156-1+noeq.in")
%
%------------------------------------------------------------------------------