TSTP Solution File: LCL298-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL298-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 109.1s
% Output : Assurance 109.1s
% 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/LCL298-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,0,24,0,0,15656,3,2851,18734,4,4276,21710,5,5701,21710,5,5701,21710,1,5701,21710,50,5703,21710,40,5703,21722,0,5703,30809,3,7108,32923,4,7804,35072,5,8504,35072,5,8504,35072,1,8504,35072,50,8505,35072,40,8505,35084,0,8505,103926,3,9941,125114,4,10607)
%
%
% START OF PROOF
% 26199 [?] ?
% 35074 [] axiom(implies(or(X,X),X)).
% 35075 [] axiom(implies(X,or(Y,X))).
% 35076 [] axiom(implies(or(X,Y),or(Y,X))).
% 35077 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 35079 [] equal(implies(X,Y),or(not(X),Y)).
% 35080 [] -axiom(X) | theorem(X).
% 35081 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 35082 [] equal(and(X,Y),not(implies(X,not(Y)))).
% 35083 [] equal(equivalent(X,Y),and(implies(X,Y),implies(Y,X))).
% 35084 [] -theorem(equivalent(not(and(p,q)),implies(p,not(q)))).
% 35086 [binary:35080,35074] theorem(implies(or(X,X),X)).
% 35087 [binary:35080,35075] theorem(implies(X,or(Y,X))).
% 35094 [para:35079.1.2,35076.1.1.1] axiom(implies(implies(X,Y),or(Y,not(X)))).
% 35095 [para:35079.1.2,35076.1.1.2] axiom(implies(or(X,not(Y)),implies(Y,X))).
% 35097 [para:35079.1.2,35077.1.1.1,demod:35079] axiom(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 35100 [binary:35080.2,35081] -axiom(implies(X,Y)) | -theorem(X) | theorem(Y).
% 35102 [binary:35086,35081] -theorem(or(X,X)) | theorem(X).
% 35168 [para:35082.1.2,35079.1.2.1] equal(implies(implies(X,not(Y)),Z),or(and(X,Y),Z)).
% 35251 [binary:35087,35100.2] -axiom(implies(implies(X,or(Y,X)),Z)) | theorem(Z).
% 35272 [binary:35094,35100] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 35274 [binary:35100,35095] -theorem(or(X,not(Y))) | theorem(implies(Y,X)).
% 39206 [binary:35081,35274.2] -theorem(or(X,not(Y))) | -theorem(Y) | theorem(X).
% 40795 [binary:35097,35251] theorem(or(X,implies(Y,Y))).
% 40933 [binary:35102,40795] theorem(implies(X,X)).
% 40962 [binary:35100.2,40933] -axiom(implies(implies(X,X),Y)) | theorem(Y).
% 40984 [binary:35272.2,40933] theorem(or(X,not(X))).
% 44183 [binary:35097,40962] theorem(or(X,implies(or(X,Y),Y))).
% 45573 [para:35079.1.2,44183.1.1,demod:35079] theorem(implies(X,implies(implies(X,Y),Y))).
% 45802 [binary:35081,45573] theorem(implies(implies(X,Y),Y)) | -theorem(X).
% 45872 [para:35168.1.1,45802.1.1] theorem(or(and(X,Y),not(Y))) | -theorem(X).
% 67424 [binary:39206,45872] theorem(and(X,Y)) | -theorem(Y) | -theorem(X).
% 67757 [para:35083.1.2,67424.1.1] -theorem(implies(X,Y)) | -theorem(implies(Y,X)) | theorem(equivalent(Y,X)).
% 132751 [binary:35084,67757.3,demod:35168,cut:26199,cut:40984] 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 4
% seconds given: 28
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 13834
% derived clauses: 2440398
% kept clauses: 103959
% kept size sum: 0
% kept mid-nuclei: 12761
% kept new demods: 18
% forw unit-subs: 270805
% forw double-subs: 138063
% forw overdouble-subs: 11876
% backward subs: 240
% fast unit cutoff: 67
% full unit cutoff: 38
% dbl unit cutoff: 0
% real runtime : 111.14
% process. runtime: 110.12
% specific non-discr-tree subsumption statistics:
% tried: 398803
% length fails: 9070
% strength fails: 996
% predlist fails: 181396
% aux str. fails: 352
% by-lit fails: 1136
% full subs tried: 197291
% full subs fail: 185415
%
% ; 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/LCL298-3+eq_r.in")
%
%------------------------------------------------------------------------------