%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SEU162+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n005.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:41:06 AM UTC 2026
% Result : Theorem 21.12s 4.89s
% Output : CNFRefutation 21.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU162+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n005.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.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 08:42:32 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 21.12/4.89 % SZS status Theorem for theBenchmark.p
% 21.12/4.89 % SZS output start CNFRefutation for theBenchmark.p
% 21.12/4.89 fof(commutativity_k2_xboole_0, axiom, ! [X0] : ! [X1] : 'set$uunion2'(X0,X1) = 'set$uunion2'(X1,X0)).
% 21.12/4.89 fof(commutativity_k3_xboole_0, axiom, ! [X0] : ! [X1] : 'set$uintersection2'(X0,X1) = 'set$uintersection2'(X1,X0)).
% 21.12/4.89 fof(d4_xboole_0, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'set$udifference'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (in(X3,X0) & ~in(X3,X1))))))).
% 21.12/4.89 fof(d7_xboole_0, axiom, ! [X0] : ! [X1] : ((disjoint(X0,X1) <=> 'set$uintersection2'(X0,X1) = 'empty$uset'))).
% 21.12/4.89 fof(idempotence_k2_xboole_0, axiom, ! [X0] : ! [X1] : 'set$uunion2'(X0,X0) = X0).
% 21.12/4.89 fof(l25_zfmisc_1, lemma, ! [X0] : ! [X1] : ~((disjoint(singleton(X0),X1) & in(X0,X1)))).
% 21.12/4.89 fof(l28_zfmisc_1, lemma, ! [X0] : ! [X1] : ((~in(X0,X1) => disjoint(singleton(X0),X1)))).
% 21.12/4.89 fof(symmetry_r1_xboole_0, axiom, ! [X0] : ! [X1] : ((disjoint(X0,X1) => disjoint(X1,X0)))).
% 21.12/4.89 fof(t12_xboole_1, lemma, ! [X0] : ! [X1] : ((subset(X0,X1) => 'set$uunion2'(X0,X1) = X1))).
% 21.12/4.89 fof(t36_xboole_1, lemma, ! [X0] : ! [X1] : subset('set$udifference'(X0,X1),X0)).
% 21.12/4.89 fof(t83_xboole_1, lemma, ! [X0] : ! [X1] : ((disjoint(X0,X1) <=> 'set$udifference'(X0,X1) = X0))).
% 21.12/4.89 fof(t65_zfmisc_1, conjecture, ! [X0] : ! [X1] : (('set$udifference'(X0,singleton(X1)) = X0 <=> ~in(X1,X0)))).
% 21.12/4.89 fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : (('set$udifference'(X0,singleton(X1)) = X0 <=> ~in(X1,X0))), inference(negate_conjecture, [status(cth)], [t65_zfmisc_1])).
% 21.12/4.89 cnf(c3, plain, 'set$uunion2'(X0,X1) = 'set$uunion2'(X1,X0), inference(clausification, [status(esa)], [commutativity_k2_xboole_0])).
% 21.12/4.89 cnf(c4, plain, 'set$uintersection2'(X0,X1) = 'set$uintersection2'(X1,X0), inference(clausification, [status(esa)], [commutativity_k3_xboole_0])).
% 21.12/4.89 cnf(c83, plain, X0 != 'set$udifference'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d4_xboole_0])).
% 21.12/4.89 cnf(c84, plain, X0 = 'set$udifference'(X1,X2) | ~X3(X1,X2,X0), inference(clausification, [status(esa)], [d4_xboole_0])).
% 21.12/4.89 cnf(c95, plain, ~disjoint(X0,X1) | 'set$uintersection2'(X0,X1) = 'empty$uset', inference(clausification, [status(esa)], [d7_xboole_0])).
% 21.12/4.89 cnf(c96, plain, disjoint(X0,X1) | 'set$uintersection2'(X0,X1) != 'empty$uset', inference(clausification, [status(esa)], [d7_xboole_0])).
% 21.12/4.89 cnf(c104, plain, 'set$uunion2'(X0,X0) = X0, inference(clausification, [status(esa)], [idempotence_k2_xboole_0])).
% 21.12/4.89 cnf(c109, plain, ~disjoint(singleton(X0),X1) | ~in(X0,X1), inference(clausification, [status(esa)], [l25_zfmisc_1])).
% 21.12/4.89 cnf(c110, plain, in(X0,X1) | disjoint(singleton(X0),X1), inference(clausification, [status(esa)], [l28_zfmisc_1])).
% 21.12/4.89 cnf(c126, plain, ~disjoint(X0,X1) | disjoint(X1,X0), inference(clausification, [status(esa)], [symmetry_r1_xboole_0])).
% 21.12/4.89 cnf(c128, plain, ~subset(X0,X1) | 'set$uunion2'(X0,X1) = X1, inference(clausification, [status(esa)], [t12_xboole_1])).
% 21.12/4.89 cnf(c145, plain, subset('set$udifference'(X0,X1),X0), inference(clausification, [status(esa)], [t36_xboole_1])).
% 21.12/4.89 cnf(c176, plain, ~disjoint(X0,X1) | 'set$udifference'(X0,X1) = X0, inference(clausification, [status(esa)], [t83_xboole_1])).
% 21.12/4.89 cnf(c177, plain, disjoint(X0,X1) | 'set$udifference'(X0,X1) != X0, inference(clausification, [status(esa)], [t83_xboole_1])).
% 21.12/4.89 cnf(c183, plain, 'set$udifference'(sK210,singleton(sK211)) = sK210 | ~in(sK211,sK210), inference(clausification, [status(esa)], [negated_conjecture])).
% 21.12/4.89 cnf(c184, plain, in(sK211,sK210) | 'set$udifference'(sK210,singleton(sK211)) != sK210, inference(clausification, [status(esa)], [negated_conjecture])).
% 21.12/4.89 cnf(d0, plain, in(X0,X1) | 'set$uintersection2'(singleton(X0),X1) = 'empty$uset', inference(resolution, [status(thm)], [c110,c95])).
% 21.12/4.89 cnf(d1, plain, 'set$uintersection2'(singleton(sK211),sK210) = 'empty$uset' | 'set$udifference'(sK210,singleton(sK211)) = sK210, inference(resolution, [status(thm)], [d0,c183])).
% 21.12/4.89 cnf(d2, plain, 'set$uintersection2'(sK210,singleton(sK211)) = 'empty$uset' | 'set$udifference'(sK210,singleton(sK211)) = sK210, inference(demodulation, [status(thm)], [d1,c4])).
% 21.12/4.89 cnf(d3, plain, 'empty$uset' != 'empty$uset' | disjoint(sK210,singleton(sK211)) | 'set$udifference'(sK210,singleton(sK211)) = sK210, inference(superposition, [status(thm)], [d2,c96])).
% 21.12/4.89 cnf(d4, plain, 'set$udifference'(sK210,singleton(sK211)) = sK210 | disjoint(sK210,singleton(sK211)), inference(equality_resolution, [status(thm)], [d3])).
% 21.12/4.89 cnf(d5, plain, 'set$udifference'(sK210,singleton(sK211)) = sK210 | 'set$udifference'(sK210,singleton(sK211)) = sK210, inference(resolution, [status(thm)], [d4,c176])).
% 21.12/4.89 cnf(d6, plain, sK210 != sK210 | disjoint(sK210,singleton(sK211)), inference(superposition, [status(thm)], [d5,c177])).
% 21.12/4.89 cnf(d7, plain, 'set$uunion2'('set$udifference'(X0,X1),X0) = X0, inference(resolution, [status(thm)], [c128,c145])).
% 21.12/4.89 cnf(d8, plain, 'set$uunion2'(X0,'set$udifference'(X0,X1)) = X0, inference(demodulation, [status(thm)], [d7,c3])).
% 21.12/4.89 cnf(d9, plain, 'Ts68'(X0,X1,'set$udifference'(X0,X1)), inference(equality_resolution, [status(thm)], [c83])).
% 21.12/4.89 cnf(d10, plain, 'Ts68'(sK210,singleton(sK211),sK210), inference(superposition, [status(thm)], [d5,d9])).
% 21.12/4.89 cnf(d11, plain, sK210 = 'set$udifference'(sK210,singleton(sK211)), inference(resolution, [status(thm)], [d10,c84])).
% 21.12/4.89 cnf(d12, plain, 'set$uunion2'(sK210,sK210) = sK210, inference(superposition, [status(thm)], [d11,d8])).
% 21.12/4.89 cnf(d13, plain, sK210 = sK210, inference(demodulation, [status(thm)], [d12,c104])).
% 21.12/4.89 cnf(d14, plain, disjoint(sK210,singleton(sK211)), inference(resolution, [status(thm)], [d13,d6])).
% 21.12/4.89 cnf(d15, plain, disjoint(singleton(sK211),sK210), inference(resolution, [status(thm)], [d14,c126])).
% 21.12/4.89 cnf(d16, plain, ~in(sK211,sK210), inference(resolution, [status(thm)], [d15,c109])).
% 21.12/4.89 cnf(d17, plain, in(sK211,sK210), inference(resolution, [status(thm)], [d5,c184])).
% 21.12/4.89 cnf(d18, plain, $false, inference(resolution, [status(thm)], [d17,d16])).
% 21.12/4.89 % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------