TSTP Solution File: LCL208-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL208-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 : art03.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 30.0s
% Output : Assurance 30.0s
% 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/LCL208-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (binary-unit-uniteq 30 #f)
% (binary-posweight-order 120 #f 4 5)
% (binary-posweight-order 240 #f)
% (binary-posweight-lex-big-order 60 #f)
% (binary-posweight-lex-small-order 12 #f)
% (binary-weightorder 24 #f)
% (hyper 30 #f)
% (binary 24 #t)
% (binary-order 30 #f)
% (binary-unit 30 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(10,40,0,20,0,0,11795,3,1528,14228,4,2251,17242,5,3001,17243,5,3002,17243,1,3002,17243,50,3003,17243,40,3003,17253,0,3003,21061,50,3413,21071,0,3413)
%
%
% START OF PROOF
% 21063 [] axiom(implies(or(X,X),X)).
% 21064 [] axiom(implies(X,or(Y,X))).
% 21065 [] axiom(implies(or(X,Y),or(Y,X))).
% 21066 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 21067 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 21068 [] equal(implies(X,Y),or(not(X),Y)).
% 21069 [] -axiom(X) | theorem(X).
% 21070 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 21071 [] -theorem(implies(or(p,q),implies(not(p),q))).
% 21073 [binary:21069,21063] theorem(implies(or(X,X),X)).
% 21074 [binary:21069,21064] theorem(implies(X,or(Y,X))).
% 21075 [binary:21069,21065] theorem(implies(or(X,Y),or(Y,X))).
% 21082 [binary:21069,21066] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 21086 [binary:21073,21070] -theorem(or(X,X)) | theorem(X).
% 21087 [binary:21074,21070] theorem(or(X,Y)) | -theorem(Y).
% 21101 [binary:21070,21075] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 21105 [binary:21069,21067] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 21136 [para:21068.1.2,21101.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 21150 [para:21068.1.2,21082.1.1.1,demod:21068] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 21152 [binary:21070,21082] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 21165 [binary:21074,21136.2] theorem(or(or(X,Y),not(Y))).
% 21176 [binary:21087.2,21165] theorem(or(X,or(or(Y,Z),not(Z)))).
% 21214 [binary:21070,21105] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 21233 [para:21068.1.2,21150.1.1.1.2,demod:21068] theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 21234 [binary:21070,21150] -theorem(implies(X,or(Y,Z))) | theorem(or(Y,implies(X,Z))).
% 21248 [binary:21176,21152] theorem(or(or(X,Y),or(Z,not(Y)))).
% 21257 [binary:21101,21248] theorem(or(or(X,not(Y)),or(Z,Y))).
% 21271 [binary:21152,21257] theorem(or(X,or(or(Y,not(Z)),Z))).
% 21284 [binary:21086,21271] theorem(or(or(X,not(Y)),Y)).
% 21287 [binary:21101,21284] theorem(or(X,or(Y,not(X)))).
% 21296 [binary:21152,21287] theorem(or(X,or(Y,not(Y)))).
% 21302 [binary:21086,21296] theorem(or(X,not(X))).
% 21307 [para:21068.1.2,21302.1.1] theorem(implies(X,not(not(X)))).
% 21308 [binary:21101,21302,demod:21068] theorem(implies(X,X)).
% 21435 [binary:21307,21214.2] theorem(implies(or(X,Y),or(X,not(not(Y))))).
% 21473 [binary:21070,21435] theorem(or(X,not(not(Y)))) | -theorem(or(X,Y)).
% 21559 [binary:21070,21233] -theorem(implies(X,implies(Y,Z))) | theorem(implies(Y,implies(X,Z))).
% 21584 [binary:21308,21234] theorem(or(X,implies(or(X,Y),Y))).
% 21600 [binary:21101,21584] theorem(or(implies(or(X,Y),Y),X)).
% 21623 [binary:21473.2,21600] theorem(or(implies(or(X,Y),Y),not(not(X)))).
% 22024 [binary:21101,21623,demod:21068] theorem(implies(not(X),implies(or(X,Y),Y))).
% 23374 [binary:22024,21559,slowcut:21071] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred 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
% clause length limited to 5
% clause depth limited to 5
% seconds given: 120
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 4263
% derived clauses: 292105
% kept clauses: 18927
% kept size sum: 272984
% kept mid-nuclei: 2983
% kept new demods: 3
% forw unit-subs: 88122
% forw double-subs: 1764
% forw overdouble-subs: 0
% backward subs: 17
% fast unit cutoff: 0
% full unit cutoff: 48
% dbl unit cutoff: 0
% real runtime : 34.64
% process. runtime: 34.63
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; 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/LCL208-3+eq_r.in")
%
%------------------------------------------------------------------------------