%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN176-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/SYN176-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,3,738,50,3,1107,0,3,1107,50,3,1476,0,3,1476,50,3,1845,0,4,1845,50,4,2214,0,5,2214,50,5,2583,0,5,2583,50,5,2952,0,6,2952,50,6,3321,0,6,3321,50,6,3690,0,7,3690,50,7,4059,0,8,4059,50,8,4428,0,8,4428,50,8,4797,0,9,4797,50,9,5166,0,9,5166,50,9,5535,0,9,5535,50,9,5904,0,10,5904,50,10,6273,0,10,6273,50,10,6642,0,11,6642,50,11,7011,0,12,7011,50,12,7380,0,12,7380,50,12,7749,0,13,7749,50,13,8118,0,13,8118,50,13,8118,40,13,8487,0,13)
%
%
% START OF PROOF
% 8123 [] s0(b).
% 8132 [] p0(b,X).
% 8137 [] m0(X,d,Y).
% 8142 [] l0(c).
% 8144 [] n0(d,c).
% 8146 [] k0(e).
% 8157 [] -n0(X,Y) | k1(Y).
% 8196 [?] ?
% 8224 [] p1(X,X,X) | -k0(X).
% 8227 [?] ?
% 8241 [?] ?
% 8333 [?] ?
% 8338 [] -q2(X,Y,Z) | -p1(Z,Z,Y) | -n1(X,Z,Y) | q2(Z,X,Z).
% 8487 [] -q2(e,c,X).
% 8506 [binary:8144,8157] k1(c).
% 8557 [binary:8146,8224.2] p1(e,e,e).
% 8693 [input:8196,slowcut:8137] n1(X,e,e) | -k1(X).
% 8695 [binary:8506,8693.2] n1(c,e,e).
% 8849 [input:8227,cut:8123,slowcut:8142] -p1(X,Y,Z) | p1(Z,X,Z).
% 8857 [input:8241,slowcut:8132] p1(X,X,X).
% 8859 [binary:8849,8857] p1(X,X,X).
% 9236 [input:8333,cut:8859] q2(X,Y,Y) | -k0(Y).
% 9238 [binary:8146,9236.2] q2(X,e,e).
% 9270 [binary:8695,8338.3,cut:8557,cut:9238,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: 514
% derived clauses: 1508
% kept clauses: 510
% kept size sum: 3064
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 602
% forw double-subs: 110
% forw overdouble-subs: 33
% backward subs: 205
% fast unit cutoff: 143
% full unit cutoff: 38
% dbl unit cutoff: 6
% real runtime: 0.21
% process. runtime: 0.19
% specific non-discr-tree subsumption statistics:
% tried: 181
% length fails: 16
% strength fails: 56
% predlist fails: 0
% aux str. fails: 7
% by-lit fails: 13
% full subs tried: 81
% full subs fail: 45
%
% ; 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/SYN176-1+noeq.in")
%
%------------------------------------------------------------------------------