TSTP Solution File: LCL339-3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL339-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n027.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:53:37 EDT 2023
% Result : Unsatisfiable 79.81s 79.90s
% Output : CNFRefutation 79.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 21
% Syntax : Number of formulae : 120 ( 46 unt; 10 typ; 0 def)
% Number of atoms : 196 ( 7 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 178 ( 92 ~; 86 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 7 >; 4 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 229 ( 32 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
or: ( $i * $i ) > $i ).
tff(decl_23,type,
implies: ( $i * $i ) > $i ).
tff(decl_24,type,
axiom: $i > $o ).
tff(decl_25,type,
not: $i > $i ).
tff(decl_26,type,
theorem: $i > $o ).
tff(decl_27,type,
and: ( $i * $i ) > $i ).
tff(decl_28,type,
equivalent: ( $i * $i ) > $i ).
tff(decl_29,type,
p: $i ).
tff(decl_30,type,
q: $i ).
tff(decl_31,type,
r: $i ).
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(implies(p,implies(q,r)),implies(p,implies(q,and(p,r))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_11,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
rule_2 ).
cnf(c_0_12,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_13,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ theorem(or(not(X2),X1)) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1 ).
cnf(c_0_15,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_16,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_17,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_18,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_12]),c_0_12]),c_0_12]) ).
cnf(c_0_20,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_21,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_22,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_24,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_25,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_22]) ).
cnf(c_0_26,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_27,plain,
( theorem(or(X1,X2))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_14]) ).
cnf(c_0_29,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_26,c_0_12]) ).
cnf(c_0_30,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ theorem(not(X3)) ),
inference(spm,[status(thm)],[c_0_25,c_0_27]) ).
cnf(c_0_31,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_32,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( theorem(or(X1,X2))
| ~ theorem(not(X3))
| ~ axiom(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_30,c_0_14]) ).
cnf(c_0_34,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_13,c_0_31]) ).
cnf(c_0_35,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_32,c_0_14]) ).
cnf(c_0_36,plain,
( theorem(or(not(X1),X2))
| ~ theorem(not(or(X3,X1))) ),
inference(spm,[status(thm)],[c_0_33,c_0_21]) ).
cnf(c_0_37,plain,
( theorem(not(or(not(X1),not(X1))))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_29]) ).
cnf(c_0_38,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_39,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_35,c_0_21]) ).
cnf(c_0_40,plain,
( theorem(or(X1,X2))
| ~ theorem(not(X3))
| ~ axiom(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_41,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_42,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_38,c_0_12]) ).
cnf(c_0_44,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_23,c_0_39]) ).
cnf(c_0_45,plain,
( theorem(or(X1,X2))
| ~ theorem(not(not(or(X1,X1)))) ),
inference(spm,[status(thm)],[c_0_40,c_0_29]) ).
cnf(c_0_46,plain,
( theorem(not(not(X1)))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_43]) ).
cnf(c_0_48,plain,
( theorem(or(X1,not(not(X2))))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_44]) ).
cnf(c_0_49,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_47,c_0_14]) ).
cnf(c_0_51,plain,
( theorem(not(not(X1)))
| ~ theorem(or(not(X2),X1))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_48]) ).
cnf(c_0_52,plain,
theorem(or(not(or(X1,X1)),X1)),
inference(spm,[status(thm)],[c_0_35,c_0_20]) ).
cnf(c_0_53,plain,
( theorem(or(or(X1,X2),X3))
| ~ axiom(or(X1,or(or(X1,X2),X2))) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
( theorem(not(not(X1)))
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,plain,
theorem(or(or(not(X1),X1),X2)),
inference(spm,[status(thm)],[c_0_53,c_0_21]) ).
cnf(c_0_56,plain,
( theorem(or(or(X1,X2),X3))
| ~ theorem(not(not(or(X2,X1)))) ),
inference(spm,[status(thm)],[c_0_40,c_0_20]) ).
cnf(c_0_57,plain,
theorem(not(not(or(not(X1),X1)))),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,plain,
theorem(or(or(X1,not(X1)),X2)),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,plain,
( theorem(not(not(not(not(X1)))))
| ~ theorem(or(not(not(X1)),X1)) ),
inference(spm,[status(thm)],[c_0_54,c_0_48]) ).
cnf(c_0_60,plain,
theorem(or(X1,or(X2,not(X2)))),
inference(spm,[status(thm)],[c_0_23,c_0_58]) ).
cnf(c_0_61,plain,
( theorem(or(not(or(X1,X2)),X1))
| ~ theorem(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_32,c_0_22]) ).
cnf(c_0_62,plain,
( theorem(or(X1,X2))
| ~ theorem(not(not(X1))) ),
inference(spm,[status(thm)],[c_0_30,c_0_44]) ).
cnf(c_0_63,plain,
theorem(not(not(not(not(or(X1,not(X1))))))),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_64,plain,
( theorem(X1)
| ~ theorem(or(not(X2),X1))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_61]) ).
cnf(c_0_65,plain,
theorem(or(not(not(or(X1,not(X1)))),X2)),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_47,c_0_24]) ).
cnf(c_0_67,plain,
( theorem(X1)
| ~ theorem(or(X1,not(or(X2,not(X2))))) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_68,plain,
( theorem(or(or(X1,X2),not(or(X1,X3))))
| ~ theorem(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_69,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_66]) ).
cnf(c_0_70,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_71,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_72,plain,
( theorem(or(X1,X2))
| ~ theorem(X3)
| ~ axiom(or(X1,or(not(X3),X2))) ),
inference(spm,[status(thm)],[c_0_13,c_0_50]) ).
cnf(c_0_73,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(not(X1)),X2)) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_74,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_23,c_0_55]) ).
cnf(c_0_75,plain,
( theorem(or(X1,X2))
| ~ theorem(X3)
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_69,c_0_14]) ).
cnf(c_0_76,negated_conjecture,
~ theorem(equivalent(implies(p,implies(q,r)),implies(p,implies(q,and(p,r))))),
prove_this ).
cnf(c_0_77,plain,
equivalent(X1,X2) = not(or(not(or(not(X1),X2)),not(or(not(X2),X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_12]),c_0_12]),c_0_71]) ).
cnf(c_0_78,plain,
( theorem(X1)
| ~ theorem(or(X1,not(X2)))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_64,c_0_42]) ).
cnf(c_0_79,plain,
( theorem(or(not(or(X1,not(X2))),X1))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_72,c_0_20]) ).
cnf(c_0_80,plain,
( theorem(or(or(not(or(X1,X2)),or(X1,X3)),X4))
| ~ theorem(not(not(or(not(X2),X3)))) ),
inference(spm,[status(thm)],[c_0_40,c_0_19]) ).
cnf(c_0_81,plain,
( theorem(not(not(X1)))
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_51,c_0_14]) ).
cnf(c_0_82,plain,
( theorem(or(X1,not(not(X2))))
| ~ theorem(or(not(not(X1)),X2)) ),
inference(spm,[status(thm)],[c_0_73,c_0_48]) ).
cnf(c_0_83,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_47,c_0_74]) ).
cnf(c_0_84,plain,
( theorem(X1)
| ~ theorem(or(X1,or(X1,X2)))
| ~ theorem(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_64,c_0_61]) ).
cnf(c_0_85,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X3,X2)) ),
inference(spm,[status(thm)],[c_0_75,c_0_20]) ).
cnf(c_0_86,negated_conjecture,
~ theorem(not(or(not(or(not(or(not(p),or(not(q),r))),or(not(p),or(not(q),not(or(not(p),not(r))))))),not(or(not(or(not(p),or(not(q),not(or(not(p),not(r)))))),or(not(p),or(not(q),r))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_12]),c_0_12]),c_0_12]),c_0_12]),c_0_71]),c_0_77]) ).
cnf(c_0_87,plain,
( theorem(not(or(not(X1),not(X2))))
| ~ theorem(X1)
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_88,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(not(not(or(not(X2),X3)))) ),
inference(spm,[status(thm)],[c_0_41,c_0_80]) ).
cnf(c_0_89,plain,
( theorem(not(not(or(not(or(X1,X2)),or(X1,X3)))))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_81,c_0_19]) ).
cnf(c_0_90,plain,
theorem(or(X1,not(not(or(X2,not(X1)))))),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_91,plain,
( theorem(X1)
| ~ theorem(or(not(X2),X1))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_92,plain,
( theorem(or(X1,or(not(or(X1,X2)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_47,c_0_22]) ).
cnf(c_0_93,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_28,c_0_20]) ).
cnf(c_0_94,plain,
theorem(or(X1,or(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_47,c_0_60]) ).
cnf(c_0_95,negated_conjecture,
( ~ theorem(or(not(or(not(p),or(not(q),r))),or(not(p),or(not(q),not(or(not(p),not(r)))))))
| ~ theorem(or(not(or(not(p),or(not(q),not(or(not(p),not(r)))))),or(not(p),or(not(q),r)))) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_96,plain,
( theorem(or(not(or(X1,or(X2,X3))),or(X1,or(X2,X4))))
| ~ theorem(or(not(X3),X4)) ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_97,plain,
theorem(or(not(not(or(X1,not(X2)))),X2)),
inference(spm,[status(thm)],[c_0_23,c_0_90]) ).
cnf(c_0_98,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,or(X1,X2))) ),
inference(spm,[status(thm)],[c_0_91,c_0_83]) ).
cnf(c_0_99,plain,
( theorem(or(X1,or(not(or(not(X2),X3)),X4)))
| ~ theorem(or(not(X3),X4))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_92]) ).
cnf(c_0_100,plain,
theorem(or(X1,or(not(X1),X2))),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_101,negated_conjecture,
~ theorem(or(not(or(not(p),or(not(q),r))),or(not(p),or(not(q),not(or(not(p),not(r))))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97])]) ).
cnf(c_0_102,plain,
( theorem(or(not(or(not(X1),X2)),X3))
| ~ theorem(or(not(X2),X3))
| ~ theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_103,plain,
theorem(or(or(not(X1),X2),X1)),
inference(spm,[status(thm)],[c_0_23,c_0_100]) ).
cnf(c_0_104,plain,
( theorem(or(X1,or(not(or(X2,X3)),or(X2,X4))))
| ~ theorem(or(X1,or(not(X3),X4))) ),
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_105,plain,
theorem(or(X1,or(not(or(X1,X2)),X2))),
inference(spm,[status(thm)],[c_0_47,c_0_39]) ).
cnf(c_0_106,negated_conjecture,
~ theorem(or(not(or(not(q),r)),or(not(p),or(not(q),not(or(not(p),not(r))))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_103])]) ).
cnf(c_0_107,plain,
( theorem(or(not(or(X1,X2)),or(X3,or(X1,X4))))
| ~ theorem(or(X3,or(not(X2),X4))) ),
inference(spm,[status(thm)],[c_0_47,c_0_104]) ).
cnf(c_0_108,plain,
theorem(or(X1,or(X2,not(or(X1,X2))))),
inference(spm,[status(thm)],[c_0_93,c_0_105]) ).
cnf(c_0_109,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_108])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL339-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 24 18:19:47 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.52 start to proof: theBenchmark
% 79.81/79.90 % Version : CSE_E---1.5
% 79.81/79.90 % Problem : theBenchmark.p
% 79.81/79.90 % Proof found
% 79.81/79.90 % SZS status Theorem for theBenchmark.p
% 79.81/79.90 % SZS output start Proof
% See solution above
% 79.81/79.91 % Total time : 79.356000 s
% 79.81/79.91 % SZS output end Proof
% 79.81/79.91 % Total time : 79.362000 s
%------------------------------------------------------------------------------