%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : SET002-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n020.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:11:07 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.38s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET002-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n020.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 : Mon Sep 21 04:41:47 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 Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.38 % SZS output start CNFRefutation for theBenchmark
% 0.10/0.38 fof(f2,axiom,(
% 0.10/0.38 (![Subset,Superset]: (( subset(Subset,Superset)| member(member_of_1_not_of_2(Subset,Superset),Subset) ) ))),
% 0.10/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.38 fof(f3,axiom,(
% 0.10/0.38 (![Subset,Superset]: (( ~ member(member_of_1_not_of_2(Subset,Superset),Superset)| subset(Subset,Superset) ) ))),
% 0.10/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.38 fof(f6,axiom,(
% 0.10/0.38 (![Set1,Set2]: (( ~ subset(Set1,Set2)| ~ subset(Set2,Set1)| equal_sets(Set2,Set1) ) ))),
% 0.10/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.38 fof(f7,axiom,(
% 0.10/0.38 (![Set1,Set2,Union,Element]: (( ~ union(Set1,Set2,Union)| ~ member(Element,Union)| member(Element,Set1)| member(Element,Set2) ) ))),
% 0.10/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.38 fof(f8,axiom,(
% 0.10/0.38 (![Set1,Set2,Union,Element]: (( ~ union(Set1,Set2,Union)| ~ member(Element,Set1)| member(Element,Union) ) ))),
% 0.10/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.38 fof(f13,hypothesis,(
% 0.10/0.38 union(a,a,aUa) ),
% 0.10/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.38 fof(f14,negated_conjecture,(
% 0.10/0.38 ~ equal_sets(aUa,a) ),
% 0.10/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.38 fof(f17,plain,(
% 0.10/0.38 ![X0,X1]: (subset(X0,X1)|member(member_of_1_not_of_2(X0,X1),X0))),
% 0.10/0.38 inference(cnf_transformation,[status(thm)],[f2])).
% 0.10/0.38 fof(f18,plain,(
% 0.10/0.38 ![X0,X1]: (~member(member_of_1_not_of_2(X0,X1),X1)|subset(X0,X1))),
% 0.10/0.38 inference(cnf_transformation,[status(thm)],[f3])).
% 0.10/0.38 fof(f21,plain,(
% 0.10/0.38 ![X0,X1]: (~subset(X0,X1)|~subset(X1,X0)|equal_sets(X1,X0))),
% 0.10/0.38 inference(cnf_transformation,[status(thm)],[f6])).
% 0.10/0.38 fof(f22,plain,(
% 0.10/0.38 ![Set2,Element]: ((![Set1]: ((![Union]: (~union(Set1,Set2,Union)|~member(Element,Union)))|member(Element,Set1)))|member(Element,Set2))),
% 0.10/0.38 inference(miniscoping,[status(thm)],[f7])).
% 0.10/0.38 fof(f23,plain,(
% 0.10/0.38 ![X0,X1,X2,X3]: (~union(X0,X1,X2)|~member(X3,X2)|member(X3,X0)|member(X3,X1))),
% 0.10/0.38 inference(cnf_transformation,[status(thm)],[f22])).
% 0.10/0.38 fof(f24,plain,(
% 0.10/0.38 ![Union,Element]: ((![Set1]: ((![Set2]: ~union(Set1,Set2,Union))|~member(Element,Set1)))|member(Element,Union))),
% 0.10/0.38 inference(miniscoping,[status(thm)],[f8])).
% 0.10/0.38 fof(f25,plain,(
% 0.10/0.38 ![X0,X1,X2,X3]: (~union(X0,X1,X2)|~member(X3,X0)|member(X3,X2))),
% 0.10/0.38 inference(cnf_transformation,[status(thm)],[f24])).
% 0.10/0.38 fof(f31,plain,(
% 0.10/0.38 union(a,a,aUa)),
% 0.10/0.38 inference(cnf_transformation,[status(thm)],[f13])).
% 0.10/0.38 fof(f32,plain,(
% 0.10/0.38 ~equal_sets(aUa,a)),
% 0.10/0.38 inference(cnf_transformation,[status(thm)],[f14])).
% 0.10/0.38 fof(f41,plain,(
% 0.10/0.38 ![X0]: (~member(X0,aUa)|member(X0,a)|member(X0,a))),
% 0.10/0.38 inference(resolution,[status(thm)],[f23,f31])).
% 0.10/0.38 fof(f42,plain,(
% 0.10/0.38 ![X0]: (~member(X0,aUa)|member(X0,a))),
% 0.10/0.38 inference(duplicate_literals_removal,[status(thm)],[f41])).
% 0.10/0.38 fof(f43,plain,(
% 0.10/0.38 ![X0]: (member(member_of_1_not_of_2(aUa,X0),a)|subset(aUa,X0))),
% 0.10/0.38 inference(resolution,[status(thm)],[f42,f17])).
% 0.10/0.38 fof(f45,plain,(
% 0.10/0.38 ![X0]: (~member(X0,a)|member(X0,aUa))),
% 0.10/0.38 inference(resolution,[status(thm)],[f25,f31])).
% 0.10/0.38 fof(f46,plain,(
% 0.10/0.38 ![X0]: (~member(member_of_1_not_of_2(X0,aUa),a)|subset(X0,aUa))),
% 0.10/0.38 inference(resolution,[status(thm)],[f45,f18])).
% 0.10/0.38 fof(f49,plain,(
% 0.10/0.38 subset(aUa,a)|subset(aUa,a)),
% 0.10/0.38 inference(resolution,[status(thm)],[f43,f18])).
% 0.10/0.38 fof(f50,definition,(
% 0.10/0.38 sQ0_spl <=> (subset(aUa,a))),
% 0.10/0.38 introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.10/0.38 fof(f51,plain,(
% 0.10/0.38 subset(aUa,a)|~sQ0_spl),
% 0.10/0.38 inference(component_clause,[status(thm)],[f50])).
% 0.10/0.38 fof(f53,plain,(
% 0.10/0.38 sQ0_spl),
% 0.10/0.38 inference(split_clause,[status(thm)],[f49,f50])).
% 0.10/0.38 fof(f55,plain,(
% 0.10/0.38 ~subset(a,aUa)|equal_sets(aUa,a)|~sQ0_spl),
% 0.10/0.38 inference(resolution,[status(thm)],[f51,f21])).
% 0.10/0.38 fof(f56,definition,(
% 0.10/0.38 sQ1_spl <=> (subset(a,aUa))),
% 0.10/0.38 introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.10/0.38 fof(f59,definition,(
% 0.10/0.38 sQ2_spl <=> (equal_sets(aUa,a))),
% 0.10/0.38 introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.10/0.38 fof(f60,plain,(
% 0.10/0.38 equal_sets(aUa,a)|~sQ2_spl),
% 0.10/0.38 inference(component_clause,[status(thm)],[f59])).
% 0.10/0.38 fof(f62,plain,(
% 0.10/0.38 ~sQ1_spl|sQ2_spl|~sQ0_spl),
% 0.10/0.38 inference(split_clause,[status(thm)],[f55,f56,f59,f50])).
% 0.10/0.38 fof(f65,plain,(
% 0.10/0.38 subset(a,aUa)|subset(a,aUa)),
% 0.10/0.38 inference(resolution,[status(thm)],[f46,f17])).
% 0.10/0.38 fof(f71,plain,(
% 0.10/0.38 sQ1_spl),
% 0.10/0.38 inference(split_clause,[status(thm)],[f65,f56])).
% 0.10/0.38 fof(f72,plain,(
% 0.10/0.38 $false|~sQ2_spl),
% 0.10/0.38 inference(forward_subsumption_resolution,[status(thm)],[f60,f32])).
% 0.10/0.38 fof(f73,plain,(
% 0.10/0.38 ~sQ2_spl),
% 0.10/0.38 inference(contradiction_clause,[status(thm)],[f72])).
% 0.10/0.38 fof(f74,plain,(
% 0.10/0.38 $false),
% 0.10/0.38 inference(sat_refutation,[status(thm)],[f53,f62,f71,f73])).
% 0.10/0.38 % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.40 % Elapsed time: 0.037209 seconds
% 0.10/0.40 % CPU time: 0.094561 seconds
% 0.10/0.40 % Total memory used: 9.697 MB
% 0.10/0.40 % Net memory used: 9.468 MB
%------------------------------------------------------------------------------