%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SEU294+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:41:34 AM UTC 2026
% Result : Theorem 14.05s 2.80s
% Output : CNFRefutation 14.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 21 ( 8 ~; 6 |; 2 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 14 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cc2_finset_1,axiom,
! [X0] :
( finite(X0)
=> ! [X1] :
( element(X1,powerset(X0))
=> finite(X1) ) ) ).
fof(t3_subset,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ) ).
fof(t13_finset_1,conjecture,
! [X0,X1] :
( ( finite(X1)
& subset(X0,X1) )
=> finite(X0) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0,X1] :
( ( finite(X1)
& subset(X0,X1) )
=> finite(X0) ),
inference(negate_conjecture,[status(cth)],[t13_finset_1]) ).
cnf(c13,plain,
( finite(X1)
| ~ element(X1,powerset(X0))
| ~ finite(X0) ),
inference(clausification,[status(esa)],[cc2_finset_1]) ).
cnf(c131,plain,
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(clausification,[status(esa)],[t3_subset]) ).
cnf(c137,plain,
subset(sK66,sK67),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c138,plain,
finite(sK67),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c139,plain,
~ finite(sK66),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( finite(X0)
| ~ finite(X1)
| ~ subset(X0,X1) ),
inference(resolution,[status(thm)],[c131,c13]) ).
cnf(d1,plain,
( finite(sK66)
| ~ finite(sK67) ),
inference(resolution,[status(thm)],[d0,c137]) ).
cnf(d2,plain,
finite(sK66),
inference(resolution,[status(thm)],[c138,d1]) ).
cnf(d3,plain,
$false,
inference(resolution,[status(thm)],[c139,d2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU294+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.37 % Computer : n004.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sat Sep 26 09:06:51 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.05/2.80 % SZS status Theorem for theBenchmark.p
% 14.05/2.80 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------