%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SEU172+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 : n026.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 13.57s 12.40s
% Output : CNFRefutation 13.57s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU172+1 : 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/10.37 % Computer : n026.cluster.edu
% 0.09/10.37 % Model : x86_64 x86_64
% 0.09/10.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.37 % Memory : 8046.5625MB
% 0.09/10.37 % OS : Linux 6.8.0-71-generic
% 0.09/10.37 % CPULimit : 300
% 0.09/10.37 % WCLimit : 300
% 0.09/10.37 % DateTime : Sat Sep 26 08:47:07 UTC 2026
% 0.09/10.38 % CPUTime :
% 0.09/10.38 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.57/12.40 % SZS status Theorem for theBenchmark.p
% 13.57/12.40 % SZS output start CNFRefutation for theBenchmark.p
% 13.57/12.40 fof(involutiveness_k3_subset_1, axiom, ! [X0] : ! [X1] : ((element(X1,powerset(X0)) => 'subset$ucomplement'(X0,'subset$ucomplement'(X0,X1)) = X1))).
% 13.57/12.40 fof(dt_k3_subset_1, axiom, ! [X0] : ! [X1] : ((element(X1,powerset(X0)) => element('subset$ucomplement'(X0,X1),powerset(X0))))).
% 13.57/12.40 fof(d5_subset_1, axiom, ! [X0] : ! [X1] : ((element(X1,powerset(X0)) => 'subset$ucomplement'(X0,X1) = 'set$udifference'(X0,X1)))).
% 13.57/12.40 fof(d4_xboole_0, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'set$udifference'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (in(X3,X0) & ~in(X3,X1))))))).
% 13.57/12.40 fof(t54_subset_1, conjecture, ! [X0] : ! [X1] : ! [X2] : ((element(X2,powerset(X0)) => ~((in(X1,'subset$ucomplement'(X0,X2)) & in(X1,X2)))))).
% 13.57/12.40 fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : ! [X2] : ((element(X2,powerset(X0)) => ~((in(X1,'subset$ucomplement'(X0,X2)) & in(X1,X2))))), inference(negate_conjecture, [status(cth)], [t54_subset_1])).
% 13.57/12.40 cnf(c11, plain, ~element(X0,powerset(X1)) | 'subset$ucomplement'(X1,'subset$ucomplement'(X1,X0)) = X0, inference(clausification, [status(esa)], [involutiveness_k3_subset_1])).
% 13.57/12.40 cnf(c14, plain, ~element(X0,powerset(X1)) | element('subset$ucomplement'(X1,X0),powerset(X1)), inference(clausification, [status(esa)], [dt_k3_subset_1])).
% 13.57/12.40 cnf(c17, plain, ~element(X0,powerset(X1)) | 'subset$ucomplement'(X1,X0) = 'set$udifference'(X1,X0), inference(clausification, [status(esa)], [d5_subset_1])).
% 13.57/12.40 cnf(c18, plain, X0 != 'set$udifference'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d4_xboole_0])).
% 13.57/12.40 cnf(c21, plain, ~X0(X1,X2,X3) | ~in(X4,X3) | ~in(X4,X2), inference(clausification, [status(esa)], [d4_xboole_0])).
% 13.57/12.40 cnf(c29, plain, element(sK32,powerset(sK30)), inference(clausification, [status(esa)], [negated_conjecture])).
% 13.57/12.40 cnf(c30, plain, in(sK31,'subset$ucomplement'(sK30,sK32)), inference(clausification, [status(esa)], [negated_conjecture])).
% 13.57/12.40 cnf(c31, plain, in(sK31,sK32), inference(clausification, [status(esa)], [negated_conjecture])).
% 13.57/12.40 cnf(d0, plain, 'subset$ucomplement'(sK30,sK32) = 'set$udifference'(sK30,sK32), inference(resolution, [status(thm)], [c17,c29])).
% 13.57/12.40 cnf(d1, plain, in(sK31,'set$udifference'(sK30,sK32)), inference(demodulation, [status(thm)], [c30,d0])).
% 13.57/12.40 cnf(d2, plain, 'subset$ucomplement'(sK30,'subset$ucomplement'(sK30,sK32)) = sK32, inference(resolution, [status(thm)], [c11,c29])).
% 13.57/12.40 cnf(d3, plain, 'subset$ucomplement'(sK30,'set$udifference'(sK30,sK32)) = sK32, inference(demodulation, [status(thm)], [d2,d0])).
% 13.57/12.40 cnf(d4, plain, element('set$udifference'(sK30,sK32),powerset(sK30)) | ~element(sK32,powerset(sK30)), inference(superposition, [status(thm)], [d0,c14])).
% 13.57/12.40 cnf(d5, plain, element('set$udifference'(sK30,sK32),powerset(sK30)), inference(resolution, [status(thm)], [c29,d4])).
% 13.57/12.40 cnf(d6, plain, 'subset$ucomplement'(sK30,'set$udifference'(sK30,sK32)) = 'set$udifference'(sK30,'set$udifference'(sK30,sK32)), inference(resolution, [status(thm)], [d5,c17])).
% 13.57/12.40 cnf(d7, plain, sK32 = 'set$udifference'(sK30,'set$udifference'(sK30,sK32)), inference(demodulation, [status(thm)], [d6,d3])).
% 13.57/12.40 cnf(d8, plain, X0 != sK32 | 'Ts24'(sK30,'set$udifference'(sK30,sK32),X0), inference(superposition, [status(thm)], [d7,c18])).
% 13.57/12.40 cnf(d9, plain, 'Ts24'(sK30,'set$udifference'(sK30,sK32),sK32), inference(equality_resolution, [status(thm)], [d8])).
% 13.57/12.40 cnf(d10, plain, ~in(X0,sK32) | ~in(X0,'set$udifference'(sK30,sK32)), inference(resolution, [status(thm)], [d9,c21])).
% 13.57/12.40 cnf(d11, plain, ~in(sK31,sK32), inference(resolution, [status(thm)], [d10,d1])).
% 13.57/12.40 cnf(d12, plain, $false, inference(resolution, [status(thm)], [c31,d11])).
% 13.57/12.40 % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------