%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN177-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 : art08.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/SYN177-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 *********
%
%
% timer checkpoints: c(369,40,2,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,5,2583,50,5,2952,0,5,2952,50,5,3321,0,6,3321,50,6,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,9,5535,50,9,5904,0,10,5904,50,10,6273,0,10,6273,50,10,6642,0,10,6642,50,10,7011,0,11,7011,50,11,7380,0,11,7380,50,11,7749,0,12,7749,50,12,8118,0,13,8118,50,13,8118,40,13,8487,0,13)
%
%
% START OF PROOF
% 8131 [] r0(e).
% 8136 [] p0(c,b).
% 8145 [] m0(e,b,c).
% 8148 [] n0(e,e).
% 8159 [?] ?
% 8342 [] q2(X,X,Y) | -l1(Y,X).
% 8411 [] -q2(X,Y,Z) | -n0(X,Y) | q3(Y,Z).
% 8487 [] -q3(X,b).
% 8517 [input:8159,slowcut:8131] -m0(X,Y,Z) | -p0(Z,Y) | l1(Y,X).
% 8525 [binary:8145,8517,cut:8136] l1(b,e).
% 8986 [binary:8525,8342.2] q2(e,e,b).
% 9561 [binary:8986,8411,cut:8148,cut:8487] 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: 625
% derived clauses: 2080
% kept clauses: 740
% kept size sum: 4635
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 823
% forw double-subs: 158
% forw overdouble-subs: 56
% backward subs: 237
% fast unit cutoff: 189
% full unit cutoff: 55
% dbl unit cutoff: 6
% real runtime: 0.23
% process. runtime: 0.22
% specific non-discr-tree subsumption statistics:
% tried: 257
% length fails: 22
% strength fails: 80
% predlist fails: 0
% aux str. fails: 8
% by-lit fails: 16
% full subs tried: 123
% 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/SYN177-1+noeq.in")
%
%------------------------------------------------------------------------------