TSTP Solution File: LCL191-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL191-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 : art05.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.4s
% Output : Assurance 109.4s
% 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/LCL191-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,12148,3,1503,15696,4,2254,18644,5,3002,18645,1,3003,18645,50,3004,18645,40,3004,18655,0,3004,22463,50,3425,22473,0,3425,60782,3,9177)
%
%
% START OF PROOF
% 22467 [] axiom(implies(or(X,Y),or(Y,X))).
% 22468 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 22469 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 22470 [] equal(implies(X,Y),or(not(X),Y)).
% 22471 [] -axiom(X) | theorem(X).
% 22472 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 22473 [] -theorem(implies(or(p,or(q,r)),or(or(p,q),r))).
% 22477 [binary:22471,22467] theorem(implies(or(X,Y),or(Y,X))).
% 22484 [binary:22471,22468] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 22507 [binary:22471,22469] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 22552 [para:22470.1.2,22484.1.1.1,demod:22470] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 22553 [para:22470.1.2,22484.1.1.1.2,demod:22470] theorem(implies(or(X,implies(Y,Z)),implies(Y,or(X,Z)))).
% 22615 [para:22470.1.2,22507.1.1.2.1,demod:22470] theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 22616 [binary:22472,22507] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 22636 [binary:22472,22552] -theorem(implies(X,or(Y,Z))) | theorem(or(Y,implies(X,Z))).
% 22641 [binary:22472,22553] -theorem(or(X,implies(Y,Z))) | theorem(implies(Y,or(X,Z))).
% 22814 [binary:22472,22615] theorem(implies(implies(X,Y),implies(X,Z))) | -theorem(implies(Y,Z)).
% 22833 [binary:22507,22616.2] theorem(implies(or(X,implies(Y,Z)),or(X,implies(or(U,Y),or(U,Z))))).
% 22982 [binary:22477,22636] theorem(or(X,implies(or(Y,X),Y))).
% 23608 [binary:22477,22814.2] theorem(implies(implies(X,or(Y,Z)),implies(X,or(Z,Y)))).
% 23829 [binary:22472,22833] theorem(or(X,implies(or(Y,Z),or(Y,U)))) | -theorem(or(X,implies(Z,U))).
% 27265 [binary:22472,23608] -theorem(implies(X,or(Y,Z))) | theorem(implies(X,or(Z,Y))).
% 32599 [binary:22982,23829.2] theorem(or(X,implies(or(Y,or(Z,X)),or(Y,Z)))).
% 54698 [binary:22641,32599] theorem(implies(or(X,or(Y,Z)),or(Z,or(X,Y)))).
% 70931 [binary:27265,54698,slowcut:22473] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using unit paramodulation strategy
% using unit 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
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 11466
% derived clauses: 2260030
% kept clauses: 64969
% kept size sum: 0
% kept mid-nuclei: 2940
% kept new demods: 3
% forw unit-subs: 440874
% forw double-subs: 3827
% forw overdouble-subs: 0
% backward subs: 24
% fast unit cutoff: 0
% full unit cutoff: 39
% dbl unit cutoff: 0
% real runtime : 113.96
% process. runtime: 113.23
% 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/LCL191-3+eq_r.in")
%
%------------------------------------------------------------------------------