TSTP Solution File: LCL202-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL202-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 : art10.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 30.0s
% Output : Assurance 30.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/LCL202-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,6,845,0,6,22272,4,2107,25363,1,2807,25363,50,2808,25363,40,2808,25372,0,2808,30071,3,3359,30444,50,3464,30444,40,3464,30453,0,3464)
%
%
% START OF PROOF
% 30445 [] axiom(or(not(or(X,X)),X)).
% 30446 [] axiom(or(not(X),or(Y,X))).
% 30447 [] axiom(or(not(or(X,Y)),or(Y,X))).
% 30448 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 30450 [] -axiom(X) | theorem(X).
% 30451 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 30452 [] -theorem(or(not(X),Y)) | -axiom(or(not(Z),X)) | theorem(or(not(Z),Y)).
% 30453 [] -theorem(or(not(not(or(p,q))),or(p,not(q)))).
% 30456 [binary:30450,30446] theorem(or(not(X),or(Y,X))).
% 30461 [binary:30445,30451] -theorem(or(X,X)) | theorem(X).
% 30462 [binary:30446,30451] theorem(or(X,Y)) | -theorem(Y).
% 30463 [binary:30456,30451.2] -axiom(or(not(or(not(X),or(Y,X))),Z)) | theorem(Z).
% 30464 [binary:30447,30451] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 30477 [binary:30451.2,30462] -axiom(or(not(or(X,Y)),Z)) | -theorem(Y) | theorem(Z).
% 30527 [binary:30446,30452.2] -theorem(or(not(or(X,Y)),Z)) | theorem(or(not(Y),Z)).
% 30638 [binary:30448,30463] theorem(or(X,or(not(Y),Y))).
% 30651 [binary:30461,30638] theorem(or(not(X),X)).
% 30657 [binary:30464,30651] theorem(or(X,not(X))).
% 30960 [binary:30448,30477] theorem(or(X,or(Y,Z))) | -theorem(or(X,Z)).
% 32034 [binary:30657,30527] theorem(or(not(X),not(not(or(Y,X))))).
% 32252 [binary:30464,32034] theorem(or(not(not(or(X,Y))),not(Y))).
% 33372 [binary:30453,30960,cut:32252] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using double 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 5
% clause depth limited to 5
% seconds given: 17
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 11984
% derived clauses: 1014340
% kept clauses: 17707
% kept size sum: 317867
% kept mid-nuclei: 14533
% kept new demods: 0
% forw unit-subs: 49048
% forw double-subs: 1969
% forw overdouble-subs: 563
% backward subs: 22
% fast unit cutoff: 2
% full unit cutoff: 3
% dbl unit cutoff: 0
% real runtime : 34.88
% process. runtime: 34.87
% specific non-discr-tree subsumption statistics:
% tried: 5908
% length fails: 265
% strength fails: 40
% predlist fails: 2116
% aux str. fails: 34
% by-lit fails: 7
% full subs tried: 3334
% full subs fail: 2771
%
% ; 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/LCL202-1+noeq.in")
%
%------------------------------------------------------------------------------