TSTP Solution File: LCL203-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL203-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 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/LCL203-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,11639,3,1504,15127,4,2277,17865,5,3002,17866,5,3003,17866,1,3003,17866,50,3004,17866,40,3004,17876,0,3004)
%
%
% START OF PROOF
% 17868 [] axiom(implies(or(X,X),X)).
% 17869 [] axiom(implies(X,or(Y,X))).
% 17870 [] axiom(implies(or(X,Y),or(Y,X))).
% 17871 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17872 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17873 [] equal(implies(X,Y),or(not(X),Y)).
% 17874 [] -axiom(X) | theorem(X).
% 17875 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 17876 [] -theorem(implies(not(or(p,q)),implies(p,not(q)))).
% 17878 [binary:17874,17868] theorem(implies(or(X,X),X)).
% 17879 [binary:17874,17869] theorem(implies(X,or(Y,X))).
% 17880 [binary:17874,17870] theorem(implies(or(X,Y),or(Y,X))).
% 17887 [binary:17874,17871] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17892 [binary:17879,17875] theorem(or(X,Y)) | -theorem(Y).
% 17906 [binary:17875,17880] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 17910 [binary:17874,17872] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17920 [para:17873.1.2,17906.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 17922 [para:17873.1.2,17887.1.1.1,demod:17873] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 17923 [para:17873.1.2,17887.1.1.1.2,demod:17873] theorem(implies(or(X,implies(Y,Z)),implies(Y,or(X,Z)))).
% 17924 [binary:17875,17887] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 17930 [binary:17879,17920.2] theorem(or(or(X,Y),not(Y))).
% 17935 [binary:17892.2,17930] theorem(or(X,or(or(Y,Z),not(Z)))).
% 17945 [para:17873.1.2,17910.1.1.2.1,demod:17873] theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 17946 [binary:17875,17910] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 17951 [para:17873.1.2,17922.1.1.1.2,demod:17873] theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 17953 [binary:17875,17923] -theorem(or(X,implies(Y,Z))) | theorem(implies(Y,or(X,Z))).
% 17956 [binary:17935,17924] theorem(or(or(X,Y),or(Z,not(Y)))).
% 17960 [binary:17906,17956] theorem(or(or(X,not(Y)),or(Z,Y))).
% 17969 [binary:17878,17946.2] theorem(implies(or(X,or(Y,Y)),or(X,Y))).
% 17972 [binary:17880,17946.2] theorem(implies(or(X,or(Y,Z)),or(X,or(Z,Y)))).
% 17975 [binary:17875,17969] -theorem(or(X,or(Y,Y))) | theorem(or(X,Y)).
% 17982 [binary:17875,17951] -theorem(implies(X,implies(Y,Z))) | theorem(implies(Y,implies(X,Z))).
% 17988 [binary:17960,17975] theorem(or(or(X,not(Y)),Y)).
% 17990 [binary:17906,17988] theorem(or(X,or(Y,not(X)))).
% 18030 [binary:17875,17972] -theorem(or(X,or(Y,Z))) | theorem(or(X,or(Z,Y))).
% 18102 [binary:17945,17982] theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 18144 [binary:17990,18030,demod:17873] theorem(or(X,implies(X,Y))).
% 18151 [binary:17953,18144] theorem(implies(X,or(X,Y))).
% 18417 [binary:17875,18102] theorem(implies(implies(X,Y),implies(Z,Y))) | -theorem(implies(Z,X)).
% 19113 [binary:18151,18417.2] theorem(implies(implies(or(X,Y),Z),implies(X,Z))).
% 19163 [binary:17875,19113] -theorem(implies(or(X,Y),Z)) | theorem(implies(X,Z)).
% 19275 [para:17873.1.2,19163.1.1.1] -theorem(implies(implies(X,Y),Z)) | theorem(implies(not(X),Z)).
% 19383 [binary:19113,19275,slowcut:17876] 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: 1642
% derived clauses: 79588
% kept clauses: 16336
% kept size sum: 242150
% kept mid-nuclei: 2727
% kept new demods: 2
% forw unit-subs: 38114
% forw double-subs: 560
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 0
% full unit cutoff: 20
% dbl unit cutoff: 0
% real runtime : 30.35
% process. runtime: 30.31
% 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/LCL203-3+eq_r.in")
%
%------------------------------------------------------------------------------