TSTP Solution File: NUM531+2 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : NUM531+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n015.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:34 EDT 2023
% Result : Theorem 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 10 unt; 0 def)
% Number of atoms : 51 ( 5 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 46 ( 20 ~; 10 |; 11 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 10 (; 7 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
isFinite0(slcrc0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [W0] :
( ( aSet0(W0)
& isCountable0(W0) )
=> ~ isFinite0(W0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,conjecture,
! [W0] :
( ( aSet0(W0)
& isCountable0(W0) )
=> ~ ( ~ ? [W1] : aElementOf0(W1,W0)
& W0 = slcrc0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,negated_conjecture,
~ ! [W0] :
( ( aSet0(W0)
& isCountable0(W0) )
=> ~ ( ~ ? [W1] : aElementOf0(W1,W0)
& W0 = slcrc0 ) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f28,plain,
isFinite0(slcrc0),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f31,plain,
! [W0] :
( ~ aSet0(W0)
| ~ isCountable0(W0)
| ~ isFinite0(W0) ),
inference(pre_NNF_transformation,[status(esa)],[f8]) ).
fof(f32,plain,
! [X0] :
( ~ aSet0(X0)
| ~ isCountable0(X0)
| ~ isFinite0(X0) ),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f33,plain,
? [W0] :
( aSet0(W0)
& isCountable0(W0)
& ! [W1] : ~ aElementOf0(W1,W0)
& W0 = slcrc0 ),
inference(pre_NNF_transformation,[status(esa)],[f10]) ).
fof(f34,plain,
( aSet0(sk0_1)
& isCountable0(sk0_1)
& ! [W1] : ~ aElementOf0(W1,sk0_1)
& sk0_1 = slcrc0 ),
inference(skolemization,[status(esa)],[f33]) ).
fof(f35,plain,
aSet0(sk0_1),
inference(cnf_transformation,[status(esa)],[f34]) ).
fof(f36,plain,
isCountable0(sk0_1),
inference(cnf_transformation,[status(esa)],[f34]) ).
fof(f38,plain,
sk0_1 = slcrc0,
inference(cnf_transformation,[status(esa)],[f34]) ).
fof(f41,plain,
isCountable0(slcrc0),
inference(backward_demodulation,[status(thm)],[f38,f36]) ).
fof(f42,plain,
aSet0(slcrc0),
inference(backward_demodulation,[status(thm)],[f38,f35]) ).
fof(f44,plain,
( spl0_0
<=> aSet0(slcrc0) ),
introduced(split_symbol_definition) ).
fof(f46,plain,
( ~ aSet0(slcrc0)
| spl0_0 ),
inference(component_clause,[status(thm)],[f44]) ).
fof(f52,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f46,f42]) ).
fof(f53,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f52]) ).
fof(f54,plain,
( spl0_2
<=> isCountable0(slcrc0) ),
introduced(split_symbol_definition) ).
fof(f56,plain,
( ~ isCountable0(slcrc0)
| spl0_2 ),
inference(component_clause,[status(thm)],[f54]) ).
fof(f57,plain,
( ~ aSet0(slcrc0)
| ~ isCountable0(slcrc0) ),
inference(resolution,[status(thm)],[f28,f32]) ).
fof(f58,plain,
( ~ spl0_0
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f57,f44,f54]) ).
fof(f59,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f56,f41]) ).
fof(f60,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f59]) ).
fof(f61,plain,
$false,
inference(sat_refutation,[status(thm)],[f53,f58,f60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM531+2 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.33 % Computer : n015.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.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue May 30 10:12:19 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.13/0.34 % 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.36 % Elapsed time: 0.022750 seconds
% 0.13/0.36 % CPU time: 0.025860 seconds
% 0.13/0.36 % Memory used: 12.441 MB
%------------------------------------------------------------------------------