%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SET183+3 : 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 : n015.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:15 AM UTC 2026
% Result : Theorem 12.17s 1.96s
% Output : CNFRefutation 12.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 10 unt; 0 def)
% Number of atoms : 50 ( 10 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 15 ~; 16 |; 2 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 40 ( 1 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(intersection_defn,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ) ).
fof(intersection_is_subset,axiom,
! [X0,X1] : subset(intersection(X0,X1),X0) ).
fof(subset_defn,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ) ).
fof(equal_defn,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ) ).
fof(commutativity_of_intersection,axiom,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0) ).
fof(prove_subset_intersection,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> intersection(X0,X1) = X0 ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> intersection(X0,X1) = X0 ),
inference(negate_conjecture,[status(cth)],[prove_subset_intersection]) ).
cnf(c2,plain,
( ~ member(X0,X2)
| ~ member(X0,X1)
| member(X0,intersection(X1,X2)) ),
inference(clausification,[status(esa)],[intersection_defn]) ).
cnf(c3,plain,
subset(intersection(X0,X1),X0),
inference(clausification,[status(esa)],[intersection_is_subset]) ).
cnf(c4,plain,
( member(X2,X1)
| ~ member(X2,X0)
| ~ subset(X0,X1) ),
inference(clausification,[status(esa)],[subset_defn]) ).
cnf(c5,plain,
( member(sK8(X0,X1),X0)
| subset(X0,X1) ),
inference(clausification,[status(esa)],[subset_defn]) ).
cnf(c6,plain,
( ~ member(sK8(X0,X1),X1)
| subset(X0,X1) ),
inference(clausification,[status(esa)],[subset_defn]) ).
cnf(c9,plain,
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(clausification,[status(esa)],[equal_defn]) ).
cnf(c10,plain,
intersection(X0,X1) = intersection(X1,X0),
inference(clausification,[status(esa)],[commutativity_of_intersection]) ).
cnf(c18,plain,
subset(sK18,sK19),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c19,plain,
intersection(sK18,sK19) != sK18,
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( ~ subset(X0,intersection(X0,X1))
| X0 = intersection(X0,X1) ),
inference(resolution,[status(thm)],[c9,c3]) ).
cnf(d1,plain,
( ~ member(X0,sK18)
| member(X0,sK19) ),
inference(resolution,[status(thm)],[c4,c18]) ).
cnf(d2,plain,
( member(sK8(sK18,X0),sK19)
| subset(sK18,X0) ),
inference(resolution,[status(thm)],[c5,d1]) ).
cnf(d3,plain,
( ~ member(sK8(X0,intersection(X1,X2)),X2)
| ~ member(sK8(X0,intersection(X1,X2)),X1)
| subset(X0,intersection(X1,X2)) ),
inference(resolution,[status(thm)],[c6,c2]) ).
cnf(d4,plain,
( subset(sK18,intersection(sK19,X0))
| subset(sK18,intersection(sK19,X0))
| ~ member(sK8(sK18,intersection(sK19,X0)),X0) ),
inference(resolution,[status(thm)],[d3,d2]) ).
cnf(d5,plain,
( subset(sK18,intersection(sK19,sK18))
| subset(sK18,intersection(sK19,sK18)) ),
inference(resolution,[status(thm)],[d4,c5]) ).
cnf(d6,plain,
subset(sK18,intersection(sK18,sK19)),
inference(demodulation,[status(thm)],[d5,c10]) ).
cnf(d7,plain,
sK18 = intersection(sK18,sK19),
inference(resolution,[status(thm)],[d6,d0]) ).
cnf(d8,plain,
sK18 != sK18,
inference(demodulation,[status(thm)],[c19,d7]) ).
cnf(d9,plain,
$false,
inference(equality_resolution,[status(thm)],[d8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET183+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.03 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n015.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 07:20:28 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.17/1.96 % SZS status Theorem for theBenchmark.p
% 12.17/1.96 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------