TSTP Solution File: LCL225-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL225-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 : art04.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 49.8s
% Output : Assurance 49.8s
% 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/LCL225-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,21354,4,2176,28058,5,2901,28059,1,2901,28059,50,2901,28059,40,2901,28068,0,2902,44177,3,3453,45497,4,3728,50152,5,4003,50152,1,4003,50152,50,4004,50152,40,4004,50161,0,4004,83009,3,4871,87072,4,5281)
%
%
% START OF PROOF
% 50153 [] axiom(or(not(or(X,X)),X)).
% 50154 [] axiom(or(not(X),or(Y,X))).
% 50155 [] axiom(or(not(or(X,Y)),or(Y,X))).
% 50156 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 50157 [] axiom(or(not(or(not(X),Y)),or(not(or(Z,X)),or(Z,Y)))).
% 50158 [] -axiom(X) | theorem(X).
% 50159 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 50160 [] -theorem(or(not(X),Y)) | -axiom(or(not(Z),X)) | theorem(or(not(Z),Y)).
% 50161 [] -theorem(or(not(or(not(p),or(not(q),r))),or(not(or(not(p),q)),or(not(p),r)))).
% 50166 [binary:50158,50155] theorem(or(not(or(X,Y)),or(Y,X))).
% 50169 [binary:50153,50159] -theorem(or(X,X)) | theorem(X).
% 50170 [binary:50154,50159] theorem(or(X,Y)) | -theorem(Y).
% 50173 [binary:50155,50159] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 50196 [binary:50159,50156] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 50206 [binary:50159,50157] theorem(or(not(or(X,Y)),or(X,Z))) | -theorem(or(not(Y),Z)).
% 50238 [binary:50154,50160.2] -theorem(or(not(or(X,Y)),Z)) | theorem(or(not(Y),Z)).
% 50242 [binary:50161,50160.3] -theorem(or(not(X),or(not(or(not(p),q)),or(not(p),r)))) | -axiom(or(not(or(not(p),or(not(q),r))),X)).
% 50243 [binary:50155,50160.2] -theorem(or(not(or(X,Y)),Z)) | theorem(or(not(or(Y,X)),Z)).
% 50256 [binary:50157,50160.2] -theorem(or(not(or(not(or(X,Y)),or(X,Z))),U)) | theorem(or(not(or(not(Y),Z)),U)).
% 50325 [binary:50170.2,50173.2] theorem(or(X,or(Y,Z))) | -theorem(or(Z,Y)).
% 51945 [binary:50196,50325] theorem(or(X,or(Y,Z))) | -theorem(or(Z,X)).
% 52555 [binary:50166,50238] theorem(or(not(X),or(X,Y))).
% 52707 [binary:50206.2,52555] theorem(or(not(or(X,Y)),or(X,or(Y,Z)))).
% 52832 [binary:50156,50242.2] -theorem(or(not(or(not(q),or(not(p),r))),or(not(or(not(p),q)),or(not(p),r)))).
% 58010 [binary:50169,51945] -theorem(or(X,or(Y,X))) | theorem(or(Y,X)).
% 62752 [binary:50196.2,58010] -theorem(or(X,or(Y,Y))) | theorem(or(X,Y)).
% 74718 [binary:50243,52707] theorem(or(not(or(X,Y)),or(Y,or(X,Z)))).
% 84814 [binary:62752,74718] theorem(or(not(or(X,or(X,Y))),or(X,Y))).
% 86701 [binary:50206.2,84814] theorem(or(not(or(X,or(Y,or(Y,Z)))),or(X,or(Y,Z)))).
% 88699 [binary:86701,50256,slowcut:52832] 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 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 6
% seconds given: 17
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 12263
% derived clauses: 410985
% kept clauses: 63785
% kept size sum: 0
% kept mid-nuclei: 22735
% kept new demods: 0
% forw unit-subs: 122755
% forw double-subs: 21939
% forw overdouble-subs: 7255
% backward subs: 49
% fast unit cutoff: 0
% full unit cutoff: 3
% dbl unit cutoff: 0
% real runtime : 54.99
% process. runtime: 54.48
% specific non-discr-tree subsumption statistics:
% tried: 143134
% length fails: 8085
% strength fails: 1628
% predlist fails: 53396
% aux str. fails: 193
% by-lit fails: 113
% full subs tried: 70753
% full subs fail: 63498
%
% ; 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/LCL225-1+noeq.in")
%
%------------------------------------------------------------------------------