TSTP Solution File: NUM548+3 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : NUM548+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n024.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:39 EDT 2023
% Result : Theorem 0.16s 0.54s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 11 unt; 0 def)
% Number of atoms : 61 ( 3 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 51 ( 18 ~; 17 |; 9 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 6 (; 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f41,axiom,
! [W0] :
( aSet0(W0)
=> ( aElementOf0(sbrdtbr0(W0),szNzAzT0)
<=> isFinite0(W0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f61,hypothesis,
aElementOf0(xk,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f65,hypothesis,
( aSet0(xQ)
& ! [W0] :
( aElementOf0(W0,xQ)
=> aElementOf0(W0,xS) )
& aSubsetOf0(xQ,xS)
& sbrdtbr0(xQ) = xk
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f66,conjecture,
isFinite0(xQ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f67,negated_conjecture,
~ isFinite0(xQ),
inference(negated_conjecture,[status(cth)],[f66]) ).
fof(f184,plain,
! [W0] :
( ~ aSet0(W0)
| ( aElementOf0(sbrdtbr0(W0),szNzAzT0)
<=> isFinite0(W0) ) ),
inference(pre_NNF_transformation,[status(esa)],[f41]) ).
fof(f185,plain,
! [W0] :
( ~ aSet0(W0)
| ( ( ~ aElementOf0(sbrdtbr0(W0),szNzAzT0)
| isFinite0(W0) )
& ( aElementOf0(sbrdtbr0(W0),szNzAzT0)
| ~ isFinite0(W0) ) ) ),
inference(NNF_transformation,[status(esa)],[f184]) ).
fof(f186,plain,
! [X0] :
( ~ aSet0(X0)
| ~ aElementOf0(sbrdtbr0(X0),szNzAzT0)
| isFinite0(X0) ),
inference(cnf_transformation,[status(esa)],[f185]) ).
fof(f266,plain,
aElementOf0(xk,szNzAzT0),
inference(cnf_transformation,[status(esa)],[f61]) ).
fof(f301,plain,
( aSet0(xQ)
& ! [W0] :
( ~ aElementOf0(W0,xQ)
| aElementOf0(W0,xS) )
& aSubsetOf0(xQ,xS)
& sbrdtbr0(xQ) = xk
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
inference(pre_NNF_transformation,[status(esa)],[f65]) ).
fof(f302,plain,
aSet0(xQ),
inference(cnf_transformation,[status(esa)],[f301]) ).
fof(f305,plain,
sbrdtbr0(xQ) = xk,
inference(cnf_transformation,[status(esa)],[f301]) ).
fof(f307,plain,
~ isFinite0(xQ),
inference(cnf_transformation,[status(esa)],[f67]) ).
fof(f348,plain,
( spl0_2
<=> isFinite0(xQ) ),
introduced(split_symbol_definition) ).
fof(f349,plain,
( isFinite0(xQ)
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f348]) ).
fof(f353,plain,
( spl0_3
<=> aSet0(xQ) ),
introduced(split_symbol_definition) ).
fof(f355,plain,
( ~ aSet0(xQ)
| spl0_3 ),
inference(component_clause,[status(thm)],[f353]) ).
fof(f356,plain,
( spl0_4
<=> aElementOf0(xk,szNzAzT0) ),
introduced(split_symbol_definition) ).
fof(f358,plain,
( ~ aElementOf0(xk,szNzAzT0)
| spl0_4 ),
inference(component_clause,[status(thm)],[f356]) ).
fof(f359,plain,
( ~ aSet0(xQ)
| ~ aElementOf0(xk,szNzAzT0)
| isFinite0(xQ) ),
inference(paramodulation,[status(thm)],[f305,f186]) ).
fof(f360,plain,
( ~ spl0_3
| ~ spl0_4
| spl0_2 ),
inference(split_clause,[status(thm)],[f359,f353,f356,f348]) ).
fof(f361,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f355,f302]) ).
fof(f362,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f361]) ).
fof(f365,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f349,f307]) ).
fof(f366,plain,
~ spl0_2,
inference(contradiction_clause,[status(thm)],[f365]) ).
fof(f461,plain,
( $false
| spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f358,f266]) ).
fof(f462,plain,
spl0_4,
inference(contradiction_clause,[status(thm)],[f461]) ).
fof(f463,plain,
$false,
inference(sat_refutation,[status(thm)],[f360,f362,f366,f462]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : NUM548+3 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31 % Computer : n024.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 09:57:48 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.32 % Drodi V3.5.1
% 0.16/0.54 % Refutation found
% 0.16/0.54 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.54 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.54 % Elapsed time: 0.016371 seconds
% 0.16/0.54 % CPU time: 0.018149 seconds
% 0.16/0.54 % Memory used: 3.980 MB
%------------------------------------------------------------------------------