TSTP Solution File: LCL265-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL265-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.3s
% Output : Assurance 109.3s
% 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/LCL265-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,15869,3,2852,18885,4,4278,21886,5,5702,21887,5,5702,21887,1,5702,21887,50,5704,21887,40,5704,21899,0,5704,31233,3,7105,33400,4,7805,35555,5,8509,35555,5,8510,35556,1,8510,35556,50,8511,35556,40,8511,35568,0,8511,103769,3,9932,125599,4,10612)
%
%
% START OF PROOF
% 35558 [] axiom(implies(or(X,X),X)).
% 35559 [] axiom(implies(X,or(Y,X))).
% 35560 [] axiom(implies(or(X,Y),or(Y,X))).
% 35561 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 35562 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 35563 [] equal(implies(X,Y),or(not(X),Y)).
% 35564 [] -axiom(X) | theorem(X).
% 35565 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 35566 [] equal(and(X,Y),not(implies(X,not(Y)))).
% 35567 [] equal(equivalent(X,Y),and(implies(X,Y),implies(Y,X))).
% 35568 [] -theorem(equivalent(p,not(not(p)))).
% 35570 [binary:35564,35558] theorem(implies(or(X,X),X)).
% 35571 [binary:35564,35559] theorem(implies(X,or(Y,X))).
% 35573 [binary:35564,35560] theorem(implies(or(X,Y),or(Y,X))).
% 35578 [para:35563.1.2,35560.1.1.1] axiom(implies(implies(X,Y),or(Y,not(X)))).
% 35579 [para:35563.1.2,35560.1.1.2] axiom(implies(or(X,not(Y)),implies(Y,X))).
% 35581 [para:35563.1.2,35561.1.1.1,demod:35563] axiom(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 35584 [binary:35564.2,35565] -axiom(implies(X,Y)) | -theorem(X) | theorem(Y).
% 35586 [binary:35570,35565] -theorem(or(X,X)) | theorem(X).
% 35640 [binary:35565,35573] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 35652 [para:35566.1.2,35563.1.2.1] equal(implies(implies(X,not(Y)),Z),or(and(X,Y),Z)).
% 35735 [binary:35571,35584.2] -axiom(implies(implies(X,or(Y,X)),Z)) | theorem(Z).
% 35744 [binary:35562,35584] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 35756 [binary:35578,35584] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 35758 [binary:35584,35579] -theorem(or(X,not(Y))) | theorem(implies(Y,X)).
% 39690 [binary:35565,35758.2] -theorem(or(X,not(Y))) | -theorem(Y) | theorem(X).
% 41279 [binary:35581,35735] theorem(or(X,implies(Y,Y))).
% 41417 [binary:35586,41279] theorem(implies(X,X)).
% 41446 [binary:35584.2,41417] -axiom(implies(implies(X,X),Y)) | theorem(Y).
% 41468 [binary:35756.2,41417] theorem(or(X,not(X))).
% 41555 [para:35563.1.2,41468.1.1] theorem(implies(X,not(not(X)))).
% 41556 [binary:35565.2,41468] -theorem(implies(or(X,not(X)),Y)) | theorem(Y).
% 44667 [binary:35581,41446] theorem(or(X,implies(or(X,Y),Y))).
% 46057 [para:35563.1.2,44667.1.1,demod:35563] theorem(implies(X,implies(implies(X,Y),Y))).
% 46286 [binary:35565,46057] theorem(implies(implies(X,Y),Y)) | -theorem(X).
% 46356 [para:35652.1.1,46286.1.1] theorem(or(and(X,Y),not(Y))) | -theorem(X).
% 57103 [binary:35744,41556] -theorem(implies(not(X),Y)) | theorem(or(X,Y)).
% 67908 [binary:39690,46356] theorem(and(X,Y)) | -theorem(Y) | -theorem(X).
% 68241 [para:35567.1.2,67908.1.1] -theorem(implies(X,Y)) | -theorem(implies(Y,X)) | theorem(equivalent(Y,X)).
% 79801 [binary:35640,57103.2] -theorem(implies(not(X),Y)) | theorem(or(Y,X)).
% 116267 [binary:41555,79801,demod:35563] theorem(implies(not(not(X)),X)).
% 133083 [binary:116267,68241,cut:41555,slowcut:35568] 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: 14104
% derived clauses: 2484044
% kept clauses: 104343
% kept size sum: 0
% kept mid-nuclei: 12639
% kept new demods: 18
% forw unit-subs: 268681
% forw double-subs: 138259
% forw overdouble-subs: 11875
% backward subs: 196
% fast unit cutoff: 21
% full unit cutoff: 39
% dbl unit cutoff: 0
% real runtime : 111.51
% process. runtime: 110.66
% specific non-discr-tree subsumption statistics:
% tried: 398798
% length fails: 9070
% strength fails: 997
% predlist fails: 181396
% aux str. fails: 352
% by-lit fails: 1136
% full subs tried: 197287
% full subs fail: 185412
%
% ; 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/LCL265-3+eq_r.in")
%
%------------------------------------------------------------------------------