TSTP Solution File: LCL337-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL337-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 109.6s
% Output : Assurance 109.6s
% 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/LCL337-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,15782,3,2851,18786,4,4276,21783,5,5701,21784,5,5701,21784,1,5701,21784,50,5703,21784,40,5703,21796,0,5703,30825,3,7116,32999,4,7804,35197,5,8504,35199,5,8504,35199,1,8504,35199,50,8505,35199,40,8505,35211,0,8505,101925,3,9906,123383,4,10607)
%
%
% START OF PROOF
% 24153 [?] ?
% 35201 [] axiom(implies(or(X,X),X)).
% 35202 [] axiom(implies(X,or(Y,X))).
% 35203 [] axiom(implies(or(X,Y),or(Y,X))).
% 35204 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 35205 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 35206 [] equal(implies(X,Y),or(not(X),Y)).
% 35207 [] -axiom(X) | theorem(X).
% 35208 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 35209 [] equal(and(X,Y),not(implies(X,not(Y)))).
% 35210 [] equal(equivalent(X,Y),and(implies(X,Y),implies(Y,X))).
% 35211 [] -theorem(equivalent(implies(p,implies(p,q)),implies(p,q))).
% 35213 [binary:35207,35201] theorem(implies(or(X,X),X)).
% 35214 [binary:35207,35202] theorem(implies(X,or(Y,X))).
% 35220 [para:35206.1.2,35214.1.1.2] theorem(implies(X,implies(Y,X))).
% 35222 [para:35206.1.2,35203.1.1.2] axiom(implies(or(X,not(Y)),implies(Y,X))).
% 35224 [para:35206.1.2,35204.1.1.1,demod:35206] axiom(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 35227 [binary:35207.2,35208] -axiom(implies(X,Y)) | -theorem(X) | theorem(Y).
% 35229 [binary:35213,35208] -theorem(or(X,X)) | theorem(X).
% 35263 [para:35206.1.2,35205.1.1.2.1,demod:35206] axiom(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 35295 [para:35209.1.2,35206.1.2.1] equal(implies(implies(X,not(Y)),Z),or(and(X,Y),Z)).
% 35378 [binary:35214,35227.2] -axiom(implies(implies(X,or(Y,X)),Z)) | theorem(Z).
% 35380 [binary:35220,35227.2] -axiom(implies(implies(X,implies(Y,X)),Z)) | theorem(Z).
% 35401 [binary:35227,35222] -theorem(or(X,not(Y))) | theorem(implies(Y,X)).
% 39333 [binary:35208,35401.2] -theorem(or(X,not(Y))) | -theorem(Y) | theorem(X).
% 40922 [binary:35224,35378] theorem(or(X,implies(Y,Y))).
% 41060 [binary:35229,40922] theorem(implies(X,X)).
% 41089 [binary:35227.2,41060] -axiom(implies(implies(X,X),Y)) | theorem(Y).
% 41383 [binary:35263,35380] theorem(implies(implies(X,Y),implies(X,implies(Z,Y)))).
% 44310 [binary:35224,41089] theorem(or(X,implies(or(X,Y),Y))).
% 45700 [para:35206.1.2,44310.1.1,demod:35206] theorem(implies(X,implies(implies(X,Y),Y))).
% 45929 [binary:35208,45700] theorem(implies(implies(X,Y),Y)) | -theorem(X).
% 45999 [para:35295.1.1,45929.1.1] theorem(or(and(X,Y),not(Y))) | -theorem(X).
% 67551 [binary:39333,45999] theorem(and(X,Y)) | -theorem(Y) | -theorem(X).
% 67884 [para:35210.1.2,67551.1.1] -theorem(implies(X,Y)) | -theorem(implies(Y,X)) | theorem(equivalent(Y,X)).
% 131024 [binary:35211,67884.3,cut:24153,cut:41383] 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: 13894
% derived clauses: 2443992
% kept clauses: 103983
% kept size sum: 0
% kept mid-nuclei: 12836
% kept new demods: 18
% forw unit-subs: 271633
% forw double-subs: 137842
% forw overdouble-subs: 11808
% backward subs: 240
% fast unit cutoff: 67
% full unit cutoff: 39
% dbl unit cutoff: 0
% real runtime : 110.77
% process. runtime: 110.22
% specific non-discr-tree subsumption statistics:
% tried: 395631
% length fails: 9041
% strength fails: 997
% predlist fails: 179430
% aux str. fails: 352
% by-lit fails: 1136
% full subs tried: 196144
% full subs fail: 184336
%
% ; 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/LCL337-3+eq_r.in")
%
%------------------------------------------------------------------------------