TSTP Solution File: LCL211-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL211-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 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/LCL211-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,1527,13972,4,2258,16968,5,3001,16968,5,3001,16968,1,3001,16968,50,3002,16968,40,3002,16978,0,3002,20786,50,3412,20796,0,3412)
%
%
% START OF PROOF
% 20788 [] axiom(implies(or(X,X),X)).
% 20789 [] axiom(implies(X,or(Y,X))).
% 20790 [] axiom(implies(or(X,Y),or(Y,X))).
% 20791 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 20792 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 20793 [] equal(implies(X,Y),or(not(X),Y)).
% 20794 [] -axiom(X) | theorem(X).
% 20795 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 20796 [] -theorem(implies(not(q),implies(or(p,q),p))).
% 20798 [binary:20794,20788] theorem(implies(or(X,X),X)).
% 20799 [binary:20794,20789] theorem(implies(X,or(Y,X))).
% 20800 [binary:20794,20790] theorem(implies(or(X,Y),or(Y,X))).
% 20807 [binary:20794,20791] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 20811 [binary:20798,20795] -theorem(or(X,X)) | theorem(X).
% 20812 [binary:20799,20795] theorem(or(X,Y)) | -theorem(Y).
% 20826 [binary:20795,20800] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 20830 [binary:20794,20792] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 20861 [para:20793.1.2,20826.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 20875 [para:20793.1.2,20807.1.1.1,demod:20793] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 20877 [binary:20795,20807] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 20890 [binary:20799,20861.2] theorem(or(or(X,Y),not(Y))).
% 20901 [binary:20812.2,20890] theorem(or(X,or(or(Y,Z),not(Z)))).
% 20939 [binary:20795,20830] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 20959 [binary:20795,20875] -theorem(implies(X,or(Y,Z))) | theorem(or(Y,implies(X,Z))).
% 20973 [binary:20901,20877] theorem(or(or(X,Y),or(Z,not(Y)))).
% 20982 [binary:20826,20973] theorem(or(or(X,not(Y)),or(Z,Y))).
% 20996 [binary:20877,20982] theorem(or(X,or(or(Y,not(Z)),Z))).
% 21009 [binary:20811,20996] theorem(or(or(X,not(Y)),Y)).
% 21012 [binary:20826,21009] theorem(or(X,or(Y,not(X)))).
% 21021 [binary:20877,21012] theorem(or(X,or(Y,not(Y)))).
% 21027 [binary:20811,21021] theorem(or(X,not(X))).
% 21032 [para:20793.1.2,21027.1.1] theorem(implies(X,not(not(X)))).
% 21160 [binary:21032,20939.2] theorem(implies(or(X,Y),or(X,not(not(Y))))).
% 21198 [binary:20795,21160] theorem(or(X,not(not(Y)))) | -theorem(or(X,Y)).
% 21305 [binary:20800,20959] theorem(or(X,implies(or(Y,X),Y))).
% 21318 [binary:20826,21305] theorem(or(implies(or(X,Y),X),Y)).
% 21335 [binary:21198.2,21318] theorem(or(implies(or(X,Y),X),not(not(Y)))).
% 21717 [binary:20826,21335,demod:20793,slowcut:20796] 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: 3820
% derived clauses: 260052
% kept clauses: 17417
% kept size sum: 255275
% kept mid-nuclei: 2964
% kept new demods: 3
% forw unit-subs: 80494
% 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.77
% process. runtime: 34.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/LCL211-3+eq_r.in")
%
%------------------------------------------------------------------------------