TSTP Solution File: SYN301-1 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN301-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 : art05.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/SYN301-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,1,738,0,2,738,50,2,1107,0,3,1107,50,3,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,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,9,5904,50,9,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,12,8118,50,12,8118,40,12,8487,0,13)
% 
% 
% START OF PROOF
% 8119 [] s0(d).
% 8131 [] r0(e).
% 8132 [] p0(b,X).
% 8136 [] p0(c,b).
% 8137 [] m0(X,d,Y).
% 8145 [] m0(e,b,c).
% 8155 [] n0(b,a).
% 8158 [] -n0(X,Y) | l1(Y,Y).
% 8159 [?] ?
% 8161 [] -m0(X,X,Y) | m1(Y,X,Y).
% 8241 [?] ?
% 8291 [?] ?
% 8293 [] -p1(X,Y,Z) | n2(Z).
% 8332 [] -m1(X,Y,X) | p2(Y,X,Y).
% 8384 [?] ?
% 8392 [] m3(X,X,X) | -n2(X).
% 8407 [] -m3(X,Y,Z) | -p2(U,X,Z) | p3(U,X,X).
% 8455 [?] ?
% 8487 [] -s4(a).
% 8515 [binary:8155,8158] l1(a,a).
% 8517 [input:8159,slowcut:8131] -m0(X,Y,Z) | -p0(Z,Y) | l1(Y,X).
% 8525 [binary:8145,8517,cut:8136] l1(b,e).
% 8538 [binary:8137,8161] m1(X,d,X).
% 8857 [input:8241,slowcut:8132] p1(X,X,X).
% 8858 [binary:8293,8857] n2(X).
% 8864 [binary:8392.2,8858] m3(X,X,X).
% 8973 [input:8291,slowcut:8525] -s0(X) | m2(X).
% 8974 [binary:8119,8973] m2(d).
% 9227 [binary:8538,8332] p2(d,X,d).
% 9416 [input:8384,cut:8858,slowcut:8864] m3(X,Y,Y) | -m2(Y).
% 9418 [binary:8974,9416.2] m3(X,d,d).
% 9536 [binary:9227,8407.2,slowcut:9418] p3(d,X,X).
% 9832 [input:8455,slowcut:9536] -l1(X,Y) | s4(X).
% 9834 [binary:8487,9832.2,slowcut:8515] 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:    750
%  derived clauses:   2513
%  kept clauses:      929
%  kept size sum:     5644
%  kept mid-nuclei:   0
%  kept new demods:   0
%  forw unit-subs:    923
%  forw double-subs: 165
%  forw overdouble-subs: 58
%  backward subs:     282
%  fast unit cutoff:  232
%  full unit cutoff:  72
%  dbl  unit cutoff:  6
%  real runtime:  0.25
%  process. runtime:  0.25
% 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/SYN301-1+noeq.in")
% 
%------------------------------------------------------------------------------