TSTP Solution File: NUM464+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : NUM464+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n023.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 : Wed May 31 12:29:15 EDT 2023
% Result : Theorem 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of formulae : 51 ( 13 unt; 0 def)
% Number of atoms : 111 ( 24 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 104 ( 44 ~; 41 |; 8 &)
% ( 7 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 8 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 9 (; 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f23,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> ( sdtlseqdt0(W0,W1)
| ( W1 != W0
& sdtlseqdt0(W1,W0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f26,axiom,
! [W0] :
( aNaturalNumber0(W0)
=> ( W0 = sz00
| W0 = sz10
| ( sz10 != W0
& sdtlseqdt0(sz10,W0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f27,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f28,conjecture,
( xm != sz00
=> sdtlseqdt0(sz10,xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f29,negated_conjecture,
~ ( xm != sz00
=> sdtlseqdt0(sz10,xm) ),
inference(negated_conjecture,[status(cth)],[f28]) ).
fof(f33,plain,
aNaturalNumber0(sz00),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f34,plain,
aNaturalNumber0(sz10),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f35,plain,
sz10 != sz00,
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f89,plain,
! [W0,W1] :
( ~ aNaturalNumber0(W0)
| ~ aNaturalNumber0(W1)
| sdtlseqdt0(W0,W1)
| ( W1 != W0
& sdtlseqdt0(W1,W0) ) ),
inference(pre_NNF_transformation,[status(esa)],[f23]) ).
fof(f91,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X0,X1)
| sdtlseqdt0(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f89]) ).
fof(f102,plain,
! [W0] :
( ~ aNaturalNumber0(W0)
| W0 = sz00
| W0 = sz10
| ( sz10 != W0
& sdtlseqdt0(sz10,W0) ) ),
inference(pre_NNF_transformation,[status(esa)],[f26]) ).
fof(f104,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| X0 = sz00
| X0 = sz10
| sdtlseqdt0(sz10,X0) ),
inference(cnf_transformation,[status(esa)],[f102]) ).
fof(f105,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[status(esa)],[f27]) ).
fof(f107,plain,
( xm != sz00
& ~ sdtlseqdt0(sz10,xm) ),
inference(pre_NNF_transformation,[status(esa)],[f29]) ).
fof(f108,plain,
xm != sz00,
inference(cnf_transformation,[status(esa)],[f107]) ).
fof(f109,plain,
~ sdtlseqdt0(sz10,xm),
inference(cnf_transformation,[status(esa)],[f107]) ).
fof(f116,plain,
( spl0_0
<=> aNaturalNumber0(xm) ),
introduced(split_symbol_definition) ).
fof(f118,plain,
( ~ aNaturalNumber0(xm)
| spl0_0 ),
inference(component_clause,[status(thm)],[f116]) ).
fof(f119,plain,
( spl0_1
<=> aNaturalNumber0(sz10) ),
introduced(split_symbol_definition) ).
fof(f121,plain,
( ~ aNaturalNumber0(sz10)
| spl0_1 ),
inference(component_clause,[status(thm)],[f119]) ).
fof(f122,plain,
( spl0_2
<=> sdtlseqdt0(xm,sz10) ),
introduced(split_symbol_definition) ).
fof(f123,plain,
( sdtlseqdt0(xm,sz10)
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f122]) ).
fof(f125,plain,
( ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(sz10)
| sdtlseqdt0(xm,sz10) ),
inference(resolution,[status(thm)],[f91,f109]) ).
fof(f126,plain,
( ~ spl0_0
| ~ spl0_1
| spl0_2 ),
inference(split_clause,[status(thm)],[f125,f116,f119,f122]) ).
fof(f127,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f121,f34]) ).
fof(f128,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f127]) ).
fof(f129,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f118,f105]) ).
fof(f130,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f129]) ).
fof(f131,plain,
( spl0_3
<=> xm = sz00 ),
introduced(split_symbol_definition) ).
fof(f132,plain,
( xm = sz00
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f131]) ).
fof(f134,plain,
( spl0_4
<=> xm = sz10 ),
introduced(split_symbol_definition) ).
fof(f135,plain,
( xm = sz10
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f134]) ).
fof(f137,plain,
( ~ aNaturalNumber0(xm)
| xm = sz00
| xm = sz10 ),
inference(resolution,[status(thm)],[f104,f109]) ).
fof(f138,plain,
( ~ spl0_0
| spl0_3
| spl0_4 ),
inference(split_clause,[status(thm)],[f137,f116,f131,f134]) ).
fof(f139,plain,
( $false
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f132,f108]) ).
fof(f140,plain,
~ spl0_3,
inference(contradiction_clause,[status(thm)],[f139]) ).
fof(f141,plain,
( spl0_5
<=> sz10 = sz00 ),
introduced(split_symbol_definition) ).
fof(f142,plain,
( sz10 = sz00
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f141]) ).
fof(f159,plain,
( $false
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f142,f35]) ).
fof(f160,plain,
~ spl0_5,
inference(contradiction_clause,[status(thm)],[f159]) ).
fof(f172,plain,
( spl0_10
<=> aNaturalNumber0(sz00) ),
introduced(split_symbol_definition) ).
fof(f174,plain,
( ~ aNaturalNumber0(sz00)
| spl0_10 ),
inference(component_clause,[status(thm)],[f172]) ).
fof(f182,plain,
( $false
| spl0_10 ),
inference(forward_subsumption_resolution,[status(thm)],[f174,f33]) ).
fof(f183,plain,
spl0_10,
inference(contradiction_clause,[status(thm)],[f182]) ).
fof(f265,plain,
( ~ sdtlseqdt0(sz10,sz10)
| ~ spl0_4 ),
inference(backward_demodulation,[status(thm)],[f135,f109]) ).
fof(f267,plain,
( sdtlseqdt0(sz10,sz10)
| ~ spl0_4
| ~ spl0_2 ),
inference(forward_demodulation,[status(thm)],[f135,f123]) ).
fof(f278,plain,
( $false
| ~ spl0_2
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f265,f267]) ).
fof(f279,plain,
( ~ spl0_2
| ~ spl0_4 ),
inference(contradiction_clause,[status(thm)],[f278]) ).
fof(f280,plain,
$false,
inference(sat_refutation,[status(thm)],[f126,f128,f130,f138,f140,f160,f183,f279]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM464+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 : Tue May 30 10:08:23 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 0.13/0.36 % Refutation found
% 0.13/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.37 % Elapsed time: 0.025471 seconds
% 0.13/0.37 % CPU time: 0.053260 seconds
% 0.13/0.37 % Memory used: 12.003 MB
%------------------------------------------------------------------------------