%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SEU171+1 : 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 : n008.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:09 AM UTC 2026
% Result : Theorem 12.30s 12.47s
% Output : CNFRefutation 12.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU171+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/10.64 % Computer : n008.cluster.edu
% 0.15/10.64 % Model : x86_64 x86_64
% 0.15/10.64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/10.64 % Memory : 8046.5625MB
% 0.15/10.64 % OS : Linux 6.8.0-71-generic
% 0.15/10.64 % CPULimit : 300
% 0.15/10.64 % WCLimit : 300
% 0.15/10.64 % DateTime : Sat Sep 26 08:45:24 UTC 2026
% 0.15/10.64 % CPUTime :
% 0.15/10.64 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.30/12.47 % SZS status Theorem for theBenchmark.p
% 12.30/12.47 % SZS output start CNFRefutation for theBenchmark.p
% 12.30/12.47 fof(d2_subset_1, axiom, ! [X0] : ! [X1] : (((~empty(X0) => (element(X1,X0) <=> in(X1,X0))) & (empty(X0) => (element(X1,X0) <=> empty(X1)))))).
% 12.30/12.47 fof(d4_xboole_0, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'set$udifference'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (in(X3,X0) & ~in(X3,X1))))))).
% 12.30/12.47 fof(d5_subset_1, axiom, ! [X0] : ! [X1] : ((element(X1,powerset(X0)) => 'subset$ucomplement'(X0,X1) = 'set$udifference'(X0,X1)))).
% 12.30/12.47 fof(dt_k3_subset_1, axiom, ! [X0] : ! [X1] : ((element(X1,powerset(X0)) => element('subset$ucomplement'(X0,X1),powerset(X0))))).
% 12.30/12.47 fof(involutiveness_k3_subset_1, axiom, ! [X0] : ! [X1] : ((element(X1,powerset(X0)) => 'subset$ucomplement'(X0,'subset$ucomplement'(X0,X1)) = X1))).
% 12.30/12.47 fof(t6_boole, axiom, ! [X0] : ((empty(X0) => X0 = 'empty$uset'))).
% 12.30/12.47 fof(t50_subset_1, conjecture, ! [X0] : ((X0 != 'empty$uset' => ! [X1] : ((element(X1,powerset(X0)) => ! [X2] : ((element(X2,X0) => (~in(X2,X1) => in(X2,'subset$ucomplement'(X0,X1)))))))))).
% 12.30/12.47 fof(negated_conjecture, negated_conjecture, ~! [X0] : ((X0 != 'empty$uset' => ! [X1] : ((element(X1,powerset(X0)) => ! [X2] : ((element(X2,X0) => (~in(X2,X1) => in(X2,'subset$ucomplement'(X0,X1))))))))), inference(negate_conjecture, [status(cth)], [t50_subset_1])).
% 12.30/12.47 cnf(c1, plain, empty(X0) | ~element(X1,X0) | in(X1,X0), inference(clausification, [status(esa)], [d2_subset_1])).
% 12.30/12.47 cnf(c5, plain, X0 != 'set$udifference'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d4_xboole_0])).
% 12.30/12.47 cnf(c9, plain, ~X0(X1,X2,X3) | in(X4,X3) | ~in(X4,X1) | in(X4,X2), inference(clausification, [status(esa)], [d4_xboole_0])).
% 12.30/12.47 cnf(c16, plain, ~element(X0,powerset(X1)) | 'subset$ucomplement'(X1,X0) = 'set$udifference'(X1,X0), inference(clausification, [status(esa)], [d5_subset_1])).
% 12.30/12.47 cnf(c17, plain, ~element(X0,powerset(X1)) | element('subset$ucomplement'(X1,X0),powerset(X1)), inference(clausification, [status(esa)], [dt_k3_subset_1])).
% 12.30/12.47 cnf(c21, plain, ~element(X0,powerset(X1)) | 'subset$ucomplement'(X1,'subset$ucomplement'(X1,X0)) = X0, inference(clausification, [status(esa)], [involutiveness_k3_subset_1])).
% 12.30/12.47 cnf(c30, plain, ~empty(X0) | X0 = 'empty$uset', inference(clausification, [status(esa)], [t6_boole])).
% 12.30/12.47 cnf(c33, plain, sK32 != 'empty$uset', inference(clausification, [status(esa)], [negated_conjecture])).
% 12.30/12.47 cnf(c34, plain, element(sK33,powerset(sK32)), inference(clausification, [status(esa)], [negated_conjecture])).
% 12.30/12.47 cnf(c35, plain, element(sK34,sK32), inference(clausification, [status(esa)], [negated_conjecture])).
% 12.30/12.47 cnf(c36, plain, ~in(sK34,sK33), inference(clausification, [status(esa)], [negated_conjecture])).
% 12.30/12.47 cnf(c37, plain, ~in(sK34,'subset$ucomplement'(sK32,sK33)), inference(clausification, [status(esa)], [negated_conjecture])).
% 12.30/12.47 cnf(d0, plain, in(sK34,sK32) | empty(sK32), inference(resolution, [status(thm)], [c1,c35])).
% 12.30/12.47 cnf(d1, plain, 'subset$ucomplement'(sK32,sK33) = 'set$udifference'(sK32,sK33), inference(resolution, [status(thm)], [c16,c34])).
% 12.30/12.47 cnf(d2, plain, ~in(sK34,'set$udifference'(sK32,sK33)), inference(demodulation, [status(thm)], [c37,d1])).
% 12.30/12.47 cnf(d3, plain, 'Ts4'(X0,X1,'set$udifference'(X0,X1)), inference(equality_resolution, [status(thm)], [c5])).
% 12.30/12.47 cnf(d4, plain, 'subset$ucomplement'(sK32,'subset$ucomplement'(sK32,sK33)) = sK33, inference(resolution, [status(thm)], [c21,c34])).
% 12.30/12.47 cnf(d5, plain, 'subset$ucomplement'(sK32,'set$udifference'(sK32,sK33)) = sK33, inference(demodulation, [status(thm)], [d4,d1])).
% 12.30/12.47 cnf(d6, plain, element('set$udifference'(sK32,sK33),powerset(sK32)) | ~element(sK33,powerset(sK32)), inference(superposition, [status(thm)], [d1,c17])).
% 12.30/12.47 cnf(d7, plain, element('set$udifference'(sK32,sK33),powerset(sK32)), inference(resolution, [status(thm)], [c34,d6])).
% 12.30/12.47 cnf(d8, plain, 'subset$ucomplement'(sK32,'set$udifference'(sK32,sK33)) = 'set$udifference'(sK32,'set$udifference'(sK32,sK33)), inference(resolution, [status(thm)], [d7,c16])).
% 12.30/12.47 cnf(d9, plain, sK33 = 'set$udifference'(sK32,'set$udifference'(sK32,sK33)), inference(demodulation, [status(thm)], [d8,d5])).
% 12.30/12.47 cnf(d10, plain, 'Ts4'(sK32,'set$udifference'(sK32,sK33),sK33), inference(superposition, [status(thm)], [d9,d3])).
% 12.30/12.47 cnf(d11, plain, in(X0,sK33) | in(X0,'set$udifference'(sK32,sK33)) | ~in(X0,sK32), inference(resolution, [status(thm)], [d10,c9])).
% 12.30/12.47 cnf(d12, plain, ~in(sK34,sK32) | in(sK34,sK33), inference(resolution, [status(thm)], [d11,d2])).
% 12.30/12.47 cnf(d13, plain, ~in(sK34,sK32), inference(resolution, [status(thm)], [c36,d12])).
% 12.30/12.47 cnf(d14, plain, empty(sK32), inference(resolution, [status(thm)], [d13,d0])).
% 12.30/12.47 cnf(d15, plain, sK32 = 'empty$uset', inference(resolution, [status(thm)], [d14,c30])).
% 12.30/12.47 cnf(d16, plain, $false, inference(resolution, [status(thm)], [c33,d15])).
% 12.30/12.47 % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------