TSTP Solution File: LCL224-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL224-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 : art06.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/LCL224-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,21597,4,2176,25634,5,2901,25634,1,2901,25634,50,2901,25634,40,2901,25643,0,2901,42911,3,3452,44773,4,3727)
%
%
% START OF PROOF
% 25635 [] axiom(or(not(or(X,X)),X)).
% 25636 [] axiom(or(not(X),or(Y,X))).
% 25637 [] axiom(or(not(or(X,Y)),or(Y,X))).
% 25638 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 25639 [] axiom(or(not(or(not(X),Y)),or(not(or(Z,X)),or(Z,Y)))).
% 25640 [] -axiom(X) | theorem(X).
% 25641 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 25642 [] -theorem(or(not(X),Y)) | -axiom(or(not(Z),X)) | theorem(or(not(Z),Y)).
% 25643 [] -theorem(or(not(or(p,or(not(q),r))),or(not(or(p,q)),or(p,r)))).
% 25648 [binary:25640,25637] theorem(or(not(or(X,Y)),or(Y,X))).
% 25650 [binary:25635,25641] -theorem(or(X,X)) | theorem(X).
% 25651 [binary:25636,25641] theorem(or(X,Y)) | -theorem(Y).
% 25654 [binary:25637,25641] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 25668 [binary:25641,25638] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 25681 [binary:25641,25639] theorem(or(not(or(X,Y)),or(X,Z))) | -theorem(or(not(Y),Z)).
% 25692 [binary:25636,25642.2] -theorem(or(not(or(X,Y)),Z)) | theorem(or(not(Y),Z)).
% 25696 [binary:25643,25642.3] -axiom(or(not(or(p,or(not(q),r))),X)) | -theorem(or(not(X),or(not(or(p,q)),or(p,r)))).
% 25697 [binary:25637,25642.2] -theorem(or(not(or(X,Y)),Z)) | theorem(or(not(or(Y,X)),Z)).
% 25702 [binary:25639,25642.2] -theorem(or(not(or(not(or(X,Y)),or(X,Z))),U)) | theorem(or(not(or(not(Y),Z)),U)).
% 26131 [binary:25648,25692] theorem(or(not(X),or(X,Y))).
% 26149 [binary:25681.2,26131] theorem(or(not(or(X,Y)),or(X,or(Y,Z)))).
% 26258 [binary:25638,25696] -theorem(or(not(or(not(q),or(p,r))),or(not(or(p,q)),or(p,r)))).
% 28749 [binary:25668,26149] theorem(or(X,or(not(or(X,Y)),or(Y,Z)))).
% 29595 [binary:25654,28749] theorem(or(or(not(or(X,Y)),or(Y,Z)),X)).
% 30660 [binary:25651.2,29595] theorem(or(X,or(or(not(or(Y,Z)),or(Z,U)),Y))).
% 37112 [binary:25702.2,26258] -theorem(or(not(or(not(or(X,q)),or(X,or(p,r)))),or(not(or(p,q)),or(p,r)))).
% 43372 [binary:25668,30660] theorem(or(or(not(or(X,Y)),or(Y,Z)),or(U,X))).
% 48398 [binary:25650,43372] theorem(or(not(or(or(X,Y),X)),or(X,Y))).
% 48414 [binary:25697,48398] theorem(or(not(or(X,or(X,Y))),or(X,Y))).
% 48428 [binary:25681.2,48414,slowcut:37112] 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
% clause length limited to 5
% clause depth limited to 6
% seconds given: 11
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 10129
% derived clauses: 730279
% kept clauses: 29771
% kept size sum: 549423
% kept mid-nuclei: 18413
% kept new demods: 0
% forw unit-subs: 58583
% forw double-subs: 462
% forw overdouble-subs: 73
% backward subs: 24
% fast unit cutoff: 0
% full unit cutoff: 3
% dbl unit cutoff: 0
% real runtime : 39.21
% process. runtime: 39.21
% specific non-discr-tree subsumption statistics:
% tried: 206
% length fails: 6
% strength fails: 23
% predlist fails: 27
% aux str. fails: 7
% by-lit fails: 0
% full subs tried: 143
% full subs fail: 70
%
% ; 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/LCL224-1+noeq.in")
%
%------------------------------------------------------------------------------