%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SET631+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 : n018.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.62s 1.62s
% Output : CNFRefutation 9.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 32 ( 14 ~; 11 |; 2 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 35 ( 1 sgn 13 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(difference_defn,axiom,
! [X0,X1,X2] :
( member(X2,difference(X0,X1))
<=> ( ~ member(X2,X1)
& member(X2,X0) ) ) ).
fof(intersect_defn,axiom,
! [X0,X1] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X1)
& member(X2,X0) ) ) ).
fof(symmetry_of_intersect,axiom,
! [X0,X1] :
( intersect(X0,X1)
=> intersect(X1,X0) ) ).
fof(prove_th113,conjecture,
! [X0,X1,X2] :
( intersect(X0,difference(X1,X2))
=> intersect(X0,X1) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0,X1,X2] :
( intersect(X0,difference(X1,X2))
=> intersect(X0,X1) ),
inference(negate_conjecture,[status(cth)],[prove_th113]) ).
cnf(c0,plain,
( member(X0,X1)
| ~ member(X0,difference(X1,X2)) ),
inference(clausification,[status(esa)],[difference_defn]) ).
cnf(c3,plain,
( member(sK5(X0,X1),X0)
| ~ intersect(X0,X1) ),
inference(clausification,[status(esa)],[intersect_defn]) ).
cnf(c4,plain,
( member(sK5(X0,X1),X1)
| ~ intersect(X0,X1) ),
inference(clausification,[status(esa)],[intersect_defn]) ).
cnf(c5,plain,
( ~ member(X2,X1)
| ~ member(X2,X0)
| intersect(X0,X1) ),
inference(clausification,[status(esa)],[intersect_defn]) ).
cnf(c6,plain,
( intersect(X1,X0)
| ~ intersect(X0,X1) ),
inference(clausification,[status(esa)],[symmetry_of_intersect]) ).
cnf(c7,plain,
intersect(sK9,difference(sK10,sK11)),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c8,plain,
~ intersect(sK9,sK10),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
intersect(difference(sK10,sK11),sK9),
inference(resolution,[status(thm)],[c6,c7]) ).
cnf(d1,plain,
( member(sK5(difference(X0,X1),X2),X0)
| ~ intersect(difference(X0,X1),X2) ),
inference(resolution,[status(thm)],[c3,c0]) ).
cnf(d2,plain,
( ~ intersect(X0,X1)
| intersect(X1,X2)
| ~ member(sK5(X0,X1),X2) ),
inference(resolution,[status(thm)],[c5,c4]) ).
cnf(d3,plain,
( ~ intersect(difference(X1,X2),X0)
| ~ intersect(difference(X1,X2),X0)
| intersect(X0,X1) ),
inference(resolution,[status(thm)],[d2,d1]) ).
cnf(d4,plain,
intersect(sK9,sK10),
inference(resolution,[status(thm)],[d3,d0]) ).
cnf(d5,plain,
$false,
inference(resolution,[status(thm)],[c8,d4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET631+3 : 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.37 % Computer : n018.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 26 08:04:07 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.62/1.62 % SZS status Theorem for theBenchmark.p
% 9.62/1.62 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------