%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SEU141+1 : 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 : 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:40:59 AM UTC 2026
% Result : Theorem 10.35s 3.80s
% Output : CNFRefutation 10.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU141+1 : 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.09/0.37 % Computer : n003.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % 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:41:39 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.35/3.80 % SZS status Theorem for theBenchmark.p
% 10.35/3.80 % SZS output start CNFRefutation for theBenchmark.p
% 10.35/3.80 fof(commutativity_k3_xboole_0, axiom, ! [X0] : ! [X1] : 'set$uintersection2'(X0,X1) = 'set$uintersection2'(X1,X0)).
% 10.35/3.80 fof(d3_xboole_0, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'set$uintersection2'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (in(X3,X0) & in(X3,X1))))))).
% 10.35/3.80 fof(d4_xboole_0, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'set$udifference'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (in(X3,X0) & ~in(X3,X1))))))).
% 10.35/3.80 fof(d7_xboole_0, axiom, ! [X0] : ! [X1] : ((disjoint(X0,X1) <=> 'set$uintersection2'(X0,X1) = 'empty$uset'))).
% 10.35/3.80 fof(fc1_xboole_0, axiom, empty('empty$uset')).
% 10.35/3.80 fof(idempotence_k3_xboole_0, axiom, ! [X0] : ! [X1] : 'set$uintersection2'(X0,X0) = X0).
% 10.35/3.80 fof(symmetry_r1_xboole_0, axiom, ! [X0] : ! [X1] : ((disjoint(X0,X1) => disjoint(X1,X0)))).
% 10.35/3.80 fof(t2_boole, axiom, ! [X0] : 'set$uintersection2'(X0,'empty$uset') = 'empty$uset').
% 10.35/3.80 fof(t3_boole, axiom, ! [X0] : 'set$udifference'(X0,'empty$uset') = X0).
% 10.35/3.80 fof(t4_xboole_0, axiom, ! [X0] : ! [X1] : ((~((~disjoint(X0,X1) & ! [X2] : ~in(X2,'set$uintersection2'(X0,X1)))) & ~((? [X2] : in(X2,'set$uintersection2'(X0,X1)) & disjoint(X0,X1)))))).
% 10.35/3.80 fof(t7_boole, axiom, ! [X0] : ! [X1] : ~((in(X0,X1) & empty(X1)))).
% 10.35/3.80 fof(t83_xboole_1, conjecture, ! [X0] : ! [X1] : ((disjoint(X0,X1) <=> 'set$udifference'(X0,X1) = X0))).
% 10.35/3.80 fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : ((disjoint(X0,X1) <=> 'set$udifference'(X0,X1) = X0)), inference(negate_conjecture, [status(cth)], [t83_xboole_1])).
% 10.35/3.80 cnf(c1, plain, 'set$uintersection2'(X0,X1) = 'set$uintersection2'(X1,X0), inference(clausification, [status(esa)], [commutativity_k3_xboole_0])).
% 10.35/3.80 cnf(c8, plain, X0 != 'set$uintersection2'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d3_xboole_0])).
% 10.35/3.80 cnf(c9, plain, X0 = 'set$uintersection2'(X1,X2) | ~X3(X1,X2,X0), inference(clausification, [status(esa)], [d3_xboole_0])).
% 10.35/3.80 cnf(c12, plain, ~X0(X1,X2,X3) | in(X4,X3) | ~in(X4,X1) | ~in(X4,X2), inference(clausification, [status(esa)], [d3_xboole_0])).
% 10.35/3.80 cnf(c14, plain, X0(X1,X2,X3) | in(sK15(X1,X2,X3),X3) | in(sK15(X1,X2,X3),X1), inference(clausification, [status(esa)], [d3_xboole_0])).
% 10.35/3.80 cnf(c15, plain, X0(X1,X2,X3) | in(sK15(X1,X2,X3),X3) | in(sK15(X1,X2,X3),X2), inference(clausification, [status(esa)], [d3_xboole_0])).
% 10.35/3.80 cnf(c19, plain, X0 != 'set$udifference'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d4_xboole_0])).
% 10.35/3.80 cnf(c20, plain, X0 = 'set$udifference'(X1,X2) | ~X3(X1,X2,X0), inference(clausification, [status(esa)], [d4_xboole_0])).
% 10.35/3.80 cnf(c22, plain, ~X0(X1,X2,X3) | ~in(X4,X3) | ~in(X4,X2), inference(clausification, [status(esa)], [d4_xboole_0])).
% 10.35/3.80 cnf(c25, plain, X0(X1,X2,X3) | in(sK21(X1,X2,X3),X3) | in(sK21(X1,X2,X3),X1), inference(clausification, [status(esa)], [d4_xboole_0])).
% 10.35/3.80 cnf(c27, plain, X0(X1,X2,X3) | ~in(sK21(X1,X2,X3),X1) | in(sK21(X1,X2,X3),X2) | ~in(sK21(X1,X2,X3),X3), inference(clausification, [status(esa)], [d4_xboole_0])).
% 10.35/3.80 cnf(c30, plain, ~disjoint(X0,X1) | 'set$uintersection2'(X0,X1) = 'empty$uset', inference(clausification, [status(esa)], [d7_xboole_0])).
% 10.35/3.80 cnf(c31, plain, disjoint(X0,X1) | 'set$uintersection2'(X0,X1) != 'empty$uset', inference(clausification, [status(esa)], [d7_xboole_0])).
% 10.35/3.80 cnf(c32, plain, empty('empty$uset'), inference(clausification, [status(esa)], [fc1_xboole_0])).
% 10.35/3.80 cnf(c33, plain, 'set$uintersection2'(X0,X0) = X0, inference(clausification, [status(esa)], [idempotence_k3_xboole_0])).
% 10.35/3.80 cnf(c37, plain, ~disjoint(X0,X1) | disjoint(X1,X0), inference(clausification, [status(esa)], [symmetry_r1_xboole_0])).
% 10.35/3.80 cnf(c38, plain, 'set$uintersection2'(X0,'empty$uset') = 'empty$uset', inference(clausification, [status(esa)], [t2_boole])).
% 10.35/3.80 cnf(c39, plain, 'set$udifference'(X0,'empty$uset') = X0, inference(clausification, [status(esa)], [t3_boole])).
% 10.35/3.80 cnf(c41, plain, disjoint(X0,X1) | in(sK37(X0,X1),'set$uintersection2'(X0,X1)), inference(clausification, [status(esa)], [t4_xboole_0])).
% 10.35/3.80 cnf(c44, plain, ~in(X0,X1) | ~empty(X1), inference(clausification, [status(esa)], [t7_boole])).
% 10.35/3.80 cnf(c47, plain, disjoint(sK44,sK45) | 'set$udifference'(sK44,sK45) = sK44, inference(clausification, [status(esa)], [negated_conjecture])).
% 10.35/3.80 cnf(c48, plain, 'set$udifference'(sK44,sK45) != sK44 | ~disjoint(sK44,sK45), inference(clausification, [status(esa)], [negated_conjecture])).
% 10.35/3.80 cnf(d0, plain, in(sK21(X0,X1,X0),X0) | 'Ts16'(X0,X1,X0), inference(factoring, [status(thm)], [c25])).
% 10.35/3.80 cnf(d1, plain, 'Ts10'(X0,X1,'set$uintersection2'(X0,X1)), inference(equality_resolution, [status(thm)], [c8])).
% 10.35/3.80 cnf(d2, plain, in(X0,'set$uintersection2'(X1,X2)) | ~in(X0,X1) | ~in(X0,X2), inference(resolution, [status(thm)], [d1,c12])).
% 10.35/3.80 cnf(d3, plain, in(sK15(X0,X1,X2),X1) | 'Ts10'(X0,X1,X2) | ~empty(X2), inference(resolution, [status(thm)], [c15,c44])).
% 10.35/3.80 cnf(d4, plain, 'set$uintersection2'(sK44,sK45) = 'empty$uset' | 'set$udifference'(sK44,sK45) = sK44, inference(resolution, [status(thm)], [c30,c47])).
% 10.35/3.80 cnf(d5, plain, X0 != sK44 | 'Ts16'(sK44,sK45,X0) | 'set$uintersection2'(sK44,sK45) = 'empty$uset', inference(superposition, [status(thm)], [d4,c19])).
% 10.35/3.80 cnf(d6, plain, 'set$uintersection2'(sK44,sK45) = 'empty$uset' | 'Ts16'(sK44,sK45,sK44), inference(equality_resolution, [status(thm)], [d5])).
% 10.35/3.80 cnf(d7, plain, 'set$uintersection2'(sK44,sK45) = 'empty$uset' | ~in(X0,sK44) | ~in(X0,sK45), inference(resolution, [status(thm)], [d6,c22])).
% 10.35/3.80 cnf(d8, plain, in(sK15(X0,X1,X2),X0) | 'Ts10'(X0,X1,X2) | ~empty(X2), inference(resolution, [status(thm)], [c14,c44])).
% 10.35/3.80 cnf(d9, plain, 'Ts10'(sK45,X0,X1) | ~empty(X1) | 'set$uintersection2'(sK44,sK45) = 'empty$uset' | ~in(sK15(sK45,X0,X1),sK44), inference(resolution, [status(thm)], [d8,d7])).
% 10.35/3.80 cnf(d10, plain, 'set$uintersection2'(sK44,sK45) = 'empty$uset' | 'Ts10'(sK45,sK44,X0) | ~empty(X0) | 'Ts10'(sK45,sK44,X0) | ~empty(X0), inference(resolution, [status(thm)], [d9,d3])).
% 10.35/3.80 cnf(d11, plain, 'set$uintersection2'(sK44,sK45) = 'empty$uset' | ~empty(X0) | X0 = 'set$uintersection2'(sK45,sK44), inference(resolution, [status(thm)], [d10,c9])).
% 10.35/3.80 cnf(d12, plain, X0 = 'set$uintersection2'(sK44,sK45) | 'set$uintersection2'(sK44,sK45) = 'empty$uset' | ~empty(X0), inference(demodulation, [status(thm)], [d11,c1])).
% 10.35/3.80 cnf(d13, plain, 'empty$uset' = 'set$uintersection2'(sK44,sK45) | 'set$uintersection2'(sK44,sK45) = 'empty$uset', inference(resolution, [status(thm)], [d12,c32])).
% 10.35/3.80 cnf(d14, plain, 'empty$uset' != 'empty$uset' | 'empty$uset' = 'set$uintersection2'(sK44,sK45), inference(equality_factoring, [status(thm)], [d13])).
% 10.35/3.80 cnf(d15, plain, 'empty$uset' = 'set$uintersection2'('empty$uset',X0), inference(superposition, [status(thm)], [c38,c1])).
% 10.35/3.80 cnf(d16, plain, X0 != 'empty$uset' | disjoint(X0,X0), inference(superposition, [status(thm)], [c33,c31])).
% 10.35/3.80 cnf(d17, plain, disjoint(X0,X0) | X0 != 'empty$uset', inference(resolution, [status(thm)], [c37,d16])).
% 10.35/3.80 cnf(d18, plain, disjoint('empty$uset','empty$uset'), inference(equality_resolution, [status(thm)], [d17])).
% 10.35/3.80 cnf(d19, plain, 'set$uintersection2'('empty$uset','empty$uset') = 'empty$uset', inference(resolution, [status(thm)], [d18,c30])).
% 10.35/3.80 cnf(d20, plain, 'empty$uset' = 'empty$uset', inference(demodulation, [status(thm)], [d19,d15])).
% 10.35/3.80 cnf(d21, plain, 'empty$uset' = 'set$uintersection2'(sK44,sK45), inference(resolution, [status(thm)], [d20,d14])).
% 10.35/3.80 cnf(d22, plain, in(X0,'empty$uset') | ~in(X0,sK45) | ~in(X0,sK44), inference(superposition, [status(thm)], [d21,d2])).
% 10.35/3.80 cnf(d23, plain, X1 != X0 | 'Ts16'(X0,'empty$uset',X1), inference(superposition, [status(thm)], [c39,c19])).
% 10.35/3.80 cnf(d24, plain, 'Ts16'(X0,'empty$uset',X0), inference(equality_resolution, [status(thm)], [d23])).
% 10.35/3.80 cnf(d25, plain, ~in(X0,X1) | ~in(X0,'empty$uset'), inference(resolution, [status(thm)], [d24,c22])).
% 10.35/3.80 cnf(d26, plain, ~in(X0,'empty$uset'), inference(factoring, [status(thm)], [d25])).
% 10.35/3.80 cnf(d27, plain, ~in(X0,sK44) | ~in(X0,sK45), inference(resolution, [status(thm)], [d26,d22])).
% 10.35/3.80 cnf(d28, plain, 'Ts16'(X0,X1,X0) | ~in(sK21(X0,X1,X0),X0) | in(sK21(X0,X1,X0),X1) | 'Ts16'(X0,X1,X0), inference(resolution, [status(thm)], [d0,c27])).
% 10.35/3.80 cnf(d29, plain, 'Ts16'(X0,X1,X0) | in(sK21(X0,X1,X0),X1) | 'Ts16'(X0,X1,X0), inference(resolution, [status(thm)], [d0,d28])).
% 10.35/3.80 cnf(d30, plain, 'Ts16'(X0,sK45,X0) | ~in(sK21(X0,sK45,X0),sK44), inference(resolution, [status(thm)], [d29,d27])).
% 10.35/3.80 cnf(d31, plain, 'Ts16'(sK44,sK45,sK44) | 'Ts16'(sK44,sK45,sK44), inference(resolution, [status(thm)], [d30,d0])).
% 10.35/3.80 cnf(d32, plain, sK44 = 'set$udifference'(sK44,sK45), inference(resolution, [status(thm)], [d31,c20])).
% 10.35/3.80 cnf(d33, plain, disjoint(X0,X1) | ~empty('set$uintersection2'(X0,X1)), inference(resolution, [status(thm)], [c41,c44])).
% 10.35/3.80 cnf(d34, plain, ~empty('empty$uset') | disjoint(sK44,sK45), inference(superposition, [status(thm)], [d21,d33])).
% 10.35/3.80 cnf(d35, plain, disjoint(sK44,sK45), inference(resolution, [status(thm)], [c32,d34])).
% 10.35/3.80 cnf(d36, plain, 'set$udifference'(sK44,sK45) != sK44, inference(resolution, [status(thm)], [d35,c48])).
% 10.35/3.80 cnf(d37, plain, sK44 != sK44, inference(demodulation, [status(thm)], [d36,d32])).
% 10.35/3.80 cnf(d38, plain, $false, inference(equality_resolution, [status(thm)], [d37])).
% 10.35/3.80 % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------