%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET124-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n013.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:42:27 PM UTC 2026
% Result : Unsatisfiable 6.31s 1.21s
% Output : Proof 6.31s
% Verified :
% Comments :
%------------------------------------------------------------------------------
cnf(t91,axiom,
sF0 = member(x,universal_class),
introduced(definition) ).
cnf(f92,negated_conjecture,
member(x,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_set_builder_alternate_defn2_1) ).
fof(f92_nnf,plain,
member(x,universal_class),
inference(nnf_transformation,[status(thm)],[f92]) ).
cnf(c92,plain,
member(x,universal_class),
inference(cnf_transformation,[status(esa)],[f92_nnf]) ).
cnf(t6,plain,
member(x,universal_class) = true,
inference(equality_encoding,[status(esa)],[c92]) ).
cnf(t106,plain,
member(x,universal_class) = true,
inference(orient,[status(thm)],[t6]) ).
cnf(t822,plain,
sF0 = true,
inference(step,[status(thm)],[t91,t106]) ).
cnf(t112,plain,
true = sF0,
inference(orient,[status(thm)],[t822]) ).
cnf(t97,axiom,
sF6 = member(x,complement(intersection(complement(unordered_pair(x,x)),complement(z)))),
introduced(definition) ).
cnf(t92,axiom,
sF1 = unordered_pair(x,x),
introduced(definition) ).
cnf(t131,plain,
unordered_pair(x,x) = sF1,
inference(orient,[status(thm)],[t92]) ).
cnf(t916,plain,
sF6 = member(x,complement(intersection(complement(sF1),complement(z)))),
inference(step,[status(thm)],[t97,t131]) ).
cnf(t93,axiom,
sF2 = complement(unordered_pair(x,x)),
introduced(definition) ).
cnf(t840,plain,
sF2 = complement(sF1),
inference(step,[status(thm)],[t93,t131]) ).
cnf(t134,plain,
complement(sF1) = sF2,
inference(orient,[status(thm)],[t840]) ).
cnf(t917,plain,
sF6 = member(x,complement(intersection(sF2,complement(z)))),
inference(step,[status(thm)],[t916,t134]) ).
cnf(t94,axiom,
sF3 = complement(z),
introduced(definition) ).
cnf(t103,plain,
complement(z) = sF3,
inference(orient,[status(thm)],[t94]) ).
cnf(t918,plain,
sF6 = member(x,complement(intersection(sF2,sF3))),
inference(step,[status(thm)],[t917,t103]) ).
cnf(t95,axiom,
sF4 = intersection(complement(unordered_pair(x,x)),complement(z)),
introduced(definition) ).
cnf(t857,plain,
sF4 = intersection(complement(sF1),complement(z)),
inference(step,[status(thm)],[t95,t131]) ).
cnf(t858,plain,
sF4 = intersection(sF2,complement(z)),
inference(step,[status(thm)],[t857,t134]) ).
cnf(t859,plain,
sF4 = intersection(sF2,sF3),
inference(step,[status(thm)],[t858,t103]) ).
cnf(t167,plain,
intersection(sF2,sF3) = sF4,
inference(orient,[status(thm)],[t859]) ).
cnf(t919,plain,
sF6 = member(x,complement(sF4)),
inference(step,[status(thm)],[t918,t167]) ).
cnf(t96,axiom,
sF5 = complement(intersection(complement(unordered_pair(x,x)),complement(z))),
introduced(definition) ).
cnf(t870,plain,
sF5 = complement(intersection(complement(sF1),complement(z))),
inference(step,[status(thm)],[t96,t131]) ).
cnf(t871,plain,
sF5 = complement(intersection(sF2,complement(z))),
inference(step,[status(thm)],[t870,t134]) ).
cnf(t872,plain,
sF5 = complement(intersection(sF2,sF3)),
inference(step,[status(thm)],[t871,t103]) ).
cnf(t873,plain,
sF5 = complement(sF4),
inference(step,[status(thm)],[t872,t167]) ).
cnf(t185,plain,
complement(sF4) = sF5,
inference(orient,[status(thm)],[t873]) ).
cnf(t920,plain,
sF6 = member(x,sF5),
inference(step,[status(thm)],[t919,t185]) ).
cnf(f93,negated_conjecture,
~ member(x,set_builder(x,z)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_set_builder_alternate_defn2_2) ).
fof(f93_nnf,plain,
~ member(x,set_builder(x,z)),
inference(nnf_transformation,[status(thm)],[f93]) ).
fof(f93_sk,plain,
~ member(x,set_builder(x,z)),
inference(skolemisation,[status(esa)],[f93_nnf]) ).
cnf(c93,plain,
~ member(x,set_builder(x,z)),
inference(cnf_transformation,[status(esa)],[f93_sk]) ).
cnf(u50,axiom,
member(x,set_builder(x,z)) = false,
inference(equality_encoding,[status(esa)],[c93]) ).
cnf(f91,axiom,
union(singleton(X),Y) = set_builder(X,Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_of_set_builder) ).
fof(f91_nnf,plain,
! [X,Y] : union(singleton(X),Y) = set_builder(X,Y),
inference(nnf_transformation,[status(thm)],[f91]) ).
fof(f91_sk,plain,
! [X,Y] : union(singleton(X),Y) = set_builder(X,Y),
inference(skolemisation,[status(esa)],[f91_nnf]) ).
cnf(c91,plain,
union(singleton(X0),X1) = set_builder(X0,X1),
inference(cnf_transformation,[status(esa)],[f91_sk]) ).
cnf(u8,axiom,
union(singleton(X0),X1) = set_builder(X0,X1),
inference(equality_encoding,[status(esa)],[c91]) ).
cnf(f11,axiom,
unordered_pair(X,X) = singleton(X),
file('/export/starexec/sandbox/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/sandbox/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(d15,axiom,
complement(intersection(complement(unordered_pair(X0,X0)),complement(X1))) = set_builder(X0,X1),
inference(definition_unfolding,[status(thm)],[u8,d0,d2]) ).
cnf(t35,plain,
member(x,complement(intersection(complement(unordered_pair(x,x)),complement(z)))) = false,
inference(definition_unfolding,[status(thm)],[u50,d15]) ).
cnf(t888,plain,
member(x,complement(intersection(complement(sF1),complement(z)))) = false,
inference(step,[status(thm)],[t35,t131]) ).
cnf(t889,plain,
member(x,complement(intersection(sF2,complement(z)))) = false,
inference(step,[status(thm)],[t888,t134]) ).
cnf(t890,plain,
member(x,complement(intersection(sF2,sF3))) = false,
inference(step,[status(thm)],[t889,t103]) ).
cnf(t891,plain,
member(x,complement(sF4)) = false,
inference(step,[status(thm)],[t890,t167]) ).
cnf(t892,plain,
member(x,sF5) = false,
inference(step,[status(thm)],[t891,t185]) ).
cnf(t208,plain,
member(x,sF5) = false,
inference(orient,[status(thm)],[t892]) ).
cnf(t921,plain,
sF6 = false,
inference(step,[status(thm)],[t920,t208]) ).
cnf(t269,plain,
false = sF6,
inference(orient,[status(thm)],[t921]) ).
cnf(f20,axiom,
( member(Z,X)
| ~ member(Z,intersection(X,Y)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection1) ).
fof(f20_nnf,plain,
! [Z,X,Y] :
( member(Z,X)
| ~ member(Z,intersection(X,Y)) ),
inference(nnf_transformation,[status(thm)],[f20]) ).
fof(f20_sk,plain,
! [Z,X,Y] :
( member(Z,X)
| ~ member(Z,intersection(X,Y)) ),
inference(skolemisation,[status(esa)],[f20_nnf]) ).
cnf(c20,plain,
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[status(esa)],[f20_sk]) ).
cnf(t39,plain,
ifeq(member(X1,intersection(X2,X3)),true,member(X1,X2),true) = true,
inference(equality_encoding,[status(esa)],[c20]) ).
cnf(t913,plain,
ifeq(member(X1,intersection(X2,X3)),sF0,member(X1,X2),true) = true,
inference(step,[status(thm)],[t39,t112]) ).
cnf(t914,plain,
ifeq(member(X1,intersection(X2,X3)),sF0,member(X1,X2),sF0) = true,
inference(step,[status(thm)],[t913,t112]) ).
cnf(t915,plain,
ifeq(member(X1,intersection(X2,X3)),sF0,member(X1,X2),sF0) = sF0,
inference(step,[status(thm)],[t914,t112]) ).
cnf(t245,plain,
ifeq(member(X1,intersection(X2,X3)),sF0,member(X1,X2),sF0) = sF0,
inference(orient,[status(thm)],[t915]) ).
cnf(t251,plain,
sF0 = ifeq(member(X1,sF4),sF0,member(X1,sF2),sF0),
inference(cp,[status(thm)],[t245,t167]) ).
cnf(t266,plain,
ifeq(member(X1,sF4),sF0,member(X1,sF2),sF0) = sF0,
inference(orient,[status(thm)],[t251]) ).
cnf(f24,axiom,
( member(Z,X)
| member(Z,complement(X))
| ~ member(Z,universal_class) ),
file('/export/starexec/sandbox/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(t50,plain,
ifeq(member(X1,universal_class),true,or(member(X1,complement(X2)),member(X1,X2)),true) = true,
inference(equality_encoding,[status(esa)],[c24]) ).
cnf(t1031,plain,
ifeq(member(X1,universal_class),sF0,or(member(X1,complement(X2)),member(X1,X2)),true) = true,
inference(step,[status(thm)],[t50,t112]) ).
cnf(t1032,plain,
ifeq(member(X1,universal_class),sF0,or(member(X1,complement(X2)),member(X1,X2)),sF0) = true,
inference(step,[status(thm)],[t1031,t112]) ).
cnf(t1033,plain,
ifeq(member(X1,universal_class),sF0,or(member(X1,complement(X2)),member(X1,X2)),sF0) = sF0,
inference(step,[status(thm)],[t1032,t112]) ).
cnf(t577,plain,
ifeq(member(X1,universal_class),sF0,or(member(X1,complement(X2)),member(X1,X2)),sF0) = sF0,
inference(orient,[status(thm)],[t1033]) ).
cnf(t834,plain,
member(x,universal_class) = sF0,
inference(step,[status(thm)],[t106,t112]) ).
cnf(t124,plain,
member(x,universal_class) = sF0,
inference(orient,[status(thm)],[t834]) ).
cnf(t580,plain,
sF0 = ifeq(sF0,sF0,or(member(x,complement(X1)),member(x,X1)),sF0),
inference(cp,[status(thm)],[t577,t124]) ).
cnf(t12,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t135,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t12]) ).
cnf(t1106,plain,
sF0 = or(member(x,complement(X1)),member(x,X1)),
inference(step,[status(thm)],[t580,t135]) ).
cnf(t743,plain,
or(member(x,complement(X1)),member(x,X1)) = sF0,
inference(orient,[status(thm)],[t1106]) ).
cnf(t745,plain,
sF0 = or(member(x,sF5),member(x,sF4)),
inference(cp,[status(thm)],[t743,t185]) ).
cnf(t927,plain,
member(x,sF5) = sF6,
inference(step,[status(thm)],[t208,t269]) ).
cnf(t277,plain,
member(x,sF5) = sF6,
inference(orient,[status(thm)],[t927]) ).
cnf(t1107,plain,
sF0 = or(sF6,member(x,sF4)),
inference(step,[status(thm)],[t745,t277]) ).
cnf(t9,plain,
or(false,X1) = X1,
introduced(definition) ).
cnf(t109,plain,
or(false,X1) = X1,
inference(orient,[status(thm)],[t9]) ).
cnf(t924,plain,
or(sF6,X1) = X1,
inference(step,[status(thm)],[t109,t269]) ).
cnf(t272,plain,
or(sF6,X1) = X1,
inference(rw,[status(thm)],[t924]) ).
cnf(t307,plain,
or(sF6,X1) = X1,
inference(orient,[status(thm)],[t272]) ).
cnf(t1108,plain,
sF0 = member(x,sF4),
inference(step,[status(thm)],[t1107,t307]) ).
cnf(t746,plain,
member(x,sF4) = sF0,
inference(orient,[status(thm)],[t1108]) ).
cnf(t749,plain,
sF0 = ifeq(sF0,sF0,member(x,sF2),sF0),
inference(cp,[status(thm)],[t266,t746]) ).
cnf(t1112,plain,
sF0 = member(x,sF2),
inference(step,[status(thm)],[t749,t135]) ).
cnf(t16,plain,
ifeq(not(X1),true,X1,false) = false,
introduced(definition) ).
cnf(t844,plain,
ifeq(not(X1),sF0,X1,false) = false,
inference(step,[status(thm)],[t16,t112]) ).
cnf(t141,plain,
ifeq(not(X1),sF0,X1,false) = false,
inference(orient,[status(thm)],[t844]) ).
cnf(t275,plain,
ifeq(not(X1),sF0,X1,sF6) = false,
inference(rw,[status(thm)],[t141]) ).
cnf(t945,plain,
ifeq(not(X1),sF0,X1,sF6) = sF6,
inference(step,[status(thm)],[t275,t269]) ).
cnf(t309,plain,
ifeq(not(X1),sF0,X1,sF6) = sF6,
inference(orient,[status(thm)],[t945]) ).
cnf(f23,axiom,
( ~ member(Z,X)
| ~ member(Z,complement(X)) ),
file('/export/starexec/sandbox/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(t37,plain,
or(not(member(X1,complement(X2))),not(member(X1,X2))) = true,
inference(equality_encoding,[status(esa)],[c23]) ).
cnf(t894,plain,
or(not(member(X1,complement(X2))),not(member(X1,X2))) = sF0,
inference(step,[status(thm)],[t37,t112]) ).
cnf(t213,plain,
or(not(member(X1,complement(X2))),not(member(X1,X2))) = sF0,
inference(orient,[status(thm)],[t894]) ).
cnf(f8,axiom,
( member(X,unordered_pair(X,Y))
| ~ member(X,universal_class) ),
file('/export/starexec/sandbox/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(t41,plain,
ifeq(member(X1,universal_class),true,member(X1,unordered_pair(X1,X2)),true) = true,
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(t946,plain,
ifeq(member(X1,universal_class),sF0,member(X1,unordered_pair(X1,X2)),true) = true,
inference(step,[status(thm)],[t41,t112]) ).
cnf(t947,plain,
ifeq(member(X1,universal_class),sF0,member(X1,unordered_pair(X1,X2)),sF0) = true,
inference(step,[status(thm)],[t946,t112]) ).
cnf(t948,plain,
ifeq(member(X1,universal_class),sF0,member(X1,unordered_pair(X1,X2)),sF0) = sF0,
inference(step,[status(thm)],[t947,t112]) ).
cnf(t315,plain,
ifeq(member(X1,universal_class),sF0,member(X1,unordered_pair(X1,X2)),sF0) = sF0,
inference(orient,[status(thm)],[t948]) ).
cnf(t318,plain,
sF0 = ifeq(member(x,universal_class),sF0,member(x,sF1),sF0),
inference(cp,[status(thm)],[t315,t131]) ).
cnf(t949,plain,
sF0 = ifeq(sF0,sF0,member(x,sF1),sF0),
inference(step,[status(thm)],[t318,t124]) ).
cnf(t950,plain,
sF0 = member(x,sF1),
inference(step,[status(thm)],[t949,t135]) ).
cnf(t321,plain,
member(x,sF1) = sF0,
inference(orient,[status(thm)],[t950]) ).
cnf(t322,plain,
sF0 = or(not(member(x,complement(sF1))),not(sF0)),
inference(cp,[status(thm)],[t213,t321]) ).
cnf(t951,plain,
sF0 = or(not(member(x,sF2)),not(sF0)),
inference(step,[status(thm)],[t322,t134]) ).
cnf(t3,plain,
not(true) = false,
introduced(definition) ).
cnf(t102,plain,
not(true) = false,
inference(orient,[status(thm)],[t3]) ).
cnf(t829,plain,
not(sF0) = false,
inference(step,[status(thm)],[t102,t112]) ).
cnf(t119,plain,
not(sF0) = false,
inference(rw,[status(thm)],[t829]) ).
cnf(t130,plain,
not(sF0) = false,
inference(orient,[status(thm)],[t119]) ).
cnf(t925,plain,
not(sF0) = sF6,
inference(step,[status(thm)],[t130,t269]) ).
cnf(t273,plain,
not(sF0) = sF6,
inference(orient,[status(thm)],[t925]) ).
cnf(t952,plain,
sF0 = or(not(member(x,sF2)),sF6),
inference(step,[status(thm)],[t951,t273]) ).
cnf(t7,plain,
or(X1,false) = X1,
introduced(definition) ).
cnf(t107,plain,
or(X1,false) = X1,
inference(orient,[status(thm)],[t7]) ).
cnf(t923,plain,
or(X1,sF6) = X1,
inference(step,[status(thm)],[t107,t269]) ).
cnf(t271,plain,
or(X1,sF6) = X1,
inference(rw,[status(thm)],[t923]) ).
cnf(t306,plain,
or(X1,sF6) = X1,
inference(orient,[status(thm)],[t271]) ).
cnf(t953,plain,
sF0 = not(member(x,sF2)),
inference(step,[status(thm)],[t952,t306]) ).
cnf(t325,plain,
not(member(x,sF2)) = sF0,
inference(orient,[status(thm)],[t953]) ).
cnf(t326,plain,
sF6 = ifeq(sF0,sF0,member(x,sF2),sF6),
inference(cp,[status(thm)],[t309,t325]) ).
cnf(t954,plain,
sF6 = member(x,sF2),
inference(step,[status(thm)],[t326,t135]) ).
cnf(t327,plain,
member(x,sF2) = sF6,
inference(orient,[status(thm)],[t954]) ).
cnf(t1113,plain,
sF0 = sF6,
inference(step,[status(thm)],[t1112,t327]) ).
cnf(t754,plain,
sF6 = sF0,
inference(orient,[status(thm)],[t1113]) ).
cnf(t1128,plain,
false = sF0,
inference(step,[status(thm)],[t269,t754]) ).
cnf(t769,plain,
false = sF0,
inference(orient,[status(thm)],[t1128]) ).
cnf(f29,axiom,
( ~ member(Z,domain_of(X))
| restrict(X,singleton(Z),universal_class) != null_class ),
file('/export/starexec/sandbox/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(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c23,c29,c93]) ).
cnf(g0_0,plain,
sF0 != false,
inference(rw,[status(thm)],[goal_0,t112]) ).
cnf(g0_1,plain,
sF0 != sF0,
inference(rw,[status(thm)],[g0_0,t769]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET124-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.35 % Computer : n013.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 : Thu Sep 24 09:57:06 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.31/1.21 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.31/1.21 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------