%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SEU141+2 : TPTP v9.3.1. Released v3.3.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:40:59 AM UTC 2026
% Result : Theorem 31.47s 9.43s
% Output : CNFRefutation 31.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU141+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/5.38 % Computer : n015.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Sat Sep 26 08:43:19 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 31.47/9.43 % SZS status Theorem for theBenchmark.p
% 31.47/9.43 % SZS output start CNFRefutation for theBenchmark.p
% 31.47/9.43 fof(commutativity_k2_xboole_0, axiom, ! [X0] : ! [X1] : 'set$uunion2'(X0,X1) = 'set$uunion2'(X1,X0)).
% 31.47/9.43 fof(d3_xboole_0, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'set$uintersection2'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (in(X3,X0) & in(X3,X1))))))).
% 31.47/9.43 fof(d7_xboole_0, axiom, ! [X0] : ! [X1] : ((disjoint(X0,X1) <=> 'set$uintersection2'(X0,X1) = 'empty$uset'))).
% 31.47/9.43 fof(d8_xboole_0, axiom, ! [X0] : ! [X1] : (('proper$usubset'(X0,X1) <=> (subset(X0,X1) & X0 != X1)))).
% 31.47/9.43 fof(fc1_xboole_0, axiom, empty('empty$uset')).
% 31.47/9.43 fof(irreflexivity_r2_xboole_0, axiom, ! [X0] : ! [X1] : ~'proper$usubset'(X0,X0)).
% 31.47/9.43 fof(l32_xboole_1, lemma, ! [X0] : ! [X1] : (('set$udifference'(X0,X1) = 'empty$uset' <=> subset(X0,X1)))).
% 31.47/9.43 fof(reflexivity_r1_tarski, axiom, ! [X0] : ! [X1] : subset(X0,X0)).
% 31.47/9.43 fof(t12_xboole_1, lemma, ! [X0] : ! [X1] : ((subset(X0,X1) => 'set$uunion2'(X0,X1) = X1))).
% 31.47/9.43 fof(t1_boole, axiom, ! [X0] : 'set$uunion2'(X0,'empty$uset') = X0).
% 31.47/9.43 fof(t36_xboole_1, lemma, ! [X0] : ! [X1] : subset('set$udifference'(X0,X1),X0)).
% 31.47/9.43 fof(t39_xboole_1, lemma, ! [X0] : ! [X1] : 'set$uunion2'(X0,'set$udifference'(X1,X0)) = 'set$uunion2'(X0,X1)).
% 31.47/9.43 fof(t48_xboole_1, lemma, ! [X0] : ! [X1] : 'set$udifference'(X0,'set$udifference'(X0,X1)) = 'set$uintersection2'(X0,X1)).
% 31.47/9.43 fof(t4_xboole_0, lemma, ! [X0] : ! [X1] : ((~((~disjoint(X0,X1) & ! [X2] : ~in(X2,'set$uintersection2'(X0,X1)))) & ~((? [X2] : in(X2,'set$uintersection2'(X0,X1)) & disjoint(X0,X1)))))).
% 31.47/9.43 fof(t7_boole, axiom, ! [X0] : ! [X1] : ~((in(X0,X1) & empty(X1)))).
% 31.47/9.43 fof(t83_xboole_1, conjecture, ! [X0] : ! [X1] : ((disjoint(X0,X1) <=> 'set$udifference'(X0,X1) = X0))).
% 31.47/9.43 fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : ((disjoint(X0,X1) <=> 'set$udifference'(X0,X1) = X0)), inference(negate_conjecture, [status(cth)], [t83_xboole_1])).
% 31.47/9.43 cnf(c2, plain, 'set$uunion2'(X0,X1) = 'set$uunion2'(X1,X0), inference(clausification, [status(esa)], [commutativity_k2_xboole_0])).
% 31.47/9.43 cnf(c23, plain, X0 != 'set$uintersection2'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d3_xboole_0])).
% 31.47/9.43 cnf(c24, plain, X0 = 'set$uintersection2'(X1,X2) | ~X3(X1,X2,X0), inference(clausification, [status(esa)], [d3_xboole_0])).
% 31.47/9.43 cnf(c45, plain, ~disjoint(X0,X1) | 'set$uintersection2'(X0,X1) = 'empty$uset', inference(clausification, [status(esa)], [d7_xboole_0])).
% 31.47/9.43 cnf(c49, plain, 'proper$usubset'(X0,X1) | ~subset(X0,X1) | X0 = X1, inference(clausification, [status(esa)], [d8_xboole_0])).
% 31.47/9.43 cnf(c50, plain, empty('empty$uset'), inference(clausification, [status(esa)], [fc1_xboole_0])).
% 31.47/9.43 cnf(c55, plain, ~'proper$usubset'(X0,X0), inference(clausification, [status(esa)], [irreflexivity_r2_xboole_0])).
% 31.47/9.43 cnf(c57, plain, 'set$udifference'(X0,X1) = 'empty$uset' | ~subset(X0,X1), inference(clausification, [status(esa)], [l32_xboole_1])).
% 31.47/9.43 cnf(c60, plain, subset(X0,X0), inference(clausification, [status(esa)], [reflexivity_r1_tarski])).
% 31.47/9.43 cnf(c62, plain, ~subset(X0,X1) | 'set$uunion2'(X0,X1) = X1, inference(clausification, [status(esa)], [t12_xboole_1])).
% 31.47/9.43 cnf(c65, plain, 'set$uunion2'(X0,'empty$uset') = X0, inference(clausification, [status(esa)], [t1_boole])).
% 31.47/9.43 cnf(c76, plain, subset('set$udifference'(X0,X1),X0), inference(clausification, [status(esa)], [t36_xboole_1])).
% 31.47/9.43 cnf(c79, plain, 'set$uunion2'(X0,'set$udifference'(X1,X0)) = 'set$uunion2'(X0,X1), inference(clausification, [status(esa)], [t39_xboole_1])).
% 31.47/9.43 cnf(c87, plain, 'set$udifference'(X0,'set$udifference'(X0,X1)) = 'set$uintersection2'(X0,X1), inference(clausification, [status(esa)], [t48_xboole_1])).
% 31.47/9.43 cnf(c89, plain, disjoint(X0,X1) | in(sK102(X0,X1),'set$uintersection2'(X0,X1)), inference(clausification, [status(esa)], [t4_xboole_0])).
% 31.47/9.43 cnf(c94, plain, ~in(X0,X1) | ~empty(X1), inference(clausification, [status(esa)], [t7_boole])).
% 31.47/9.43 cnf(c99, plain, disjoint(sK119,sK120) | 'set$udifference'(sK119,sK120) = sK119, inference(clausification, [status(esa)], [negated_conjecture])).
% 31.47/9.43 cnf(c100, plain, 'set$udifference'(sK119,sK120) != sK119 | ~disjoint(sK119,sK120), inference(clausification, [status(esa)], [negated_conjecture])).
% 31.47/9.43 cnf(d0, plain, disjoint(X0,X1) | ~empty('set$uintersection2'(X0,X1)), inference(resolution, [status(thm)], [c89,c94])).
% 31.47/9.43 cnf(d1, plain, 'set$udifference'(X0,X0) = 'empty$uset', inference(resolution, [status(thm)], [c57,c60])).
% 31.47/9.43 cnf(d2, plain, 'set$udifference'(X0,X1) = X0 | 'proper$usubset'('set$udifference'(X0,X1),X0), inference(resolution, [status(thm)], [c49,c76])).
% 31.47/9.43 cnf(d3, plain, 'set$uunion2'('set$udifference'(X0,X1),X0) = X0, inference(resolution, [status(thm)], [c62,c76])).
% 31.47/9.43 cnf(d4, plain, 'set$uunion2'(X0,'set$udifference'(X0,X1)) = X0, inference(demodulation, [status(thm)], [d3,c2])).
% 31.47/9.43 cnf(d5, plain, 'set$uunion2'('set$udifference'(X0,X1),'set$uintersection2'(X0,X1)) = 'set$uunion2'('set$udifference'(X0,X1),X0), inference(superposition, [status(thm)], [c87,c79])).
% 31.47/9.43 cnf(d6, plain, 'set$uunion2'('set$udifference'(X0,X1),'set$uintersection2'(X0,X1)) = 'set$uunion2'(X0,'set$udifference'(X0,X1)), inference(demodulation, [status(thm)], [d5,c2])).
% 31.47/9.43 cnf(d7, plain, 'set$uunion2'('set$udifference'(X0,X1),'set$uintersection2'(X0,X1)) = X0, inference(demodulation, [status(thm)], [d6,d4])).
% 31.47/9.43 cnf(d8, plain, 'set$uintersection2'(sK119,sK120) = 'empty$uset' | 'set$udifference'(sK119,sK120) = sK119, inference(resolution, [status(thm)], [c45,c99])).
% 31.47/9.43 cnf(d9, plain, X0 != 'empty$uset' | 'Ts23'(sK119,sK120,X0) | 'set$udifference'(sK119,sK120) = sK119, inference(superposition, [status(thm)], [d8,c23])).
% 31.47/9.43 cnf(d10, plain, 'set$udifference'(sK119,sK120) = sK119 | 'Ts23'(sK119,sK120,'empty$uset'), inference(equality_resolution, [status(thm)], [d9])).
% 31.47/9.43 cnf(d11, plain, 'set$udifference'(sK119,sK120) = sK119 | 'empty$uset' = 'set$uintersection2'(sK119,sK120), inference(resolution, [status(thm)], [d10,c24])).
% 31.47/9.43 cnf(d12, plain, 'set$uunion2'('set$udifference'(sK119,sK120),'empty$uset') = sK119 | 'set$udifference'(sK119,sK120) = sK119, inference(superposition, [status(thm)], [d11,d7])).
% 31.47/9.43 cnf(d13, plain, 'set$udifference'(sK119,sK120) = sK119 | 'set$udifference'(sK119,sK120) = sK119, inference(demodulation, [status(thm)], [d12,c65])).
% 31.47/9.43 cnf(d14, plain, 'proper$usubset'(sK119,sK119) | 'set$udifference'(sK119,sK120) = sK119 | 'set$udifference'(sK119,sK120) = sK119, inference(superposition, [status(thm)], [d13,d2])).
% 31.47/9.43 cnf(d15, plain, 'set$udifference'(sK119,sK120) = sK119, inference(resolution, [status(thm)], [c55,d14])).
% 31.47/9.43 cnf(d16, plain, 'set$udifference'(sK119,sK119) = 'set$uintersection2'(sK119,sK120), inference(superposition, [status(thm)], [d15,c87])).
% 31.47/9.43 cnf(d17, plain, 'empty$uset' = 'set$uintersection2'(sK119,sK120), inference(demodulation, [status(thm)], [d16,d1])).
% 31.47/9.43 cnf(d18, plain, ~empty('empty$uset') | disjoint(sK119,sK120), inference(superposition, [status(thm)], [d17,d0])).
% 31.47/9.43 cnf(d19, plain, disjoint(sK119,sK120), inference(resolution, [status(thm)], [c50,d18])).
% 31.47/9.43 cnf(d20, plain, ~disjoint(sK119,sK120), inference(resolution, [status(thm)], [d15,c100])).
% 31.47/9.43 cnf(d21, plain, $false, inference(resolution, [status(thm)], [d20,d19])).
% 31.47/9.43 % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------