TSTP Solution File: LCL248-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL248-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 0.0s
% Output : Assurance 0.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/LCL248-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(11,40,0,22,0,0)
%
%
% START OF PROOF
% 13 [] axiom(implies(or(X,X),X)).
% 14 [] axiom(implies(X,or(Y,X))).
% 15 [] axiom(implies(or(X,Y),or(Y,X))).
% 16 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 18 [] equal(implies(X,Y),or(not(X),Y)).
% 19 [] -axiom(X) | theorem(X).
% 20 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 21 [] equal(and(X,Y),not(implies(X,not(Y)))).
% 22 [] -theorem(implies(and(p,q),implies(p,q))).
% 24 [binary:19,13] theorem(implies(or(X,X),X)).
% 25 [binary:19,14] theorem(implies(X,or(Y,X))).
% 26 [binary:19,15] theorem(implies(or(X,Y),or(Y,X))).
% 30 [para:18.1.2,25.1.1.2] theorem(implies(X,implies(Y,X))).
% 33 [binary:19,16] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 38 [binary:25,20] theorem(or(X,Y)) | -theorem(Y).
% 52 [binary:20,26] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 56 [binary:19,17] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 64 [para:21.1.2,18.1.2.1] equal(implies(implies(X,not(Y)),Z),or(and(X,Y),Z)).
% 69 [para:18.1.2,52.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 71 [para:18.1.2,33.1.1.1,demod:18] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 72 [para:18.1.2,33.1.1.1.2,demod:18] theorem(implies(or(X,implies(Y,Z)),implies(Y,or(X,Z)))).
% 73 [binary:20,33] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 96 [binary:25,69.2] theorem(or(or(X,Y),not(Y))).
% 100 [binary:38.2,96] theorem(or(X,or(or(Y,Z),not(Z)))).
% 113 [para:18.1.2,56.1.1.2.1,demod:18] theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 114 [binary:20,56] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 129 [para:18.1.2,71.1.1.1.2,demod:18] theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 130 [binary:20,71] -theorem(implies(X,or(Y,Z))) | theorem(or(Y,implies(X,Z))).
% 131 [binary:20,72] -theorem(or(X,implies(Y,Z))) | theorem(implies(Y,or(X,Z))).
% 136 [binary:100,73] theorem(or(or(X,Y),or(Z,not(Y)))).
% 141 [para:18.1.2,136.1.1.2] theorem(or(or(X,Y),implies(Z,not(Y)))).
% 142 [binary:52,136] theorem(or(or(X,not(Y)),or(Z,Y))).
% 149 [binary:52,141] theorem(or(implies(X,not(Y)),or(Z,Y))).
% 155 [binary:20,113] theorem(implies(implies(X,Y),implies(X,Z))) | -theorem(implies(Y,Z)).
% 162 [binary:24,114.2] theorem(implies(or(X,or(Y,Y)),or(X,Y))).
% 164 [binary:30,114.2] theorem(implies(or(X,Y),or(X,implies(Z,Y)))).
% 168 [binary:20,162] -theorem(or(X,or(Y,Y))) | theorem(or(X,Y)).
% 173 [binary:20,164] theorem(or(X,implies(Y,Z))) | -theorem(or(X,Z)).
% 181 [binary:142,168] theorem(or(or(X,not(Y)),Y)).
% 182 [binary:149,168] theorem(or(implies(X,not(Y)),Y)).
% 184 [binary:52,181] theorem(or(X,or(Y,not(X)))).
% 188 [binary:52,182] theorem(or(X,implies(Y,not(X)))).
% 191 [binary:168,184] theorem(or(X,not(X))).
% 196 [binary:52,191,demod:18] theorem(implies(X,X)).
% 248 [binary:20,129] -theorem(implies(X,implies(Y,Z))) | theorem(implies(Y,implies(X,Z))).
% 256 [binary:196,130] theorem(or(X,implies(or(X,Y),Y))).
% 270 [binary:52,256] theorem(or(implies(or(X,Y),Y),X)).
% 313 [binary:26,155.2] theorem(implies(implies(X,or(Y,Z)),implies(X,or(Z,Y)))).
% 412 [binary:270,173.2] theorem(or(implies(or(X,Y),Y),implies(Z,X))).
% 548 [binary:52,412] theorem(or(implies(X,Y),implies(or(Y,Z),Z))).
% 584 [binary:56,248] theorem(implies(or(X,Y),implies(implies(Y,Z),or(X,Z)))).
% 687 [binary:20,313] -theorem(implies(X,or(Y,Z))) | theorem(implies(X,or(Z,Y))).
% 698 [binary:131,548] theorem(implies(or(X,Y),or(implies(Z,X),Y))).
% 2026 [binary:20,584] theorem(implies(implies(X,Y),or(Z,Y))) | -theorem(or(Z,X)).
% 2188 [binary:698,687] theorem(implies(or(X,Y),or(Y,implies(Z,X)))).
% 2216 [binary:20,2188] theorem(or(X,implies(Y,Z))) | -theorem(or(Z,X)).
% 2950 [binary:188,2026.2,demod:64] theorem(implies(or(and(X,Y),Z),or(Y,Z))).
% 3136 [binary:20,2950] -theorem(or(and(X,Y),Z)) | theorem(or(Y,Z)).
% 3235 [binary:191,3136] theorem(or(X,not(and(Y,X)))).
% 3250 [binary:2216.2,3235,demod:18,slowcut:22] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos 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: 1786
% derived clauses: 102591
% kept clauses: 2825
% kept size sum: 33120
% kept mid-nuclei: 0
% kept new demods: 5
% forw unit-subs: 15717
% forw double-subs: 707
% forw overdouble-subs: 1
% backward subs: 15
% fast unit cutoff: 0
% full unit cutoff: 5
% dbl unit cutoff: 0
% real runtime : 1.41
% process. runtime: 1.38
% specific non-discr-tree subsumption statistics:
% tried: 1
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 1
% 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/LCL248-3+eq_r.in")
%
%------------------------------------------------------------------------------