%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : SEU151+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n005.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 : Thu Sep 24 02:21:48 PM UTC 2026
% Result : Theorem 0.10s 0.38s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU151+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n005.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 05:53:03 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.37 % Drodi V4.1.1
% 0.10/0.38 % Refutation found
% 0.10/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.38 % SZS output start CNFRefutation for theBenchmark
% 0.10/0.38 fof(f2,axiom,(
% 0.10/0.38 (! [A,B] : unordered_pair(A,B) = unordered_pair(B,A) )),
% 0.10/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.38 fof(f3,axiom,(
% 0.10/0.38 (! [A,B,C] :( C = unordered_pair(A,B)<=> (! [D] :( in(D,C)<=> ( D = A| D = B ) ) )) )),
% 0.10/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.38 fof(f5,conjecture,(
% 0.10/0.38 (! [A,B,C,D] :~ ( unordered_pair(A,B) = unordered_pair(C,D)& A != C& A != D ) )),
% 0.10/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.38 fof(f6,negated_conjecture,(
% 0.10/0.38 ~((! [A,B,C,D] :~ ( unordered_pair(A,B) = unordered_pair(C,D)& A != C& A != D ) ))),
% 0.10/0.38 inference(negated_conjecture,[status(cth)],[f5])).
% 0.10/0.38 fof(f9,plain,(
% 0.10/0.38 ![X0,X1]: (unordered_pair(X0,X1)=unordered_pair(X1,X0))),
% 0.10/0.38 inference(cnf_transformation,[status(thm)],[f2])).
% 0.10/0.38 fof(f10,plain,(
% 0.10/0.38 ![A,B,C]: ((~C=unordered_pair(A,B)|(![D]: ((~in(D,C)|(D=A|D=B))&(in(D,C)|(~D=A&~D=B)))))&(C=unordered_pair(A,B)|(?[D]: ((~in(D,C)|(~D=A&~D=B))&(in(D,C)|(D=A|D=B))))))),
% 0.10/0.38 inference(NNF_transformation,[status(thm)],[f3])).
% 0.10/0.38 fof(f11,plain,(
% 0.10/0.38 (![A,B,C]: (~C=unordered_pair(A,B)|((![D]: (~in(D,C)|(D=A|D=B)))&(![D]: (in(D,C)|(~D=A&~D=B))))))&(![A,B,C]: (C=unordered_pair(A,B)|(?[D]: ((~in(D,C)|(~D=A&~D=B))&(in(D,C)|(D=A|D=B))))))),
% 0.10/0.38 inference(miniscoping,[status(thm)],[f10])).
% 0.10/0.38 fof(f12,plain,(
% 0.10/0.38 (![A,B,C]: (~C=unordered_pair(A,B)|((![D]: (~in(D,C)|(D=A|D=B)))&(![D]: (in(D,C)|(~D=A&~D=B))))))&(![A,B,C]: (C=unordered_pair(A,B)|((~in(sK0_skl(C,B,A),C)|(~sK0_skl(C,B,A)=A&~sK0_skl(C,B,A)=B))&(in(sK0_skl(C,B,A),C)|(sK0_skl(C,B,A)=A|sK0_skl(C,B,A)=B)))))),
% 0.10/0.38 inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(D,sK0_skl(C,B,A))],[f11])).
% 0.10/0.38 fof(f13,plain,(
% 0.10/0.38 ![X0,X1,X2,X3]: (~X0=unordered_pair(X1,X2)|~in(X3,X0)|X3=X1|X3=X2)),
% 0.10/0.38 inference(cnf_transformation,[status(thm)],[f12])).
% 0.10/0.38 fof(f14,plain,(
% 0.10/0.38 ![X0,X1,X2,X3]: (~X0=unordered_pair(X1,X2)|in(X3,X0)|~X3=X1)),
% 0.10/0.38 inference(cnf_transformation,[status(thm)],[f12])).
% 0.10/0.38 fof(f19,plain,(
% 0.10/0.38 (?[A,B,C,D]: ((unordered_pair(A,B)=unordered_pair(C,D)&~A=C)&~A=D))),
% 0.10/0.38 inference(pre_NNF_transformation,[status(thm)],[f6])).
% 0.10/0.38 fof(f20,plain,(
% 0.10/0.38 ?[A,D]: ((?[C]: ((?[B]: unordered_pair(A,B)=unordered_pair(C,D))&~A=C))&~A=D)),
% 0.10/0.38 inference(miniscoping,[status(thm)],[f19])).
% 0.10/0.38 fof(f21,plain,(
% 0.10/0.38 ((unordered_pair(sK1_skl,sK4_skl)=unordered_pair(sK3_skl,sK2_skl)&~sK1_skl=sK3_skl)&~sK1_skl=sK2_skl)),
% 0.10/0.38 inference(skolemize,[status(esa),new_symbols(skolem,[sK1_skl,sK2_skl,sK3_skl,sK4_skl]),skolemize(A,sK1_skl),skolemize(D,sK2_skl),skolemize(C,sK3_skl),skolemize(B,sK4_skl)],[f20])).
% 0.10/0.38 fof(f22,plain,(
% 0.10/0.38 unordered_pair(sK1_skl,sK4_skl)=unordered_pair(sK3_skl,sK2_skl)),
% 0.10/0.38 inference(cnf_transformation,[status(thm)],[f21])).
% 0.10/0.38 fof(f23,plain,(
% 0.10/0.38 ~sK1_skl=sK3_skl),
% 0.10/0.38 inference(cnf_transformation,[status(thm)],[f21])).
% 0.10/0.38 fof(f24,plain,(
% 0.10/0.38 ~sK1_skl=sK2_skl),
% 0.10/0.38 inference(cnf_transformation,[status(thm)],[f21])).
% 0.10/0.38 fof(f25,plain,(
% 0.10/0.38 ![X0,X1,X2]: (~in(X0,unordered_pair(X1,X2))|X0=X1|X0=X2)),
% 0.10/0.38 inference(destructive_equality_resolution,[status(thm)],[f13])).
% 0.10/0.38 fof(f26,plain,(
% 0.10/0.38 ![X0,X1]: (in(X0,unordered_pair(X0,X1)))),
% 0.10/0.38 inference(destructive_equality_resolution,[status(thm)],[f14])).
% 0.10/0.38 fof(f28,plain,(
% 0.10/0.38 unordered_pair(sK1_skl,sK4_skl)=unordered_pair(sK2_skl,sK3_skl)),
% 0.10/0.38 inference(paramodulation,[status(thm)],[f22,f9])).
% 0.10/0.38 fof(f58,plain,(
% 0.10/0.38 ![X0]: (~in(X0,unordered_pair(sK1_skl,sK4_skl))|X0=sK2_skl|X0=sK3_skl)),
% 0.10/0.38 inference(paramodulation,[status(thm)],[f28,f25])).
% 0.10/0.38 fof(f62,definition,(
% 0.10/0.38 sQ0_spl <=> (sK3_skl=sK1_skl)),
% 0.10/0.38 introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.10/0.38 fof(f63,plain,(
% 0.10/0.38 sK3_skl=sK1_skl|~sQ0_spl),
% 0.10/0.38 inference(component_clause,[status(thm)],[f62])).
% 0.10/0.38 fof(f69,plain,(
% 0.10/0.38 $false|~sQ0_spl),
% 0.10/0.38 inference(forward_subsumption_resolution,[status(thm)],[f63,f23])).
% 0.10/0.38 fof(f70,plain,(
% 0.10/0.38 ~sQ0_spl),
% 0.10/0.38 inference(contradiction_clause,[status(thm)],[f69])).
% 0.10/0.38 fof(f73,plain,(
% 0.10/0.38 sK1_skl=sK2_skl|sK1_skl=sK3_skl),
% 0.10/0.38 inference(resolution,[status(thm)],[f58,f26])).
% 0.10/0.38 fof(f85,definition,(
% 0.10/0.38 sQ5_spl <=> (sK1_skl=sK2_skl)),
% 0.10/0.38 introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition])).
% 0.10/0.38 fof(f86,plain,(
% 0.10/0.38 sK1_skl=sK2_skl|~sQ5_spl),
% 0.10/0.38 inference(component_clause,[status(thm)],[f85])).
% 0.10/0.38 fof(f88,plain,(
% 0.10/0.38 sQ5_spl|sQ0_spl),
% 0.10/0.38 inference(split_clause,[status(thm)],[f73,f85,f62])).
% 0.10/0.38 fof(f89,plain,(
% 0.10/0.38 $false|~sQ5_spl),
% 0.10/0.38 inference(forward_subsumption_resolution,[status(thm)],[f86,f24])).
% 0.10/0.38 fof(f90,plain,(
% 0.10/0.38 ~sQ5_spl),
% 0.10/0.38 inference(contradiction_clause,[status(thm)],[f89])).
% 0.10/0.38 fof(f91,plain,(
% 0.10/0.38 $false),
% 0.10/0.38 inference(sat_refutation,[status(thm)],[f70,f88,f90])).
% 0.10/0.38 % SZS output end CNFRefutation for theBenchmark.p
% 0.14/0.41 % Elapsed time: 0.038283 seconds
% 0.14/0.41 % CPU time: 0.078452 seconds
% 0.14/0.41 % Total memory used: 12.721 MB
% 0.14/0.41 % Net memory used: 12.688 MB
%------------------------------------------------------------------------------