TSTP Solution File: LCL197-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL197-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 : art07.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 10.0s
% Output : Assurance 10.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/LCL197-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (binary-unit-uniteq 30 #f)
% (binary-posweight-order 120 #f 4 5)
% (binary-posweight-order 240 #f)
% (binary-posweight-lex-big-order 60 #f)
% (binary-posweight-lex-small-order 12 #f)
% (binary-weightorder 24 #f)
% (hyper 30 #f)
% (binary 24 #t)
% (binary-order 30 #f)
% (binary-unit 30 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(10,40,0,20,0,0)
%
%
% START OF PROOF
% 12 [] axiom(implies(or(X,X),X)).
% 13 [] axiom(implies(X,or(Y,X))).
% 14 [] axiom(implies(or(X,Y),or(Y,X))).
% 15 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 16 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17 [] equal(implies(X,Y),or(not(X),Y)).
% 18 [] -axiom(X) | theorem(X).
% 19 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 20 [] -theorem(implies(or(q,or(p,q)),or(p,q))).
% 22 [binary:18,12] theorem(implies(or(X,X),X)).
% 23 [binary:18,13] theorem(implies(X,or(Y,X))).
% 25 [binary:18,14] theorem(implies(or(X,Y),or(Y,X))).
% 29 [para:17.1.2,23.1.1.2] theorem(implies(X,implies(Y,X))).
% 32 [binary:18,15] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 36 [binary:22,19] -theorem(or(X,X)) | theorem(X).
% 37 [binary:22,19.2] -theorem(implies(implies(or(X,X),X),Y)) | theorem(Y).
% 40 [binary:23,19.2] -theorem(implies(implies(X,or(Y,X)),Z)) | theorem(Z).
% 42 [binary:29,19.2] -theorem(implies(implies(X,implies(Y,X)),Z)) | theorem(Z).
% 44 [binary:20,36.2] -theorem(or(implies(or(q,or(p,q)),or(p,q)),implies(or(q,or(p,q)),or(p,q)))).
% 49 [binary:18,16] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 68 [binary:19,25] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 171 [para:17.1.2,32.1.1.1,demod:17] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 368 [binary:37,49] theorem(implies(or(X,or(Y,Y)),or(X,Y))).
% 369 [binary:40,49] theorem(implies(or(X,Y),or(X,or(Z,Y)))).
% 372 [binary:42,49] theorem(implies(or(X,Y),or(X,implies(Z,Y)))).
% 1480 [para:17.1.2,368.1.1.1,demod:17] theorem(implies(implies(X,or(Y,Y)),implies(X,Y))).
% 1656 [binary:19,369] theorem(or(X,or(Y,Z))) | -theorem(or(X,Z)).
% 1684 [binary:19,372] theorem(or(X,implies(Y,Z))) | -theorem(or(X,Z)).
% 1795 [binary:40,1480] theorem(implies(X,X)).
% 1801 [binary:19.2,1795] -theorem(implies(implies(X,X),Y)) | theorem(Y).
% 3812 [binary:1801,171] theorem(or(X,implies(or(X,Y),Y))).
% 3845 [binary:68,3812] theorem(or(implies(or(X,Y),Y),X)).
% 11659 [binary:3845,1656.2] theorem(or(implies(or(X,Y),Y),or(Z,X))).
% 11726 [binary:44,1684,cut:11659] 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
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 688
% derived clauses: 23505
% kept clauses: 11636
% kept size sum: 174286
% kept mid-nuclei: 0
% kept new demods: 1
% forw unit-subs: 11565
% forw double-subs: 13
% forw overdouble-subs: 0
% backward subs: 2
% fast unit cutoff: 1
% full unit cutoff: 6
% dbl unit cutoff: 0
% real runtime : 14.65
% process. runtime: 14.64
% 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/LCL197-3+eq_r.in")
%
%------------------------------------------------------------------------------