%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET241-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n011.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:57 PM UTC 2026
% Result : Unsatisfiable 7.68s 1.59s
% Output : Proof 7.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 53 ( 37 unt; 0 def)
% Number of atoms : 69 ( 33 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 46 ( 30 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 9 con; 0-4 aty)
% Number of variables : 87 ( 11 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f113,negated_conjecture,
~ member(v,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_restriction_alternate_defn4_2) ).
fof(f113_nnf,plain,
~ member(v,y),
inference(nnf_transformation,[status(thm)],[f113]) ).
fof(f113_sk,plain,
~ member(v,y),
inference(skolemisation,[status(esa)],[f113_nnf]) ).
cnf(c113,plain,
~ member(v,y),
inference(cnf_transformation,[status(esa)],[f113_sk]) ).
cnf(t83,plain,
ifeq(member(v,y),true,false,true) = true,
inference(equality_encoding,[status(esa)],[c113]) ).
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(hi21,axiom,
ifeq(member(X0,intersection(X1,X2)),true,member(X0,X2),true) = true,
inference(equality_encoding,[status(esa)],[c21]) ).
cnf(f112,negated_conjecture,
member(ordered_pair(u,v),restrict(xr,x,y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_restriction_alternate_defn4_1) ).
fof(f112_nnf,plain,
member(ordered_pair(u,v),restrict(xr,x,y)),
inference(nnf_transformation,[status(thm)],[f112]) ).
cnf(c112,plain,
member(ordered_pair(u,v),restrict(xr,x,y)),
inference(cnf_transformation,[status(esa)],[f112_nnf]) ).
cnf(hi102,negated_conjecture,
member(ordered_pair(u,v),restrict(xr,x,y)) = true,
inference(equality_encoding,[status(esa)],[c112]) ).
cnf(f12,axiom,
unordered_pair(singleton(X),unordered_pair(X,singleton(Y))) = ordered_pair(X,Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair) ).
fof(f12_nnf,plain,
! [X,Y] : unordered_pair(singleton(X),unordered_pair(X,singleton(Y))) = ordered_pair(X,Y),
inference(nnf_transformation,[status(thm)],[f12]) ).
fof(f12_sk,plain,
! [X,Y] : unordered_pair(singleton(X),unordered_pair(X,singleton(Y))) = ordered_pair(X,Y),
inference(skolemisation,[status(esa)],[f12_nnf]) ).
cnf(c12,plain,
unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))) = ordered_pair(X0,X1),
inference(cnf_transformation,[status(esa)],[f12_sk]) ).
cnf(hi12,axiom,
unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))) = ordered_pair(X0,X1),
inference(equality_encoding,[status(esa)],[c12]) ).
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(hi13,axiom,
unordered_pair(X0,X0) = singleton(X0),
inference(equality_encoding,[status(esa)],[c11]) ).
cnf(f27,axiom,
intersection(Xr,cross_product(X,Y)) = restrict(Xr,X,Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',restriction1) ).
fof(f27_nnf,plain,
! [Xr,X,Y] : intersection(Xr,cross_product(X,Y)) = restrict(Xr,X,Y),
inference(nnf_transformation,[status(thm)],[f27]) ).
fof(f27_sk,plain,
! [Xr,X,Y] : intersection(Xr,cross_product(X,Y)) = restrict(Xr,X,Y),
inference(skolemisation,[status(esa)],[f27_nnf]) ).
cnf(c27,plain,
intersection(X0,cross_product(X1,X2)) = restrict(X0,X1,X2),
inference(cnf_transformation,[status(esa)],[f27_sk]) ).
cnf(hi25,axiom,
intersection(X0,cross_product(X1,X2)) = restrict(X0,X1,X2),
inference(equality_encoding,[status(esa)],[c27]) ).
cnf(h85,plain,
member(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))),cross_product(x,y)) = true,
inference(hyper_resolution,[status(thm)],[hi21,hi102,hi12,hi13,hi25]) ).
cnf(f14,axiom,
( member(V,Y)
| ~ member(ordered_pair(U,V),cross_product(X,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cartesian_product2) ).
fof(f14_nnf,plain,
! [U,V,X,Y] :
( member(V,Y)
| ~ member(ordered_pair(U,V),cross_product(X,Y)) ),
inference(nnf_transformation,[status(thm)],[f14]) ).
fof(f14_sk,plain,
! [U,V,X,Y] :
( member(V,Y)
| ~ member(ordered_pair(U,V),cross_product(X,Y)) ),
inference(skolemisation,[status(esa)],[f14_nnf]) ).
cnf(c14,plain,
( member(X1,X3)
| ~ member(ordered_pair(X0,X1),cross_product(X2,X3)) ),
inference(cnf_transformation,[status(esa)],[f14_sk]) ).
cnf(hi14,axiom,
ifeq(member(ordered_pair(X0,X1),cross_product(X2,X3)),true,member(X1,X3),true) = true,
inference(equality_encoding,[status(esa)],[c14]) ).
cnf(t13,plain,
member(v,y) = true,
inference(hyper_resolution,[status(thm)],[hi14,h85,hi12,hi13]) ).
cnf(t316,plain,
member(v,y) = true,
inference(orient,[status(thm)],[t13]) ).
cnf(t932,plain,
ifeq(true,true,false,true) = true,
inference(step,[status(thm)],[t83,t316]) ).
cnf(t35,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t256,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t35]) ).
cnf(t933,plain,
false = true,
inference(step,[status(thm)],[t932,t256]) ).
cnf(t897,plain,
false = true,
inference(orient,[status(thm)],[t933]) ).
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(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c23,c29,c113]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t897]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET241-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.37 % Computer : n011.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 10:21:29 UTC 2026
% 0.14/0.37 % CPUTime :
% 0.14/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.68/1.59 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.68/1.59 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------