TSTP Solution File: NUM448+5 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM448+5 : 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 : n005.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:35 EDT 2023
% Result : Theorem 0.19s 0.61s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 51
% Syntax : Number of formulae : 89 ( 7 unt; 47 typ; 0 def)
% Number of atoms : 275 ( 63 equ)
% Maximal formula atoms : 102 ( 6 avg)
% Number of connectives : 363 ( 130 ~; 141 |; 71 &)
% ( 7 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 41 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 67 ( 40 >; 27 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 37 ( 37 usr; 7 con; 0-3 aty)
% Number of variables : 55 ( 0 sgn; 21 !; 15 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
aInteger0: $i > $o ).
tff(decl_23,type,
sz00: $i ).
tff(decl_24,type,
sz10: $i ).
tff(decl_25,type,
smndt0: $i > $i ).
tff(decl_26,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(decl_27,type,
sdtasdt0: ( $i * $i ) > $i ).
tff(decl_28,type,
aDivisorOf0: ( $i * $i ) > $o ).
tff(decl_29,type,
sdteqdtlpzmzozddtrp0: ( $i * $i * $i ) > $o ).
tff(decl_30,type,
isPrime0: $i > $o ).
tff(decl_31,type,
aSet0: $i > $o ).
tff(decl_32,type,
aElementOf0: ( $i * $i ) > $o ).
tff(decl_33,type,
aSubsetOf0: ( $i * $i ) > $o ).
tff(decl_34,type,
isFinite0: $i > $o ).
tff(decl_35,type,
cS1395: $i ).
tff(decl_36,type,
sdtbsmnsldt0: ( $i * $i ) > $i ).
tff(decl_37,type,
sdtslmnbsdt0: ( $i * $i ) > $i ).
tff(decl_38,type,
sbsmnsldt0: $i > $i ).
tff(decl_39,type,
stldt0: $i > $i ).
tff(decl_40,type,
szAzrzSzezqlpdtcmdtrp0: ( $i * $i ) > $i ).
tff(decl_41,type,
isOpen0: $i > $o ).
tff(decl_42,type,
isClosed0: $i > $o ).
tff(decl_43,type,
xS: $i ).
tff(decl_44,type,
cS2043: $i ).
tff(decl_45,type,
cS2076: $i ).
tff(decl_46,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_47,type,
esk2_1: $i > $i ).
tff(decl_48,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_49,type,
esk4_3: ( $i * $i * $i ) > $i ).
tff(decl_50,type,
esk5_3: ( $i * $i * $i ) > $i ).
tff(decl_51,type,
esk6_1: $i > $i ).
tff(decl_52,type,
esk7_3: ( $i * $i * $i ) > $i ).
tff(decl_53,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_54,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_55,type,
esk10_2: ( $i * $i ) > $i ).
tff(decl_56,type,
esk11_3: ( $i * $i * $i ) > $i ).
tff(decl_57,type,
esk12_2: ( $i * $i ) > $i ).
tff(decl_58,type,
esk13_1: $i > $i ).
tff(decl_59,type,
esk14_1: $i > $i ).
tff(decl_60,type,
esk15_1: $i > $i ).
tff(decl_61,type,
esk16_1: $i > $i ).
tff(decl_62,type,
esk17_2: ( $i * $i ) > $i ).
tff(decl_63,type,
esk18_3: ( $i * $i * $i ) > $i ).
tff(decl_64,type,
esk19_1: $i > $i ).
tff(decl_65,type,
esk20_1: $i > $i ).
tff(decl_66,type,
esk21_1: $i > $i ).
tff(decl_67,type,
esk22_1: $i > $i ).
tff(decl_68,type,
esk23_0: $i ).
fof(m__,conjecture,
( ! [X1] :
( aInteger0(X1)
=> ( ( ( ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) )
| aElementOf0(X1,sbsmnsldt0(xS)) )
=> ? [X2] :
( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X2,X3) = X1 )
& aDivisorOf0(X2,X1)
& isPrime0(X2) ) )
& ( ? [X2] :
( ( ( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X2,X3) = X1 ) )
| aDivisorOf0(X2,X1) )
& isPrime0(X2) )
=> ( ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) )
& aElementOf0(X1,sbsmnsldt0(xS)) ) ) ) )
=> ( ( aSet0(sbsmnsldt0(xS))
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( aInteger0(X1)
& ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) ) ) ) )
=> ( ( aSet0(stldt0(sbsmnsldt0(xS)))
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( aInteger0(X1)
& ~ aElementOf0(X1,sbsmnsldt0(xS)) ) ) )
=> ( ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( X1 = sz10
| X1 = smndt0(sz10) ) )
| stldt0(sbsmnsldt0(xS)) = cS2076 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mIntNeg,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntNeg) ).
fof(mPrimeDivisor,axiom,
! [X1] :
( aInteger0(X1)
=> ( ? [X2] :
( aDivisorOf0(X2,X1)
& isPrime0(X2) )
<=> ( X1 != sz10
& X1 != smndt0(sz10) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mPrimeDivisor) ).
fof(mIntOne,axiom,
aInteger0(sz10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntOne) ).
fof(c_0_4,negated_conjecture,
~ ( ! [X1] :
( aInteger0(X1)
=> ( ( ( ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) )
| aElementOf0(X1,sbsmnsldt0(xS)) )
=> ? [X2] :
( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X2,X3) = X1 )
& aDivisorOf0(X2,X1)
& isPrime0(X2) ) )
& ( ? [X2] :
( ( ( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X2,X3) = X1 ) )
| aDivisorOf0(X2,X1) )
& isPrime0(X2) )
=> ( ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) )
& aElementOf0(X1,sbsmnsldt0(xS)) ) ) ) )
=> ( ( aSet0(sbsmnsldt0(xS))
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( aInteger0(X1)
& ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) ) ) ) )
=> ( ( aSet0(stldt0(sbsmnsldt0(xS)))
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( aInteger0(X1)
& ~ aElementOf0(X1,sbsmnsldt0(xS)) ) ) )
=> ( ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( X1 = sz10
| X1 = smndt0(sz10) ) )
| stldt0(sbsmnsldt0(xS)) = cS2076 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_5,negated_conjecture,
! [X125,X126,X129,X130,X132,X134,X135,X136] :
( ( aInteger0(esk19_1(X125))
| ~ aElementOf0(X126,xS)
| ~ aElementOf0(X125,X126)
| ~ aInteger0(X125) )
& ( esk19_1(X125) != sz00
| ~ aElementOf0(X126,xS)
| ~ aElementOf0(X125,X126)
| ~ aInteger0(X125) )
& ( aInteger0(esk20_1(X125))
| ~ aElementOf0(X126,xS)
| ~ aElementOf0(X125,X126)
| ~ aInteger0(X125) )
& ( sdtasdt0(esk19_1(X125),esk20_1(X125)) = X125
| ~ aElementOf0(X126,xS)
| ~ aElementOf0(X125,X126)
| ~ aInteger0(X125) )
& ( aDivisorOf0(esk19_1(X125),X125)
| ~ aElementOf0(X126,xS)
| ~ aElementOf0(X125,X126)
| ~ aInteger0(X125) )
& ( isPrime0(esk19_1(X125))
| ~ aElementOf0(X126,xS)
| ~ aElementOf0(X125,X126)
| ~ aInteger0(X125) )
& ( aInteger0(esk19_1(X125))
| ~ aElementOf0(X125,sbsmnsldt0(xS))
| ~ aInteger0(X125) )
& ( esk19_1(X125) != sz00
| ~ aElementOf0(X125,sbsmnsldt0(xS))
| ~ aInteger0(X125) )
& ( aInteger0(esk20_1(X125))
| ~ aElementOf0(X125,sbsmnsldt0(xS))
| ~ aInteger0(X125) )
& ( sdtasdt0(esk19_1(X125),esk20_1(X125)) = X125
| ~ aElementOf0(X125,sbsmnsldt0(xS))
| ~ aInteger0(X125) )
& ( aDivisorOf0(esk19_1(X125),X125)
| ~ aElementOf0(X125,sbsmnsldt0(xS))
| ~ aInteger0(X125) )
& ( isPrime0(esk19_1(X125))
| ~ aElementOf0(X125,sbsmnsldt0(xS))
| ~ aInteger0(X125) )
& ( aElementOf0(esk21_1(X125),xS)
| ~ aInteger0(X129)
| X129 = sz00
| ~ aInteger0(X130)
| sdtasdt0(X129,X130) != X125
| ~ isPrime0(X129)
| ~ aInteger0(X125) )
& ( aElementOf0(X125,esk21_1(X125))
| ~ aInteger0(X129)
| X129 = sz00
| ~ aInteger0(X130)
| sdtasdt0(X129,X130) != X125
| ~ isPrime0(X129)
| ~ aInteger0(X125) )
& ( aElementOf0(X125,sbsmnsldt0(xS))
| ~ aInteger0(X129)
| X129 = sz00
| ~ aInteger0(X130)
| sdtasdt0(X129,X130) != X125
| ~ isPrime0(X129)
| ~ aInteger0(X125) )
& ( aElementOf0(esk21_1(X125),xS)
| ~ aDivisorOf0(X129,X125)
| ~ isPrime0(X129)
| ~ aInteger0(X125) )
& ( aElementOf0(X125,esk21_1(X125))
| ~ aDivisorOf0(X129,X125)
| ~ isPrime0(X129)
| ~ aInteger0(X125) )
& ( aElementOf0(X125,sbsmnsldt0(xS))
| ~ aDivisorOf0(X129,X125)
| ~ isPrime0(X129)
| ~ aInteger0(X125) )
& aSet0(sbsmnsldt0(xS))
& ( aInteger0(X132)
| ~ aElementOf0(X132,sbsmnsldt0(xS)) )
& ( aElementOf0(esk22_1(X132),xS)
| ~ aElementOf0(X132,sbsmnsldt0(xS)) )
& ( aElementOf0(X132,esk22_1(X132))
| ~ aElementOf0(X132,sbsmnsldt0(xS)) )
& ( ~ aInteger0(X134)
| ~ aElementOf0(X135,xS)
| ~ aElementOf0(X134,X135)
| aElementOf0(X134,sbsmnsldt0(xS)) )
& aSet0(stldt0(sbsmnsldt0(xS)))
& ( aInteger0(X136)
| ~ aElementOf0(X136,stldt0(sbsmnsldt0(xS))) )
& ( ~ aElementOf0(X136,sbsmnsldt0(xS))
| ~ aElementOf0(X136,stldt0(sbsmnsldt0(xS))) )
& ( ~ aInteger0(X136)
| aElementOf0(X136,sbsmnsldt0(xS))
| aElementOf0(X136,stldt0(sbsmnsldt0(xS))) )
& ( esk23_0 != sz10
| ~ aElementOf0(esk23_0,stldt0(sbsmnsldt0(xS))) )
& ( esk23_0 != smndt0(sz10)
| ~ aElementOf0(esk23_0,stldt0(sbsmnsldt0(xS))) )
& ( aElementOf0(esk23_0,stldt0(sbsmnsldt0(xS)))
| esk23_0 = sz10
| esk23_0 = smndt0(sz10) )
& stldt0(sbsmnsldt0(xS)) != cS2076 ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])]) ).
fof(c_0_6,plain,
! [X5] :
( ~ aInteger0(X5)
| aInteger0(smndt0(X5)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])]) ).
cnf(c_0_7,negated_conjecture,
( aInteger0(X1)
| ~ aElementOf0(X1,stldt0(sbsmnsldt0(xS))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( aElementOf0(esk23_0,stldt0(sbsmnsldt0(xS)))
| esk23_0 = sz10
| esk23_0 = smndt0(sz10) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,plain,
! [X51,X52] :
( ( X51 != sz10
| ~ aDivisorOf0(X52,X51)
| ~ isPrime0(X52)
| ~ aInteger0(X51) )
& ( X51 != smndt0(sz10)
| ~ aDivisorOf0(X52,X51)
| ~ isPrime0(X52)
| ~ aInteger0(X51) )
& ( aDivisorOf0(esk2_1(X51),X51)
| X51 = sz10
| X51 = smndt0(sz10)
| ~ aInteger0(X51) )
& ( isPrime0(esk2_1(X51))
| X51 = sz10
| X51 = smndt0(sz10)
| ~ aInteger0(X51) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mPrimeDivisor])])])])]) ).
cnf(c_0_10,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( smndt0(sz10) = esk23_0
| esk23_0 = sz10
| aInteger0(esk23_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
aInteger0(sz10),
inference(split_conjunct,[status(thm)],[mIntOne]) ).
cnf(c_0_13,plain,
( X1 != smndt0(sz10)
| ~ aDivisorOf0(X2,X1)
| ~ isPrime0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( aDivisorOf0(esk19_1(X1),X1)
| ~ aElementOf0(X1,sbsmnsldt0(xS))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( aInteger0(X1)
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( isPrime0(esk19_1(X1))
| ~ aElementOf0(X1,sbsmnsldt0(xS))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,plain,
( aDivisorOf0(esk2_1(X1),X1)
| X1 = sz10
| X1 = smndt0(sz10)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
( esk23_0 = sz10
| aInteger0(esk23_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_19,plain,
( isPrime0(esk2_1(X1))
| X1 = sz10
| X1 = smndt0(sz10)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
( ~ aElementOf0(X1,sbsmnsldt0(xS))
| ~ aElementOf0(X1,stldt0(sbsmnsldt0(xS))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,negated_conjecture,
( aElementOf0(X1,sbsmnsldt0(xS))
| aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,plain,
( ~ isPrime0(X1)
| ~ aDivisorOf0(X1,smndt0(sz10))
| ~ aInteger0(smndt0(sz10)) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( aDivisorOf0(esk19_1(X1),X1)
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(csr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( isPrime0(esk19_1(X1))
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(csr,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_25,negated_conjecture,
( aElementOf0(X1,sbsmnsldt0(xS))
| ~ aDivisorOf0(X2,X1)
| ~ isPrime0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_26,negated_conjecture,
( smndt0(sz10) = esk23_0
| esk23_0 = sz10
| aDivisorOf0(esk2_1(esk23_0),esk23_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
( smndt0(sz10) = esk23_0
| esk23_0 = sz10
| isPrime0(esk2_1(esk23_0)) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_28,negated_conjecture,
( smndt0(sz10) = esk23_0
| esk23_0 = sz10
| ~ aElementOf0(esk23_0,sbsmnsldt0(xS)) ),
inference(spm,[status(thm)],[c_0_20,c_0_8]) ).
cnf(c_0_29,plain,
( X1 != sz10
| ~ aDivisorOf0(X2,X1)
| ~ isPrime0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_30,negated_conjecture,
( esk23_0 != smndt0(sz10)
| ~ aElementOf0(esk23_0,stldt0(sbsmnsldt0(xS))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_31,negated_conjecture,
( esk23_0 = sz10
| aElementOf0(esk23_0,stldt0(sbsmnsldt0(xS)))
| aElementOf0(esk23_0,sbsmnsldt0(xS)) ),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_32,negated_conjecture,
~ aElementOf0(smndt0(sz10),sbsmnsldt0(xS)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_15]),c_0_24]) ).
cnf(c_0_33,negated_conjecture,
( smndt0(sz10) = esk23_0
| esk23_0 = sz10 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_18]),c_0_27]),c_0_28]) ).
cnf(c_0_34,plain,
( ~ isPrime0(X1)
| ~ aDivisorOf0(X1,sz10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_29]),c_0_12])]) ).
cnf(c_0_35,negated_conjecture,
( esk23_0 = sz10
| aElementOf0(esk23_0,sbsmnsldt0(xS))
| smndt0(sz10) != esk23_0 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( esk23_0 = sz10
| ~ aElementOf0(esk23_0,sbsmnsldt0(xS)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
~ aElementOf0(sz10,sbsmnsldt0(xS)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_23]),c_0_24]) ).
cnf(c_0_38,negated_conjecture,
( esk23_0 != sz10
| ~ aElementOf0(esk23_0,stldt0(sbsmnsldt0(xS))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_39,negated_conjecture,
esk23_0 = sz10,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_33]),c_0_36]) ).
cnf(c_0_40,negated_conjecture,
aElementOf0(sz10,stldt0(sbsmnsldt0(xS))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_12]),c_0_37]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_39]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM448+5 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n005.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 : Fri Aug 25 09:59:23 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.61 % Version : CSE_E---1.5
% 0.19/0.61 % Problem : theBenchmark.p
% 0.19/0.61 % Proof found
% 0.19/0.61 % SZS status Theorem for theBenchmark.p
% 0.19/0.61 % SZS output start Proof
% See solution above
% 0.19/0.62 % Total time : 0.039000 s
% 0.19/0.62 % SZS output end Proof
% 0.19/0.62 % Total time : 0.044000 s
%------------------------------------------------------------------------------