%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET077-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 : n026.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:00 PM UTC 2026
% Result : Unsatisfiable 4.77s 1.09s
% Output : Proof 4.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 22 unt; 0 def)
% Number of atoms : 38 ( 17 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 30 ( 22 ~; 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 : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 33 ( 8 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f91,negated_conjecture,
~ member(singleton(x),universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singletons_are_sets_1) ).
fof(f91_nnf,plain,
~ member(singleton(x),universal_class),
inference(nnf_transformation,[status(thm)],[f91]) ).
fof(f91_sk,plain,
~ member(singleton(x),universal_class),
inference(skolemisation,[status(esa)],[f91_nnf]) ).
cnf(c91,plain,
~ member(singleton(x),universal_class),
inference(cnf_transformation,[status(esa)],[f91_sk]) ).
cnf(u11,axiom,
member(singleton(x),universal_class) = false,
inference(equality_encoding,[status(esa)],[c91]) ).
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(d0,axiom,
unordered_pair(X0,X0) = singleton(X0),
inference(equality_encoding,[status(esa)],[c11]) ).
cnf(t13,plain,
member(unordered_pair(x,x),universal_class) = false,
inference(definition_unfolding,[status(thm)],[u11,d0]) ).
cnf(f10,axiom,
member(unordered_pair(X,Y),universal_class),
file('/export/starexec/sandbox2/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(t12,plain,
member(unordered_pair(X1,X2),universal_class) = true,
inference(equality_encoding,[status(esa)],[c10]) ).
cnf(t106,plain,
member(unordered_pair(X1,X2),universal_class) = true,
inference(orient,[status(thm)],[t12]) ).
cnf(t115,plain,
true = false,
inference(step,[status(thm)],[t13,t106]) ).
cnf(t109,plain,
false = true,
inference(orient,[status(thm)],[t115]) ).
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,c91]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t109]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET077-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.36 % Computer : n026.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 09:40:23 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.77/1.09 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.77/1.09 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------