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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN180-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/SYN180-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,1,738,50,1,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,10,7011,50,10,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).
% 8146 [] k0(e).
% 8152 [] n0(c,d).
% 8157 [] -n0(X,Y) | k1(Y).
% 8161 [] -m0(X,X,Y) | m1(Y,X,Y).
% 8192 [] -m0(b,X,Y) | n1(Y,Y,X).
% 8241 [?] ?
% 8262 [] q1(X,X,X) | -s0(X).
% 8280 [?] ?
% 8283 [] -m1(X,Y,Z) | -k2(U,Y) | k2(Z,Y) | -k1(U).
% 8285 [] -q1(X,Y,Y) | k2(Y,Y).
% 8293 [] -p1(X,Y,Z) | n2(Z).
% 8335 [] -n1(X,X,Y) | q2(X,X,X) | -k1(Y).
% 8343 [?] ?
% 8350 [] k3(X,X,Y) | -k2(Y,X).
% 8392 [] m3(X,X,X) | -n2(X).
% 8451 [?] ?
% 8487 [] -q4(a,e).
% 8507 [binary:8152,8157] k1(d).
% 8538 [binary:8137,8161] m1(X,d,X).
% 8560 [binary:8119,8262.2] q1(d,d,d).
% 8661 [binary:8137,8192] n1(X,X,d).
% 8857 [input:8241,slowcut:8132] p1(X,X,X).
% 8858 [binary:8293,8857] n2(X).
% 8864 [binary:8392.2,8858] m3(X,X,X).
% 8927 [binary:8560,8285] k2(d,d).
% 9061 [input:8280,cut:8119] -q1(d,X,d) | -q0(Y,X) | r1(Y).
% 9062 [binary:8135,9061.2,cut:8560] r1(X).
% 9088 [binary:8927,8283.2,cut:8507,slowcut:8538] k2(X,d).
% 9098 [binary:8350.2,9088] k3(d,d,X).
% 9250 [binary:8507,8335.3,cut:8661] q2(X,X,X).
% 9297 [input:8343,cut:9250,cut:9062,slowcut:8137] q2(X,Y,X) | -k0(Y).
% 9298 [binary:8146,9297.2] q2(X,e,X).
% 9801 [input:8451,slowcut:8864,slowcut:9098] -q2(X,Y,Z) | q4(Z,Y).
% 9803 [binary:8487,9801.2,slowcut:9298] 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:    740
%  derived clauses:   2464
%  kept clauses:      902
%  kept size sum:     5573
%  kept mid-nuclei:   0
%  kept new demods:   0
%  forw unit-subs:    903
%  forw double-subs: 165
%  forw overdouble-subs: 58
%  backward subs:     279
%  fast unit cutoff:  231
%  full unit cutoff:  70
%  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/SYN180-1+noeq.in")
% 
%------------------------------------------------------------------------------