TSTP Solution File: SEU116+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SEU116+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n004.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:02 EDT 2024
% Result : Theorem 0.20s 0.36s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 4 unt; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 8 ~; 3 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 16 ( 12 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f21,axiom,
! [A,B] :
( element(B,finite_subsets(A))
=> finite(B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f31,conjecture,
! [A,B] :
( element(B,finite_subsets(A))
=> finite(B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f32,negated_conjecture,
~ ! [A,B] :
( element(B,finite_subsets(A))
=> finite(B) ),
inference(negated_conjecture,[status(cth)],[f31]) ).
fof(f83,plain,
! [A,B] :
( ~ element(B,finite_subsets(A))
| finite(B) ),
inference(pre_NNF_transformation,[status(esa)],[f21]) ).
fof(f84,plain,
! [B] :
( ! [A] : ~ element(B,finite_subsets(A))
| finite(B) ),
inference(miniscoping,[status(esa)],[f83]) ).
fof(f85,plain,
! [X0,X1] :
( ~ element(X0,finite_subsets(X1))
| finite(X0) ),
inference(cnf_transformation,[status(esa)],[f84]) ).
fof(f127,plain,
? [A,B] :
( element(B,finite_subsets(A))
& ~ finite(B) ),
inference(pre_NNF_transformation,[status(esa)],[f32]) ).
fof(f128,plain,
? [B] :
( ? [A] : element(B,finite_subsets(A))
& ~ finite(B) ),
inference(miniscoping,[status(esa)],[f127]) ).
fof(f129,plain,
( element(sk0_10,finite_subsets(sk0_11))
& ~ finite(sk0_10) ),
inference(skolemization,[status(esa)],[f128]) ).
fof(f130,plain,
element(sk0_10,finite_subsets(sk0_11)),
inference(cnf_transformation,[status(esa)],[f129]) ).
fof(f131,plain,
~ finite(sk0_10),
inference(cnf_transformation,[status(esa)],[f129]) ).
fof(f132,plain,
finite(sk0_10),
inference(resolution,[status(thm)],[f85,f130]) ).
fof(f133,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f132,f131]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU116+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.33 % Computer : n004.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Apr 29 19:39:03 EDT 2024
% 0.11/0.34 % CPUTime :
% 0.20/0.35 % Drodi V3.6.0
% 0.20/0.36 % Refutation found
% 0.20/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.39 % Elapsed time: 0.032009 seconds
% 0.20/0.39 % CPU time: 0.017772 seconds
% 0.20/0.39 % Total memory used: 1.604 MB
% 0.20/0.39 % Net memory used: 1.602 MB
%------------------------------------------------------------------------------