%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SET019+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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:31:37 AM UTC 2026
% Result : Theorem 8.50s 1.80s
% Output : CNFRefutation 8.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 5 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 5 ~; 3 |; 3 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 8 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(equal_set,axiom,
! [X0,X1] :
( 'equal$uset'(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ) ).
fof(thI02,conjecture,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> 'equal$uset'(X0,X1) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> 'equal$uset'(X0,X1) ),
inference(negate_conjecture,[status(cth)],[thI02]) ).
cnf(c5,plain,
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| 'equal$uset'(X0,X1) ),
inference(clausification,[status(esa)],[equal_set]) ).
cnf(c29,plain,
subset(sK31,sK32),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c30,plain,
subset(sK32,sK31),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c31,plain,
~ 'equal$uset'(sK31,sK32),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( 'equal$uset'(sK31,sK32)
| ~ subset(sK32,sK31) ),
inference(resolution,[status(thm)],[c5,c29]) ).
cnf(d1,plain,
'equal$uset'(sK31,sK32),
inference(resolution,[status(thm)],[c30,d0]) ).
cnf(d2,plain,
$false,
inference(resolution,[status(thm)],[c31,d1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET019+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n003.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 26 06:54:08 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.50/1.80 % SZS status Theorem for theBenchmark.p
% 8.50/1.80 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------