TSTP Solution File: LCL301-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL301-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 : art02.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/LCL301-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 5 5)
% (binary-unit 28 #f 5 5)
% (binary-double 28 #f 5 5)
% (binary 45 #t 5 5)
% (hyper 11 #t 5 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,0,24,0,1)
%
%
% 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)))).
% 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(and(not(p),q),and(not(p),q))).
% 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)))).
% 39 [binary:26,21] -theorem(or(X,X)) | theorem(X).
% 40 [binary:27,21] theorem(or(X,Y)) | -theorem(Y).
% 41 [binary:32,21] theorem(implies(X,Y)) | -theorem(Y).
% 49 [binary:26,41.2] theorem(implies(X,implies(or(Y,Y),Y))).
% 53 [para:19.1.2,28.1.1.2] theorem(implies(or(X,not(Y)),implies(Y,X))).
% 54 [binary:21,28] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 55 [binary:21,28,binarydemod:40] theorem(or(X,Y)) | -theorem(X).
% 72 [para:22.1.2,19.1.2.1] equal(implies(implies(X,not(Y)),Z),or(and(X,Y),Z)).
% 80 [para:19.1.2,49.1.1.2.1,demod:72] theorem(implies(X,or(and(Y,Y),not(Y)))).
% 91 [para:19.1.2,54.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 110 [binary:55.2,53] theorem(or(implies(or(X,not(Y)),implies(Y,X)),Z)).
% 112 [binary:21,80,slowcut:110] theorem(or(and(X,X),not(X))).
% 119 [binary:21,35] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 126 [binary:54,112,demod:19] theorem(implies(X,and(X,X))).
% 128 [binary:21,126] theorem(and(X,X)) | -theorem(X).
% 216 [binary:27,91.2] theorem(or(or(X,Y),not(Y))).
% 227 [binary:40.2,216] theorem(or(X,or(or(Y,Z),not(Z)))).
% 424 [binary:227,119] theorem(or(or(X,Y),or(Z,not(Y)))).
% 482 [binary:54,424] theorem(or(or(X,not(Y)),or(Z,Y))).
% 534 [binary:119,482] theorem(or(X,or(or(Y,not(Z)),Z))).
% 563 [binary:39,534] theorem(or(or(X,not(Y)),Y)).
% 572 [binary:54,563] theorem(or(X,or(Y,not(X)))).
% 590 [binary:119,572] theorem(or(X,or(Y,not(Y)))).
% 603 [binary:39,590] theorem(or(X,not(X))).
% 613 [binary:54,603,demod:19] theorem(implies(X,X)).
% 624 [binary:128.2,613,demod:23,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 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 5
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 196
% derived clauses: 2476
% kept clauses: 572
% kept size sum: 7162
% kept mid-nuclei: 0
% kept new demods: 10
% forw unit-subs: 731
% forw double-subs: 15
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 0
% full unit cutoff: 2
% dbl unit cutoff: 0
% real runtime : 0.4
% process. runtime: 0.4
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% 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/LCL301-3+eq_r.in")
%
%------------------------------------------------------------------------------