TSTP Solution File: LCL210-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL210-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 : art02.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/LCL210-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,11549,3,1516,13972,4,2254,16950,5,3001,16951,5,3001,16951,1,3001,16951,50,3002,16951,40,3002,16961,0,3002,20769,50,3413,20779,0,3413)
%
%
% START OF PROOF
% 20771 [] axiom(implies(or(X,X),X)).
% 20772 [] axiom(implies(X,or(Y,X))).
% 20773 [] axiom(implies(or(X,Y),or(Y,X))).
% 20774 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 20775 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 20776 [] equal(implies(X,Y),or(not(X),Y)).
% 20777 [] -axiom(X) | theorem(X).
% 20778 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 20779 [] -theorem(implies(not(p),implies(or(p,q),q))).
% 20781 [binary:20777,20771] theorem(implies(or(X,X),X)).
% 20782 [binary:20777,20772] theorem(implies(X,or(Y,X))).
% 20783 [binary:20777,20773] theorem(implies(or(X,Y),or(Y,X))).
% 20790 [binary:20777,20774] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 20794 [binary:20781,20778] -theorem(or(X,X)) | theorem(X).
% 20795 [binary:20782,20778] theorem(or(X,Y)) | -theorem(Y).
% 20809 [binary:20778,20783] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 20813 [binary:20777,20775] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 20844 [para:20776.1.2,20809.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 20858 [para:20776.1.2,20790.1.1.1,demod:20776] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 20860 [binary:20778,20790] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 20873 [binary:20782,20844.2] theorem(or(or(X,Y),not(Y))).
% 20884 [binary:20795.2,20873] theorem(or(X,or(or(Y,Z),not(Z)))).
% 20922 [binary:20778,20813] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 20942 [binary:20778,20858] -theorem(implies(X,or(Y,Z))) | theorem(or(Y,implies(X,Z))).
% 20956 [binary:20884,20860] theorem(or(or(X,Y),or(Z,not(Y)))).
% 20965 [binary:20809,20956] theorem(or(or(X,not(Y)),or(Z,Y))).
% 20979 [binary:20860,20965] theorem(or(X,or(or(Y,not(Z)),Z))).
% 20992 [binary:20794,20979] theorem(or(or(X,not(Y)),Y)).
% 20995 [binary:20809,20992] theorem(or(X,or(Y,not(X)))).
% 21004 [binary:20860,20995] theorem(or(X,or(Y,not(Y)))).
% 21010 [binary:20794,21004] theorem(or(X,not(X))).
% 21015 [para:20776.1.2,21010.1.1] theorem(implies(X,not(not(X)))).
% 21016 [binary:20809,21010,demod:20776] theorem(implies(X,X)).
% 21143 [binary:21015,20922.2] theorem(implies(or(X,Y),or(X,not(not(Y))))).
% 21181 [binary:20778,21143] theorem(or(X,not(not(Y)))) | -theorem(or(X,Y)).
% 21292 [binary:21016,20942] theorem(or(X,implies(or(X,Y),Y))).
% 21308 [binary:20809,21292] theorem(or(implies(or(X,Y),Y),X)).
% 21331 [binary:21181.2,21308] theorem(or(implies(or(X,Y),Y),not(not(X)))).
% 21733 [binary:20809,21331,demod:20776,slowcut:20779] 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: 3835
% derived clauses: 260434
% kept clauses: 17449
% kept size sum: 255641
% kept mid-nuclei: 2947
% kept new demods: 3
% forw unit-subs: 80579
% forw double-subs: 1655
% forw overdouble-subs: 0
% backward subs: 9
% fast unit cutoff: 0
% full unit cutoff: 44
% dbl unit cutoff: 0
% real runtime : 34.27
% process. runtime: 34.25
% 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/LCL210-3+eq_r.in")
%
%------------------------------------------------------------------------------