%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SET599+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 : 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:32:51 AM UTC 2026
% Result : Theorem 6.97s 1.73s
% Output : CNFRefutation 6.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 9 unt; 0 def)
% Number of atoms : 9 ( 2 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 14 ( 1 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(symmetric_difference_defn,axiom,
! [X0,X1] : 'symmetric$udifference'(X0,X1) = union(difference(X0,X1),difference(X1,X0)) ).
fof(subset_of_union,axiom,
! [X0,X1] : subset(X0,union(X0,X1)) ).
fof(prove_th58,conjecture,
! [X0,X1] : subset(difference(X0,X1),'symmetric$udifference'(X0,X1)) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0,X1] : subset(difference(X0,X1),'symmetric$udifference'(X0,X1)),
inference(negate_conjecture,[status(cth)],[prove_th58]) ).
cnf(c0,plain,
'symmetric$udifference'(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
inference(clausification,[status(esa)],[symmetric_difference_defn]) ).
cnf(c1,plain,
subset(X0,union(X0,X1)),
inference(clausification,[status(esa)],[subset_of_union]) ).
cnf(c17,plain,
~ subset(difference(sK20,sK21),'symmetric$udifference'(sK20,sK21)),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
subset(difference(X0,X1),'symmetric$udifference'(X0,X1)),
inference(superposition,[status(thm)],[c0,c1]) ).
cnf(d1,plain,
$false,
inference(resolution,[status(thm)],[d0,c17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET599+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n003.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sat Sep 26 08:00:24 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.97/1.73 % SZS status Theorem for theBenchmark.p
% 6.97/1.73 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------