TSTP Solution File: NUM453+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM453+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n002.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:38 EDT 2023
% Result : Theorem 0.71s 0.79s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 48
% Syntax : Number of formulae : 82 ( 13 unt; 40 typ; 0 def)
% Number of atoms : 89 ( 49 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 78 ( 31 ~; 33 |; 10 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 57 ( 33 >; 24 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 30 ( 30 usr; 7 con; 0-3 aty)
% Number of variables : 24 ( 0 sgn; 12 !; 0 ?; 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,
xp: $i ).
tff(decl_47,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_48,type,
esk2_1: $i > $i ).
tff(decl_49,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_50,type,
esk4_3: ( $i * $i * $i ) > $i ).
tff(decl_51,type,
esk5_3: ( $i * $i * $i ) > $i ).
tff(decl_52,type,
esk6_1: $i > $i ).
tff(decl_53,type,
esk7_3: ( $i * $i * $i ) > $i ).
tff(decl_54,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_55,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_56,type,
esk10_2: ( $i * $i ) > $i ).
tff(decl_57,type,
esk11_3: ( $i * $i * $i ) > $i ).
tff(decl_58,type,
esk12_2: ( $i * $i ) > $i ).
tff(decl_59,type,
esk13_1: $i > $i ).
tff(decl_60,type,
esk14_1: $i > $i ).
tff(decl_61,type,
esk15_1: $i > $i ).
fof(m__,conjecture,
( sdtpldt0(sz10,xp) != sz10
& sdtpldt0(sz10,smndt0(xp)) != sz10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mAddAsso,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3) )
=> sdtpldt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtpldt0(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddAsso) ).
fof(mIntOne,axiom,
aInteger0(sz10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntOne) ).
fof(mIntNeg,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntNeg) ).
fof(m__2171,hypothesis,
( aInteger0(xp)
& xp != sz00
& aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,xp),stldt0(sbsmnsldt0(xS))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2171) ).
fof(mIntZero,axiom,
aInteger0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntZero) ).
fof(mAddZero,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddZero) ).
fof(mAddNeg,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtpldt0(X1,smndt0(X1)) = sz00
& sz00 = sdtpldt0(smndt0(X1),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddNeg) ).
fof(c_0_8,negated_conjecture,
~ ( sdtpldt0(sz10,xp) != sz10
& sdtpldt0(sz10,smndt0(xp)) != sz10 ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_9,plain,
! [X10,X11,X12] :
( ~ aInteger0(X10)
| ~ aInteger0(X11)
| ~ aInteger0(X12)
| sdtpldt0(X10,sdtpldt0(X11,X12)) = sdtpldt0(sdtpldt0(X10,X11),X12) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddAsso])]) ).
fof(c_0_10,negated_conjecture,
( sdtpldt0(sz10,xp) = sz10
| sdtpldt0(sz10,smndt0(xp)) = sz10 ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( sdtpldt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtpldt0(X1,X2),X3)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( sdtpldt0(sz10,xp) = sz10
| sdtpldt0(sz10,smndt0(xp)) = sz10 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
aInteger0(sz10),
inference(split_conjunct,[status(thm)],[mIntOne]) ).
fof(c_0_14,plain,
! [X5] :
( ~ aInteger0(X5)
| aInteger0(smndt0(X5)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])]) ).
cnf(c_0_15,negated_conjecture,
( sdtpldt0(sz10,sdtpldt0(smndt0(xp),X1)) = sdtpldt0(sz10,X1)
| sdtpldt0(sz10,xp) = sz10
| ~ aInteger0(smndt0(xp))
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_16,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,hypothesis,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[m__2171]) ).
cnf(c_0_18,negated_conjecture,
( sdtpldt0(sz10,sdtpldt0(smndt0(xp),X1)) = sdtpldt0(sz10,X1)
| sdtpldt0(sz10,xp) = sz10
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_19,plain,
aInteger0(sz00),
inference(split_conjunct,[status(thm)],[mIntZero]) ).
fof(c_0_20,plain,
! [X15] :
( ( sdtpldt0(X15,sz00) = X15
| ~ aInteger0(X15) )
& ( X15 = sdtpldt0(sz00,X15)
| ~ aInteger0(X15) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])]) ).
fof(c_0_21,plain,
! [X16] :
( ( sdtpldt0(X16,smndt0(X16)) = sz00
| ~ aInteger0(X16) )
& ( sz00 = sdtpldt0(smndt0(X16),X16)
| ~ aInteger0(X16) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddNeg])])]) ).
cnf(c_0_22,negated_conjecture,
( sdtpldt0(sz10,sdtpldt0(smndt0(xp),sz00)) = sdtpldt0(sz10,sz00)
| sdtpldt0(sz10,xp) = sz10 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,hypothesis,
( sdtpldt0(sz10,sdtpldt0(smndt0(xp),xp)) = sdtpldt0(sz10,xp)
| sdtpldt0(sz10,xp) = sz10 ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_25,plain,
( sz00 = sdtpldt0(smndt0(X1),X1)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( sdtpldt0(sz10,smndt0(xp)) = sdtpldt0(sz10,sz00)
| sdtpldt0(sz10,xp) = sz10
| ~ aInteger0(smndt0(xp)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,hypothesis,
( sdtpldt0(sz10,xp) = sdtpldt0(sz10,sz00)
| sdtpldt0(sz10,xp) = sz10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_17])]) ).
cnf(c_0_28,negated_conjecture,
( sdtpldt0(sz10,smndt0(xp)) = sdtpldt0(sz10,sz00)
| sdtpldt0(sz10,xp) = sz10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_16]),c_0_17])]) ).
cnf(c_0_29,hypothesis,
( sdtpldt0(sz10,xp) = sz10
| sdtpldt0(sz10,sz00) != sz10 ),
inference(ef,[status(thm)],[c_0_27]) ).
cnf(c_0_30,negated_conjecture,
sdtpldt0(sz10,xp) = sz10,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_28]),c_0_29]) ).
cnf(c_0_31,plain,
( smndt0(sz00) = sz00
| ~ aInteger0(smndt0(sz00)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_25]),c_0_19])]) ).
cnf(c_0_32,negated_conjecture,
( sdtpldt0(sz10,sdtpldt0(xp,X1)) = sdtpldt0(sz10,X1)
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_30]),c_0_17]),c_0_13])]) ).
cnf(c_0_33,plain,
smndt0(sz00) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_16]),c_0_19])]) ).
cnf(c_0_34,plain,
( sdtpldt0(smndt0(X1),sdtpldt0(X1,X2)) = sdtpldt0(sz00,X2)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_25]),c_0_16]) ).
cnf(c_0_35,negated_conjecture,
sdtpldt0(sz10,sz00) = sz10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_23]),c_0_30]),c_0_19]),c_0_17])]) ).
cnf(c_0_36,plain,
sdtpldt0(sz00,sz00) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_33]),c_0_19])]) ).
cnf(c_0_37,negated_conjecture,
sdtpldt0(smndt0(sz10),sz10) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_19]),c_0_13])]) ).
cnf(c_0_38,plain,
( X1 = sdtpldt0(sz00,X1)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_39,negated_conjecture,
sdtpldt0(sz00,xp) = sz00,
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_30]),c_0_17]),c_0_13])]),c_0_37]) ).
cnf(c_0_40,hypothesis,
xp != sz00,
inference(split_conjunct,[status(thm)],[m__2171]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_17])]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM453+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n002.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 15:28:17 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 0.71/0.79 % Version : CSE_E---1.5
% 0.71/0.79 % Problem : theBenchmark.p
% 0.71/0.79 % Proof found
% 0.71/0.79 % SZS status Theorem for theBenchmark.p
% 0.71/0.79 % SZS output start Proof
% See solution above
% 0.71/0.79 % Total time : 0.212000 s
% 0.71/0.79 % SZS output end Proof
% 0.71/0.79 % Total time : 0.216000 s
%------------------------------------------------------------------------------