TSTP Solution File: LCL205-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL205-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 : art06.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 29.5s
% Output : Assurance 29.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/LCL205-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,1,20,0,1,11614,3,1529,14500,4,2258,17270,5,3002,17271,5,3003,17271,1,3003,17271,50,3004,17271,40,3004,17281,0,3004)
%
%
% START OF PROOF
% 17273 [] axiom(implies(or(X,X),X)).
% 17274 [] axiom(implies(X,or(Y,X))).
% 17275 [] axiom(implies(or(X,Y),or(Y,X))).
% 17276 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17277 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17278 [] equal(implies(X,Y),or(not(X),Y)).
% 17279 [] -axiom(X) | theorem(X).
% 17280 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 17281 [] -theorem(implies(not(implies(p,q)),implies(p,not(q)))).
% 17283 [binary:17279,17273] theorem(implies(or(X,X),X)).
% 17284 [binary:17279,17274] theorem(implies(X,or(Y,X))).
% 17285 [binary:17279,17275] theorem(implies(or(X,Y),or(Y,X))).
% 17289 [para:17278.1.2,17284.1.1.2] theorem(implies(X,implies(Y,X))).
% 17292 [binary:17279,17276] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17297 [binary:17284,17280] theorem(or(X,Y)) | -theorem(Y).
% 17311 [binary:17280,17285] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 17315 [binary:17279,17277] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17325 [para:17278.1.2,17311.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 17327 [para:17278.1.2,17292.1.1.1,demod:17278] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 17328 [para:17278.1.2,17292.1.1.1.2,demod:17278] theorem(implies(or(X,implies(Y,Z)),implies(Y,or(X,Z)))).
% 17329 [binary:17280,17292] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 17335 [binary:17284,17325.2] theorem(or(or(X,Y),not(Y))).
% 17340 [binary:17297.2,17335] theorem(or(X,or(or(Y,Z),not(Z)))).
% 17350 [para:17278.1.2,17315.1.1.2.1,demod:17278] theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 17351 [binary:17280,17315] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 17356 [para:17278.1.2,17327.1.1.1.2,demod:17278] theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 17358 [binary:17280,17328] -theorem(or(X,implies(Y,Z))) | theorem(implies(Y,or(X,Z))).
% 17361 [binary:17340,17329] theorem(or(or(X,Y),or(Z,not(Y)))).
% 17365 [binary:17311,17361] theorem(or(or(X,not(Y)),or(Z,Y))).
% 17374 [binary:17283,17351.2] theorem(implies(or(X,or(Y,Y)),or(X,Y))).
% 17376 [binary:17289,17351.2] theorem(implies(or(X,Y),or(X,implies(Z,Y)))).
% 17377 [binary:17285,17351.2] theorem(implies(or(X,or(Y,Z)),or(X,or(Z,Y)))).
% 17379 [para:17278.1.2,17374.1.1.1,demod:17278] theorem(implies(implies(X,or(Y,Y)),implies(X,Y))).
% 17380 [binary:17280,17374] -theorem(or(X,or(Y,Y))) | theorem(or(X,Y)).
% 17384 [para:17278.1.2,17376.1.1.1,demod:17278] theorem(implies(implies(X,Y),implies(X,implies(Z,Y)))).
% 17387 [binary:17280,17356] -theorem(implies(X,implies(Y,Z))) | theorem(implies(Y,implies(X,Z))).
% 17390 [binary:17280,17379] -theorem(implies(X,or(Y,Y))) | theorem(implies(X,Y)).
% 17393 [binary:17365,17380] theorem(or(or(X,not(Y)),Y)).
% 17395 [binary:17311,17393] theorem(or(X,or(Y,not(X)))).
% 17435 [binary:17280,17377] -theorem(or(X,or(Y,Z))) | theorem(or(X,or(Z,Y))).
% 17468 [binary:17280,17384] theorem(implies(X,implies(Y,Z))) | -theorem(implies(X,Z)).
% 17507 [binary:17350,17387] theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 17516 [para:17278.1.2,17390.1.1.2] -theorem(implies(X,implies(Y,not(Y)))) | theorem(implies(X,not(Y))).
% 17549 [binary:17395,17435,demod:17278] theorem(or(X,implies(X,Y))).
% 17556 [binary:17358,17549] theorem(implies(X,or(X,Y))).
% 17822 [binary:17280,17507] theorem(implies(implies(X,Y),implies(Z,Y))) | -theorem(implies(Z,X)).
% 18514 [binary:17289,17822.2] theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 18518 [binary:17556,17822.2] theorem(implies(implies(or(X,Y),Z),implies(X,Z))).
% 18566 [binary:17516,18514] theorem(implies(implies(implies(X,Y),not(Y)),not(Y))).
% 18568 [binary:17280,18518] -theorem(implies(or(X,Y),Z)) | theorem(implies(X,Z)).
% 18680 [para:17278.1.2,18568.1.1.1] -theorem(implies(implies(X,Y),Z)) | theorem(implies(not(X),Z)).
% 18789 [binary:18566,18680] theorem(implies(not(implies(X,Y)),not(Y))).
% 18799 [binary:17468.2,18789,slowcut:17281] 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 4
% seconds given: 120
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1545
% derived clauses: 77580
% kept clauses: 15718
% kept size sum: 235083
% kept mid-nuclei: 2758
% kept new demods: 2
% forw unit-subs: 36565
% forw double-subs: 577
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 0
% full unit cutoff: 20
% dbl unit cutoff: 0
% real runtime : 30.90
% process. runtime: 30.33
% 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/LCL205-3+eq_r.in")
%
%------------------------------------------------------------------------------