%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : NUM141-1 : 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:18:41 PM UTC 2026
% Result : Unsatisfiable 11.14s 1.97s
% Output : Proof 11.14s
% Verified :
% Comments :
%------------------------------------------------------------------------------
cnf(t152,axiom,
sF0 = member(x,universal_class),
introduced(definition) ).
cnf(f158,negated_conjecture,
member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_successor_of_set_is_set2_1) ).
fof(f158_nnf,plain,
member(x,universal_class),
inference(nnf_transformation,[status(thm)],[f158]) ).
cnf(c158,plain,
member(x,universal_class),
inference(cnf_transformation,[status(esa)],[f158_nnf]) ).
cnf(t6,plain,
member(x,universal_class) = true,
inference(equality_encoding,[status(esa)],[c158]) ).
cnf(t167,plain,
member(x,universal_class) = true,
inference(orient,[status(thm)],[t6]) ).
cnf(t1045,plain,
sF0 = true,
inference(step,[status(thm)],[t152,t167]) ).
cnf(t173,plain,
true = sF0,
inference(orient,[status(thm)],[t1045]) ).
cnf(t158,axiom,
sF6 = member(x,complement(intersection(complement(x),complement(unordered_pair(x,x))))),
introduced(definition) ).
cnf(t153,axiom,
sF1 = complement(x),
introduced(definition) ).
cnf(t164,plain,
complement(x) = sF1,
inference(orient,[status(thm)],[t153]) ).
cnf(t1168,plain,
sF6 = member(x,complement(intersection(sF1,complement(unordered_pair(x,x))))),
inference(step,[status(thm)],[t158,t164]) ).
cnf(t154,axiom,
sF2 = unordered_pair(x,x),
introduced(definition) ).
cnf(t192,plain,
unordered_pair(x,x) = sF2,
inference(orient,[status(thm)],[t154]) ).
cnf(t1169,plain,
sF6 = member(x,complement(intersection(sF1,complement(sF2)))),
inference(step,[status(thm)],[t1168,t192]) ).
cnf(t155,axiom,
sF3 = complement(unordered_pair(x,x)),
introduced(definition) ).
cnf(t1063,plain,
sF3 = complement(sF2),
inference(step,[status(thm)],[t155,t192]) ).
cnf(t196,plain,
complement(sF2) = sF3,
inference(orient,[status(thm)],[t1063]) ).
cnf(t1170,plain,
sF6 = member(x,complement(intersection(sF1,sF3))),
inference(step,[status(thm)],[t1169,t196]) ).
cnf(t156,axiom,
sF4 = intersection(complement(x),complement(unordered_pair(x,x))),
introduced(definition) ).
cnf(t1087,plain,
sF4 = intersection(sF1,complement(unordered_pair(x,x))),
inference(step,[status(thm)],[t156,t164]) ).
cnf(t1088,plain,
sF4 = intersection(sF1,complement(sF2)),
inference(step,[status(thm)],[t1087,t192]) ).
cnf(t1089,plain,
sF4 = intersection(sF1,sF3),
inference(step,[status(thm)],[t1088,t196]) ).
cnf(t251,plain,
intersection(sF1,sF3) = sF4,
inference(orient,[status(thm)],[t1089]) ).
cnf(t1171,plain,
sF6 = member(x,complement(sF4)),
inference(step,[status(thm)],[t1170,t251]) ).
cnf(t157,axiom,
sF5 = complement(intersection(complement(x),complement(unordered_pair(x,x)))),
introduced(definition) ).
cnf(t1103,plain,
sF5 = complement(intersection(sF1,complement(unordered_pair(x,x)))),
inference(step,[status(thm)],[t157,t164]) ).
cnf(t1104,plain,
sF5 = complement(intersection(sF1,complement(sF2))),
inference(step,[status(thm)],[t1103,t192]) ).
cnf(t1105,plain,
sF5 = complement(intersection(sF1,sF3)),
inference(step,[status(thm)],[t1104,t196]) ).
cnf(t1106,plain,
sF5 = complement(sF4),
inference(step,[status(thm)],[t1105,t251]) ).
cnf(t279,plain,
complement(sF4) = sF5,
inference(orient,[status(thm)],[t1106]) ).
cnf(t1172,plain,
sF6 = member(x,sF5),
inference(step,[status(thm)],[t1171,t279]) ).
cnf(f159,negated_conjecture,
~ member(x,successor(x)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_successor_of_set_is_set2_2) ).
fof(f159_nnf,plain,
~ member(x,successor(x)),
inference(nnf_transformation,[status(thm)],[f159]) ).
fof(f159_sk,plain,
~ member(x,successor(x)),
inference(skolemisation,[status(esa)],[f159_nnf]) ).
cnf(c159,plain,
~ member(x,successor(x)),
inference(cnf_transformation,[status(esa)],[f159_sk]) ).
cnf(u83,axiom,
member(x,successor(x)) = false,
inference(equality_encoding,[status(esa)],[c159]) ).
cnf(f42,axiom,
union(X,singleton(X)) = successor(X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor) ).
fof(f42_nnf,plain,
! [X] : union(X,singleton(X)) = successor(X),
inference(nnf_transformation,[status(thm)],[f42]) ).
fof(f42_sk,plain,
! [X] : union(X,singleton(X)) = successor(X),
inference(skolemisation,[status(esa)],[f42_nnf]) ).
cnf(c42,plain,
union(X0,singleton(X0)) = successor(X0),
inference(cnf_transformation,[status(esa)],[f42_sk]) ).
cnf(u4,axiom,
union(X0,singleton(X0)) = successor(X0),
inference(equality_encoding,[status(esa)],[c42]) ).
cnf(f11,axiom,
unordered_pair(X,X) = singleton(X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_set) ).
fof(f11_nnf,plain,
! [X] : unordered_pair(X,X) = singleton(X),
inference(nnf_transformation,[status(thm)],[f11]) ).
fof(f11_sk,plain,
! [X] : unordered_pair(X,X) = singleton(X),
inference(skolemisation,[status(esa)],[f11_nnf]) ).
cnf(c11,plain,
unordered_pair(X0,X0) = singleton(X0),
inference(cnf_transformation,[status(esa)],[f11_sk]) ).
cnf(d0,axiom,
unordered_pair(X0,X0) = singleton(X0),
inference(equality_encoding,[status(esa)],[c11]) ).
cnf(f25,axiom,
complement(intersection(complement(X),complement(Y))) = union(X,Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union) ).
fof(f25_nnf,plain,
! [X,Y] : complement(intersection(complement(X),complement(Y))) = union(X,Y),
inference(nnf_transformation,[status(thm)],[f25]) ).
fof(f25_sk,plain,
! [X,Y] : complement(intersection(complement(X),complement(Y))) = union(X,Y),
inference(skolemisation,[status(esa)],[f25_nnf]) ).
cnf(c25,plain,
complement(intersection(complement(X0),complement(X1))) = union(X0,X1),
inference(cnf_transformation,[status(esa)],[f25_sk]) ).
cnf(d2,axiom,
complement(intersection(complement(X0),complement(X1))) = union(X0,X1),
inference(equality_encoding,[status(esa)],[c25]) ).
cnf(d10,axiom,
complement(intersection(complement(X0),complement(unordered_pair(X0,X0)))) = successor(X0),
inference(definition_unfolding,[status(thm)],[u4,d0,d2]) ).
cnf(t53,plain,
member(x,complement(intersection(complement(x),complement(unordered_pair(x,x))))) = false,
inference(definition_unfolding,[status(thm)],[u83,d10]) ).
cnf(t1140,plain,
member(x,complement(intersection(sF1,complement(unordered_pair(x,x))))) = false,
inference(step,[status(thm)],[t53,t164]) ).
cnf(t1141,plain,
member(x,complement(intersection(sF1,complement(sF2)))) = false,
inference(step,[status(thm)],[t1140,t192]) ).
cnf(t1142,plain,
member(x,complement(intersection(sF1,sF3))) = false,
inference(step,[status(thm)],[t1141,t196]) ).
cnf(t1143,plain,
member(x,complement(sF4)) = false,
inference(step,[status(thm)],[t1142,t251]) ).
cnf(t1144,plain,
member(x,sF5) = false,
inference(step,[status(thm)],[t1143,t279]) ).
cnf(t351,plain,
member(x,sF5) = false,
inference(orient,[status(thm)],[t1144]) ).
cnf(t1173,plain,
sF6 = false,
inference(step,[status(thm)],[t1172,t351]) ).
cnf(t413,plain,
false = sF6,
inference(orient,[status(thm)],[t1173]) ).
cnf(f21,axiom,
( member(Z,Y)
| ~ member(Z,intersection(X,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection2) ).
fof(f21_nnf,plain,
! [Z,X,Y] :
( member(Z,Y)
| ~ member(Z,intersection(X,Y)) ),
inference(nnf_transformation,[status(thm)],[f21]) ).
fof(f21_sk,plain,
! [Z,X,Y] :
( member(Z,Y)
| ~ member(Z,intersection(X,Y)) ),
inference(skolemisation,[status(esa)],[f21_nnf]) ).
cnf(c21,plain,
( member(X0,X2)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[status(esa)],[f21_sk]) ).
cnf(t58,plain,
ifeq(member(X1,intersection(X2,X3)),true,member(X1,X3),true) = true,
inference(equality_encoding,[status(esa)],[c21]) ).
cnf(t1193,plain,
ifeq(member(X1,intersection(X2,X3)),sF0,member(X1,X3),true) = true,
inference(step,[status(thm)],[t58,t173]) ).
cnf(t1194,plain,
ifeq(member(X1,intersection(X2,X3)),sF0,member(X1,X3),sF0) = true,
inference(step,[status(thm)],[t1193,t173]) ).
cnf(t1195,plain,
ifeq(member(X1,intersection(X2,X3)),sF0,member(X1,X3),sF0) = sF0,
inference(step,[status(thm)],[t1194,t173]) ).
cnf(t436,plain,
ifeq(member(X1,intersection(X2,X3)),sF0,member(X1,X3),sF0) = sF0,
inference(orient,[status(thm)],[t1195]) ).
cnf(t444,plain,
sF0 = ifeq(member(X1,sF4),sF0,member(X1,sF3),sF0),
inference(cp,[status(thm)],[t436,t251]) ).
cnf(t465,plain,
ifeq(member(X1,sF4),sF0,member(X1,sF3),sF0) = sF0,
inference(orient,[status(thm)],[t444]) ).
cnf(f24,axiom,
( member(Z,X)
| member(Z,complement(X))
| ~ member(Z,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement2) ).
fof(f24_nnf,plain,
! [Z,X] :
( member(Z,X)
| member(Z,complement(X))
| ~ member(Z,universal_class) ),
inference(nnf_transformation,[status(thm)],[f24]) ).
fof(f24_sk,plain,
! [Z,X] :
( member(Z,X)
| member(Z,complement(X))
| ~ member(Z,universal_class) ),
inference(skolemisation,[status(esa)],[f24_nnf]) ).
cnf(c24,plain,
( member(X0,X1)
| member(X0,complement(X1))
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[status(esa)],[f24_sk]) ).
cnf(t72,plain,
ifeq(member(X1,universal_class),true,or(member(X1,complement(X2)),member(X1,X2)),true) = true,
inference(equality_encoding,[status(esa)],[c24]) ).
cnf(t1307,plain,
ifeq(member(X1,universal_class),sF0,or(member(X1,complement(X2)),member(X1,X2)),true) = true,
inference(step,[status(thm)],[t72,t173]) ).
cnf(t1308,plain,
ifeq(member(X1,universal_class),sF0,or(member(X1,complement(X2)),member(X1,X2)),sF0) = true,
inference(step,[status(thm)],[t1307,t173]) ).
cnf(t1309,plain,
ifeq(member(X1,universal_class),sF0,or(member(X1,complement(X2)),member(X1,X2)),sF0) = sF0,
inference(step,[status(thm)],[t1308,t173]) ).
cnf(t795,plain,
ifeq(member(X1,universal_class),sF0,or(member(X1,complement(X2)),member(X1,X2)),sF0) = sF0,
inference(orient,[status(thm)],[t1309]) ).
cnf(t1057,plain,
member(x,universal_class) = sF0,
inference(step,[status(thm)],[t167,t173]) ).
cnf(t185,plain,
member(x,universal_class) = sF0,
inference(orient,[status(thm)],[t1057]) ).
cnf(t798,plain,
sF0 = ifeq(sF0,sF0,or(member(x,complement(X1)),member(x,X1)),sF0),
inference(cp,[status(thm)],[t795,t185]) ).
cnf(t13,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t197,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t13]) ).
cnf(t1382,plain,
sF0 = or(member(x,complement(X1)),member(x,X1)),
inference(step,[status(thm)],[t798,t197]) ).
cnf(t962,plain,
or(member(x,complement(X1)),member(x,X1)) = sF0,
inference(orient,[status(thm)],[t1382]) ).
cnf(t964,plain,
sF0 = or(member(x,sF5),member(x,sF4)),
inference(cp,[status(thm)],[t962,t279]) ).
cnf(t1179,plain,
member(x,sF5) = sF6,
inference(step,[status(thm)],[t351,t413]) ).
cnf(t421,plain,
member(x,sF5) = sF6,
inference(orient,[status(thm)],[t1179]) ).
cnf(t1383,plain,
sF0 = or(sF6,member(x,sF4)),
inference(step,[status(thm)],[t964,t421]) ).
cnf(t9,plain,
or(false,X1) = X1,
introduced(definition) ).
cnf(t170,plain,
or(false,X1) = X1,
inference(orient,[status(thm)],[t9]) ).
cnf(t1176,plain,
or(sF6,X1) = X1,
inference(step,[status(thm)],[t170,t413]) ).
cnf(t416,plain,
or(sF6,X1) = X1,
inference(rw,[status(thm)],[t1176]) ).
cnf(t453,plain,
or(sF6,X1) = X1,
inference(orient,[status(thm)],[t416]) ).
cnf(t1384,plain,
sF0 = member(x,sF4),
inference(step,[status(thm)],[t1383,t453]) ).
cnf(t965,plain,
member(x,sF4) = sF0,
inference(orient,[status(thm)],[t1384]) ).
cnf(t970,plain,
sF0 = ifeq(sF0,sF0,member(x,sF3),sF0),
inference(cp,[status(thm)],[t465,t965]) ).
cnf(t1388,plain,
sF0 = member(x,sF3),
inference(step,[status(thm)],[t970,t197]) ).
cnf(t20,plain,
ifeq(not(X1),true,X1,false) = false,
introduced(definition) ).
cnf(t1070,plain,
ifeq(not(X1),sF0,X1,false) = false,
inference(step,[status(thm)],[t20,t173]) ).
cnf(t206,plain,
ifeq(not(X1),sF0,X1,false) = false,
inference(orient,[status(thm)],[t1070]) ).
cnf(t419,plain,
ifeq(not(X1),sF0,X1,sF6) = false,
inference(rw,[status(thm)],[t206]) ).
cnf(t1197,plain,
ifeq(not(X1),sF0,X1,sF6) = sF6,
inference(step,[status(thm)],[t419,t413]) ).
cnf(t455,plain,
ifeq(not(X1),sF0,X1,sF6) = sF6,
inference(orient,[status(thm)],[t1197]) ).
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(t55,plain,
or(not(member(X1,complement(X2))),not(member(X1,X2))) = true,
inference(equality_encoding,[status(esa)],[c23]) ).
cnf(t1146,plain,
or(not(member(X1,complement(X2))),not(member(X1,X2))) = sF0,
inference(step,[status(thm)],[t55,t173]) ).
cnf(t355,plain,
or(not(member(X1,complement(X2))),not(member(X1,X2))) = sF0,
inference(orient,[status(thm)],[t1146]) ).
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(t61,plain,
ifeq(member(X1,universal_class),true,member(X1,unordered_pair(X1,X2)),true) = true,
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(t1206,plain,
ifeq(member(X1,universal_class),sF0,member(X1,unordered_pair(X1,X2)),true) = true,
inference(step,[status(thm)],[t61,t173]) ).
cnf(t1207,plain,
ifeq(member(X1,universal_class),sF0,member(X1,unordered_pair(X1,X2)),sF0) = true,
inference(step,[status(thm)],[t1206,t173]) ).
cnf(t1208,plain,
ifeq(member(X1,universal_class),sF0,member(X1,unordered_pair(X1,X2)),sF0) = sF0,
inference(step,[status(thm)],[t1207,t173]) ).
cnf(t484,plain,
ifeq(member(X1,universal_class),sF0,member(X1,unordered_pair(X1,X2)),sF0) = sF0,
inference(orient,[status(thm)],[t1208]) ).
cnf(t487,plain,
sF0 = ifeq(member(x,universal_class),sF0,member(x,sF2),sF0),
inference(cp,[status(thm)],[t484,t192]) ).
cnf(t1209,plain,
sF0 = ifeq(sF0,sF0,member(x,sF2),sF0),
inference(step,[status(thm)],[t487,t185]) ).
cnf(t1210,plain,
sF0 = member(x,sF2),
inference(step,[status(thm)],[t1209,t197]) ).
cnf(t490,plain,
member(x,sF2) = sF0,
inference(orient,[status(thm)],[t1210]) ).
cnf(t491,plain,
sF0 = or(not(member(x,complement(sF2))),not(sF0)),
inference(cp,[status(thm)],[t355,t490]) ).
cnf(t1211,plain,
sF0 = or(not(member(x,sF3)),not(sF0)),
inference(step,[status(thm)],[t491,t196]) ).
cnf(t3,plain,
not(true) = false,
introduced(definition) ).
cnf(t163,plain,
not(true) = false,
inference(orient,[status(thm)],[t3]) ).
cnf(t1052,plain,
not(sF0) = false,
inference(step,[status(thm)],[t163,t173]) ).
cnf(t180,plain,
not(sF0) = false,
inference(rw,[status(thm)],[t1052]) ).
cnf(t191,plain,
not(sF0) = false,
inference(orient,[status(thm)],[t180]) ).
cnf(t1177,plain,
not(sF0) = sF6,
inference(step,[status(thm)],[t191,t413]) ).
cnf(t417,plain,
not(sF0) = sF6,
inference(orient,[status(thm)],[t1177]) ).
cnf(t1212,plain,
sF0 = or(not(member(x,sF3)),sF6),
inference(step,[status(thm)],[t1211,t417]) ).
cnf(t7,plain,
or(X1,false) = X1,
introduced(definition) ).
cnf(t168,plain,
or(X1,false) = X1,
inference(orient,[status(thm)],[t7]) ).
cnf(t1175,plain,
or(X1,sF6) = X1,
inference(step,[status(thm)],[t168,t413]) ).
cnf(t415,plain,
or(X1,sF6) = X1,
inference(rw,[status(thm)],[t1175]) ).
cnf(t452,plain,
or(X1,sF6) = X1,
inference(orient,[status(thm)],[t415]) ).
cnf(t1213,plain,
sF0 = not(member(x,sF3)),
inference(step,[status(thm)],[t1212,t452]) ).
cnf(t494,plain,
not(member(x,sF3)) = sF0,
inference(orient,[status(thm)],[t1213]) ).
cnf(t495,plain,
sF6 = ifeq(sF0,sF0,member(x,sF3),sF6),
inference(cp,[status(thm)],[t455,t494]) ).
cnf(t1214,plain,
sF6 = member(x,sF3),
inference(step,[status(thm)],[t495,t197]) ).
cnf(t496,plain,
member(x,sF3) = sF6,
inference(orient,[status(thm)],[t1214]) ).
cnf(t1389,plain,
sF0 = sF6,
inference(step,[status(thm)],[t1388,t496]) ).
cnf(t973,plain,
sF6 = sF0,
inference(orient,[status(thm)],[t1389]) ).
cnf(t1404,plain,
false = sF0,
inference(step,[status(thm)],[t413,t973]) ).
cnf(t988,plain,
false = sF0,
inference(orient,[status(thm)],[t1404]) ).
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(f126,axiom,
( ~ member(ordered_pair(V,least(Xr,U)),Xr)
| ~ member(V,U)
| ~ subclass(U,Y)
| ~ well_ordering(Xr,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',well_ordering5) ).
fof(f126_nnf,plain,
! [Xr,Y,U,V] :
( ~ member(ordered_pair(V,least(Xr,U)),Xr)
| ~ member(V,U)
| ~ subclass(U,Y)
| ~ well_ordering(Xr,Y) ),
inference(nnf_transformation,[status(thm)],[f126]) ).
fof(f126_sk,plain,
! [Xr,Y,U,V] :
( ~ member(ordered_pair(V,least(Xr,U)),Xr)
| ~ member(V,U)
| ~ subclass(U,Y)
| ~ well_ordering(Xr,Y) ),
inference(skolemisation,[status(esa)],[f126_nnf]) ).
cnf(c126,plain,
( ~ member(ordered_pair(X3,least(X0,X2)),X0)
| ~ member(X3,X2)
| ~ subclass(X2,X1)
| ~ well_ordering(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f126_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c23,c29,c126,c159]) ).
cnf(g0_0,plain,
sF0 != false,
inference(rw,[status(thm)],[goal_0,t173]) ).
cnf(g0_1,plain,
sF0 != sF0,
inference(rw,[status(thm)],[g0_0,t988]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM141-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/0.38 % Computer : n004.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 03:01:40 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 11.14/1.97 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.14/1.97 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------