TSTP Solution File: LCL237-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL237-1 : TPTP v3.4.2. Bugfixed v2.3.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 49.5s
% Output : Assurance 49.5s
% 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/LCL237-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,21732,4,2176,26635,1,2901,26635,50,2901,26635,40,2901,26644,0,2901,38505,3,3452,39927,4,3727,44214,1,4002,44214,50,4003,44214,40,4003,44223,0,4003,74152,3,4854,83815,4,5279)
%
%
% START OF PROOF
% 44215 [] axiom(or(not(or(X,X)),X)).
% 44216 [] axiom(or(not(X),or(Y,X))).
% 44217 [] axiom(or(not(or(X,Y)),or(Y,X))).
% 44218 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 44219 [] axiom(or(not(or(not(X),Y)),or(not(or(Z,X)),or(Z,Y)))).
% 44220 [] -axiom(X) | theorem(X).
% 44221 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 44222 [] -theorem(or(not(X),Y)) | -axiom(or(not(Z),X)) | theorem(or(not(Z),Y)).
% 44223 [] -theorem(or(not(q),or(not(p),not(or(not(p),not(q)))))).
% 44228 [binary:44220,44217] theorem(or(not(or(X,Y)),or(Y,X))).
% 44231 [binary:44215,44221] -theorem(or(X,X)) | theorem(X).
% 44232 [binary:44216,44221] theorem(or(X,Y)) | -theorem(Y).
% 44235 [binary:44217,44221] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 44248 [binary:44221.2,44232] -axiom(or(not(or(X,Y)),Z)) | -theorem(Y) | theorem(Z).
% 44277 [binary:44221,44219] theorem(or(not(or(X,Y)),or(X,Z))) | -theorem(or(not(Y),Z)).
% 44312 [binary:44216,44222.2] -theorem(or(not(or(X,Y)),Z)) | theorem(or(not(Y),Z)).
% 44317 [binary:44217,44222.2] -theorem(or(not(or(X,Y)),Z)) | theorem(or(not(or(Y,X)),Z)).
% 44811 [binary:44218,44248] theorem(or(X,or(Y,Z))) | -theorem(or(X,Z)).
% 46399 [binary:44811.2,44811] theorem(or(X,or(Y,or(Z,U)))) | -theorem(or(X,U)).
% 48800 [binary:44228,44312] theorem(or(not(X),or(X,Y))).
% 48949 [binary:44277.2,48800] theorem(or(not(or(X,Y)),or(X,or(Y,Z)))).
% 61412 [binary:44317,48949] theorem(or(not(or(X,Y)),or(Y,or(X,Z)))).
% 65502 [binary:44235,61412] theorem(or(or(X,or(Y,Z)),not(or(Y,X)))).
% 83735 [binary:65502,46399.2] theorem(or(or(X,or(Y,Z)),or(U,or(V,not(or(Y,X)))))).
% 83825 [binary:83735,44231,slowcut:44223] 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: 12262
% derived clauses: 383446
% kept clauses: 61454
% kept size sum: 0
% kept mid-nuclei: 20320
% kept new demods: 0
% forw unit-subs: 86559
% forw double-subs: 28839
% forw overdouble-subs: 7983
% backward subs: 106
% fast unit cutoff: 0
% full unit cutoff: 2
% dbl unit cutoff: 0
% real runtime : 53.47
% process. runtime: 52.93
% specific non-discr-tree subsumption statistics:
% tried: 162382
% length fails: 7485
% strength fails: 2513
% predlist fails: 62136
% aux str. fails: 230
% by-lit fails: 185
% full subs tried: 83404
% full subs fail: 75421
%
% ; 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/LCL237-1+noeq.in")
%
%------------------------------------------------------------------------------