TSTP Solution File: NUM482+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : NUM482+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n001.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:20 EDT 2023
% Result : Theorem 0.15s 0.32s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 39 ( 9 unt; 1 def)
% Number of atoms : 106 ( 14 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 112 ( 45 ~; 42 |; 15 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 25 (; 20 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [W0] :
( aNaturalNumber0(W0)
=> ( sdtasdt0(W0,sz10) = W0
& W0 = sdtasdt0(sz10,W0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f30,definition,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> ( doDivides0(W0,W1)
<=> ? [W2] :
( aNaturalNumber0(W2)
& W1 = sdtasdt0(W0,W2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f38,hypothesis,
aNaturalNumber0(xk),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f41,conjecture,
( isPrime0(xk)
=> ? [W0] :
( aNaturalNumber0(W0)
& doDivides0(W0,xk)
& isPrime0(W0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f42,negated_conjecture,
~ ( isPrime0(xk)
=> ? [W0] :
( aNaturalNumber0(W0)
& doDivides0(W0,xk)
& isPrime0(W0) ) ),
inference(negated_conjecture,[status(cth)],[f41]) ).
fof(f47,plain,
aNaturalNumber0(sz10),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f64,plain,
! [W0] :
( ~ aNaturalNumber0(W0)
| ( sdtasdt0(W0,sz10) = W0
& W0 = sdtasdt0(sz10,W0) ) ),
inference(pre_NNF_transformation,[status(esa)],[f11]) ).
fof(f65,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| sdtasdt0(X0,sz10) = X0 ),
inference(cnf_transformation,[status(esa)],[f64]) ).
fof(f124,plain,
! [W0,W1] :
( ~ aNaturalNumber0(W0)
| ~ aNaturalNumber0(W1)
| ( doDivides0(W0,W1)
<=> ? [W2] :
( aNaturalNumber0(W2)
& W1 = sdtasdt0(W0,W2) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f30]) ).
fof(f125,plain,
! [W0,W1] :
( ~ aNaturalNumber0(W0)
| ~ aNaturalNumber0(W1)
| ( ( ~ doDivides0(W0,W1)
| ? [W2] :
( aNaturalNumber0(W2)
& W1 = sdtasdt0(W0,W2) ) )
& ( doDivides0(W0,W1)
| ! [W2] :
( ~ aNaturalNumber0(W2)
| W1 != sdtasdt0(W0,W2) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f124]) ).
fof(f126,plain,
! [W0,W1] :
( ~ aNaturalNumber0(W0)
| ~ aNaturalNumber0(W1)
| ( ( ~ doDivides0(W0,W1)
| ( aNaturalNumber0(sk0_1(W1,W0))
& W1 = sdtasdt0(W0,sk0_1(W1,W0)) ) )
& ( doDivides0(W0,W1)
| ! [W2] :
( ~ aNaturalNumber0(W2)
| W1 != sdtasdt0(W0,W2) ) ) ) ),
inference(skolemization,[status(esa)],[f125]) ).
fof(f129,plain,
! [X0,X1,X2] :
( ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| doDivides0(X0,X1)
| ~ aNaturalNumber0(X2)
| X1 != sdtasdt0(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f126]) ).
fof(f156,plain,
aNaturalNumber0(xk),
inference(cnf_transformation,[status(esa)],[f38]) ).
fof(f164,plain,
( isPrime0(xk)
& ! [W0] :
( ~ aNaturalNumber0(W0)
| ~ doDivides0(W0,xk)
| ~ isPrime0(W0) ) ),
inference(pre_NNF_transformation,[status(esa)],[f42]) ).
fof(f165,plain,
isPrime0(xk),
inference(cnf_transformation,[status(esa)],[f164]) ).
fof(f166,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| ~ doDivides0(X0,xk)
| ~ isPrime0(X0) ),
inference(cnf_transformation,[status(esa)],[f164]) ).
fof(f173,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(sdtasdt0(X0,X1))
| doDivides0(X0,sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1) ),
inference(destructive_equality_resolution,[status(esa)],[f129]) ).
fof(f187,plain,
( spl0_1
<=> aNaturalNumber0(sz10) ),
introduced(split_symbol_definition) ).
fof(f189,plain,
( ~ aNaturalNumber0(sz10)
| spl0_1 ),
inference(component_clause,[status(thm)],[f187]) ).
fof(f197,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f189,f47]) ).
fof(f198,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f197]) ).
fof(f208,plain,
( spl0_5
<=> aNaturalNumber0(xk) ),
introduced(split_symbol_definition) ).
fof(f210,plain,
( ~ aNaturalNumber0(xk)
| spl0_5 ),
inference(component_clause,[status(thm)],[f208]) ).
fof(f213,plain,
( $false
| spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f210,f156]) ).
fof(f214,plain,
spl0_5,
inference(contradiction_clause,[status(thm)],[f213]) ).
fof(f231,plain,
sdtasdt0(xk,sz10) = xk,
inference(resolution,[status(thm)],[f65,f156]) ).
fof(f244,plain,
( spl0_10
<=> doDivides0(xk,sdtasdt0(xk,sz10)) ),
introduced(split_symbol_definition) ).
fof(f245,plain,
( doDivides0(xk,sdtasdt0(xk,sz10))
| ~ spl0_10 ),
inference(component_clause,[status(thm)],[f244]) ).
fof(f247,plain,
( ~ aNaturalNumber0(xk)
| ~ aNaturalNumber0(xk)
| doDivides0(xk,sdtasdt0(xk,sz10))
| ~ aNaturalNumber0(sz10) ),
inference(paramodulation,[status(thm)],[f231,f173]) ).
fof(f248,plain,
( ~ spl0_5
| spl0_10
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f247,f208,f244,f187]) ).
fof(f249,plain,
( doDivides0(xk,xk)
| ~ spl0_10 ),
inference(forward_demodulation,[status(thm)],[f231,f245]) ).
fof(f320,plain,
( spl0_23
<=> isPrime0(xk) ),
introduced(split_symbol_definition) ).
fof(f322,plain,
( ~ isPrime0(xk)
| spl0_23 ),
inference(component_clause,[status(thm)],[f320]) ).
fof(f323,plain,
( ~ aNaturalNumber0(xk)
| ~ isPrime0(xk)
| ~ spl0_10 ),
inference(resolution,[status(thm)],[f249,f166]) ).
fof(f324,plain,
( ~ spl0_5
| ~ spl0_23
| ~ spl0_10 ),
inference(split_clause,[status(thm)],[f323,f208,f320,f244]) ).
fof(f351,plain,
( $false
| spl0_23 ),
inference(forward_subsumption_resolution,[status(thm)],[f322,f165]) ).
fof(f352,plain,
spl0_23,
inference(contradiction_clause,[status(thm)],[f351]) ).
fof(f353,plain,
$false,
inference(sat_refutation,[status(thm)],[f198,f214,f248,f324,f352]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : NUM482+1 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31 % Computer : n001.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue May 30 10:27:30 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.32 % Drodi V3.5.1
% 0.15/0.32 % Refutation found
% 0.15/0.32 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/0.32 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.56 % Elapsed time: 0.039473 seconds
% 0.16/0.56 % CPU time: 0.016932 seconds
% 0.16/0.56 % Memory used: 3.076 MB
%------------------------------------------------------------------------------