TSTP Solution File: NUM472+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : NUM472+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n016.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:17 EDT 2023
% Result : Theorem 0.14s 0.31s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 8 unt; 1 def)
% Number of atoms : 74 ( 7 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 80 ( 33 ~; 31 |; 10 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 26 (; 23 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> aNaturalNumber0(sdtpldt0(W0,W1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,definition,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> ( sdtlseqdt0(W0,W1)
<=> ? [W2] :
( aNaturalNumber0(W2)
& sdtpldt0(W0,W2) = W1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f34,hypothesis,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f39,conjecture,
sdtlseqdt0(xm,sdtpldt0(xm,xn)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f40,negated_conjecture,
~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
inference(negated_conjecture,[status(cth)],[f39]) ).
fof(f47,plain,
! [W0,W1] :
( ~ aNaturalNumber0(W0)
| ~ aNaturalNumber0(W1)
| aNaturalNumber0(sdtpldt0(W0,W1)) ),
inference(pre_NNF_transformation,[status(esa)],[f4]) ).
fof(f48,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtpldt0(X0,X1)) ),
inference(cnf_transformation,[status(esa)],[f47]) ).
fof(f82,plain,
! [W0,W1] :
( ~ aNaturalNumber0(W0)
| ~ aNaturalNumber0(W1)
| ( sdtlseqdt0(W0,W1)
<=> ? [W2] :
( aNaturalNumber0(W2)
& sdtpldt0(W0,W2) = W1 ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f18]) ).
fof(f83,plain,
! [W0,W1] :
( ~ aNaturalNumber0(W0)
| ~ aNaturalNumber0(W1)
| ( ( ~ sdtlseqdt0(W0,W1)
| ? [W2] :
( aNaturalNumber0(W2)
& sdtpldt0(W0,W2) = W1 ) )
& ( sdtlseqdt0(W0,W1)
| ! [W2] :
( ~ aNaturalNumber0(W2)
| sdtpldt0(W0,W2) != W1 ) ) ) ),
inference(NNF_transformation,[status(esa)],[f82]) ).
fof(f84,plain,
! [W0,W1] :
( ~ aNaturalNumber0(W0)
| ~ aNaturalNumber0(W1)
| ( ( ~ sdtlseqdt0(W0,W1)
| ( aNaturalNumber0(sk0_0(W1,W0))
& sdtpldt0(W0,sk0_0(W1,W0)) = W1 ) )
& ( sdtlseqdt0(W0,W1)
| ! [W2] :
( ~ aNaturalNumber0(W2)
| sdtpldt0(W0,W2) != W1 ) ) ) ),
inference(skolemization,[status(esa)],[f83]) ).
fof(f87,plain,
! [X0,X1,X2] :
( ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X0,X2) != X1 ),
inference(cnf_transformation,[status(esa)],[f84]) ).
fof(f139,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[status(esa)],[f34]) ).
fof(f140,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[status(esa)],[f34]) ).
fof(f146,plain,
~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
inference(cnf_transformation,[status(esa)],[f40]) ).
fof(f147,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(sdtpldt0(X0,X1))
| sdtlseqdt0(X0,sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X1) ),
inference(destructive_equality_resolution,[status(esa)],[f87]) ).
fof(f160,plain,
( spl0_1
<=> aNaturalNumber0(xm) ),
introduced(split_symbol_definition) ).
fof(f162,plain,
( ~ aNaturalNumber0(xm)
| spl0_1 ),
inference(component_clause,[status(thm)],[f160]) ).
fof(f168,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f162,f139]) ).
fof(f169,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f168]) ).
fof(f180,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X0)
| sdtlseqdt0(X0,sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X1) ),
inference(forward_subsumption_resolution,[status(thm)],[f147,f48]) ).
fof(f181,plain,
( spl0_5
<=> aNaturalNumber0(xn) ),
introduced(split_symbol_definition) ).
fof(f183,plain,
( ~ aNaturalNumber0(xn)
| spl0_5 ),
inference(component_clause,[status(thm)],[f181]) ).
fof(f184,plain,
( ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xn) ),
inference(resolution,[status(thm)],[f180,f146]) ).
fof(f185,plain,
( ~ spl0_1
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f184,f160,f181]) ).
fof(f189,plain,
( $false
| spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f183,f140]) ).
fof(f190,plain,
spl0_5,
inference(contradiction_clause,[status(thm)],[f189]) ).
fof(f191,plain,
$false,
inference(sat_refutation,[status(thm)],[f169,f185,f190]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : NUM472+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30 % Computer : n016.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue May 30 10:27:14 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.31 % Drodi V3.5.1
% 0.14/0.31 % Refutation found
% 0.14/0.31 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.31 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.31 % Elapsed time: 0.011897 seconds
% 0.14/0.31 % CPU time: 0.013130 seconds
% 0.14/0.31 % Memory used: 3.733 MB
%------------------------------------------------------------------------------