TSTP Solution File: NUM482+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM482+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 : n021.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:57 EDT 2023
% Result : Theorem 0.20s 0.62s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 22
% Syntax : Number of formulae : 38 ( 7 unt; 16 typ; 0 def)
% Number of atoms : 68 ( 11 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 77 ( 31 ~; 27 |; 13 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 22 ( 13 >; 9 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn; 12 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
aNaturalNumber0: $i > $o ).
tff(decl_23,type,
sz00: $i ).
tff(decl_24,type,
sz10: $i ).
tff(decl_25,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(decl_26,type,
sdtasdt0: ( $i * $i ) > $i ).
tff(decl_27,type,
sdtlseqdt0: ( $i * $i ) > $o ).
tff(decl_28,type,
sdtmndt0: ( $i * $i ) > $i ).
tff(decl_29,type,
iLess0: ( $i * $i ) > $o ).
tff(decl_30,type,
doDivides0: ( $i * $i ) > $o ).
tff(decl_31,type,
sdtsldt0: ( $i * $i ) > $i ).
tff(decl_32,type,
isPrime0: $i > $o ).
tff(decl_33,type,
xk: $i ).
tff(decl_34,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_35,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_36,type,
esk3_1: $i > $i ).
tff(decl_37,type,
esk4_1: $i > $i ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(m_MulUnit,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtasdt0(X1,sz10) = X1
& X1 = sdtasdt0(sz10,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_MulUnit) ).
fof(m__,conjecture,
( isPrime0(xk)
=> ? [X1] :
( aNaturalNumber0(X1)
& doDivides0(X1,xk)
& isPrime0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__1716,hypothesis,
aNaturalNumber0(xk),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1716) ).
fof(mSortsC_01,axiom,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(c_0_6,plain,
! [X60,X61,X63] :
( ( aNaturalNumber0(esk2_2(X60,X61))
| ~ doDivides0(X60,X61)
| ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X61) )
& ( X61 = sdtasdt0(X60,esk2_2(X60,X61))
| ~ doDivides0(X60,X61)
| ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X61) )
& ( ~ aNaturalNumber0(X63)
| X61 != sdtasdt0(X60,X63)
| doDivides0(X60,X61)
| ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X61) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiv])])])])]) ).
fof(c_0_7,plain,
! [X6,X7] :
( ~ aNaturalNumber0(X6)
| ~ aNaturalNumber0(X7)
| aNaturalNumber0(sdtasdt0(X6,X7)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
fof(c_0_8,plain,
! [X19] :
( ( sdtasdt0(X19,sz10) = X19
| ~ aNaturalNumber0(X19) )
& ( X19 = sdtasdt0(sz10,X19)
| ~ aNaturalNumber0(X19) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulUnit])])]) ).
fof(c_0_9,negated_conjecture,
~ ( isPrime0(xk)
=> ? [X1] :
( aNaturalNumber0(X1)
& doDivides0(X1,xk)
& isPrime0(X1) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_10,plain,
( doDivides0(X3,X2)
| ~ aNaturalNumber0(X1)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
aNaturalNumber0(xk),
inference(split_conjunct,[status(thm)],[m__1716]) ).
fof(c_0_14,negated_conjecture,
! [X86] :
( isPrime0(xk)
& ( ~ aNaturalNumber0(X86)
| ~ doDivides0(X86,xk)
| ~ isPrime0(X86) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_15,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_10]),c_0_11]) ).
cnf(c_0_16,hypothesis,
sdtasdt0(xk,sz10) = xk,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_18,negated_conjecture,
( ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,xk)
| ~ isPrime0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,hypothesis,
doDivides0(xk,xk),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_13]),c_0_17])]) ).
cnf(c_0_20,negated_conjecture,
isPrime0(xk),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM482+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n021.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:03:26 EDT 2023
% 0.12/0.35 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 0.20/0.62 % Version : CSE_E---1.5
% 0.20/0.62 % Problem : theBenchmark.p
% 0.20/0.62 % Proof found
% 0.20/0.62 % SZS status Theorem for theBenchmark.p
% 0.20/0.62 % SZS output start Proof
% See solution above
% 0.20/0.62 % Total time : 0.025000 s
% 0.20/0.62 % SZS output end Proof
% 0.20/0.62 % Total time : 0.029000 s
%------------------------------------------------------------------------------