%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET074-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n004.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 : Fri Sep 25 02:41:58 PM UTC 2026
% Result : Unsatisfiable 5.78s 1.19s
% Output : Proof 5.78s
% Verified :
% Comments :
%------------------------------------------------------------------------------
cnf(t116,axiom,
sF0 = member(y,universal_class),
introduced(definition) ).
cnf(f115,negated_conjecture,
member(y,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_unordered_pair_axiom2_1) ).
fof(f115_nnf,plain,
member(y,universal_class),
inference(nnf_transformation,[status(thm)],[f115]) ).
cnf(c115,plain,
member(y,universal_class),
inference(cnf_transformation,[status(esa)],[f115_nnf]) ).
cnf(t8,plain,
member(y,universal_class) = true,
inference(equality_encoding,[status(esa)],[c115]) ).
cnf(t126,plain,
member(y,universal_class) = true,
inference(orient,[status(thm)],[t8]) ).
cnf(t408,plain,
sF0 = true,
inference(step,[status(thm)],[t116,t126]) ).
cnf(t135,plain,
true = sF0,
inference(orient,[status(thm)],[t408]) ).
cnf(f8,axiom,
( member(X,unordered_pair(X,Y))
| ~ member(X,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair2) ).
fof(f8_nnf,plain,
! [X,Y] :
( member(X,unordered_pair(X,Y))
| ~ member(X,universal_class) ),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
! [X,Y] :
( member(X,unordered_pair(X,Y))
| ~ member(X,universal_class) ),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c8,plain,
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(t53,plain,
ifeq(member(X1,universal_class),true,member(X1,unordered_pair(X1,X2)),true) = true,
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(t530,plain,
ifeq(member(X1,universal_class),sF0,member(X1,unordered_pair(X1,X2)),true) = true,
inference(step,[status(thm)],[t53,t135]) ).
cnf(t531,plain,
ifeq(member(X1,universal_class),sF0,member(X1,unordered_pair(X1,X2)),sF0) = true,
inference(step,[status(thm)],[t530,t135]) ).
cnf(t532,plain,
ifeq(member(X1,universal_class),sF0,member(X1,unordered_pair(X1,X2)),sF0) = sF0,
inference(step,[status(thm)],[t531,t135]) ).
cnf(t369,plain,
ifeq(member(X1,universal_class),sF0,member(X1,unordered_pair(X1,X2)),sF0) = sF0,
inference(orient,[status(thm)],[t532]) ).
cnf(f116,negated_conjecture,
unordered_pair(x,y) = null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_unordered_pair_axiom2_2) ).
fof(f116_nnf,plain,
unordered_pair(x,y) = null_class,
inference(nnf_transformation,[status(thm)],[f116]) ).
cnf(c116,plain,
unordered_pair(x,y) = null_class,
inference(cnf_transformation,[status(esa)],[f116_nnf]) ).
cnf(t16,plain,
unordered_pair(x,y) = null_class,
inference(equality_encoding,[status(esa)],[c116]) ).
cnf(t134,plain,
unordered_pair(x,y) = null_class,
inference(orient,[status(thm)],[t16]) ).
cnf(t117,axiom,
sF1 = unordered_pair(x,y),
introduced(definition) ).
cnf(t430,plain,
sF1 = null_class,
inference(step,[status(thm)],[t117,t134]) ).
cnf(t160,plain,
null_class = sF1,
inference(orient,[status(thm)],[t430]) ).
cnf(t434,plain,
unordered_pair(x,y) = sF1,
inference(step,[status(thm)],[t134,t160]) ).
cnf(t164,plain,
unordered_pair(x,y) = sF1,
inference(orient,[status(thm)],[t434]) ).
cnf(f107,axiom,
unordered_pair(X,Y) = unordered_pair(Y,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_unordered_pair) ).
fof(f107_nnf,plain,
! [X,Y] : unordered_pair(X,Y) = unordered_pair(Y,X),
inference(nnf_transformation,[status(thm)],[f107]) ).
fof(f107_sk,plain,
! [X,Y] : unordered_pair(X,Y) = unordered_pair(Y,X),
inference(skolemisation,[status(esa)],[f107_nnf]) ).
cnf(c107,plain,
unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[status(esa)],[f107_sk]) ).
cnf(t21,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(equality_encoding,[status(esa)],[c107]) ).
cnf(t175,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(orient,[status(thm)],[t21]) ).
cnf(t441,plain,
unordered_pair(y,x) = sF1,
inference(step,[status(thm)],[t164,t175]) ).
cnf(t176,plain,
unordered_pair(y,x) = sF1,
inference(rw,[status(thm)],[t441]) ).
cnf(t177,plain,
unordered_pair(y,x) = sF1,
inference(orient,[status(thm)],[t176]) ).
cnf(t375,plain,
sF0 = ifeq(member(y,universal_class),sF0,member(y,sF1),sF0),
inference(cp,[status(thm)],[t369,t177]) ).
cnf(t422,plain,
member(y,universal_class) = sF0,
inference(step,[status(thm)],[t126,t135]) ).
cnf(t149,plain,
member(y,universal_class) = sF0,
inference(orient,[status(thm)],[t422]) ).
cnf(t533,plain,
sF0 = ifeq(sF0,sF0,member(y,sF1),sF0),
inference(step,[status(thm)],[t375,t149]) ).
cnf(t17,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t167,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t17]) ).
cnf(t534,plain,
sF0 = member(y,sF1),
inference(step,[status(thm)],[t533,t167]) ).
cnf(f102,axiom,
~ member(Z,null_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_null_class) ).
fof(f102_nnf,plain,
! [Z] : ~ member(Z,null_class),
inference(nnf_transformation,[status(thm)],[f102]) ).
fof(f102_sk,plain,
! [Z] : ~ member(Z,null_class),
inference(skolemisation,[status(esa)],[f102_nnf]) ).
cnf(c102,plain,
~ member(X0,null_class),
inference(cnf_transformation,[status(esa)],[f102_sk]) ).
cnf(t5,plain,
member(X1,null_class) = false,
inference(equality_encoding,[status(esa)],[c102]) ).
cnf(t123,plain,
member(X1,null_class) = false,
inference(orient,[status(thm)],[t5]) ).
cnf(t431,plain,
member(X1,sF1) = false,
inference(step,[status(thm)],[t123,t160]) ).
cnf(t161,plain,
member(X1,sF1) = false,
inference(rw,[status(thm)],[t431]) ).
cnf(t169,plain,
member(X1,sF1) = false,
inference(orient,[status(thm)],[t161]) ).
cnf(t535,plain,
sF0 = false,
inference(step,[status(thm)],[t534,t169]) ).
cnf(t377,plain,
false = sF0,
inference(orient,[status(thm)],[t535]) ).
cnf(f23,axiom,
( ~ member(Z,X)
| ~ member(Z,complement(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement1) ).
fof(f23_nnf,plain,
! [Z,X] :
( ~ member(Z,X)
| ~ member(Z,complement(X)) ),
inference(nnf_transformation,[status(thm)],[f23]) ).
fof(f23_sk,plain,
! [Z,X] :
( ~ member(Z,X)
| ~ member(Z,complement(X)) ),
inference(skolemisation,[status(esa)],[f23_nnf]) ).
cnf(c23,plain,
( ~ member(X0,X1)
| ~ member(X0,complement(X1)) ),
inference(cnf_transformation,[status(esa)],[f23_sk]) ).
cnf(f29,axiom,
( ~ member(Z,domain_of(X))
| restrict(X,singleton(Z),universal_class) != null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain1) ).
fof(f29_nnf,plain,
! [X,Z] :
( ~ member(Z,domain_of(X))
| restrict(X,singleton(Z),universal_class) != null_class ),
inference(nnf_transformation,[status(thm)],[f29]) ).
fof(f29_sk,plain,
! [X,Z] :
( ~ member(Z,domain_of(X))
| restrict(X,singleton(Z),universal_class) != null_class ),
inference(skolemisation,[status(esa)],[f29_nnf]) ).
cnf(c29,plain,
( ~ member(X1,domain_of(X0))
| restrict(X0,singleton(X1),universal_class) != null_class ),
inference(cnf_transformation,[status(esa)],[f29_sk]) ).
cnf(f101,axiom,
~ member(Y,intersection(complement(X),X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',special_classes_lemma) ).
fof(f101_nnf,plain,
! [Y,X] : ~ member(Y,intersection(complement(X),X)),
inference(nnf_transformation,[status(thm)],[f101]) ).
fof(f101_sk,plain,
! [Y,X] : ~ member(Y,intersection(complement(X),X)),
inference(skolemisation,[status(esa)],[f101_nnf]) ).
cnf(c101,plain,
~ member(X0,intersection(complement(X1),X1)),
inference(cnf_transformation,[status(esa)],[f101_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c23,c29,c101,c102]) ).
cnf(g0_0,plain,
sF0 != false,
inference(rw,[status(thm)],[goal_0,t135]) ).
cnf(g0_1,plain,
sF0 != sF0,
inference(rw,[status(thm)],[g0_0,t377]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET074-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.12/0.38 % Computer : n004.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Thu Sep 24 09:36:36 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.78/1.19 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.78/1.19 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------