TSTP Solution File: LCL341-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL341-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 : art09.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 197.9s
% Output : Assurance 197.9s
% 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/LCL341-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,15907,3,2851,19034,4,4279,22067,5,5701,22067,5,5701,22067,1,5701,22067,50,5703,22067,40,5703,22079,0,5703,31552,3,7107,33235,4,7804,34063,1,8504,34063,50,8505,34063,40,8505,34075,0,8505,102062,3,9940,119934,4,10606,130980,5,11306,130981,1,11308,130981,50,11313,130981,40,11313,130993,0,11313,130994,50,11313,131006,0,11313,154964,3,13564,157974,4,14689,160523,5,15814,160524,5,15814,160525,1,15814,160525,50,15815,160525,40,15815,160537,0,15815,160537,50,15815,160549,0,15815,160549,50,15815,160561,0,15828,160561,50,15828,160573,0,15828,160573,50,15828,160585,0,15829,160585,50,15829,160597,0,15842,160597,50,15842,160609,0,15842,160609,50,15842,160621,0,15855,160621,50,15855,160633,0,15855,160633,50,15855,160645,0,15855,160645,50,15855,160657,0,15868,160657,50,15868,160669,0,15868,160669,50,15868,160681,0,15881,160681,50,15881,160693,0,15881,160693,50,15881,160705,0,15881,160705,50,15881,160717,0,15895,160717,50,15895,160729,0,15895,160729,50,15895,160741,0,15908,160741,50,15908,160741,40,15908,160753,0,15908,223482,4,18012,223720,5,18710,223721,1,18713,223721,50,18718,223721,40,18718,223733,0,18718,231577,3,19554,233095,4,19921,234589,5,20319,234590,5,20319,234591,1,20319,234591,50,20320,234591,40,20320,234603,0,20337)
%
%
% START OF PROOF
% 234593 [] axiom(implies(or(X,X),X)).
% 234594 [] axiom(implies(X,or(Y,X))).
% 234595 [] axiom(implies(or(X,Y),or(Y,X))).
% 234596 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 234597 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 234598 [] equal(implies(X,Y),or(not(X),Y)).
% 234599 [] -axiom(X) | theorem(X).
% 234600 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 234601 [] equal(and(X,Y),not(implies(X,not(Y)))).
% 234602 [] equal(equivalent(X,Y),and(implies(X,Y),implies(Y,X))).
% 234603 [] -theorem(implies(p,equivalent(implies(p,q),q))).
% 234605 [binary:234599,234593] theorem(implies(or(X,X),X)).
% 234606 [binary:234599,234594] theorem(implies(X,or(Y,X))).
% 234607 [binary:234599,234595] theorem(implies(or(X,Y),or(Y,X))).
% 234608 [binary:234599,234596] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 234609 [binary:234599,234597] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 234620 [binary:234605,234600] -theorem(or(X,X)) | theorem(X).
% 234622 [para:234601.1.2,234598.1.2.1] equal(implies(implies(X,not(Y)),Z),or(and(X,Y),Z)).
% 234625 [para:234598.1.2,234607.1.1.1] theorem(implies(implies(X,Y),or(Y,not(X)))).
% 234626 [para:234598.1.2,234607.1.1.2] theorem(implies(or(X,not(Y)),implies(Y,X))).
% 234627 [binary:234600,234607] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 234629 [para:234598.1.2,234608.1.1.1,demod:234598] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 234636 [binary:234600,234609] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 234672 [para:234598.1.2,234625.1.1.2,demod:234622] theorem(or(and(X,Y),implies(Y,not(X)))).
% 234673 [binary:234600,234625] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 234676 [binary:234600,234626] -theorem(or(X,not(Y))) | theorem(implies(Y,X)).
% 234683 [binary:234600,234629] -theorem(implies(X,or(Y,Z))) | theorem(or(Y,implies(X,Z))).
% 234707 [binary:234600,234636] -theorem(or(Z,X)) | -theorem(implies(X,Y)) | theorem(or(Z,Y)).
% 234721 [para:234602.1.2,234672.1.1.1] theorem(or(equivalent(X,Y),implies(implies(Y,X),not(implies(X,Y))))).
% 234725 [para:234598.1.2,234673.1.1] -theorem(implies(X,not(Y))) | theorem(implies(Y,not(X))).
% 234881 [binary:234606,234683] theorem(or(X,implies(Y,Y))).
% 234903 [binary:234620,234881] theorem(implies(X,X)).
% 234911 [binary:234683,234903] theorem(or(X,implies(or(X,Y),Y))).
% 234949 [para:234598.1.2,234911.1.1,demod:234598] theorem(implies(X,implies(implies(X,Y),Y))).
% 234975 [binary:234911,234707] -theorem(implies(implies(or(X,Y),Y),Z)) | theorem(or(X,Z)).
% 235026 [binary:234707,234721,demod:234602,234622] -theorem(or(equivalent(X,Y),Z)) | theorem(or(equivalent(Y,X),Z)).
% 235078 [binary:234600,234949] theorem(implies(implies(X,Y),Y)) | -theorem(X).
% 235133 [binary:234725,235078,demod:234601] theorem(implies(X,and(Y,X))) | -theorem(Y).
% 235182 [para:234602.1.2,235133.1.1.2] theorem(implies(implies(X,Y),equivalent(Y,X))) | -theorem(implies(Y,X)).
% 242587 [binary:234975,235182,cut:234606] theorem(or(X,equivalent(Y,or(X,Y)))).
% 242589 [binary:234627,242587] theorem(or(equivalent(X,or(Y,X)),Y)).
% 242657 [binary:235026,242589] theorem(or(equivalent(or(X,Y),Y),X)).
% 242780 [binary:234676,242657,demod:234598,slowcut:234603] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using weight-order 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
% seconds given: 22
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 25610
% derived clauses: 3127667
% kept clauses: 197574
% kept size sum: 373781
% kept mid-nuclei: 19130
% kept new demods: 499
% forw unit-subs: 659810
% forw double-subs: 192715
% forw overdouble-subs: 17875
% backward subs: 546
% fast unit cutoff: 141
% full unit cutoff: 192
% dbl unit cutoff: 1
% real runtime : 207.82
% process. runtime: 205.55
% specific non-discr-tree subsumption statistics:
% tried: 875580
% length fails: 23468
% strength fails: 78156
% predlist fails: 318306
% aux str. fails: 5695
% by-lit fails: 11850
% full subs tried: 421953
% full subs fail: 403928
%
% ; 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/LCL341-3+eq_r.in")
%
%------------------------------------------------------------------------------