TSTP Solution File: SEU294+2 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SEU294+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n018.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 : Tue Apr 30 20:41:50 EDT 2024
% Result : Theorem 13.30s 2.14s
% Output : CNFRefutation 13.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 6 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 56 ( 22 ~; 17 |; 10 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 26 ( 22 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [A] :
( finite(A)
=> ! [B] :
( element(B,powerset(A))
=> finite(B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f249,conjecture,
! [A,B] :
( ( subset(A,B)
& finite(B) )
=> finite(A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f250,negated_conjecture,
~ ! [A,B] :
( ( subset(A,B)
& finite(B) )
=> finite(A) ),
inference(negated_conjecture,[status(cth)],[f249]) ).
fof(f324,axiom,
! [A,B] :
( element(A,powerset(B))
<=> subset(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f422,plain,
! [A] :
( ~ finite(A)
| ! [B] :
( ~ element(B,powerset(A))
| finite(B) ) ),
inference(pre_NNF_transformation,[status(esa)],[f10]) ).
fof(f423,plain,
! [X0,X1] :
( ~ finite(X0)
| ~ element(X1,powerset(X0))
| finite(X1) ),
inference(cnf_transformation,[status(esa)],[f422]) ).
fof(f1497,plain,
? [A,B] :
( subset(A,B)
& finite(B)
& ~ finite(A) ),
inference(pre_NNF_transformation,[status(esa)],[f250]) ).
fof(f1498,plain,
? [A] :
( ? [B] :
( subset(A,B)
& finite(B) )
& ~ finite(A) ),
inference(miniscoping,[status(esa)],[f1497]) ).
fof(f1499,plain,
( subset(sk0_200,sk0_201)
& finite(sk0_201)
& ~ finite(sk0_200) ),
inference(skolemization,[status(esa)],[f1498]) ).
fof(f1500,plain,
subset(sk0_200,sk0_201),
inference(cnf_transformation,[status(esa)],[f1499]) ).
fof(f1501,plain,
finite(sk0_201),
inference(cnf_transformation,[status(esa)],[f1499]) ).
fof(f1502,plain,
~ finite(sk0_200),
inference(cnf_transformation,[status(esa)],[f1499]) ).
fof(f1744,plain,
! [A,B] :
( ( ~ element(A,powerset(B))
| subset(A,B) )
& ( element(A,powerset(B))
| ~ subset(A,B) ) ),
inference(NNF_transformation,[status(esa)],[f324]) ).
fof(f1745,plain,
( ! [A,B] :
( ~ element(A,powerset(B))
| subset(A,B) )
& ! [A,B] :
( element(A,powerset(B))
| ~ subset(A,B) ) ),
inference(miniscoping,[status(esa)],[f1744]) ).
fof(f1747,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f1745]) ).
fof(f9965,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| ~ finite(X1)
| finite(X0) ),
inference(resolution,[status(thm)],[f1747,f423]) ).
fof(f11476,plain,
( spl0_397
<=> finite(sk0_201) ),
introduced(split_symbol_definition) ).
fof(f11478,plain,
( ~ finite(sk0_201)
| spl0_397 ),
inference(component_clause,[status(thm)],[f11476]) ).
fof(f11479,plain,
( spl0_398
<=> finite(sk0_200) ),
introduced(split_symbol_definition) ).
fof(f11480,plain,
( finite(sk0_200)
| ~ spl0_398 ),
inference(component_clause,[status(thm)],[f11479]) ).
fof(f11482,plain,
( ~ finite(sk0_201)
| finite(sk0_200) ),
inference(resolution,[status(thm)],[f9965,f1500]) ).
fof(f11483,plain,
( ~ spl0_397
| spl0_398 ),
inference(split_clause,[status(thm)],[f11482,f11476,f11479]) ).
fof(f11529,plain,
( $false
| spl0_397 ),
inference(forward_subsumption_resolution,[status(thm)],[f11478,f1501]) ).
fof(f11530,plain,
spl0_397,
inference(contradiction_clause,[status(thm)],[f11529]) ).
fof(f11531,plain,
( $false
| ~ spl0_398 ),
inference(forward_subsumption_resolution,[status(thm)],[f11480,f1502]) ).
fof(f11532,plain,
~ spl0_398,
inference(contradiction_clause,[status(thm)],[f11531]) ).
fof(f11533,plain,
$false,
inference(sat_refutation,[status(thm)],[f11483,f11530,f11532]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU294+2 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Apr 29 20:05:58 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.39 % Drodi V3.6.0
% 13.30/2.14 % Refutation found
% 13.30/2.14 % SZS status Theorem for theBenchmark: Theorem is valid
% 13.30/2.14 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 13.30/2.16 % Elapsed time: 1.793149 seconds
% 13.30/2.16 % CPU time: 13.894012 seconds
% 13.30/2.16 % Total memory used: 174.413 MB
% 13.30/2.16 % Net memory used: 168.802 MB
%------------------------------------------------------------------------------