%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SEU122+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n012.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:40:55 AM UTC 2026
% Result : Theorem 8.80s 1.60s
% Output : CNFRefutation 8.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 7 unt; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 7 ~; 3 |; 1 &)
% ( 1 <=>; 1 =>; 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-2 aty)
% Number of variables : 13 ( 2 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d3_tarski,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ) ).
fof(fc1_xboole_0,axiom,
empty('empty$uset') ).
fof(t7_boole,axiom,
! [X0,X1] :
~ ( empty(X1)
& in(X0,X1) ) ).
fof(t2_xboole_1,conjecture,
! [X0] : subset('empty$uset',X0) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0] : subset('empty$uset',X0),
inference(negate_conjecture,[status(cth)],[t2_xboole_1]) ).
cnf(c2,plain,
( in(sK5(X0,X1),X0)
| subset(X0,X1) ),
inference(clausification,[status(esa)],[d3_tarski]) ).
cnf(c4,plain,
empty('empty$uset'),
inference(clausification,[status(esa)],[fc1_xboole_0]) ).
cnf(c9,plain,
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(clausification,[status(esa)],[t7_boole]) ).
cnf(c11,plain,
~ subset('empty$uset',sK15),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( subset(X0,X1)
| ~ empty(X0) ),
inference(resolution,[status(thm)],[c9,c2]) ).
cnf(d1,plain,
~ empty('empty$uset'),
inference(resolution,[status(thm)],[d0,c11]) ).
cnf(d2,plain,
$false,
inference(resolution,[status(thm)],[c4,d1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU122+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.02 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Sat Sep 26 08:37:19 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.80/1.60 % SZS status Theorem for theBenchmark.p
% 8.80/1.60 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------