%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SET935+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n001.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:33:36 AM UTC 2026
% Result : Theorem 13.41s 2.38s
% Output : CNFRefutation 13.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET935+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n001.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sat Sep 26 08:32:12 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.41/2.38 % SZS status Theorem for theBenchmark.p
% 13.41/2.38 % SZS output start CNFRefutation for theBenchmark.p
% 13.41/2.38 fof(commutativity_k2_xboole_0, axiom, ! [X0] : ! [X1] : 'set$uunion2'(X0,X1) = 'set$uunion2'(X1,X0)).
% 13.41/2.38 fof(d10_xboole_0, axiom, ! [X0] : ! [X1] : ((X0 = X1 <=> (subset(X0,X1) & subset(X1,X0))))).
% 13.41/2.38 fof(d1_zfmisc_1, axiom, ! [X0] : ! [X1] : ((X1 = powerset(X0) <=> ! [X2] : ((in(X2,X1) <=> subset(X2,X0)))))).
% 13.41/2.38 fof(d2_xboole_0, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'set$uunion2'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (in(X3,X0) | in(X3,X1))))))).
% 13.41/2.38 fof(d9_xboole_0, axiom, ! [X0] : ! [X1] : (('inclusion$ucomparable'(X0,X1) <=> (subset(X0,X1) | subset(X1,X0))))).
% 13.41/2.38 fof(reflexivity_r1_tarski, axiom, ! [X0] : ! [X1] : subset(X0,X0)).
% 13.41/2.38 fof(t7_xboole_1, axiom, ! [X0] : ! [X1] : subset(X0,'set$uunion2'(X0,X1))).
% 13.41/2.38 fof(t82_zfmisc_1, conjecture, ! [X0] : ! [X1] : (('set$uunion2'(powerset(X0),powerset(X1)) = powerset('set$uunion2'(X0,X1)) => 'inclusion$ucomparable'(X0,X1)))).
% 13.41/2.38 fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : (('set$uunion2'(powerset(X0),powerset(X1)) = powerset('set$uunion2'(X0,X1)) => 'inclusion$ucomparable'(X0,X1))), inference(negate_conjecture, [status(cth)], [t82_zfmisc_1])).
% 13.41/2.38 cnf(c1, plain, 'set$uunion2'(X0,X1) = 'set$uunion2'(X1,X0), inference(clausification, [status(esa)], [commutativity_k2_xboole_0])).
% 13.41/2.38 cnf(c4, plain, X0 = X1 | ~subset(X0,X1) | ~subset(X1,X0), inference(clausification, [status(esa)], [d10_xboole_0])).
% 13.41/2.38 cnf(c5, plain, X0 != powerset(X1) | ~in(X2,X0) | subset(X2,X1), inference(clausification, [status(esa)], [d1_zfmisc_1])).
% 13.41/2.38 cnf(c6, plain, X0 != powerset(X1) | in(X2,X0) | ~subset(X2,X1), inference(clausification, [status(esa)], [d1_zfmisc_1])).
% 13.41/2.38 cnf(c11, plain, X0 != 'set$uunion2'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d2_xboole_0])).
% 13.41/2.38 cnf(c13, plain, ~X0(X1,X2,X3) | ~in(X4,X3) | in(X4,X1) | in(X4,X2), inference(clausification, [status(esa)], [d2_xboole_0])).
% 13.41/2.38 cnf(c23, plain, 'inclusion$ucomparable'(X0,X1) | ~subset(X0,X1), inference(clausification, [status(esa)], [d9_xboole_0])).
% 13.41/2.38 cnf(c24, plain, 'inclusion$ucomparable'(X0,X1) | ~subset(X1,X0), inference(clausification, [status(esa)], [d9_xboole_0])).
% 13.41/2.38 cnf(c30, plain, subset(X0,X0), inference(clausification, [status(esa)], [reflexivity_r1_tarski])).
% 13.41/2.38 cnf(c33, plain, subset(X0,'set$uunion2'(X0,X1)), inference(clausification, [status(esa)], [t7_xboole_1])).
% 13.41/2.38 cnf(c34, plain, 'set$uunion2'(powerset(sK34),powerset(sK35)) = powerset('set$uunion2'(sK34,sK35)), inference(clausification, [status(esa)], [negated_conjecture])).
% 13.41/2.38 cnf(c35, plain, ~'inclusion$ucomparable'(sK34,sK35), inference(clausification, [status(esa)], [negated_conjecture])).
% 13.41/2.38 cnf(d0, plain, subset(X0,'set$uunion2'(X1,X0)), inference(superposition, [status(thm)], [c1,c33])).
% 13.41/2.38 cnf(d1, plain, 'inclusion$ucomparable'('set$uunion2'(X0,X1),X1), inference(resolution, [status(thm)], [d0,c24])).
% 13.41/2.38 cnf(d2, plain, 'inclusion$ucomparable'(X0,'set$uunion2'(X0,X1)), inference(resolution, [status(thm)], [c23,c33])).
% 13.41/2.38 cnf(d3, plain, X0 = 'set$uunion2'(X0,X1) | ~subset('set$uunion2'(X0,X1),X0), inference(resolution, [status(thm)], [c33,c4])).
% 13.41/2.38 cnf(d4, plain, X0 = 'set$uunion2'(X1,X0) | ~subset('set$uunion2'(X1,X0),X0), inference(resolution, [status(thm)], [d0,c4])).
% 13.41/2.38 cnf(d5, plain, ~in(X0,powerset(X1)) | subset(X0,X1), inference(equality_resolution, [status(thm)], [c5])).
% 13.41/2.38 cnf(d6, plain, in(X0,powerset(X1)) | ~subset(X0,X1), inference(equality_resolution, [status(thm)], [c6])).
% 13.41/2.38 cnf(d7, plain, X0 != powerset('set$uunion2'(sK34,sK35)) | 'Ts10'(powerset(sK34),powerset(sK35),X0), inference(superposition, [status(thm)], [c34,c11])).
% 13.41/2.38 cnf(d8, plain, 'Ts10'(powerset(sK34),powerset(sK35),powerset('set$uunion2'(sK34,sK35))), inference(equality_resolution, [status(thm)], [d7])).
% 13.41/2.38 cnf(d9, plain, ~in(X0,powerset('set$uunion2'(sK34,sK35))) | in(X0,powerset(sK35)) | in(X0,powerset(sK34)), inference(resolution, [status(thm)], [d8,c13])).
% 13.41/2.38 cnf(d10, plain, in(X0,powerset(sK34)) | in(X0,powerset(sK35)) | ~subset(X0,'set$uunion2'(sK34,sK35)), inference(resolution, [status(thm)], [d9,d6])).
% 13.41/2.38 cnf(d11, plain, in('set$uunion2'(sK34,sK35),powerset(sK34)) | in('set$uunion2'(sK34,sK35),powerset(sK35)), inference(resolution, [status(thm)], [d10,c30])).
% 13.41/2.38 cnf(d12, plain, in('set$uunion2'(sK34,sK35),powerset(sK34)) | subset('set$uunion2'(sK34,sK35),sK35), inference(resolution, [status(thm)], [d11,d5])).
% 13.41/2.38 cnf(d13, plain, subset('set$uunion2'(sK34,sK35),sK35) | subset('set$uunion2'(sK34,sK35),sK34), inference(resolution, [status(thm)], [d12,d5])).
% 13.41/2.38 cnf(d14, plain, subset('set$uunion2'(sK34,sK35),sK34) | sK35 = 'set$uunion2'(sK34,sK35), inference(resolution, [status(thm)], [d13,d4])).
% 13.41/2.38 cnf(d15, plain, sK35 = 'set$uunion2'(sK34,sK35) | sK34 = 'set$uunion2'(sK34,sK35), inference(resolution, [status(thm)], [d14,d3])).
% 13.41/2.38 cnf(d16, plain, 'inclusion$ucomparable'(sK34,sK35) | sK34 = 'set$uunion2'(sK34,sK35), inference(superposition, [status(thm)], [d15,d2])).
% 13.41/2.38 cnf(d17, plain, sK34 = 'set$uunion2'(sK34,sK35), inference(resolution, [status(thm)], [c35,d16])).
% 13.41/2.38 cnf(d18, plain, 'inclusion$ucomparable'(sK34,sK35), inference(superposition, [status(thm)], [d17,d1])).
% 13.41/2.38 cnf(d19, plain, $false, inference(resolution, [status(thm)], [c35,d18])).
% 13.41/2.38 % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------