TSTP Solution File: LCL202-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL202-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 : art09.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/LCL202-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,11973,3,1503,15597,4,2283,18854,5,3001,18855,5,3002,18855,1,3002,18855,50,3003,18855,40,3003,18865,0,3003)
%
%
% START OF PROOF
% 18857 [] axiom(implies(or(X,X),X)).
% 18858 [] axiom(implies(X,or(Y,X))).
% 18859 [] axiom(implies(or(X,Y),or(Y,X))).
% 18860 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 18861 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 18862 [] equal(implies(X,Y),or(not(X),Y)).
% 18863 [] -axiom(X) | theorem(X).
% 18864 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 18865 [] -theorem(implies(not(or(p,q)),or(p,not(q)))).
% 18867 [binary:18863,18857] theorem(implies(or(X,X),X)).
% 18868 [binary:18863,18858] theorem(implies(X,or(Y,X))).
% 18869 [binary:18863,18859] theorem(implies(or(X,Y),or(Y,X))).
% 18876 [binary:18863,18860] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 18881 [binary:18868,18864] theorem(or(X,Y)) | -theorem(Y).
% 18895 [binary:18864,18869] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 18899 [binary:18863,18861] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 18909 [para:18862.1.2,18895.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 18911 [para:18862.1.2,18876.1.1.1,demod:18862] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 18912 [para:18862.1.2,18876.1.1.1.2,demod:18862] theorem(implies(or(X,implies(Y,Z)),implies(Y,or(X,Z)))).
% 18913 [binary:18864,18876] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 18919 [binary:18868,18909.2] theorem(or(or(X,Y),not(Y))).
% 18924 [binary:18881.2,18919] theorem(or(X,or(or(Y,Z),not(Z)))).
% 18934 [para:18862.1.2,18899.1.1.2.1,demod:18862] theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 18935 [binary:18864,18899] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 18940 [para:18862.1.2,18911.1.1.1.2,demod:18862] theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 18942 [binary:18864,18912] -theorem(or(X,implies(Y,Z))) | theorem(implies(Y,or(X,Z))).
% 18945 [binary:18924,18913] theorem(or(or(X,Y),or(Z,not(Y)))).
% 18949 [binary:18895,18945] theorem(or(or(X,not(Y)),or(Z,Y))).
% 18958 [binary:18867,18935.2] theorem(implies(or(X,or(Y,Y)),or(X,Y))).
% 18959 [binary:18868,18935.2] theorem(implies(or(X,Y),or(X,or(Z,Y)))).
% 18961 [binary:18869,18935.2] theorem(implies(or(X,or(Y,Z)),or(X,or(Z,Y)))).
% 18963 [para:18862.1.2,18958.1.1.1,demod:18862] theorem(implies(implies(X,or(Y,Y)),implies(X,Y))).
% 18964 [binary:18864,18958] -theorem(or(X,or(Y,Y))) | theorem(or(X,Y)).
% 18965 [para:18862.1.2,18959.1.1.1,demod:18862] theorem(implies(implies(X,Y),implies(X,or(Z,Y)))).
% 18971 [binary:18864,18940] -theorem(implies(X,implies(Y,Z))) | theorem(implies(Y,implies(X,Z))).
% 18974 [binary:18864,18963] -theorem(implies(X,or(Y,Y))) | theorem(implies(X,Y)).
% 18977 [binary:18949,18964] theorem(or(or(X,not(Y)),Y)).
% 18979 [binary:18895,18977] theorem(or(X,or(Y,not(X)))).
% 19019 [binary:18864,18961] -theorem(or(X,or(Y,Z))) | theorem(or(X,or(Z,Y))).
% 19023 [binary:18864,18965] theorem(implies(X,or(Y,Z))) | -theorem(implies(X,Z)).
% 19091 [binary:18934,18971] theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 19100 [para:18862.1.2,18974.1.1.2] -theorem(implies(X,implies(Y,not(Y)))) | theorem(implies(X,not(Y))).
% 19133 [binary:18979,19019,demod:18862] theorem(or(X,implies(X,Y))).
% 19140 [binary:18942,19133] theorem(implies(X,or(X,Y))).
% 19406 [binary:18864,19091] theorem(implies(implies(X,Y),implies(Z,Y))) | -theorem(implies(Z,X)).
% 20097 [binary:18868,19406.2] theorem(implies(implies(or(X,Y),Z),implies(Y,Z))).
% 20102 [binary:19140,19406.2] theorem(implies(implies(or(X,Y),Z),implies(X,Z))).
% 20145 [binary:19100,20097] theorem(implies(implies(or(X,Y),not(Y)),not(Y))).
% 20152 [binary:18864,20102] -theorem(implies(or(X,Y),Z)) | theorem(implies(X,Z)).
% 20264 [para:18862.1.2,20152.1.1.1] -theorem(implies(implies(X,Y),Z)) | theorem(implies(not(X),Z)).
% 20372 [binary:20145,20264] theorem(implies(not(or(X,Y)),not(Y))).
% 20378 [binary:19023.2,20372,slowcut:18865] 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: 1625
% derived clauses: 82187
% kept clauses: 16809
% kept size sum: 248655
% kept mid-nuclei: 3246
% kept new demods: 2
% forw unit-subs: 39718
% forw double-subs: 552
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 0
% full unit cutoff: 19
% dbl unit cutoff: 0
% real runtime : 30.39
% process. runtime: 30.38
% 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/LCL202-3+eq_r.in")
%
%------------------------------------------------------------------------------