%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET093-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 : n016.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:12 PM UTC 2026
% Result : Unsatisfiable 4.94s 1.29s
% Output : Proof 4.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 47 ( 39 unt; 0 def)
% Number of atoms : 55 ( 34 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 31 ( 23 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 33 ( 8 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f10,axiom,
member(unordered_pair(X,Y),universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pairs_in_universal) ).
fof(f10_nnf,plain,
! [X,Y] : member(unordered_pair(X,Y),universal_class),
inference(nnf_transformation,[status(thm)],[f10]) ).
fof(f10_sk,plain,
! [X,Y] : member(unordered_pair(X,Y),universal_class),
inference(skolemisation,[status(esa)],[f10_nnf]) ).
cnf(c10,plain,
member(unordered_pair(X0,X1),universal_class),
inference(cnf_transformation,[status(esa)],[f10_sk]) ).
cnf(t13,plain,
member(unordered_pair(X1,X2),universal_class) = true,
inference(equality_encoding,[status(esa)],[c10]) ).
cnf(t120,plain,
member(unordered_pair(X1,X2),universal_class) = true,
inference(orient,[status(thm)],[t13]) ).
cnf(f91,negated_conjecture,
singleton(member_of(x)) = x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_2_to_singletons_are_sets_1) ).
fof(f91_nnf,plain,
singleton(member_of(x)) = x,
inference(nnf_transformation,[status(thm)],[f91]) ).
cnf(c91,plain,
singleton(member_of(x)) = x,
inference(cnf_transformation,[status(esa)],[f91_nnf]) ).
cnf(u8,axiom,
singleton(member_of(x)) = x,
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(t16,plain,
unordered_pair(member_of(x),member_of(x)) = x,
inference(definition_unfolding,[status(thm)],[u8,d0]) ).
cnf(t92,axiom,
sF1 = member_of(x),
introduced(definition) ).
cnf(t99,plain,
member_of(x) = sF1,
inference(orient,[status(thm)],[t92]) ).
cnf(t155,plain,
unordered_pair(sF1,member_of(x)) = x,
inference(step,[status(thm)],[t16,t99]) ).
cnf(t156,plain,
unordered_pair(sF1,sF1) = x,
inference(step,[status(thm)],[t155,t99]) ).
cnf(t123,plain,
unordered_pair(sF1,sF1) = x,
inference(orient,[status(thm)],[t156]) ).
cnf(t124,plain,
true = member(x,universal_class),
inference(cp,[status(thm)],[t120,t123]) ).
cnf(f92,negated_conjecture,
~ member(x,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_2_to_singletons_are_sets_2) ).
fof(f92_nnf,plain,
~ member(x,universal_class),
inference(nnf_transformation,[status(thm)],[f92]) ).
fof(f92_sk,plain,
~ member(x,universal_class),
inference(skolemisation,[status(esa)],[f92_nnf]) ).
cnf(c92,plain,
~ member(x,universal_class),
inference(cnf_transformation,[status(esa)],[f92_sk]) ).
cnf(t6,plain,
member(x,universal_class) = false,
inference(equality_encoding,[status(esa)],[c92]) ).
cnf(t102,plain,
member(x,universal_class) = false,
inference(orient,[status(thm)],[t6]) ).
cnf(t91,axiom,
sF0 = member(x,universal_class),
introduced(definition) ).
cnf(t147,plain,
sF0 = false,
inference(step,[status(thm)],[t91,t102]) ).
cnf(t108,plain,
false = sF0,
inference(orient,[status(thm)],[t147]) ).
cnf(t151,plain,
member(x,universal_class) = sF0,
inference(step,[status(thm)],[t102,t108]) ).
cnf(t112,plain,
member(x,universal_class) = sF0,
inference(orient,[status(thm)],[t151]) ).
cnf(t157,plain,
true = sF0,
inference(step,[status(thm)],[t124,t112]) ).
cnf(t125,plain,
true = sF0,
inference(orient,[status(thm)],[t157]) ).
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,c92]) ).
cnf(g0_0,plain,
sF0 != false,
inference(rw,[status(thm)],[goal_0,t125]) ).
cnf(g0_1,plain,
sF0 != sF0,
inference(rw,[status(thm)],[g0_0,t108]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET093-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.56 % Computer : n016.cluster.edu
% 0.10/0.56 % Model : x86_64 x86_64
% 0.10/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.56 % Memory : 8046.5625MB
% 0.10/0.56 % OS : Linux 6.8.0-71-generic
% 0.10/0.56 % CPULimit : 300
% 0.10/0.56 % WCLimit : 300
% 0.10/0.56 % DateTime : Thu Sep 24 09:49:27 UTC 2026
% 0.10/0.56 % CPUTime :
% 0.10/0.56 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.94/1.29 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.94/1.29 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------