%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET203-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 : n003.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:53 PM UTC 2026
% Result : Unsatisfiable 12.37s 2.17s
% Output : Proof 12.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 54 ( 38 unt; 0 def)
% Number of atoms : 78 ( 27 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 62 ( 38 ~; 24 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 8 con; 0-4 aty)
% Number of variables : 71 ( 3 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f0,axiom,
( member(U,Y)
| ~ member(U,X)
| ~ subclass(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subclass_members) ).
fof(f0_nnf,plain,
! [X,Y,U] :
( member(U,Y)
| ~ member(U,X)
| ~ subclass(X,Y) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X,Y,U] :
( member(U,Y)
| ~ member(U,X)
| ~ subclass(X,Y) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( member(X2,X1)
| ~ member(X2,X0)
| ~ subclass(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,axiom,
ifeq(subclass(X0,X1),true,ifeq(member(X2,X0),true,member(X2,X1),true),true) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(f3,axiom,
subclass(X,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',class_elements_are_sets) ).
fof(f3_nnf,plain,
! [X] : subclass(X,universal_class),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [X] : subclass(X,universal_class),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
subclass(X0,universal_class),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(hi3,axiom,
subclass(X0,universal_class) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(f113,negated_conjecture,
member(v,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_to_X_product_property1_2) ).
fof(f113_nnf,plain,
member(v,y),
inference(nnf_transformation,[status(thm)],[f113]) ).
cnf(c113,plain,
member(v,y),
inference(cnf_transformation,[status(esa)],[f113_nnf]) ).
cnf(hi103,negated_conjecture,
member(v,y) = true,
inference(equality_encoding,[status(esa)],[c113]) ).
cnf(h85,plain,
member(v,universal_class) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi3,hi103]) ).
cnf(f112,negated_conjecture,
member(u,x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_to_X_product_property1_1) ).
fof(f112_nnf,plain,
member(u,x),
inference(nnf_transformation,[status(thm)],[f112]) ).
cnf(c112,plain,
member(u,x),
inference(cnf_transformation,[status(esa)],[f112_nnf]) ).
cnf(hi102,negated_conjecture,
member(u,x) = true,
inference(equality_encoding,[status(esa)],[c112]) ).
cnf(h68,plain,
member(u,universal_class) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi3,hi102]) ).
cnf(f15,axiom,
( member(ordered_pair(U,V),cross_product(X,Y))
| ~ member(V,Y)
| ~ member(U,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartesian_product3) ).
fof(f15_nnf,plain,
! [U,X,V,Y] :
( member(ordered_pair(U,V),cross_product(X,Y))
| ~ member(V,Y)
| ~ member(U,X) ),
inference(nnf_transformation,[status(thm)],[f15]) ).
fof(f15_sk,plain,
! [U,X,V,Y] :
( member(ordered_pair(U,V),cross_product(X,Y))
| ~ member(V,Y)
| ~ member(U,X) ),
inference(skolemisation,[status(esa)],[f15_nnf]) ).
cnf(c15,plain,
( member(ordered_pair(X0,X2),cross_product(X1,X3))
| ~ member(X2,X3)
| ~ member(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f15_sk]) ).
cnf(hi15,axiom,
ifeq(member(X0,X1),true,ifeq(member(X2,X3),true,member(ordered_pair(X0,X2),cross_product(X1,X3)),true),true) = true,
inference(equality_encoding,[status(esa)],[c15]) ).
cnf(f12,axiom,
unordered_pair(singleton(X),unordered_pair(X,singleton(Y))) = ordered_pair(X,Y),
file('/export/starexec/sandbox/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/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(hi13,axiom,
unordered_pair(X0,X0) = singleton(X0),
inference(equality_encoding,[status(esa)],[c11]) ).
cnf(h171,plain,
member(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))),cross_product(universal_class,universal_class)) = true,
inference(hyper_resolution,[status(thm)],[hi15,h68,h85,hi12,hi13]) ).
cnf(f114,negated_conjecture,
~ member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_to_X_product_property1_3) ).
fof(f114_nnf,plain,
~ member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
inference(nnf_transformation,[status(thm)],[f114]) ).
fof(f114_sk,plain,
~ member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
inference(skolemisation,[status(esa)],[f114_nnf]) ).
cnf(c114,plain,
~ member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
inference(cnf_transformation,[status(esa)],[f114_sk]) ).
cnf(hi106,negated_conjecture,
ifeq(member(ordered_pair(u,v),cross_product(universal_class,universal_class)),true,false,true) = true,
inference(equality_encoding,[status(esa)],[c114]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi106,h171,hi12,hi13]) ).
cnf(t705,plain,
false = true,
inference(orient,[status(thm)],[t0]) ).
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(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,c114]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t705]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET203-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/0.37 % Computer : n003.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Thu Sep 24 10:16:35 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 12.37/2.17 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.37/2.17 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------