TSTP Solution File: NUM568+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : NUM568+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n009.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:44 EDT 2023
% Result : Theorem 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 7 unt; 0 def)
% Number of atoms : 61 ( 19 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 55 ( 22 ~; 24 |; 5 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 11 (; 7 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f27,axiom,
! [W0] :
( aElementOf0(W0,szNzAzT0)
=> ( W0 = sz00
| ? [W1] :
( aElementOf0(W1,szNzAzT0)
& W0 = szszuzczcdt0(W1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f74,hypothesis,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f78,hypothesis,
xK != sz00,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f80,conjecture,
? [W0] :
( aElementOf0(W0,szNzAzT0)
& szszuzczcdt0(W0) = xK ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f81,negated_conjecture,
~ ? [W0] :
( aElementOf0(W0,szNzAzT0)
& szszuzczcdt0(W0) = xK ),
inference(negated_conjecture,[status(cth)],[f80]) ).
fof(f166,plain,
! [W0] :
( ~ aElementOf0(W0,szNzAzT0)
| W0 = sz00
| ? [W1] :
( aElementOf0(W1,szNzAzT0)
& W0 = szszuzczcdt0(W1) ) ),
inference(pre_NNF_transformation,[status(esa)],[f27]) ).
fof(f167,plain,
! [W0] :
( ~ aElementOf0(W0,szNzAzT0)
| W0 = sz00
| ( aElementOf0(sk0_4(W0),szNzAzT0)
& W0 = szszuzczcdt0(sk0_4(W0)) ) ),
inference(skolemization,[status(esa)],[f166]) ).
fof(f168,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| X0 = sz00
| aElementOf0(sk0_4(X0),szNzAzT0) ),
inference(cnf_transformation,[status(esa)],[f167]) ).
fof(f169,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| X0 = sz00
| X0 = szszuzczcdt0(sk0_4(X0)) ),
inference(cnf_transformation,[status(esa)],[f167]) ).
fof(f340,plain,
aElementOf0(xK,szNzAzT0),
inference(cnf_transformation,[status(esa)],[f74]) ).
fof(f352,plain,
xK != sz00,
inference(cnf_transformation,[status(esa)],[f78]) ).
fof(f354,plain,
! [W0] :
( ~ aElementOf0(W0,szNzAzT0)
| szszuzczcdt0(W0) != xK ),
inference(pre_NNF_transformation,[status(esa)],[f81]) ).
fof(f355,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| szszuzczcdt0(X0) != xK ),
inference(cnf_transformation,[status(esa)],[f354]) ).
fof(f922,plain,
( spl0_72
<=> aElementOf0(xK,szNzAzT0) ),
introduced(split_symbol_definition) ).
fof(f924,plain,
( ~ aElementOf0(xK,szNzAzT0)
| spl0_72 ),
inference(component_clause,[status(thm)],[f922]) ).
fof(f925,plain,
( spl0_73
<=> xK = sz00 ),
introduced(split_symbol_definition) ).
fof(f926,plain,
( xK = sz00
| ~ spl0_73 ),
inference(component_clause,[status(thm)],[f925]) ).
fof(f928,plain,
( spl0_74
<=> aElementOf0(sk0_4(xK),szNzAzT0) ),
introduced(split_symbol_definition) ).
fof(f930,plain,
( ~ aElementOf0(sk0_4(xK),szNzAzT0)
| spl0_74 ),
inference(component_clause,[status(thm)],[f928]) ).
fof(f931,plain,
( ~ aElementOf0(xK,szNzAzT0)
| xK = sz00
| ~ aElementOf0(sk0_4(xK),szNzAzT0) ),
inference(resolution,[status(thm)],[f169,f355]) ).
fof(f932,plain,
( ~ spl0_72
| spl0_73
| ~ spl0_74 ),
inference(split_clause,[status(thm)],[f931,f922,f925,f928]) ).
fof(f985,plain,
( $false
| spl0_72 ),
inference(forward_subsumption_resolution,[status(thm)],[f924,f340]) ).
fof(f986,plain,
spl0_72,
inference(contradiction_clause,[status(thm)],[f985]) ).
fof(f1052,plain,
( $false
| ~ spl0_73 ),
inference(forward_subsumption_resolution,[status(thm)],[f926,f352]) ).
fof(f1053,plain,
~ spl0_73,
inference(contradiction_clause,[status(thm)],[f1052]) ).
fof(f1112,plain,
( ~ aElementOf0(xK,szNzAzT0)
| xK = sz00
| spl0_74 ),
inference(resolution,[status(thm)],[f930,f168]) ).
fof(f1113,plain,
( ~ spl0_72
| spl0_73
| spl0_74 ),
inference(split_clause,[status(thm)],[f1112,f922,f925,f928]) ).
fof(f1114,plain,
$false,
inference(sat_refutation,[status(thm)],[f932,f986,f1053,f1113]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM568+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n009.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 : Tue May 30 09:50:31 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 0.13/0.39 % Refutation found
% 0.13/0.39 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.39 % Elapsed time: 0.041568 seconds
% 0.13/0.39 % CPU time: 0.127730 seconds
% 0.13/0.39 % Memory used: 20.427 MB
%------------------------------------------------------------------------------