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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LCL230-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 70.0s
% Output   : Assurance 70.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/LCL/LCL230-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: small
% detected subclass: short
% 
% strategies selected: 
% (hyper 29 #f 6 5)
% (binary-unit 11 #f 6 5)
% (binary-double 17 #f 6 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 6 5)
% (binary-posweight-order 283 #f)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(9,40,0,18,0,0,21641,4,2176,24618,5,2901,24618,1,2901,24618,50,2901,24618,40,2901,24627,0,2901,41482,3,3452,43111,4,3727,46759,5,4002,46759,1,4002,46759,50,4004,46759,40,4004,46768,0,4004,85741,3,4855,90038,4,5281,96153,5,5705,96153,5,5706,96153,1,5706,96153,50,5709,96153,40,5709,96162,0,5709,126821,4,7886)
% 
% 
% START OF PROOF
% 96154 [] axiom(or(not(or(X,X)),X)).
% 96155 [] axiom(or(not(X),or(Y,X))).
% 96157 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 96158 [] axiom(or(not(or(not(X),Y)),or(not(or(Z,X)),or(Z,Y)))).
% 96159 [] -axiom(X) | theorem(X).
% 96160 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 96161 [] -theorem(or(not(X),Y)) | -axiom(or(not(Z),X)) | theorem(or(not(Z),Y)).
% 96162 [] -theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))).
% 96164 [hyper:96159,96154] theorem(or(not(or(X,X)),X)).
% 96174 [hyper:96161,96164,96155] theorem(or(not(X),X)).
% 96207 [hyper:96160,96157,96174] theorem(or(X,or(not(or(X,Y)),Y))).
% 96398 [hyper:96161,96207,96155] theorem(or(not(X),or(not(or(not(or(Y,X)),Z)),Z))).
% 98363 [hyper:96160,96398,96157] theorem(or(not(or(not(or(X,Y)),Z)),or(not(Y),Z))).
% 102301 [hyper:96160,98363,96158] theorem(or(not(or(X,or(not(or(Y,Z)),U))),or(X,or(not(Z),U)))).
% 126822 [binary:96161.3,96162] -axiom(or(not(or(not(or(p,q)),or(p,r))),X)) | -theorem(or(not(X),or(p,or(not(q),r)))).
% 126824 [binary:96157,126822,cut:102301] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% seconds given: 29
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    16650
%  derived clauses:   1079205
%  kept clauses:      88711
%  kept size sum:     321468
%  kept mid-nuclei:   36553
%  kept new demods:   0
%  forw unit-subs:    222849
%  forw double-subs: 21087
%  forw overdouble-subs: 6344
%  backward subs:     10
%  fast unit cutoff:  1
%  full unit cutoff:  14
%  dbl  unit cutoff:  0
%  real runtime  :  78.98
%  process. runtime:  78.92
% specific non-discr-tree subsumption statistics: 
%  tried:           127203
%  length fails:    6240
%  strength fails:  468
%  predlist fails:  50839
%  aux str. fails:  224
%  by-lit fails:    110
%  full subs tried: 61912
%  full subs fail:  55568
% 
% ; 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/LCL/LCL230-1+noeq.in")
% 
%------------------------------------------------------------------------------