TSTP Solution File: LCL206-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL206-3 : TPTP v3.4.2. Bugfixed v2.4.1.
% 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 29.7s
% Output : Assurance 29.7s
% 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/LCL206-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,11744,3,1505,15019,4,2263,17685,5,3002,17687,5,3003,17687,1,3003,17687,50,3005,17687,40,3005,17697,0,3005)
%
%
% START OF PROOF
% 17689 [] axiom(implies(or(X,X),X)).
% 17690 [] axiom(implies(X,or(Y,X))).
% 17691 [] axiom(implies(or(X,Y),or(Y,X))).
% 17692 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17693 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17694 [] equal(implies(X,Y),or(not(X),Y)).
% 17695 [] -axiom(X) | theorem(X).
% 17696 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 17697 [] -theorem(implies(not(implies(p,q)),implies(not(p),not(q)))).
% 17699 [binary:17695,17689] theorem(implies(or(X,X),X)).
% 17700 [binary:17695,17690] theorem(implies(X,or(Y,X))).
% 17701 [binary:17695,17691] theorem(implies(or(X,Y),or(Y,X))).
% 17708 [binary:17695,17692] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17713 [binary:17700,17696] theorem(or(X,Y)) | -theorem(Y).
% 17727 [binary:17696,17701] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 17731 [binary:17695,17693] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17741 [para:17694.1.2,17727.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 17743 [para:17694.1.2,17708.1.1.1,demod:17694] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 17744 [para:17694.1.2,17708.1.1.1.2,demod:17694] theorem(implies(or(X,implies(Y,Z)),implies(Y,or(X,Z)))).
% 17745 [binary:17696,17708] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 17751 [binary:17700,17741.2] theorem(or(or(X,Y),not(Y))).
% 17756 [binary:17713.2,17751] theorem(or(X,or(or(Y,Z),not(Z)))).
% 17766 [para:17694.1.2,17731.1.1.2.1,demod:17694] theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 17767 [binary:17696,17731] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 17772 [para:17694.1.2,17743.1.1.1.2,demod:17694] theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 17774 [binary:17696,17744] -theorem(or(X,implies(Y,Z))) | theorem(implies(Y,or(X,Z))).
% 17777 [binary:17756,17745] theorem(or(or(X,Y),or(Z,not(Y)))).
% 17781 [binary:17727,17777] theorem(or(or(X,not(Y)),or(Z,Y))).
% 17790 [binary:17699,17767.2] theorem(implies(or(X,or(Y,Y)),or(X,Y))).
% 17793 [binary:17701,17767.2] theorem(implies(or(X,or(Y,Z)),or(X,or(Z,Y)))).
% 17796 [binary:17696,17790] -theorem(or(X,or(Y,Y))) | theorem(or(X,Y)).
% 17803 [binary:17696,17772] -theorem(implies(X,implies(Y,Z))) | theorem(implies(Y,implies(X,Z))).
% 17809 [binary:17781,17796] theorem(or(or(X,not(Y)),Y)).
% 17811 [binary:17727,17809] theorem(or(X,or(Y,not(X)))).
% 17851 [binary:17696,17793] -theorem(or(X,or(Y,Z))) | theorem(or(X,or(Z,Y))).
% 17923 [binary:17766,17803] theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 17965 [binary:17811,17851,demod:17694] theorem(or(X,implies(X,Y))).
% 17972 [binary:17774,17965] theorem(implies(X,or(X,Y))).
% 17982 [para:17694.1.2,17972.1.1.2] theorem(implies(not(X),implies(X,Y))).
% 18238 [binary:17696,17923] theorem(implies(implies(X,Y),implies(Z,Y))) | -theorem(implies(Z,X)).
% 18934 [binary:17972,18238.2] theorem(implies(implies(or(X,Y),Z),implies(X,Z))).
% 18935 [binary:17982,18238.2] theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))).
% 18984 [binary:17696,18934] -theorem(implies(or(X,Y),Z)) | theorem(implies(X,Z)).
% 19096 [para:17694.1.2,18984.1.1.1] -theorem(implies(implies(X,Y),Z)) | theorem(implies(not(X),Z)).
% 19208 [binary:18935,19096,slowcut:17697] 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: 1594
% derived clauses: 79147
% kept clauses: 16235
% kept size sum: 242535
% kept mid-nuclei: 2658
% kept new demods: 2
% forw unit-subs: 37836
% forw double-subs: 562
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 0
% full unit cutoff: 11
% dbl unit cutoff: 0
% real runtime : 30.83
% 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/LCL206-3+eq_r.in")
%
%------------------------------------------------------------------------------