TSTP Solution File: LCL300-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL300-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 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/LCL300-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,1,15575,3,2855,18729,4,4277,21700,5,5702,21701,5,5702,21701,1,5702,21701,50,5704,21701,40,5704,21713,0,5704,30742,3,7109,32917,4,7805,35102,5,8505,35102,5,8505,35102,1,8505,35102,50,8506,35102,40,8506,35114,0,8506,103688,3,9923,125406,4,10608)
%
%
% START OF PROOF
% 10879 [?] ?
% 26076 [?] ?
% 35104 [] axiom(implies(or(X,X),X)).
% 35105 [] axiom(implies(X,or(Y,X))).
% 35106 [] axiom(implies(or(X,Y),or(Y,X))).
% 35107 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 35109 [] equal(implies(X,Y),or(not(X),Y)).
% 35110 [] -axiom(X) | theorem(X).
% 35111 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 35112 [] equal(and(X,Y),not(implies(X,not(Y)))).
% 35113 [] equal(equivalent(X,Y),and(implies(X,Y),implies(Y,X))).
% 35114 [] -theorem(equivalent(implies(not(p),not(q)),or(p,not(q)))).
% 35116 [binary:35110,35104] theorem(implies(or(X,X),X)).
% 35117 [binary:35110,35105] theorem(implies(X,or(Y,X))).
% 35125 [para:35109.1.2,35106.1.1.2] axiom(implies(or(X,not(Y)),implies(Y,X))).
% 35127 [para:35109.1.2,35107.1.1.1,demod:35109] axiom(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 35130 [binary:35110.2,35111] -axiom(implies(X,Y)) | -theorem(X) | theorem(Y).
% 35132 [binary:35116,35111] -theorem(or(X,X)) | theorem(X).
% 35198 [para:35112.1.2,35109.1.2.1] equal(implies(implies(X,not(Y)),Z),or(and(X,Y),Z)).
% 35281 [binary:35117,35130.2] -axiom(implies(implies(X,or(Y,X)),Z)) | theorem(Z).
% 35304 [binary:35130,35125] -theorem(or(X,not(Y))) | theorem(implies(Y,X)).
% 39236 [binary:35111,35304.2] -theorem(or(X,not(Y))) | -theorem(Y) | theorem(X).
% 40825 [binary:35127,35281] theorem(or(X,implies(Y,Y))).
% 40963 [binary:35132,40825] theorem(implies(X,X)).
% 40992 [binary:35130.2,40963] -axiom(implies(implies(X,X),Y)) | theorem(Y).
% 44213 [binary:35127,40992] theorem(or(X,implies(or(X,Y),Y))).
% 45603 [para:35109.1.2,44213.1.1,demod:35109] theorem(implies(X,implies(implies(X,Y),Y))).
% 45832 [binary:35111,45603] theorem(implies(implies(X,Y),Y)) | -theorem(X).
% 45902 [para:35198.1.1,45832.1.1] theorem(or(and(X,Y),not(Y))) | -theorem(X).
% 67454 [binary:39236,45902] theorem(and(X,Y)) | -theorem(Y) | -theorem(X).
% 67787 [para:35113.1.2,67454.1.1] -theorem(implies(X,Y)) | -theorem(implies(Y,X)) | theorem(equivalent(Y,X)).
% 133043 [binary:35114,67787.3,demod:35198,cut:26076,cut:10879] 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: 13879
% derived clauses: 2448046
% kept clauses: 103955
% kept size sum: 0
% kept mid-nuclei: 12793
% kept new demods: 18
% forw unit-subs: 271306
% forw double-subs: 137938
% forw overdouble-subs: 11853
% backward subs: 254
% fast unit cutoff: 67
% full unit cutoff: 38
% dbl unit cutoff: 0
% real runtime : 111.42
% process. runtime: 110.54
% specific non-discr-tree subsumption statistics:
% tried: 398617
% length fails: 9062
% strength fails: 996
% predlist fails: 181527
% aux str. fails: 352
% by-lit fails: 1136
% full subs tried: 196982
% full subs fail: 185129
%
% ; 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/LCL300-3+eq_r.in")
%
%------------------------------------------------------------------------------