%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SET914+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n018.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 11.16s 1.84s
% Output : CNFRefutation 11.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET914+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n018.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sat Sep 26 08:27:37 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.16/1.84 % SZS status Theorem for theBenchmark.p
% 11.16/1.84 % SZS output start CNFRefutation for theBenchmark.p
% 11.16/1.84 fof(commutativity_k3_xboole_0, axiom, ! [X0] : ! [X1] : 'set$uintersection2'(X0,X1) = 'set$uintersection2'(X1,X0)).
% 11.16/1.84 fof(d1_xboole_0, axiom, ! [X0] : ((X0 = 'empty$uset' <=> ! [X1] : ~in(X1,X0)))).
% 11.16/1.84 fof(d2_tarski, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'unordered$upair'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (X3 = X0 | X3 = X1)))))).
% 11.16/1.84 fof(d3_xboole_0, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'set$uintersection2'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (in(X3,X0) & in(X3,X1))))))).
% 11.16/1.84 fof(d7_xboole_0, axiom, ! [X0] : ! [X1] : ((disjoint(X0,X1) <=> 'set$uintersection2'(X0,X1) = 'empty$uset'))).
% 11.16/1.84 fof(t55_zfmisc_1, conjecture, ! [X0] : ! [X1] : ! [X2] : ~((disjoint('unordered$upair'(X0,X1),X2) & in(X0,X2)))).
% 11.16/1.84 fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : ! [X2] : ~((disjoint('unordered$upair'(X0,X1),X2) & in(X0,X2))), inference(negate_conjecture, [status(cth)], [t55_zfmisc_1])).
% 11.16/1.84 cnf(c2, plain, 'set$uintersection2'(X0,X1) = 'set$uintersection2'(X1,X0), inference(clausification, [status(esa)], [commutativity_k3_xboole_0])).
% 11.16/1.84 cnf(c3, plain, X0 != 'empty$uset' | ~in(X1,X0), inference(clausification, [status(esa)], [d1_xboole_0])).
% 11.16/1.84 cnf(c5, plain, X0 != 'unordered$upair'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d2_tarski])).
% 11.16/1.84 cnf(c8, plain, ~X0(X1,X2,X3) | in(X4,X3) | X4 != X1, inference(clausification, [status(esa)], [d2_tarski])).
% 11.16/1.84 cnf(c16, plain, X0 != 'set$uintersection2'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d3_xboole_0])).
% 11.16/1.84 cnf(c20, plain, ~X0(X1,X2,X3) | in(X4,X3) | ~in(X4,X1) | ~in(X4,X2), inference(clausification, [status(esa)], [d3_xboole_0])).
% 11.16/1.84 cnf(c27, plain, ~disjoint(X0,X1) | 'set$uintersection2'(X0,X1) = 'empty$uset', inference(clausification, [status(esa)], [d7_xboole_0])).
% 11.16/1.84 cnf(c34, plain, disjoint('unordered$upair'(sK29,sK30),sK31), inference(clausification, [status(esa)], [negated_conjecture])).
% 11.16/1.84 cnf(c35, plain, in(sK29,sK31), inference(clausification, [status(esa)], [negated_conjecture])).
% 11.16/1.84 cnf(d0, plain, 'Ts15'(X0,X1,'set$uintersection2'(X0,X1)), inference(equality_resolution, [status(thm)], [c16])).
% 11.16/1.84 cnf(d1, plain, 'set$uintersection2'('unordered$upair'(sK29,sK30),sK31) = 'empty$uset', inference(resolution, [status(thm)], [c27,c34])).
% 11.16/1.84 cnf(d2, plain, 'set$uintersection2'(sK31,'unordered$upair'(sK29,sK30)) = 'empty$uset', inference(demodulation, [status(thm)], [d1,c2])).
% 11.16/1.84 cnf(d3, plain, 'Ts15'(sK31,'unordered$upair'(sK29,sK30),'empty$uset'), inference(superposition, [status(thm)], [d2,d0])).
% 11.16/1.84 cnf(d4, plain, in(X0,'empty$uset') | ~in(X0,'unordered$upair'(sK29,sK30)) | ~in(X0,sK31), inference(resolution, [status(thm)], [d3,c20])).
% 11.16/1.84 cnf(d5, plain, ~in(X0,'empty$uset'), inference(equality_resolution, [status(thm)], [c3])).
% 11.16/1.84 cnf(d6, plain, ~in(X0,'unordered$upair'(sK29,sK30)) | ~in(X0,sK31), inference(resolution, [status(thm)], [d5,d4])).
% 11.16/1.84 cnf(d7, plain, 'Ts9'(X0,X1,'unordered$upair'(X0,X1)), inference(equality_resolution, [status(thm)], [c5])).
% 11.16/1.84 cnf(d8, plain, in(X0,X1) | ~'Ts9'(X0,X2,X1), inference(equality_resolution, [status(thm)], [c8])).
% 11.16/1.84 cnf(d9, plain, in(X0,'unordered$upair'(X0,X1)), inference(resolution, [status(thm)], [d8,d7])).
% 11.16/1.84 cnf(d10, plain, ~in(sK29,sK31), inference(resolution, [status(thm)], [d9,d6])).
% 11.16/1.84 cnf(d11, plain, $false, inference(resolution, [status(thm)], [c35,d10])).
% 11.16/1.84 % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------