TSTP Solution File: LCL485+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL485+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 06:54:20 EDT 2023
% Result : Theorem 9.74s 9.85s
% Output : CNFRefutation 9.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 118
% Syntax : Number of formulae : 249 ( 67 unt; 92 typ; 0 def)
% Number of atoms : 296 ( 33 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 251 ( 112 ~; 112 |; 12 &)
% ( 8 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 6 >; 4 *; 0 +; 0 <<)
% Number of predicates : 34 ( 32 usr; 32 prp; 0-2 aty)
% Number of functors : 60 ( 60 usr; 55 con; 0-2 aty)
% Number of variables : 259 ( 24 sgn; 54 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
modus_ponens: $o ).
tff(decl_23,type,
is_a_theorem: $i > $o ).
tff(decl_24,type,
implies: ( $i * $i ) > $i ).
tff(decl_25,type,
substitution_of_equivalents: $o ).
tff(decl_26,type,
equiv: ( $i * $i ) > $i ).
tff(decl_27,type,
modus_tollens: $o ).
tff(decl_28,type,
not: $i > $i ).
tff(decl_29,type,
implies_1: $o ).
tff(decl_30,type,
implies_2: $o ).
tff(decl_31,type,
implies_3: $o ).
tff(decl_32,type,
and_1: $o ).
tff(decl_33,type,
and: ( $i * $i ) > $i ).
tff(decl_34,type,
and_2: $o ).
tff(decl_35,type,
and_3: $o ).
tff(decl_36,type,
or_1: $o ).
tff(decl_37,type,
or: ( $i * $i ) > $i ).
tff(decl_38,type,
or_2: $o ).
tff(decl_39,type,
or_3: $o ).
tff(decl_40,type,
equivalence_1: $o ).
tff(decl_41,type,
equivalence_2: $o ).
tff(decl_42,type,
equivalence_3: $o ).
tff(decl_43,type,
kn1: $o ).
tff(decl_44,type,
kn2: $o ).
tff(decl_45,type,
kn3: $o ).
tff(decl_46,type,
cn1: $o ).
tff(decl_47,type,
cn2: $o ).
tff(decl_48,type,
cn3: $o ).
tff(decl_49,type,
r1: $o ).
tff(decl_50,type,
r2: $o ).
tff(decl_51,type,
r3: $o ).
tff(decl_52,type,
r4: $o ).
tff(decl_53,type,
r5: $o ).
tff(decl_54,type,
op_or: $o ).
tff(decl_55,type,
op_and: $o ).
tff(decl_56,type,
op_implies_and: $o ).
tff(decl_57,type,
op_implies_or: $o ).
tff(decl_58,type,
op_equiv: $o ).
tff(decl_59,type,
esk1_0: $i ).
tff(decl_60,type,
esk2_0: $i ).
tff(decl_61,type,
esk3_0: $i ).
tff(decl_62,type,
esk4_0: $i ).
tff(decl_63,type,
esk5_0: $i ).
tff(decl_64,type,
esk6_0: $i ).
tff(decl_65,type,
esk7_0: $i ).
tff(decl_66,type,
esk8_0: $i ).
tff(decl_67,type,
esk9_0: $i ).
tff(decl_68,type,
esk10_0: $i ).
tff(decl_69,type,
esk11_0: $i ).
tff(decl_70,type,
esk12_0: $i ).
tff(decl_71,type,
esk13_0: $i ).
tff(decl_72,type,
esk14_0: $i ).
tff(decl_73,type,
esk15_0: $i ).
tff(decl_74,type,
esk16_0: $i ).
tff(decl_75,type,
esk17_0: $i ).
tff(decl_76,type,
esk18_0: $i ).
tff(decl_77,type,
esk19_0: $i ).
tff(decl_78,type,
esk20_0: $i ).
tff(decl_79,type,
esk21_0: $i ).
tff(decl_80,type,
esk22_0: $i ).
tff(decl_81,type,
esk23_0: $i ).
tff(decl_82,type,
esk24_0: $i ).
tff(decl_83,type,
esk25_0: $i ).
tff(decl_84,type,
esk26_0: $i ).
tff(decl_85,type,
esk27_0: $i ).
tff(decl_86,type,
esk28_0: $i ).
tff(decl_87,type,
esk29_0: $i ).
tff(decl_88,type,
esk30_0: $i ).
tff(decl_89,type,
esk31_0: $i ).
tff(decl_90,type,
esk32_0: $i ).
tff(decl_91,type,
esk33_0: $i ).
tff(decl_92,type,
esk34_0: $i ).
tff(decl_93,type,
esk35_0: $i ).
tff(decl_94,type,
esk36_0: $i ).
tff(decl_95,type,
esk37_0: $i ).
tff(decl_96,type,
esk38_0: $i ).
tff(decl_97,type,
esk39_0: $i ).
tff(decl_98,type,
esk40_0: $i ).
tff(decl_99,type,
esk41_0: $i ).
tff(decl_100,type,
esk42_0: $i ).
tff(decl_101,type,
esk43_0: $i ).
tff(decl_102,type,
esk44_0: $i ).
tff(decl_103,type,
esk45_0: $i ).
tff(decl_104,type,
esk46_0: $i ).
tff(decl_105,type,
esk47_0: $i ).
tff(decl_106,type,
esk48_0: $i ).
tff(decl_107,type,
esk49_0: $i ).
tff(decl_108,type,
esk50_0: $i ).
tff(decl_109,type,
esk51_0: $i ).
tff(decl_110,type,
esk52_0: $i ).
tff(decl_111,type,
esk53_0: $i ).
tff(decl_112,type,
esk54_0: $i ).
tff(decl_113,type,
esk55_0: $i ).
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(modus_ponens,axiom,
( modus_ponens
<=> ! [X1,X2] :
( ( is_a_theorem(X1)
& is_a_theorem(implies(X1,X2)) )
=> is_a_theorem(X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(r3,axiom,
( r3
<=> ! [X4,X5] : is_a_theorem(implies(or(X4,X5),or(X5,X4))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r3) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(principia_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_modus_ponens) ).
fof(principia_r3,axiom,
r3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r3) ).
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X1,X2] : implies(X1,X2) = or(not(X1),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
fof(r1,axiom,
( r1
<=> ! [X4] : is_a_theorem(implies(or(X4,X4),X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r1) ).
fof(hilbert_op_or,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_op_implies_or) ).
fof(principia_r1,axiom,
r1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r1) ).
fof(r2,axiom,
( r2
<=> ! [X4,X5] : is_a_theorem(implies(X5,or(X4,X5))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r2) ).
fof(principia_r2,axiom,
r2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r2) ).
fof(r4,axiom,
( r4
<=> ! [X4,X5,X6] : is_a_theorem(implies(or(X4,or(X5,X6)),or(X5,or(X4,X6)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r4) ).
fof(r5,axiom,
( r5
<=> ! [X4,X5,X6] : is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r5) ).
fof(op_and,axiom,
( op_and
=> ! [X1,X2] : and(X1,X2) = not(or(not(X1),not(X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_and) ).
fof(principia_r4,axiom,
r4,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r4) ).
fof(principia_r5,axiom,
r5,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r5) ).
fof(principia_op_and,axiom,
op_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_op_and) ).
fof(op_equiv,axiom,
( op_equiv
=> ! [X1,X2] : equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_equiv) ).
fof(principia_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_op_equiv) ).
fof(substitution_of_equivalents,axiom,
( substitution_of_equivalents
<=> ! [X1,X2] :
( is_a_theorem(equiv(X1,X2))
=> X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',substitution_of_equivalents) ).
fof(substitution_of_equivalents_001,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',substitution_of_equivalents) ).
fof(implies_2,axiom,
( implies_2
<=> ! [X1,X2] : is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_2) ).
fof(hilbert_implies_2,conjecture,
implies_2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_implies_2) ).
fof(c_0_26,plain,
! [X121,X122] :
( ~ op_implies_and
| implies(X121,X122) = not(and(X121,not(X122))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])]) ).
fof(c_0_27,plain,
! [X7,X8] :
( ( ~ modus_ponens
| ~ is_a_theorem(X7)
| ~ is_a_theorem(implies(X7,X8))
| is_a_theorem(X8) )
& ( is_a_theorem(esk1_0)
| modus_ponens )
& ( is_a_theorem(implies(esk1_0,esk2_0))
| modus_ponens )
& ( ~ is_a_theorem(esk2_0)
| modus_ponens ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens])])])])]) ).
fof(c_0_28,plain,
! [X101,X102] :
( ( ~ r3
| is_a_theorem(implies(or(X101,X102),or(X102,X101))) )
& ( ~ is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0)))
| r3 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r3])])])]) ).
fof(c_0_29,plain,
! [X117,X118] :
( ~ op_or
| or(X117,X118) = not(and(not(X117),not(X118))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])]) ).
cnf(c_0_30,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
cnf(c_0_32,plain,
( is_a_theorem(X2)
| ~ modus_ponens
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[principia_modus_ponens]) ).
cnf(c_0_34,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
r3,
inference(split_conjunct,[status(thm)],[principia_r3]) ).
fof(c_0_36,plain,
! [X123,X124] :
( ~ op_implies_or
| implies(X123,X124) = or(not(X123),X124) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_or])])]) ).
fof(c_0_37,plain,
! [X95] :
( ( ~ r1
| is_a_theorem(implies(or(X95,X95),X95)) )
& ( ~ is_a_theorem(implies(or(esk45_0,esk45_0),esk45_0))
| r1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r1])])])]) ).
cnf(c_0_38,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_39,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_40,plain,
op_or,
inference(split_conjunct,[status(thm)],[hilbert_op_or]) ).
cnf(c_0_41,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_43,plain,
( implies(X1,X2) = or(not(X1),X2)
| ~ op_implies_or ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_44,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
cnf(c_0_45,plain,
( is_a_theorem(implies(or(X1,X1),X1))
| ~ r1 ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_46,plain,
r1,
inference(split_conjunct,[status(thm)],[principia_r1]) ).
fof(c_0_47,plain,
! [X97,X98] :
( ( ~ r2
| is_a_theorem(implies(X98,or(X97,X98))) )
& ( ~ is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0)))
| r2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r2])])])]) ).
cnf(c_0_48,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_49,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_51,plain,
is_a_theorem(implies(or(X1,X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).
cnf(c_0_52,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_53,plain,
r2,
inference(split_conjunct,[status(thm)],[principia_r2]) ).
cnf(c_0_54,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X2,X1))
| ~ is_a_theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_41,c_0_48]) ).
cnf(c_0_55,plain,
( is_a_theorem(or(X1,not(X2)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_41,c_0_51]) ).
cnf(c_0_57,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]) ).
cnf(c_0_58,plain,
( is_a_theorem(not(X1))
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,plain,
( is_a_theorem(not(X1))
| ~ is_a_theorem(implies(X1,not(X1))) ),
inference(spm,[status(thm)],[c_0_56,c_0_50]) ).
cnf(c_0_60,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_57]) ).
cnf(c_0_61,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(or(X1,X2))
| ~ is_a_theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_58,c_0_48]) ).
cnf(c_0_62,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(or(X1,not(not(X1)))) ),
inference(spm,[status(thm)],[c_0_59,c_0_48]) ).
cnf(c_0_63,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_60]) ).
fof(c_0_64,plain,
! [X105,X106,X107] :
( ( ~ r4
| is_a_theorem(implies(or(X105,or(X106,X107)),or(X106,or(X105,X107)))) )
& ( ~ is_a_theorem(implies(or(esk50_0,or(esk51_0,esk52_0)),or(esk51_0,or(esk50_0,esk52_0))))
| r4 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r4])])])]) ).
cnf(c_0_65,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(not(not(X2)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_61,c_0_55]) ).
cnf(c_0_66,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
fof(c_0_67,plain,
! [X111,X112,X113] :
( ( ~ r5
| is_a_theorem(implies(implies(X112,X113),implies(or(X111,X112),or(X111,X113)))) )
& ( ~ is_a_theorem(implies(implies(esk54_0,esk55_0),implies(or(esk53_0,esk54_0),or(esk53_0,esk55_0))))
| r5 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r5])])])]) ).
fof(c_0_68,plain,
! [X119,X120] :
( ~ op_and
| and(X119,X120) = not(or(not(X119),not(X120))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_and])])]) ).
cnf(c_0_69,plain,
( is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))
| ~ r4 ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_70,plain,
r4,
inference(split_conjunct,[status(thm)],[principia_r4]) ).
cnf(c_0_71,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_72,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_73,plain,
r5,
inference(split_conjunct,[status(thm)],[principia_r5]) ).
cnf(c_0_74,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_57,c_0_50]) ).
cnf(c_0_75,plain,
( and(X1,X2) = not(or(not(X1),not(X2)))
| ~ op_and ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_76,plain,
op_and,
inference(split_conjunct,[status(thm)],[principia_op_and]) ).
cnf(c_0_77,plain,
is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70])]) ).
cnf(c_0_78,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(not(not(X2)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_54,c_0_50]) ).
cnf(c_0_79,plain,
( is_a_theorem(not(not(or(X1,X2))))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_71,c_0_57]) ).
cnf(c_0_80,plain,
is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]) ).
cnf(c_0_81,plain,
is_a_theorem(or(X1,implies(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_74,c_0_48]) ).
cnf(c_0_82,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_50]),c_0_76])]) ).
cnf(c_0_83,plain,
( is_a_theorem(not(or(X1,X1)))
| ~ is_a_theorem(not(X1)) ),
inference(spm,[status(thm)],[c_0_58,c_0_51]) ).
fof(c_0_84,plain,
! [X125,X126] :
( ~ op_equiv
| equiv(X125,X126) = and(implies(X125,X126),implies(X126,X125)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_equiv])])]) ).
cnf(c_0_85,plain,
( is_a_theorem(or(X1,or(X2,X3)))
| ~ is_a_theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_41,c_0_77]) ).
cnf(c_0_86,plain,
is_a_theorem(or(X1,or(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_57,c_0_48]) ).
cnf(c_0_87,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(or(X2,X3),X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_88,plain,
( is_a_theorem(implies(or(X1,X2),or(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_41,c_0_80]) ).
cnf(c_0_89,plain,
is_a_theorem(or(implies(X1,not(X2)),X2)),
inference(spm,[status(thm)],[c_0_49,c_0_81]) ).
cnf(c_0_90,plain,
or(implies(X1,not(X2)),X3) = implies(and(X1,X2),X3),
inference(spm,[status(thm)],[c_0_48,c_0_82]) ).
cnf(c_0_91,plain,
( is_a_theorem(and(X1,X1))
| ~ is_a_theorem(not(not(X1))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_50]),c_0_82]) ).
cnf(c_0_92,plain,
( equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1))
| ~ op_equiv ),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_93,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[principia_op_equiv]) ).
cnf(c_0_94,plain,
is_a_theorem(or(X1,or(X2,not(X2)))),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_95,plain,
is_a_theorem(or(or(X1,not(X2)),X2)),
inference(spm,[status(thm)],[c_0_49,c_0_86]) ).
cnf(c_0_96,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_97,plain,
is_a_theorem(implies(and(X1,X2),X2)),
inference(rw,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_98,plain,
( is_a_theorem(and(X1,X1))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_91,c_0_66]) ).
cnf(c_0_99,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_93])]) ).
cnf(c_0_100,plain,
is_a_theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_56,c_0_94]) ).
cnf(c_0_101,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(not(or(X2,not(X1)))) ),
inference(spm,[status(thm)],[c_0_54,c_0_95]) ).
cnf(c_0_102,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(and(X3,X2)) ),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_103,plain,
( is_a_theorem(equiv(X1,X1))
| ~ is_a_theorem(implies(X1,X1)) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_104,plain,
is_a_theorem(implies(X1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_100]),c_0_50]) ).
cnf(c_0_105,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(not(not(X1))) ),
inference(spm,[status(thm)],[c_0_101,c_0_83]) ).
cnf(c_0_106,plain,
not(and(X1,implies(X2,X3))) = implies(X1,and(X2,not(X3))),
inference(spm,[status(thm)],[c_0_39,c_0_39]) ).
cnf(c_0_107,plain,
and(X1,implies(X2,not(X3))) = not(implies(X1,and(X2,X3))),
inference(spm,[status(thm)],[c_0_82,c_0_82]) ).
cnf(c_0_108,plain,
( is_a_theorem(or(X1,implies(X2,X3)))
| ~ is_a_theorem(equiv(X3,X2)) ),
inference(spm,[status(thm)],[c_0_102,c_0_99]) ).
cnf(c_0_109,plain,
is_a_theorem(equiv(X1,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_104])]) ).
fof(c_0_110,plain,
! [X11,X12] :
( ( ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X11,X12))
| X11 = X12 )
& ( is_a_theorem(equiv(esk3_0,esk4_0))
| substitution_of_equivalents )
& ( esk3_0 != esk4_0
| substitution_of_equivalents ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[substitution_of_equivalents])])])])]) ).
cnf(c_0_111,plain,
( is_a_theorem(and(X1,implies(X2,X3)))
| ~ is_a_theorem(not(implies(X1,and(X2,not(X3))))) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_112,plain,
not(implies(or(X1,X2),and(X2,X1))) = equiv(not(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_48]),c_0_107]) ).
cnf(c_0_113,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(or(X1,X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_55]),c_0_48]) ).
cnf(c_0_114,plain,
is_a_theorem(or(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_115,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_110]) ).
cnf(c_0_116,plain,
substitution_of_equivalents,
inference(split_conjunct,[status(thm)],[substitution_of_equivalents]) ).
cnf(c_0_117,plain,
( is_a_theorem(equiv(X1,X2))
| ~ is_a_theorem(equiv(not(not(X1)),X2)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_50]),c_0_99]) ).
cnf(c_0_118,plain,
is_a_theorem(not(not(implies(X1,X1)))),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_119,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_41,c_0_88]) ).
cnf(c_0_120,plain,
( is_a_theorem(implies(X1,not(X2)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_55,c_0_50]) ).
cnf(c_0_121,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_115,c_0_116])]) ).
cnf(c_0_122,plain,
is_a_theorem(equiv(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_117,c_0_109]) ).
cnf(c_0_123,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_78,c_0_118]) ).
cnf(c_0_124,plain,
is_a_theorem(implies(implies(X1,or(X2,X3)),or(X2,implies(X1,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_50]),c_0_50]) ).
cnf(c_0_125,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X3,X2))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_55]),c_0_48]) ).
cnf(c_0_126,plain,
( is_a_theorem(implies(X1,not(not(X2))))
| ~ is_a_theorem(or(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_120,c_0_48]) ).
cnf(c_0_127,plain,
not(not(X1)) = X1,
inference(spm,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_128,plain,
is_a_theorem(or(X1,implies(or(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_129,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(or(X3,X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_50]),c_0_48]) ).
cnf(c_0_130,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X1,not(X2)))
| ~ is_a_theorem(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_126]),c_0_127]) ).
cnf(c_0_131,plain,
is_a_theorem(or(implies(or(X1,X2),X2),X1)),
inference(spm,[status(thm)],[c_0_49,c_0_128]) ).
cnf(c_0_132,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(or(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_129,c_0_51]) ).
cnf(c_0_133,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_50]),c_0_50]) ).
cnf(c_0_134,plain,
( is_a_theorem(not(X1))
| ~ is_a_theorem(implies(X1,not(X2)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_130,c_0_50]) ).
cnf(c_0_135,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_50]) ).
cnf(c_0_136,plain,
is_a_theorem(implies(implies(X1,X2),or(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_42,c_0_50]) ).
cnf(c_0_137,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,or(X2,X2))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_55]),c_0_50]) ).
cnf(c_0_138,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(or(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_133,c_0_57]) ).
cnf(c_0_139,plain,
is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_42,c_0_50]) ).
cnf(c_0_140,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_82]) ).
cnf(c_0_141,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(or(X2,not(X1)),X3)) ),
inference(spm,[status(thm)],[c_0_133,c_0_136]) ).
cnf(c_0_142,plain,
( is_a_theorem(implies(or(X1,X2),X1))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_137,c_0_88]) ).
cnf(c_0_143,plain,
is_a_theorem(or(X1,implies(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_48]) ).
cnf(c_0_144,plain,
( is_a_theorem(equiv(X1,X2))
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_140,c_0_99]) ).
cnf(c_0_145,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(or(X1,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_48]) ).
cnf(c_0_146,plain,
is_a_theorem(or(implies(X1,X2),X1)),
inference(spm,[status(thm)],[c_0_49,c_0_143]) ).
fof(c_0_147,plain,
! [X23,X24] :
( ( ~ implies_2
| is_a_theorem(implies(implies(X23,implies(X23,X24)),implies(X23,X24))) )
& ( ~ is_a_theorem(implies(implies(esk9_0,implies(esk9_0,esk10_0)),implies(esk9_0,esk10_0)))
| implies_2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[implies_2])])])]) ).
fof(c_0_148,negated_conjecture,
~ implies_2,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[hilbert_implies_2])]) ).
cnf(c_0_149,plain,
( X1 = X2
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_121,c_0_144]) ).
cnf(c_0_150,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
inference(spm,[status(thm)],[c_0_145,c_0_146]) ).
cnf(c_0_151,plain,
( implies_2
| ~ is_a_theorem(implies(implies(esk9_0,implies(esk9_0,esk10_0)),implies(esk9_0,esk10_0))) ),
inference(split_conjunct,[status(thm)],[c_0_147]) ).
cnf(c_0_152,negated_conjecture,
~ implies_2,
inference(split_conjunct,[status(thm)],[c_0_148]) ).
cnf(c_0_153,plain,
implies(implies(X1,X2),X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_150]),c_0_74])]) ).
cnf(c_0_154,plain,
~ is_a_theorem(implies(implies(esk9_0,implies(esk9_0,esk10_0)),implies(esk9_0,esk10_0))),
inference(sr,[status(thm)],[c_0_151,c_0_152]) ).
cnf(c_0_155,plain,
implies(X1,implies(X1,X2)) = implies(X1,X2),
inference(spm,[status(thm)],[c_0_153,c_0_153]) ).
cnf(c_0_156,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_155]),c_0_104])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL485+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 24 17:40:51 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 9.74/9.85 % Version : CSE_E---1.5
% 9.74/9.85 % Problem : theBenchmark.p
% 9.74/9.85 % Proof found
% 9.74/9.85 % SZS status Theorem for theBenchmark.p
% 9.74/9.85 % SZS output start Proof
% See solution above
% 9.74/9.86 % Total time : 9.277000 s
% 9.74/9.86 % SZS output end Proof
% 9.74/9.86 % Total time : 9.281000 s
%------------------------------------------------------------------------------