TSTP Solution File: NUM464+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM464+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 : n014.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.19s 0.54s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 15
% Syntax : Number of formulae : 28 ( 7 unt; 10 typ; 0 def)
% Number of atoms : 40 ( 16 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 38 ( 16 ~; 13 |; 5 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 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 : 6 ( 0 sgn; 4 !; 0 ?; 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
=> sdtlseqdt0(sz10,xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mLENTr,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 = sz00
| X1 = sz10
| ( sz10 != X1
& sdtlseqdt0(sz10,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLENTr) ).
fof(m__987,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__987) ).
fof(mLERefl,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> sdtlseqdt0(X1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLERefl) ).
fof(mSortsC_01,axiom,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(c_0_5,negated_conjecture,
~ ( xm != sz00
=> sdtlseqdt0(sz10,xm) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,negated_conjecture,
( xm != sz00
& ~ sdtlseqdt0(sz10,xm) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
fof(c_0_7,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_8,negated_conjecture,
~ sdtlseqdt0(sz10,xm),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( sdtlseqdt0(sz10,X1)
| X1 = sz00
| X1 = sz10
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__987]) ).
cnf(c_0_11,negated_conjecture,
xm != sz00,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
xm = sz10,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),c_0_11]) ).
fof(c_0_13,plain,
! [X41] :
( ~ aNaturalNumber0(X41)
| sdtlseqdt0(X41,X41) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLERefl])]) ).
cnf(c_0_14,negated_conjecture,
~ sdtlseqdt0(sz10,sz10),
inference(rw,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_15,plain,
( sdtlseqdt0(X1,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM464+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.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Aug 25 08:57:48 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.51 start to proof: theBenchmark
% 0.19/0.54 % Version : CSE_E---1.5
% 0.19/0.54 % Problem : theBenchmark.p
% 0.19/0.54 % Proof found
% 0.19/0.54 % SZS status Theorem for theBenchmark.p
% 0.19/0.54 % SZS output start Proof
% See solution above
% 0.19/0.54 % Total time : 0.011000 s
% 0.19/0.54 % SZS output end Proof
% 0.19/0.54 % Total time : 0.015000 s
%------------------------------------------------------------------------------