%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SET627+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n005.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:32:57 AM UTC 2026
% Result : Theorem 9.35s 2.49s
% Output : CNFRefutation 9.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 8 unt; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 2 |; 1 &)
% ( 2 <=>; 0 =>; 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 : 14 ( 2 sgn 7 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(empty_set_defn,axiom,
! [X0] : ~ member(X0,'empty$uset') ).
fof(intersect_defn,axiom,
! [X0,X1] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X1)
& member(X2,X0) ) ) ).
fof(disjoint_defn,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> ~ intersect(X0,X1) ) ).
fof(prove_th104,conjecture,
! [X0] : disjoint(X0,'empty$uset') ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0] : disjoint(X0,'empty$uset'),
inference(negate_conjecture,[status(cth)],[prove_th104]) ).
cnf(c0,plain,
~ member(X0,'empty$uset'),
inference(clausification,[status(esa)],[empty_set_defn]) ).
cnf(c2,plain,
( member(sK3(X0,X1),X1)
| ~ intersect(X0,X1) ),
inference(clausification,[status(esa)],[intersect_defn]) ).
cnf(c5,plain,
( intersect(X0,X1)
| disjoint(X0,X1) ),
inference(clausification,[status(esa)],[disjoint_defn]) ).
cnf(c9,plain,
~ disjoint(sK12,'empty$uset'),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
intersect(sK12,'empty$uset'),
inference(resolution,[status(thm)],[c5,c9]) ).
cnf(d1,plain,
~ intersect(X0,'empty$uset'),
inference(resolution,[status(thm)],[c2,c0]) ).
cnf(d2,plain,
$false,
inference(resolution,[status(thm)],[d1,d0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET627+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.03 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n005.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 26 08:01:47 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.35/2.49 % SZS status Theorem for theBenchmark.p
% 9.35/2.49 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------