%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET050-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 : n007.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:43 PM UTC 2026
% Result : Unsatisfiable 6.94s 1.49s
% Output : Proof 6.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 55 ( 35 unt; 0 def)
% Number of atoms : 79 ( 27 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 62 ( 38 ~; 24 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 82 ( 13 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f13,axiom,
( member(U,X)
| ~ member(ordered_pair(U,V),cross_product(X,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cartesian_product1) ).
fof(f13_nnf,plain,
! [U,V,X,Y] :
( member(U,X)
| ~ member(ordered_pair(U,V),cross_product(X,Y)) ),
inference(nnf_transformation,[status(thm)],[f13]) ).
fof(f13_sk,plain,
! [U,V,X,Y] :
( member(U,X)
| ~ member(ordered_pair(U,V),cross_product(X,Y)) ),
inference(skolemisation,[status(esa)],[f13_nnf]) ).
cnf(c13,plain,
( member(X0,X2)
| ~ member(ordered_pair(X0,X1),cross_product(X2,X3)) ),
inference(cnf_transformation,[status(esa)],[f13_sk]) ).
cnf(hi11,axiom,
ifeq(member(ordered_pair(X0,X1),cross_product(X2,X3)),true,member(X0,X2),true) = true,
inference(equality_encoding,[status(esa)],[c13]) ).
cnf(f91,negated_conjecture,
member(ordered_pair(x,y),cross_product(u,v)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_1_to_unordered_pair_1) ).
fof(f91_nnf,plain,
member(ordered_pair(x,y),cross_product(u,v)),
inference(nnf_transformation,[status(thm)],[f91]) ).
cnf(c91,plain,
member(ordered_pair(x,y),cross_product(u,v)),
inference(cnf_transformation,[status(esa)],[f91_nnf]) ).
cnf(hi84,negated_conjecture,
member(ordered_pair(x,y),cross_product(u,v)) = true,
inference(equality_encoding,[status(esa)],[c91]) ).
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(h75,plain,
member(x,u) = true,
inference(hyper_resolution,[status(thm)],[hi11,hi84,hi12,hi13]) ).
cnf(f0,axiom,
( member(U,Y)
| ~ member(U,X)
| ~ subclass(X,Y) ),
file('/export/starexec/sandbox2/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/sandbox2/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(h143,plain,
member(x,universal_class) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi3,h75]) ).
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(hi8,axiom,
ifeq(member(X0,universal_class),true,member(X0,unordered_pair(X0,X1)),true) = true,
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(h449,plain,
member(x,unordered_pair(x,V0)) = true,
inference(hyper_resolution,[status(thm)],[hi8,h143]) ).
cnf(f92,negated_conjecture,
~ member(x,unordered_pair(x,y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_1_to_unordered_pair_2) ).
fof(f92_nnf,plain,
~ member(x,unordered_pair(x,y)),
inference(nnf_transformation,[status(thm)],[f92]) ).
fof(f92_sk,plain,
~ member(x,unordered_pair(x,y)),
inference(skolemisation,[status(esa)],[f92_nnf]) ).
cnf(c92,plain,
~ member(x,unordered_pair(x,y)),
inference(cnf_transformation,[status(esa)],[f92_sk]) ).
cnf(hi87,negated_conjecture,
ifeq(member(x,unordered_pair(x,y)),true,false,true) = true,
inference(equality_encoding,[status(esa)],[c92]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi87,h449]) ).
cnf(t1338,plain,
false = true,
inference(orient,[status(thm)],[t0]) ).
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,c92]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t1338]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET050-6 : 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.36 % Computer : n007.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Thu Sep 24 09:24:37 UTC 2026
% 0.15/0.36 % CPUTime :
% 0.15/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.94/1.49 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.94/1.49 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------