%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SEU229+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/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:21 AM UTC 2026
% Result : Theorem 19.47s 6.77s
% Output : CNFRefutation 19.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU229+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 % Computer : n026.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Sat Sep 26 08:57:40 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 19.47/6.77 % SZS status Theorem for theBenchmark.p
% 19.47/6.77 % SZS output start CNFRefutation for theBenchmark.p
% 19.47/6.77 fof(d1_enumset1, axiom, ! [X0] : ! [X1] : ! [X2] : ! [X3] : ((X3 = 'unordered$utriple'(X0,X1,X2) <=> ! [X4] : ((in(X4,X3) <=> ~((X4 != X0 & (X4 != X1 & X4 != X2)))))))).
% 19.47/6.77 fof(existence_m1_subset_1, axiom, ! [X0] : ? [X1] : element(X1,X0)).
% 19.47/6.77 fof(t2_subset, axiom, ! [X0] : ! [X1] : ((element(X0,X1) => (empty(X1) | in(X0,X1))))).
% 19.47/6.77 fof(t7_boole, axiom, ! [X0] : ! [X1] : ~((in(X0,X1) & empty(X1)))).
% 19.47/6.77 fof(t7_tarski, axiom, ! [X0] : ! [X1] : ~((in(X0,X1) & ! [X2] : ~((in(X2,X1) & ! [X3] : ~((in(X3,X1) & in(X3,X2)))))))).
% 19.47/6.77 fof(t3_ordinal1, conjecture, ! [X0] : ! [X1] : ! [X2] : ~((in(X0,X1) & (in(X1,X2) & in(X2,X0))))).
% 19.47/6.77 fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : ! [X2] : ~((in(X0,X1) & (in(X1,X2) & in(X2,X0)))), inference(negate_conjecture, [status(cth)], [t3_ordinal1])).
% 19.47/6.77 cnf(c6, plain, X0 != 'unordered$utriple'(X1,X2,X3) | X4(X1,X2,X3,X0), inference(clausification, [status(esa)], [d1_enumset1])).
% 19.47/6.77 cnf(c8, plain, X0 = X1 | ~in(X0,X2) | X0 = X3 | X0 = X4 | ~X5(X4,X3,X1,X2), inference(clausification, [status(esa)], [d1_enumset1])).
% 19.47/6.77 cnf(c9, plain, ~X0(X1,X2,X3,X4) | in(X5,X4) | X5 != X1, inference(clausification, [status(esa)], [d1_enumset1])).
% 19.47/6.77 cnf(c10, plain, ~X0(X1,X2,X3,X4) | in(X5,X4) | X5 != X2, inference(clausification, [status(esa)], [d1_enumset1])).
% 19.47/6.77 cnf(c11, plain, ~X0(X1,X2,X3,X4) | in(X5,X4) | X5 != X3, inference(clausification, [status(esa)], [d1_enumset1])).
% 19.47/6.77 cnf(c20, plain, element(sK13(X0),X0), inference(clausification, [status(esa)], [existence_m1_subset_1])).
% 19.47/6.77 cnf(c47, plain, ~element(X0,X1) | empty(X1) | in(X0,X1), inference(clausification, [status(esa)], [t2_subset])).
% 19.47/6.77 cnf(c49, plain, ~in(X0,X1) | ~empty(X1), inference(clausification, [status(esa)], [t7_boole])).
% 19.47/6.77 cnf(c50, plain, ~in(X0,X1) | in(sK32(X1),X1), inference(clausification, [status(esa)], [t7_tarski])).
% 19.47/6.77 cnf(c51, plain, ~in(X0,X1) | ~in(X2,X1) | ~in(X2,sK32(X1)), inference(clausification, [status(esa)], [t7_tarski])).
% 19.47/6.77 cnf(c53, plain, in(sK36,sK37), inference(clausification, [status(esa)], [negated_conjecture])).
% 19.47/6.77 cnf(c54, plain, in(sK37,sK38), inference(clausification, [status(esa)], [negated_conjecture])).
% 19.47/6.77 cnf(c55, plain, in(sK38,sK36), inference(clausification, [status(esa)], [negated_conjecture])).
% 19.47/6.77 cnf(d0, plain, 'Ts5'(X0,X1,X2,'unordered$utriple'(X0,X1,X2)), inference(equality_resolution, [status(thm)], [c6])).
% 19.47/6.77 cnf(d1, plain, in(X0,X1) | ~'Ts5'(X2,X3,X0,X1), inference(equality_resolution, [status(thm)], [c11])).
% 19.47/6.77 cnf(d2, plain, in(X0,'unordered$utriple'(X1,X2,X0)), inference(resolution, [status(thm)], [d1,d0])).
% 19.47/6.77 cnf(d3, plain, in(X0,X1) | ~'Ts5'(X2,X0,X3,X1), inference(equality_resolution, [status(thm)], [c10])).
% 19.47/6.77 cnf(d4, plain, in(X0,'unordered$utriple'(X1,X0,X2)), inference(resolution, [status(thm)], [d3,d0])).
% 19.47/6.77 cnf(d5, plain, in(X0,X1) | ~'Ts5'(X0,X2,X3,X1), inference(equality_resolution, [status(thm)], [c9])).
% 19.47/6.77 cnf(d6, plain, in(X0,'unordered$utriple'(X0,X1,X2)), inference(resolution, [status(thm)], [d5,d0])).
% 19.47/6.77 cnf(d7, plain, X0 = X1 | X0 = X2 | X0 = X3 | ~in(X0,'unordered$utriple'(X3,X2,X1)), inference(resolution, [status(thm)], [d0,c8])).
% 19.47/6.77 cnf(d8, plain, in(sK13(X0),X0) | empty(X0), inference(resolution, [status(thm)], [c47,c20])).
% 19.47/6.77 cnf(d9, plain, empty(X0) | in(sK32(X0),X0), inference(resolution, [status(thm)], [d8,c50])).
% 19.47/6.77 cnf(d10, plain, empty('unordered$utriple'(X0,X1,X2)) | sK32('unordered$utriple'(X0,X1,X2)) = X0 | sK32('unordered$utriple'(X0,X1,X2)) = X1 | sK32('unordered$utriple'(X0,X1,X2)) = X2, inference(resolution, [status(thm)], [d9,d7])).
% 19.47/6.77 cnf(d11, plain, ~empty('unordered$utriple'(X0,X1,X2)), inference(resolution, [status(thm)], [d6,c49])).
% 19.47/6.77 cnf(d12, plain, sK32('unordered$utriple'(X0,X1,X2)) = X2 | sK32('unordered$utriple'(X0,X1,X2)) = X1 | sK32('unordered$utriple'(X0,X1,X2)) = X0, inference(resolution, [status(thm)], [d11,d10])).
% 19.47/6.77 cnf(d13, plain, ~in(X3,X2) | ~in(X3,'unordered$utriple'(X0,X1,X2)) | ~in(X4,'unordered$utriple'(X0,X1,X2)) | sK32('unordered$utriple'(X0,X1,X2)) = X1 | sK32('unordered$utriple'(X0,X1,X2)) = X0, inference(superposition, [status(thm)], [d12,c51])).
% 19.47/6.77 cnf(d14, plain, sK32('unordered$utriple'(X0,X1,X2)) = X1 | sK32('unordered$utriple'(X0,X1,X2)) = X0 | ~in(X3,'unordered$utriple'(X0,X1,X2)) | ~in(X0,X2), inference(resolution, [status(thm)], [d13,d6])).
% 19.47/6.77 cnf(d15, plain, sK32('unordered$utriple'(X0,X1,X2)) = X1 | sK32('unordered$utriple'(X0,X1,X2)) = X0 | ~in(X0,X2), inference(resolution, [status(thm)], [d14,d2])).
% 19.47/6.77 cnf(d16, plain, sK32('unordered$utriple'(sK38,X0,sK36)) = X0 | sK32('unordered$utriple'(sK38,X0,sK36)) = sK38, inference(resolution, [status(thm)], [d15,c55])).
% 19.47/6.77 cnf(d17, plain, ~in(X1,X0) | ~in(X1,'unordered$utriple'(sK38,X0,sK36)) | ~in(X2,'unordered$utriple'(sK38,X0,sK36)) | sK32('unordered$utriple'(sK38,X0,sK36)) = sK38, inference(superposition, [status(thm)], [d16,c51])).
% 19.47/6.77 cnf(d18, plain, sK32('unordered$utriple'(sK38,X0,sK36)) = sK38 | ~in(X1,'unordered$utriple'(sK38,X0,sK36)) | ~in(sK36,X0), inference(resolution, [status(thm)], [d17,d2])).
% 19.47/6.77 cnf(d19, plain, sK32('unordered$utriple'(sK38,X0,sK36)) = sK38 | ~in(sK36,X0), inference(resolution, [status(thm)], [d18,d2])).
% 19.47/6.77 cnf(d20, plain, sK32('unordered$utriple'(sK38,sK37,sK36)) = sK38, inference(resolution, [status(thm)], [d19,c53])).
% 19.47/6.77 cnf(d21, plain, ~in(X0,sK38) | ~in(X0,'unordered$utriple'(sK38,sK37,sK36)) | ~in(X1,'unordered$utriple'(sK38,sK37,sK36)), inference(superposition, [status(thm)], [d20,c51])).
% 19.47/6.77 cnf(d22, plain, ~in(X0,'unordered$utriple'(sK38,sK37,sK36)) | ~in(sK37,sK38), inference(resolution, [status(thm)], [d21,d4])).
% 19.47/6.77 cnf(d23, plain, ~in(X0,'unordered$utriple'(sK38,sK37,sK36)), inference(resolution, [status(thm)], [c54,d22])).
% 19.47/6.77 cnf(d24, plain, $false, inference(resolution, [status(thm)], [d23,d2])).
% 19.47/6.77 % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------