TSTP Solution File: LCL452+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL452+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n024.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:10 EDT 2023
% Result : Theorem 0.20s 0.60s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 101
% Syntax : Number of formulae : 120 ( 15 unt; 93 typ; 0 def)
% Number of atoms : 43 ( 8 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 30 ( 14 ~; 10 |; 2 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 6 >; 4 *; 0 +; 0 <<)
% Number of predicates : 35 ( 33 usr; 33 prp; 0-2 aty)
% Number of functors : 60 ( 60 usr; 55 con; 0-2 aty)
% Number of variables : 28 ( 2 sgn; 16 !; 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,
op_implies: $o ).
tff(decl_60,type,
esk1_0: $i ).
tff(decl_61,type,
esk2_0: $i ).
tff(decl_62,type,
esk3_0: $i ).
tff(decl_63,type,
esk4_0: $i ).
tff(decl_64,type,
esk5_0: $i ).
tff(decl_65,type,
esk6_0: $i ).
tff(decl_66,type,
esk7_0: $i ).
tff(decl_67,type,
esk8_0: $i ).
tff(decl_68,type,
esk9_0: $i ).
tff(decl_69,type,
esk10_0: $i ).
tff(decl_70,type,
esk11_0: $i ).
tff(decl_71,type,
esk12_0: $i ).
tff(decl_72,type,
esk13_0: $i ).
tff(decl_73,type,
esk14_0: $i ).
tff(decl_74,type,
esk15_0: $i ).
tff(decl_75,type,
esk16_0: $i ).
tff(decl_76,type,
esk17_0: $i ).
tff(decl_77,type,
esk18_0: $i ).
tff(decl_78,type,
esk19_0: $i ).
tff(decl_79,type,
esk20_0: $i ).
tff(decl_80,type,
esk21_0: $i ).
tff(decl_81,type,
esk22_0: $i ).
tff(decl_82,type,
esk23_0: $i ).
tff(decl_83,type,
esk24_0: $i ).
tff(decl_84,type,
esk25_0: $i ).
tff(decl_85,type,
esk26_0: $i ).
tff(decl_86,type,
esk27_0: $i ).
tff(decl_87,type,
esk28_0: $i ).
tff(decl_88,type,
esk29_0: $i ).
tff(decl_89,type,
esk30_0: $i ).
tff(decl_90,type,
esk31_0: $i ).
tff(decl_91,type,
esk32_0: $i ).
tff(decl_92,type,
esk33_0: $i ).
tff(decl_93,type,
esk34_0: $i ).
tff(decl_94,type,
esk35_0: $i ).
tff(decl_95,type,
esk36_0: $i ).
tff(decl_96,type,
esk37_0: $i ).
tff(decl_97,type,
esk38_0: $i ).
tff(decl_98,type,
esk39_0: $i ).
tff(decl_99,type,
esk40_0: $i ).
tff(decl_100,type,
esk41_0: $i ).
tff(decl_101,type,
esk42_0: $i ).
tff(decl_102,type,
esk43_0: $i ).
tff(decl_103,type,
esk44_0: $i ).
tff(decl_104,type,
esk45_0: $i ).
tff(decl_105,type,
esk46_0: $i ).
tff(decl_106,type,
esk47_0: $i ).
tff(decl_107,type,
esk48_0: $i ).
tff(decl_108,type,
esk49_0: $i ).
tff(decl_109,type,
esk50_0: $i ).
tff(decl_110,type,
esk51_0: $i ).
tff(decl_111,type,
esk52_0: $i ).
tff(decl_112,type,
esk53_0: $i ).
tff(decl_113,type,
esk54_0: $i ).
tff(decl_114,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/sandbox2/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(cn2,axiom,
( cn2
<=> ! [X4,X5] : is_a_theorem(implies(X4,implies(not(X4),X5))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',cn2) ).
fof(luka_cn2,conjecture,
cn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_cn2) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_op_implies_and) ).
fof(hilbert_op_or,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_op_or) ).
fof(or_1,axiom,
( or_1
<=> ! [X1,X2] : is_a_theorem(implies(X1,or(X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',or_1) ).
fof(hilbert_or_1,axiom,
or_1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_or_1) ).
fof(c_0_8,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_9,plain,
! [X89,X90] :
( ( ~ cn2
| is_a_theorem(implies(X89,implies(not(X89),X90))) )
& ( ~ is_a_theorem(implies(esk42_0,implies(not(esk42_0),esk43_0)))
| cn2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cn2])])])]) ).
fof(c_0_10,negated_conjecture,
~ cn2,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[luka_cn2])]) ).
fof(c_0_11,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_12,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
cnf(c_0_14,plain,
( cn2
| ~ is_a_theorem(implies(esk42_0,implies(not(esk42_0),esk43_0))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
~ cn2,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_18,plain,
op_or,
inference(split_conjunct,[status(thm)],[hilbert_op_or]) ).
fof(c_0_19,plain,
! [X45,X46] :
( ( ~ or_1
| is_a_theorem(implies(X45,or(X45,X46))) )
& ( ~ is_a_theorem(implies(esk20_0,or(esk20_0,esk21_0)))
| or_1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[or_1])])])]) ).
cnf(c_0_20,plain,
~ is_a_theorem(implies(esk42_0,implies(not(esk42_0),esk43_0))),
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(X1,or(X1,X2)))
| ~ or_1 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
or_1,
inference(split_conjunct,[status(thm)],[hilbert_or_1]) ).
cnf(c_0_24,plain,
~ is_a_theorem(implies(esk42_0,or(esk42_0,esk43_0))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(X1,or(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_26,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL452+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 25 07:17:09 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 0.20/0.60 % Version : CSE_E---1.5
% 0.20/0.60 % Problem : theBenchmark.p
% 0.20/0.60 % Proof found
% 0.20/0.60 % SZS status Theorem for theBenchmark.p
% 0.20/0.60 % SZS output start Proof
% See solution above
% 0.20/0.60 % Total time : 0.014000 s
% 0.20/0.60 % SZS output end Proof
% 0.20/0.60 % Total time : 0.018000 s
%------------------------------------------------------------------------------