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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN162-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 : 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 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/SYN162-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,2,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,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,8,4428,50,8,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
% 8121 [] n0(d,e).
% 8131 [] r0(e).
% 8132 [] p0(b,X).
% 8135 [] q0(X,d).
% 8136 [] p0(c,b).
% 8145 [] m0(e,b,c).
% 8148 [] n0(e,e).
% 8152 [] n0(c,d).
% 8157 [] -n0(X,Y) | k1(Y).
% 8159 [?] ?
% 8281 [] -p0(X,X) | s1(X).
% 8282 [?] ?
% 8315 [] p2(X,X,X) | -k1(X).
% 8342 [] q2(X,X,Y) | -l1(Y,X).
% 8396 [] -p2(X,Y,Z) | n3(Z).
% 8411 [] -q2(X,Y,Z) | -n0(X,Y) | q3(Y,Z).
% 8430 [] -q3(e,b) | -n0(c,d) | -n3(e) | k4(c).
% 8471 [] n5(X,X) | -k4(X) | -s1(X).
% 8487 [] -n5(c,c).
% 8504 [binary:8121,8157] k1(e).
% 8517 [input:8159,slowcut:8131] -m0(X,Y,Z) | -p0(Z,Y) | l1(Y,X).
% 8525 [binary:8145,8517,cut:8136] l1(b,e).
% 8529 [binary:8132,8281] s1(b).
% 8573 [binary:8504,8315.2] p2(e,e,e).
% 8600 [binary:8573,8396] n3(e).
% 8923 [input:8282,slowcut:8135,slowcut:8529] s1(X).
% 8990 [binary:8525,8342.2] q2(e,e,b).
% 9043 [binary:8487,8471] -k4(c) | -s1(c).
% 9047 [binary:8923,9043.2] -k4(c).
% 9567 [binary:8990,8411,cut:8148] q3(e,b).
% 9700 [input:8430,cut:9567,cut:8152,cut:8600,cut:9047] 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:    687
%  derived clauses:   2307
%  kept clauses:      839
%  kept size sum:     5270
%  kept mid-nuclei:   0
%  kept new demods:   0
%  forw unit-subs:    891
%  forw double-subs: 162
%  forw overdouble-subs: 57
%  backward subs:     237
%  fast unit cutoff:  217
%  full unit cutoff:  64
%  dbl  unit cutoff:  6
%  real runtime:  0.24
%  process. runtime:  0.23
% specific non-discr-tree subsumption statistics: 
%  tried:           280
%  length fails:    22
%  strength fails:  98
%  predlist fails:  0
%  aux str. fails:  8
%  by-lit fails:    16
%  full subs tried: 124
%  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/SYN162-1+noeq.in")
% 
%------------------------------------------------------------------------------