TSTP Solution File: LCL312-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL312-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 : art10.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.5s
% Output : Assurance 109.5s
% 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/LCL312-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,15960,3,2852,19066,4,4277,22120,5,5702,22121,5,5703,22121,1,5703,22121,50,5705,22121,40,5705,22133,0,5705,31400,3,7106,33582,4,7821,35719,5,8506,35719,5,8506,35720,1,8506,35720,50,8507,35720,40,8507,35732,0,8507,103933,3,9934,124998,4,10610)
%
%
% START OF PROOF
% 26497 [?] ?
% 35722 [] axiom(implies(or(X,X),X)).
% 35723 [] axiom(implies(X,or(Y,X))).
% 35724 [] axiom(implies(or(X,Y),or(Y,X))).
% 35725 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 35727 [] equal(implies(X,Y),or(not(X),Y)).
% 35728 [] -axiom(X) | theorem(X).
% 35729 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 35730 [] equal(and(X,Y),not(implies(X,not(Y)))).
% 35731 [] equal(equivalent(X,Y),and(implies(X,Y),implies(Y,X))).
% 35732 [] -theorem(equivalent(implies(not(p),p),p)).
% 35734 [binary:35728,35722] theorem(implies(or(X,X),X)).
% 35735 [binary:35728,35723] theorem(implies(X,or(Y,X))).
% 35741 [para:35727.1.2,35735.1.1.2] theorem(implies(X,implies(Y,X))).
% 35743 [para:35727.1.2,35724.1.1.2] axiom(implies(or(X,not(Y)),implies(Y,X))).
% 35745 [para:35727.1.2,35725.1.1.1,demod:35727] axiom(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 35748 [binary:35728.2,35729] -axiom(implies(X,Y)) | -theorem(X) | theorem(Y).
% 35750 [binary:35734,35729] -theorem(or(X,X)) | theorem(X).
% 35816 [para:35730.1.2,35727.1.2.1] equal(implies(implies(X,not(Y)),Z),or(and(X,Y),Z)).
% 35899 [binary:35735,35748.2] -axiom(implies(implies(X,or(Y,X)),Z)) | theorem(Z).
% 35922 [binary:35748,35743] -theorem(or(X,not(Y))) | theorem(implies(Y,X)).
% 39854 [binary:35729,35922.2] -theorem(or(X,not(Y))) | -theorem(Y) | theorem(X).
% 41443 [binary:35745,35899] theorem(or(X,implies(Y,Y))).
% 41581 [binary:35750,41443] theorem(implies(X,X)).
% 41610 [binary:35748.2,41581] -axiom(implies(implies(X,X),Y)) | theorem(Y).
% 44831 [binary:35745,41610] theorem(or(X,implies(or(X,Y),Y))).
% 46221 [para:35727.1.2,44831.1.1,demod:35727] theorem(implies(X,implies(implies(X,Y),Y))).
% 46450 [binary:35729,46221] theorem(implies(implies(X,Y),Y)) | -theorem(X).
% 46520 [para:35816.1.1,46450.1.1] theorem(or(and(X,Y),not(Y))) | -theorem(X).
% 68072 [binary:39854,46520] theorem(and(X,Y)) | -theorem(Y) | -theorem(X).
% 68405 [para:35731.1.2,68072.1.1] -theorem(implies(X,Y)) | -theorem(implies(Y,X)) | theorem(equivalent(Y,X)).
% 132635 [binary:35732,68405.3,cut:26497,cut:35741] 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: 14128
% derived clauses: 2485452
% kept clauses: 104475
% kept size sum: 0
% kept mid-nuclei: 12828
% kept new demods: 18
% forw unit-subs: 269324
% forw double-subs: 138337
% forw overdouble-subs: 11875
% backward subs: 210
% fast unit cutoff: 67
% full unit cutoff: 39
% dbl unit cutoff: 0
% real runtime : 110.84
% process. runtime: 110.22
% specific non-discr-tree subsumption statistics:
% tried: 398155
% length fails: 9070
% strength fails: 997
% predlist fails: 180845
% aux str. fails: 352
% by-lit fails: 1136
% full subs tried: 197195
% full subs fail: 185320
%
% ; 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/LCL312-3+eq_r.in")
%
%------------------------------------------------------------------------------