TSTP Solution File: NUM464+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM464+2 : 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 : n006.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:45 EDT 2023
% Result : Theorem 0.18s 0.56s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 16
% Syntax : Number of formulae : 30 ( 8 unt; 10 typ; 0 def)
% Number of atoms : 52 ( 25 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 53 ( 21 ~; 18 |; 10 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 6 >; 5 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn; 5 !; 2 ?; 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,
xm: $i ).
tff(decl_30,type,
xn: $i ).
tff(decl_31,type,
esk1_2: ( $i * $i ) > $i ).
fof(m__,conjecture,
( xm != sz00
=> ( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(sz10,X1) = xm )
| sdtlseqdt0(sz10,xm) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m_AddZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_AddZero) ).
fof(mLENTr,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 = sz00
| X1 = sz10
| ( sz10 != X1
& sdtlseqdt0(sz10,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLENTr) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC) ).
fof(mSortsC_01,axiom,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC_01) ).
fof(m__987,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__987) ).
fof(c_0_6,negated_conjecture,
~ ( xm != sz00
=> ( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(sz10,X1) = xm )
| sdtlseqdt0(sz10,xm) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,negated_conjecture,
! [X56] :
( xm != sz00
& ( ~ aNaturalNumber0(X56)
| sdtpldt0(sz10,X56) != xm )
& ~ sdtlseqdt0(sz10,xm) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X13] :
( ( sdtpldt0(X13,sz00) = X13
| ~ aNaturalNumber0(X13) )
& ( X13 = sdtpldt0(sz00,X13)
| ~ aNaturalNumber0(X13) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_AddZero])])]) ).
fof(c_0_9,plain,
! [X55] :
( ( sz10 != X55
| X55 = sz00
| X55 = sz10
| ~ aNaturalNumber0(X55) )
& ( sdtlseqdt0(sz10,X55)
| X55 = sz00
| X55 = sz10
| ~ aNaturalNumber0(X55) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLENTr])])]) ).
cnf(c_0_10,negated_conjecture,
( ~ aNaturalNumber0(X1)
| sdtpldt0(sz10,X1) != xm ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_13,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_14,negated_conjecture,
~ sdtlseqdt0(sz10,xm),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
( sdtlseqdt0(sz10,X1)
| X1 = sz00
| X1 = sz10
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__987]) ).
cnf(c_0_17,negated_conjecture,
xm != sz00,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
xm != sz10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM464+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Aug 25 15:40:37 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.18/0.54 start to proof: theBenchmark
% 0.18/0.56 % Version : CSE_E---1.5
% 0.18/0.56 % Problem : theBenchmark.p
% 0.18/0.56 % Proof found
% 0.18/0.56 % SZS status Theorem for theBenchmark.p
% 0.18/0.56 % SZS output start Proof
% See solution above
% 0.18/0.56 % Total time : 0.009000 s
% 0.18/0.56 % SZS output end Proof
% 0.18/0.56 % Total time : 0.012000 s
%------------------------------------------------------------------------------