TSTP Solution File: NUM420-1.001 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM420-1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n004.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 10:37:15 EDT 2023
% Result : Unsatisfiable 60.42s 60.40s
% Output : CNFRefutation 60.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 42
% Syntax : Number of formulae : 128 ( 68 unt; 13 typ; 0 def)
% Number of atoms : 186 ( 108 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 171 ( 100 ~; 71 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 9 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 161 ( 61 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
less: ( $i * $i ) > $o ).
tff(decl_23,type,
times: ( $i * $i ) > $i ).
tff(decl_24,type,
plus: ( $i * $i ) > $i ).
tff(decl_25,type,
n0: $i ).
tff(decl_26,type,
n1: $i ).
tff(decl_27,type,
p__0: $i ).
tff(decl_28,type,
s_5: ( $i * $i ) > $i ).
tff(decl_29,type,
element: ( $i * $i ) > $o ).
tff(decl_30,type,
p__1: $i ).
tff(decl_31,type,
s_7: $i > $i ).
tff(decl_32,type,
s_6: ( $i * $i ) > $i ).
tff(decl_33,type,
s_1: $i > $i ).
tff(decl_34,type,
s_4: $i > $i ).
cnf(clause_61,negated_conjecture,
( less(n0,p__1)
| ~ less(plus(n0,n1),p__1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_61) ).
cnf(clause_46,negated_conjecture,
plus(n0,n1) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_46) ).
cnf(clause_81,negated_conjecture,
( less(n1,X1)
| X1 != p__1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_81) ).
cnf(clause_53,negated_conjecture,
( p__1 = plus(s_7(p__1),n1)
| ~ less(n0,p__1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_53) ).
cnf(clause_44,negated_conjecture,
( less(n0,p__0)
| ~ less(plus(n0,n1),p__0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_44) ).
cnf(clause_83,negated_conjecture,
( less(n1,X1)
| X1 != p__0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_83) ).
cnf(axiom_7,axiom,
( X2 = n0
| X1 != plus(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
cnf(axiom_3,axiom,
plus(X1,plus(X2,X3)) = plus(plus(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
cnf(axiom_16,axiom,
plus(X1,n1) != n0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_16) ).
cnf(axiom_5,axiom,
plus(X1,X2) = plus(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
cnf(clause_1,negated_conjecture,
( ~ less(n0,X1)
| ~ less(n0,p__0)
| ~ less(X1,p__0)
| plus(X1,times(X2,p__0)) != plus(n0,times(X3,p__0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(axiom_12,axiom,
plus(n0,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_12) ).
cnf(clause_43,negated_conjecture,
( ~ less(X1,n0)
| ~ less(n0,p__0)
| ~ less(X1,p__0)
| plus(X1,times(X2,p__0)) != plus(n0,times(X3,p__0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_43) ).
cnf(axiom_17,axiom,
times(X1,X2) = times(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_17) ).
cnf(clause_39,negated_conjecture,
( X1 = plus(s_5(p__0,X1),times(s_6(p__0,X1),p__0))
| ~ less(n0,p__0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_39) ).
cnf(clause_2,negated_conjecture,
( less(s_5(p__0,X1),p__0)
| ~ less(n0,p__0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(axiom_21,axiom,
times(n1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_21) ).
cnf(clause_55,negated_conjecture,
( ~ less(n0,X1)
| ~ less(n0,p__1)
| ~ less(X1,p__1)
| plus(X1,times(X2,p__1)) != plus(n0,times(X3,p__1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_55) ).
cnf(axiom_2,axiom,
( X1 = X2
| less(X1,X2)
| less(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
cnf(axiom_31,axiom,
less(n0,plus(X1,n1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_31) ).
cnf(axiom_22,axiom,
times(X1,plus(X2,X3)) = plus(times(X1,X2),times(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_22) ).
cnf(axiom_20,axiom,
times(X1,n1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_20) ).
cnf(clause_10,negated_conjecture,
( p__0 = plus(s_7(p__0),n1)
| ~ less(n0,p__0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_54,negated_conjecture,
( X1 = plus(s_5(p__1,X1),times(s_6(p__1,X1),p__1))
| ~ less(n0,p__1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_54) ).
cnf(axiom_25,axiom,
times(plus(X1,X2),X3) = plus(times(X2,X3),times(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_25) ).
cnf(axiom_4,axiom,
( X2 = X3
| plus(X1,X2) != plus(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
cnf(axiom_14,axiom,
plus(n1,plus(X1,n1)) != n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_14) ).
cnf(clause_88,negated_conjecture,
( X1 = n1
| times(s_1(X1),s_4(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_88) ).
cnf(clause_93,negated_conjecture,
( X1 = n1
| s_1(X1) = p__0
| s_1(X1) = p__1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_93) ).
cnf(c_0_29,negated_conjecture,
( less(n0,p__1)
| ~ less(plus(n0,n1),p__1) ),
clause_61 ).
cnf(c_0_30,negated_conjecture,
plus(n0,n1) = n1,
clause_46 ).
cnf(c_0_31,negated_conjecture,
( less(n1,X1)
| X1 != p__1 ),
clause_81 ).
cnf(c_0_32,negated_conjecture,
( less(n0,p__1)
| ~ less(n1,p__1) ),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
less(n1,p__1),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( p__1 = plus(s_7(p__1),n1)
| ~ less(n0,p__1) ),
clause_53 ).
cnf(c_0_35,negated_conjecture,
less(n0,p__1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_36,negated_conjecture,
( less(n0,p__0)
| ~ less(plus(n0,n1),p__0) ),
clause_44 ).
cnf(c_0_37,negated_conjecture,
( less(n1,X1)
| X1 != p__0 ),
clause_83 ).
cnf(c_0_38,axiom,
( X2 = n0
| X1 != plus(X1,X2) ),
axiom_7 ).
cnf(c_0_39,axiom,
plus(X1,plus(X2,X3)) = plus(plus(X1,X2),X3),
axiom_3 ).
cnf(c_0_40,negated_conjecture,
plus(s_7(p__1),n1) = p__1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_41,axiom,
plus(X1,n1) != n0,
axiom_16 ).
cnf(c_0_42,axiom,
plus(X1,X2) = plus(X2,X1),
axiom_5 ).
cnf(c_0_43,negated_conjecture,
( less(n0,p__0)
| ~ less(n1,p__0) ),
inference(rw,[status(thm)],[c_0_36,c_0_30]) ).
cnf(c_0_44,negated_conjecture,
less(n1,p__0),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_45,plain,
( X1 = n0
| plus(X2,plus(X3,X1)) != plus(X2,X3) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
plus(s_7(p__1),plus(n1,X1)) = plus(p__1,X1),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,plain,
plus(n1,X1) != n0,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( ~ less(n0,X1)
| ~ less(n0,p__0)
| ~ less(X1,p__0)
| plus(X1,times(X2,p__0)) != plus(n0,times(X3,p__0)) ),
clause_1 ).
cnf(c_0_49,axiom,
plus(n0,X1) = X1,
axiom_12 ).
cnf(c_0_50,negated_conjecture,
less(n0,p__0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_51,negated_conjecture,
( ~ less(X1,n0)
| ~ less(n0,p__0)
| ~ less(X1,p__0)
| plus(X1,times(X2,p__0)) != plus(n0,times(X3,p__0)) ),
clause_43 ).
cnf(c_0_52,negated_conjecture,
plus(X1,plus(p__1,X2)) != plus(X1,s_7(p__1)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( plus(X1,times(X2,p__0)) != times(X3,p__0)
| ~ less(X1,p__0)
| ~ less(n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_54,axiom,
times(X1,X2) = times(X2,X1),
axiom_17 ).
cnf(c_0_55,negated_conjecture,
( X1 = plus(s_5(p__0,X1),times(s_6(p__0,X1),p__0))
| ~ less(n0,p__0) ),
clause_39 ).
cnf(c_0_56,negated_conjecture,
( less(s_5(p__0,X1),p__0)
| ~ less(n0,p__0) ),
clause_2 ).
cnf(c_0_57,negated_conjecture,
( plus(X1,times(X2,p__0)) != times(X3,p__0)
| ~ less(X1,n0)
| ~ less(X1,p__0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_49]),c_0_50])]) ).
cnf(c_0_58,negated_conjecture,
plus(p__1,plus(X1,X2)) != plus(X2,s_7(p__1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_42]),c_0_39]) ).
cnf(c_0_59,negated_conjecture,
( plus(X1,times(p__0,X2)) != times(X3,p__0)
| ~ less(X1,p__0)
| ~ less(n0,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,negated_conjecture,
plus(s_5(p__0,X1),times(p__0,s_6(p__0,X1))) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_54]),c_0_50])]) ).
cnf(c_0_61,negated_conjecture,
less(s_5(p__0,X1),p__0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_50])]) ).
cnf(c_0_62,negated_conjecture,
( plus(X1,times(p__0,X2)) != times(X3,p__0)
| ~ less(X1,n0)
| ~ less(X1,p__0) ),
inference(spm,[status(thm)],[c_0_57,c_0_54]) ).
cnf(c_0_63,negated_conjecture,
plus(p__1,plus(X1,X2)) != plus(s_7(p__1),X2),
inference(spm,[status(thm)],[c_0_58,c_0_42]) ).
cnf(c_0_64,negated_conjecture,
~ less(n0,s_5(p__0,times(X1,p__0))),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])])]) ).
cnf(c_0_65,axiom,
times(n1,X1) = X1,
axiom_21 ).
cnf(c_0_66,negated_conjecture,
~ less(s_5(p__0,times(X1,p__0)),n0),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_60]),c_0_61])])]) ).
cnf(c_0_67,negated_conjecture,
plus(p__1,plus(X1,plus(n1,X2))) != plus(p__1,X2),
inference(spm,[status(thm)],[c_0_63,c_0_46]) ).
cnf(c_0_68,negated_conjecture,
( ~ less(n0,X1)
| ~ less(n0,p__1)
| ~ less(X1,p__1)
| plus(X1,times(X2,p__1)) != plus(n0,times(X3,p__1)) ),
clause_55 ).
cnf(c_0_69,negated_conjecture,
~ less(n0,s_5(p__0,p__0)),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_70,axiom,
( X1 = X2
| less(X1,X2)
| less(X2,X1) ),
axiom_2 ).
cnf(c_0_71,negated_conjecture,
~ less(s_5(p__0,p__0),n0),
inference(spm,[status(thm)],[c_0_66,c_0_65]) ).
cnf(c_0_72,axiom,
less(n0,plus(X1,n1)),
axiom_31 ).
cnf(c_0_73,negated_conjecture,
plus(p__1,plus(X1,plus(X2,n1))) != plus(p__1,X2),
inference(spm,[status(thm)],[c_0_67,c_0_42]) ).
cnf(c_0_74,axiom,
times(X1,plus(X2,X3)) = plus(times(X1,X2),times(X1,X3)),
axiom_22 ).
cnf(c_0_75,axiom,
times(X1,n1) = X1,
axiom_20 ).
cnf(c_0_76,plain,
plus(X1,plus(X2,X3)) = plus(X2,plus(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_42]),c_0_39]) ).
cnf(c_0_77,negated_conjecture,
( p__0 = plus(s_7(p__0),n1)
| ~ less(n0,p__0) ),
clause_10 ).
cnf(c_0_78,negated_conjecture,
( X1 = plus(s_5(p__1,X1),times(s_6(p__1,X1),p__1))
| ~ less(n0,p__1) ),
clause_54 ).
cnf(c_0_79,negated_conjecture,
( plus(X1,times(X2,p__1)) != times(X3,p__1)
| ~ less(X1,p__1)
| ~ less(n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_49]),c_0_35])]) ).
cnf(c_0_80,negated_conjecture,
n0 = s_5(p__0,p__0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]) ).
cnf(c_0_81,plain,
less(n0,n1),
inference(spm,[status(thm)],[c_0_72,c_0_49]) ).
cnf(c_0_82,negated_conjecture,
plus(p__1,plus(X1,plus(n1,X2))) != plus(p__1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_42]),c_0_39]) ).
cnf(c_0_83,negated_conjecture,
plus(X1,plus(times(X1,s_7(p__1)),times(X1,X2))) = plus(times(X1,p__1),times(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_46]),c_0_74]),c_0_74]),c_0_75]),c_0_76]) ).
cnf(c_0_84,axiom,
times(plus(X1,X2),X3) = plus(times(X2,X3),times(X1,X3)),
axiom_25 ).
cnf(c_0_85,negated_conjecture,
plus(s_7(p__0),n1) = p__0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_50])]) ).
cnf(c_0_86,axiom,
( X2 = X3
| plus(X1,X2) != plus(X1,X3) ),
axiom_4 ).
cnf(c_0_87,negated_conjecture,
plus(s_5(p__1,X1),times(p__1,s_6(p__1,X1))) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_54]),c_0_35])]) ).
cnf(c_0_88,negated_conjecture,
( plus(X1,times(X2,p__1)) != times(X3,p__1)
| ~ less(s_5(p__0,p__0),X1)
| ~ less(X1,p__1) ),
inference(rw,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_89,plain,
less(s_5(p__0,p__0),n1),
inference(rw,[status(thm)],[c_0_81,c_0_80]) ).
cnf(c_0_90,axiom,
plus(n1,plus(X1,n1)) != n1,
axiom_14 ).
cnf(c_0_91,negated_conjecture,
plus(p__1,plus(X1,plus(p__1,X2))) != plus(p__1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_65]),c_0_65]) ).
cnf(c_0_92,negated_conjecture,
plus(X1,times(s_7(p__0),X1)) = times(p__0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_65]) ).
cnf(c_0_93,negated_conjecture,
( X1 = times(p__1,s_6(p__1,X2))
| plus(s_5(p__1,X2),X1) != X2 ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_94,negated_conjecture,
plus(s_5(p__1,X1),plus(times(p__1,s_6(p__1,X1)),X2)) = plus(X1,X2),
inference(spm,[status(thm)],[c_0_39,c_0_87]) ).
cnf(c_0_95,negated_conjecture,
plus(n1,times(X1,p__1)) != times(X2,p__1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_33])]) ).
cnf(c_0_96,negated_conjecture,
( plus(X1,times(p__0,X2)) != times(X3,p__0)
| ~ less(s_5(p__0,p__0),X1)
| ~ less(X1,p__0) ),
inference(rw,[status(thm)],[c_0_59,c_0_80]) ).
cnf(c_0_97,plain,
plus(n1,plus(X1,plus(X2,n1))) != n1,
inference(spm,[status(thm)],[c_0_90,c_0_39]) ).
cnf(c_0_98,negated_conjecture,
plus(p__1,plus(X1,times(p__0,p__1))) != plus(p__1,X1),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_99,negated_conjecture,
( plus(times(p__1,s_6(p__1,X1)),X2) = times(p__1,s_6(p__1,X1))
| plus(X1,X2) != X1 ),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_100,negated_conjecture,
( X1 = n1
| times(s_1(X1),s_4(X1)) = X1 ),
clause_88 ).
cnf(c_0_101,negated_conjecture,
( X1 = n1
| s_1(X1) = p__0
| s_1(X1) = p__1 ),
clause_93 ).
cnf(c_0_102,negated_conjecture,
plus(n1,times(X1,p__1)) != times(p__1,X2),
inference(spm,[status(thm)],[c_0_95,c_0_54]) ).
cnf(c_0_103,negated_conjecture,
plus(n1,times(p__0,X1)) != times(X2,p__0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_89]),c_0_44])]) ).
cnf(c_0_104,negated_conjecture,
plus(n1,plus(X1,p__0)) != n1,
inference(spm,[status(thm)],[c_0_97,c_0_85]) ).
cnf(c_0_105,negated_conjecture,
plus(X1,times(p__0,p__1)) != X1,
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_106,negated_conjecture,
( times(p__1,s_4(X1)) = X1
| s_1(X1) = p__0
| X1 = n1 ),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_107,negated_conjecture,
plus(times(X1,p__1),n1) != times(p__1,X2),
inference(spm,[status(thm)],[c_0_102,c_0_42]) ).
cnf(c_0_108,negated_conjecture,
plus(n1,times(p__0,X1)) != times(p__0,X2),
inference(spm,[status(thm)],[c_0_103,c_0_54]) ).
cnf(c_0_109,negated_conjecture,
plus(n1,plus(p__0,X1)) != n1,
inference(spm,[status(thm)],[c_0_104,c_0_42]) ).
cnf(c_0_110,negated_conjecture,
plus(X1,times(X1,s_7(p__1))) = times(X1,p__1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_40]),c_0_75]),c_0_42]) ).
cnf(c_0_111,negated_conjecture,
s_1(plus(times(p__0,p__1),n1)) = p__0,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106])]),c_0_42]),c_0_42]),c_0_42]),c_0_107]) ).
cnf(c_0_112,negated_conjecture,
plus(times(p__0,X1),n1) != times(p__0,X2),
inference(spm,[status(thm)],[c_0_108,c_0_42]) ).
cnf(c_0_113,negated_conjecture,
plus(times(p__0,p__1),n1) != n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_42]) ).
cnf(c_0_114,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_111]),c_0_112]),c_0_113]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM420-1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n004.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 : Fri Aug 25 09:26:38 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.56 start to proof: theBenchmark
% 60.42/60.40 % Version : CSE_E---1.5
% 60.42/60.40 % Problem : theBenchmark.p
% 60.42/60.40 % Proof found
% 60.42/60.40 % SZS status Theorem for theBenchmark.p
% 60.42/60.40 % SZS output start Proof
% See solution above
% 60.42/60.41 % Total time : 59.840000 s
% 60.42/60.41 % SZS output end Proof
% 60.42/60.41 % Total time : 59.847000 s
%------------------------------------------------------------------------------