TSTP Solution File: LCL195-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL195-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 109.6s
% Output : Assurance 109.6s
% 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/LCL195-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 5 5)
% (binary-unit 11 #f 5 5)
% (binary-double 17 #f 5 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 5 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(9,40,1,18,0,1,836,50,5,845,0,5,22363,4,2106,26253,5,2806,26254,1,2806,26254,50,2807,26254,40,2807,26263,0,2807,31190,3,3358,31916,4,3633,32382,50,3848,32382,40,3848,32391,0,3848,60856,3,4699,69342,4,5124,76353,5,5549,76353,1,5550,76353,50,5552,76353,40,5552,76362,0,5552,107351,4,7728,248857,5,8453,248858,1,8453,248858,50,8457,248858,40,8457,248867,0,8457,306923,3,10167,339235,4,11008)
%
%
% START OF PROOF
% 248861 [] axiom(or(not(or(X,Y)),or(Y,X))).
% 248862 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 248863 [] axiom(or(not(or(not(X),Y)),or(not(or(Z,X)),or(Z,Y)))).
% 248864 [] -axiom(X) | theorem(X).
% 248865 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 248866 [] -theorem(or(not(X),Y)) | -axiom(or(not(Z),X)) | theorem(or(not(Z),Y)).
% 248867 [] -theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p)))).
% 248872 [binary:248864,248861] theorem(or(not(or(X,Y)),or(Y,X))).
% 248878 [binary:248867,248865.3] -axiom(or(not(X),or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))))) | -theorem(X).
% 248895 [binary:248865,248862] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 248908 [binary:248865,248863] theorem(or(not(or(X,Y)),or(X,Z))) | -theorem(or(not(Y),Z)).
% 248924 [binary:248861,248866.2] -theorem(or(not(or(X,Y)),Z)) | theorem(or(not(or(Y,X)),Z)).
% 248929 [binary:248863,248866.2] -theorem(or(not(or(not(or(X,Y)),or(X,Z))),U)) | theorem(or(not(or(not(Y),Z)),U)).
% 249024 [binary:248862,248878] -theorem(or(not(or(q,p)),or(not(or(not(q),r)),or(r,p)))).
% 249408 [binary:248872,248908.2] theorem(or(not(or(X,or(Y,Z))),or(X,or(Z,Y)))).
% 253360 [binary:248924.2,249024] -theorem(or(not(or(p,q)),or(not(or(not(q),r)),or(r,p)))).
% 287822 [binary:248929,249408] theorem(or(not(or(not(X),Y)),or(not(or(Z,X)),or(Y,Z)))).
% 342222 [binary:287822,248895,slowcut:253360] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 34
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 22487
% derived clauses: 2004579
% kept clauses: 173809
% kept size sum: 0
% kept mid-nuclei: 39570
% kept new demods: 0
% forw unit-subs: 291981
% forw double-subs: 118482
% forw overdouble-subs: 12712
% backward subs: 208
% fast unit cutoff: 1
% full unit cutoff: 10
% dbl unit cutoff: 0
% real runtime : 113.30
% process. runtime: 112.76
% specific non-discr-tree subsumption statistics:
% tried: 240622
% length fails: 14640
% strength fails: 325
% predlist fails: 98545
% aux str. fails: 371
% by-lit fails: 93
% full subs tried: 114686
% full subs fail: 101974
%
% ; 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/LCL195-1+noeq.in")
%
%------------------------------------------------------------------------------