%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SET918+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 : n017.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:33 AM UTC 2026
% Result : Theorem 8.35s 3.22s
% Output : CNFRefutation 8.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET918+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.43 % Computer : n017.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Sat Sep 26 08:21:03 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.35/3.22 % SZS status Theorem for theBenchmark.p
% 8.35/3.22 % SZS output start CNFRefutation for theBenchmark.p
% 8.35/3.22 fof(commutativity_k2_tarski, axiom, ! [X0] : ! [X1] : 'unordered$upair'(X0,X1) = 'unordered$upair'(X1,X0)).
% 8.35/3.22 fof(commutativity_k3_xboole_0, axiom, ! [X0] : ! [X1] : 'set$uintersection2'(X0,X1) = 'set$uintersection2'(X1,X0)).
% 8.35/3.22 fof(d1_tarski, axiom, ! [X0] : ! [X1] : ((X1 = singleton(X0) <=> ! [X2] : ((in(X2,X1) <=> X2 = X0))))).
% 8.35/3.22 fof(d2_tarski, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'unordered$upair'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (X3 = X0 | X3 = X1)))))).
% 8.35/3.22 fof(d3_xboole_0, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'set$uintersection2'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (in(X3,X0) & in(X3,X1))))))).
% 8.35/3.22 fof(t59_zfmisc_1, conjecture, ! [X0] : ! [X1] : ! [X2] : ~(('set$uintersection2'('unordered$upair'(X0,X1),X2) = singleton(X0) & (in(X1,X2) & X0 != X1)))).
% 8.35/3.22 fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : ! [X2] : ~(('set$uintersection2'('unordered$upair'(X0,X1),X2) = singleton(X0) & (in(X1,X2) & X0 != X1))), inference(negate_conjecture, [status(cth)], [t59_zfmisc_1])).
% 8.35/3.22 cnf(c1, plain, 'unordered$upair'(X0,X1) = 'unordered$upair'(X1,X0), inference(clausification, [status(esa)], [commutativity_k2_tarski])).
% 8.35/3.22 cnf(c2, plain, 'set$uintersection2'(X0,X1) = 'set$uintersection2'(X1,X0), inference(clausification, [status(esa)], [commutativity_k3_xboole_0])).
% 8.35/3.22 cnf(c3, plain, X0 != singleton(X1) | ~in(X2,X0) | X2 = X1, inference(clausification, [status(esa)], [d1_tarski])).
% 8.35/3.22 cnf(c9, plain, X0 != 'unordered$upair'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d2_tarski])).
% 8.35/3.22 cnf(c12, plain, ~X0(X1,X2,X3) | in(X4,X3) | X4 != X1, inference(clausification, [status(esa)], [d2_tarski])).
% 8.35/3.22 cnf(c20, plain, X0 != 'set$uintersection2'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d3_xboole_0])).
% 8.35/3.22 cnf(c24, plain, ~X0(X1,X2,X3) | in(X4,X3) | ~in(X4,X1) | ~in(X4,X2), inference(clausification, [status(esa)], [d3_xboole_0])).
% 8.35/3.22 cnf(c34, plain, 'set$uintersection2'('unordered$upair'(sK26,sK27),sK28) = singleton(sK26), inference(clausification, [status(esa)], [negated_conjecture])).
% 8.35/3.22 cnf(c35, plain, in(sK27,sK28), inference(clausification, [status(esa)], [negated_conjecture])).
% 8.35/3.22 cnf(c36, plain, sK26 != sK27, inference(clausification, [status(esa)], [negated_conjecture])).
% 8.35/3.22 cnf(d0, plain, X0 = X1 | ~in(X0,singleton(X1)), inference(equality_resolution, [status(thm)], [c3])).
% 8.35/3.22 cnf(d1, plain, 'set$uintersection2'(sK28,'unordered$upair'(sK26,sK27)) = singleton(sK26), inference(demodulation, [status(thm)], [c34,c2])).
% 8.35/3.22 cnf(d2, plain, X0 != singleton(sK26) | 'Ts16'(sK28,'unordered$upair'(sK26,sK27),X0), inference(superposition, [status(thm)], [d1,c20])).
% 8.35/3.22 cnf(d3, plain, 'Ts16'(sK28,'unordered$upair'(sK26,sK27),singleton(sK26)), inference(equality_resolution, [status(thm)], [d2])).
% 8.35/3.22 cnf(d4, plain, in(X0,singleton(sK26)) | ~in(X0,'unordered$upair'(sK26,sK27)) | ~in(X0,sK28), inference(resolution, [status(thm)], [c24,d3])).
% 8.35/3.22 cnf(d5, plain, 'Ts10'(X0,X1,'unordered$upair'(X0,X1)), inference(equality_resolution, [status(thm)], [c9])).
% 8.35/3.22 cnf(d6, plain, 'Ts10'(X0,X1,'unordered$upair'(X1,X0)), inference(superposition, [status(thm)], [c1,d5])).
% 8.35/3.22 cnf(d7, plain, in(X0,X1) | ~'Ts10'(X0,X2,X1), inference(equality_resolution, [status(thm)], [c12])).
% 8.35/3.22 cnf(d8, plain, in(X0,'unordered$upair'(X1,X0)), inference(resolution, [status(thm)], [d7,d6])).
% 8.35/3.22 cnf(d9, plain, in(sK27,singleton(sK26)) | ~in(sK27,sK28), inference(resolution, [status(thm)], [d8,d4])).
% 8.35/3.22 cnf(d10, plain, in(sK27,singleton(sK26)), inference(resolution, [status(thm)], [c35,d9])).
% 8.35/3.22 cnf(d11, plain, sK27 = sK26, inference(resolution, [status(thm)], [d10,d0])).
% 8.35/3.22 cnf(d12, plain, sK26 != sK26, inference(demodulation, [status(thm)], [c36,d11])).
% 8.35/3.22 cnf(d13, plain, $false, inference(equality_resolution, [status(thm)], [d12])).
% 8.35/3.22 % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------