TSTP Solution File: LCL491+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL491+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 : n015.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:22 EDT 2023
% Result : Theorem 0.20s 0.58s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 96
% Syntax : Number of formulae : 106 ( 8 unt; 92 typ; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 19 ( 9 ~; 6 |; 2 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 6 >; 4 *; 0 +; 0 <<)
% Number of predicates : 33 ( 32 usr; 32 prp; 0-1 aty)
% Number of functors : 60 ( 60 usr; 55 con; 0-2 aty)
% Number of variables : 12 ( 2 sgn; 8 !; 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(or_2,axiom,
( or_2
<=> ! [X1,X2] : is_a_theorem(implies(X2,or(X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',or_2) ).
fof(hilbert_or_2,conjecture,
or_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_or_2) ).
fof(r2,axiom,
( r2
<=> ! [X4,X5] : is_a_theorem(implies(X5,or(X4,X5))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r2) ).
fof(principia_r2,axiom,
r2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r2) ).
fof(c_0_4,plain,
! [X49,X50] :
( ( ~ or_2
| is_a_theorem(implies(X50,or(X49,X50))) )
& ( ~ is_a_theorem(implies(esk23_0,or(esk22_0,esk23_0)))
| or_2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[or_2])])])]) ).
fof(c_0_5,negated_conjecture,
~ or_2,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[hilbert_or_2])]) ).
fof(c_0_6,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_7,plain,
( or_2
| ~ is_a_theorem(implies(esk23_0,or(esk22_0,esk23_0))) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
~ or_2,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
r2,
inference(split_conjunct,[status(thm)],[principia_r2]) ).
cnf(c_0_11,plain,
~ is_a_theorem(implies(esk23_0,or(esk22_0,esk23_0))),
inference(sr,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_13,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL491+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 24 19:03:06 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 0.20/0.58 % Version : CSE_E---1.5
% 0.20/0.58 % Problem : theBenchmark.p
% 0.20/0.58 % Proof found
% 0.20/0.58 % SZS status Theorem for theBenchmark.p
% 0.20/0.58 % SZS output start Proof
% See solution above
% 0.20/0.58 % Total time : 0.011000 s
% 0.20/0.58 % SZS output end Proof
% 0.20/0.58 % Total time : 0.015000 s
%------------------------------------------------------------------------------