TSTP Solution File: LCL272-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL272-3 : TPTP v3.4.2. Released v2.3.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 40.0s
% Output : Assurance 40.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/LCL272-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: short
%
% strategies selected:
% (binary-posweight-order 57 #f 4 5)
% (binary-unit 28 #f 4 5)
% (binary-double 28 #f 4 5)
% (binary 45 #t 4 5)
% (hyper 11 #t 4 5)
% (hyper 28 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 159 #f)
% (binary-posweight-lex-big-order 57 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 65 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(12,40,1,24,0,1,16011,3,2854,19175,4,4278)
%
%
% START OF PROOF
% 14 [] axiom(implies(or(X,X),X)).
% 15 [] axiom(implies(X,or(Y,X))).
% 16 [] axiom(implies(or(X,Y),or(Y,X))).
% 17 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 18 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 19 [] equal(implies(X,Y),or(not(X),Y)).
% 20 [] -axiom(X) | theorem(X).
% 21 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 22 [] equal(and(X,Y),not(implies(X,not(Y)))).
% 23 [] equal(equivalent(X,Y),and(implies(X,Y),implies(Y,X))).
% 24 [] -theorem(equivalent(p,or(p,p))).
% 26 [binary:20,14] theorem(implies(or(X,X),X)).
% 27 [binary:20,15] theorem(implies(X,or(Y,X))).
% 28 [binary:20,16] theorem(implies(or(X,Y),or(Y,X))).
% 32 [para:19.1.2,27.1.1.2] theorem(implies(X,implies(Y,X))).
% 35 [binary:20,17] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 40 [binary:27,21] theorem(or(X,Y)) | -theorem(Y).
% 54 [binary:21,28] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 58 [binary:20,18] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 66 [para:22.1.2,19.1.2.1] equal(implies(implies(X,not(Y)),Z),or(and(X,Y),Z)).
% 70 [para:19.1.2,54.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 77 [para:19.1.2,35.1.1.1,demod:19] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 78 [para:19.1.2,35.1.1.1.2,demod:19] theorem(implies(or(X,implies(Y,Z)),implies(Y,or(X,Z)))).
% 79 [binary:21,35] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 123 [binary:27,70.2] theorem(or(or(X,Y),not(Y))).
% 127 [binary:40.2,123] theorem(or(X,or(or(Y,Z),not(Z)))).
% 143 [binary:21,58] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 164 [para:19.1.2,77.1.1.1.2,demod:19] theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 165 [binary:21,77] -theorem(implies(X,or(Y,Z))) | theorem(or(Y,implies(X,Z))).
% 167 [binary:21,78] -theorem(or(X,implies(Y,Z))) | theorem(implies(Y,or(X,Z))).
% 172 [binary:127,79] theorem(or(or(X,Y),or(Z,not(Y)))).
% 178 [binary:54,172] theorem(or(or(X,not(Y)),or(Z,Y))).
% 207 [binary:26,143.2] theorem(implies(or(X,or(Y,Y)),or(X,Y))).
% 208 [binary:27,143.2] theorem(implies(or(X,Y),or(X,or(Z,Y)))).
% 209 [binary:32,143.2] theorem(implies(or(X,Y),or(X,implies(Z,Y)))).
% 210 [binary:28,143.2] theorem(implies(or(X,or(Y,Z)),or(X,or(Z,Y)))).
% 213 [para:19.1.2,207.1.1.1,demod:19] theorem(implies(implies(X,or(Y,Y)),implies(X,Y))).
% 214 [binary:21,207] -theorem(or(X,or(Y,Y))) | theorem(or(X,Y)).
% 216 [binary:21,208] theorem(or(X,or(Y,Z))) | -theorem(or(X,Z)).
% 224 [binary:21,213] -theorem(implies(X,or(Y,Y))) | theorem(implies(X,Y)).
% 227 [binary:178,214] theorem(or(or(X,not(Y)),Y)).
% 230 [binary:54,227] theorem(or(X,or(Y,not(X)))).
% 235 [binary:214,230] theorem(or(X,not(X))).
% 240 [binary:54,235,demod:19] theorem(implies(X,X)).
% 336 [binary:21,164] -theorem(implies(X,implies(Y,Z))) | theorem(implies(Y,implies(X,Z))).
% 371 [binary:240,165] theorem(or(X,implies(or(X,Y),Y))).
% 380 [para:19.1.2,371.1.1,demod:19] theorem(implies(X,implies(implies(X,Y),Y))).
% 389 [binary:70.2,380] theorem(or(implies(implies(X,Y),Y),not(X))).
% 532 [binary:216.2,389] theorem(or(implies(implies(X,Y),Y),or(Z,not(X)))).
% 552 [binary:21,210] -theorem(or(X,or(Y,Z))) | theorem(or(X,or(Z,Y))).
% 632 [binary:209,224] theorem(implies(or(implies(X,Y),Y),implies(X,Y))).
% 816 [binary:21,632] -theorem(or(implies(X,Y),Y)) | theorem(implies(X,Y)).
% 1271 [binary:230,552,demod:19] theorem(or(X,implies(X,Y))).
% 1284 [binary:532,552,demod:19] theorem(or(implies(implies(X,Y),Y),implies(X,Z))).
% 1304 [binary:167,1271] theorem(implies(X,or(X,Y))).
% 1614 [binary:54,1284] theorem(or(implies(X,Y),implies(implies(X,Z),Z))).
% 1829 [para:66.1.1,1614.1.1.2] theorem(or(implies(X,Y),or(and(X,Z),not(Z)))).
% 2187 [binary:552,1829,demod:19] theorem(or(implies(X,Y),implies(Z,and(X,Z)))).
% 2191 [binary:816,2187] theorem(implies(X,implies(Y,and(X,Y)))).
% 2199 [binary:336,2191] theorem(implies(X,implies(Y,and(Y,X)))).
% 2208 [para:23.1.2,2199.1.1.2.2] theorem(implies(implies(X,Y),implies(implies(Y,X),equivalent(Y,X)))).
% 3328 [binary:21,2208] theorem(implies(implies(X,Y),equivalent(X,Y))) | -theorem(implies(Y,X)).
% 16132 [binary:26,3328.2] theorem(implies(implies(X,or(X,X)),equivalent(X,or(X,X)))).
% 19929 [binary:16132,21,cut:1304,slowcut:24] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% 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 4
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 7945
% derived clauses: 1168277
% kept clauses: 17200
% kept size sum: 212297
% kept mid-nuclei: 752
% kept new demods: 6
% forw unit-subs: 109960
% forw double-subs: 2901
% forw overdouble-subs: 3
% backward subs: 113
% fast unit cutoff: 6
% full unit cutoff: 18
% dbl unit cutoff: 0
% real runtime : 46.95
% process. runtime: 46.93
% specific non-discr-tree subsumption statistics:
% tried: 3
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 3
% full subs fail: 0
%
% ; 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/LCL272-3+eq_r.in")
%
%------------------------------------------------------------------------------