%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET025-8 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n020.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:35 PM UTC 2026
% Result : Unsatisfiable 15.48s 2.45s
% Output : Proof 15.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 50 ( 34 unt; 0 def)
% Number of atoms : 70 ( 26 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 62 ( 42 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-4 aty)
% Number of variables : 56 ( 12 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f150,axiom,
little_set(ordered_pair(X,Y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pairs_are_small1) ).
fof(f150_nnf,plain,
! [X,Y] : little_set(ordered_pair(X,Y)),
inference(nnf_transformation,[status(thm)],[f150]) ).
fof(f150_sk,plain,
! [X,Y] : little_set(ordered_pair(X,Y)),
inference(skolemisation,[status(esa)],[f150_nnf]) ).
cnf(c150,plain,
little_set(ordered_pair(X0,X1)),
inference(cnf_transformation,[status(esa)],[f150_sk]) ).
cnf(t14,plain,
little_set(ordered_pair(X1,X2)) = true,
inference(equality_encoding,[status(esa)],[c150]) ).
cnf(t642,plain,
little_set(ordered_pair(X1,X2)) = true,
inference(orient,[status(thm)],[t14]) ).
cnf(f12,axiom,
( X = ordered_pair(f2(X),f3(X))
| ~ ordered_pair_predicate(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair_predicate3) ).
fof(f12_nnf,plain,
! [X] :
( X = ordered_pair(f2(X),f3(X))
| ~ ordered_pair_predicate(X) ),
inference(nnf_transformation,[status(thm)],[f12]) ).
fof(f12_sk,plain,
! [X] :
( X = ordered_pair(f2(X),f3(X))
| ~ ordered_pair_predicate(X) ),
inference(skolemisation,[status(esa)],[f12_nnf]) ).
cnf(c12,plain,
( X0 = ordered_pair(f2(X0),f3(X0))
| ~ ordered_pair_predicate(X0) ),
inference(cnf_transformation,[status(esa)],[f12_sk]) ).
cnf(t122,plain,
ifeq(ordered_pair_predicate(X1),true,X1,ordered_pair(f2(X1),f3(X1))) = ordered_pair(f2(X1),f3(X1)),
inference(equality_encoding,[status(esa)],[c12]) ).
cnf(t365,plain,
ifeq(ordered_pair_predicate(X1),true,X1,ordered_pair(f2(X1),f3(X1))) = ordered_pair(f2(X1),f3(X1)),
inference(orient,[status(thm)],[t122]) ).
cnf(f151,hypothesis,
ordered_pair_predicate(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_ordered_pair_predicate) ).
fof(f151_nnf,plain,
ordered_pair_predicate(a),
inference(nnf_transformation,[status(thm)],[f151]) ).
cnf(c151,plain,
ordered_pair_predicate(a),
inference(cnf_transformation,[status(esa)],[f151_nnf]) ).
cnf(t5,plain,
ordered_pair_predicate(a) = true,
inference(equality_encoding,[status(esa)],[c151]) ).
cnf(t786,plain,
ordered_pair_predicate(a) = true,
inference(orient,[status(thm)],[t5]) ).
cnf(t794,plain,
ordered_pair(f2(a),f3(a)) = ifeq(true,true,a,ordered_pair(f2(a),f3(a))),
inference(cp,[status(thm)],[t365,t786]) ).
cnf(t16,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t168,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t16]) ).
cnf(t3595,plain,
ordered_pair(f2(a),f3(a)) = a,
inference(step,[status(thm)],[t794,t168]) ).
cnf(t3482,plain,
ordered_pair(f2(a),f3(a)) = a,
inference(orient,[status(thm)],[t3595]) ).
cnf(t3485,plain,
true = little_set(a),
inference(cp,[status(thm)],[t642,t3482]) ).
cnf(f152,negated_conjecture,
~ little_set(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_predicate_is_small) ).
fof(f152_nnf,plain,
~ little_set(a),
inference(nnf_transformation,[status(thm)],[f152]) ).
fof(f152_sk,plain,
~ little_set(a),
inference(skolemisation,[status(esa)],[f152_nnf]) ).
cnf(c152,plain,
~ little_set(a),
inference(cnf_transformation,[status(esa)],[f152_sk]) ).
cnf(t1,plain,
little_set(a) = false,
inference(equality_encoding,[status(esa)],[c152]) ).
cnf(t584,plain,
little_set(a) = false,
inference(orient,[status(thm)],[t1]) ).
cnf(t3596,plain,
true = false,
inference(step,[status(thm)],[t3485,t584]) ).
cnf(t3506,plain,
false = true,
inference(orient,[status(thm)],[t3596]) ).
cnf(f30,axiom,
( ~ member(Z,X)
| ~ member(Z,complement(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement1) ).
fof(f30_nnf,plain,
! [Z,X] :
( ~ member(Z,X)
| ~ member(Z,complement(X)) ),
inference(nnf_transformation,[status(thm)],[f30]) ).
fof(f30_sk,plain,
! [Z,X] :
( ~ member(Z,X)
| ~ member(Z,complement(X)) ),
inference(skolemisation,[status(esa)],[f30_nnf]) ).
cnf(c30,plain,
( ~ member(X0,X1)
| ~ member(X0,complement(X1)) ),
inference(cnf_transformation,[status(esa)],[f30_sk]) ).
cnf(f57,axiom,
~ member(Z,empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set) ).
fof(f57_nnf,plain,
! [Z] : ~ member(Z,empty_set),
inference(nnf_transformation,[status(thm)],[f57]) ).
fof(f57_sk,plain,
! [Z] : ~ member(Z,empty_set),
inference(skolemisation,[status(esa)],[f57_nnf]) ).
cnf(c57,plain,
~ member(X0,empty_set),
inference(cnf_transformation,[status(esa)],[f57_sk]) ).
cnf(f70,axiom,
( X != Y
| ~ proper_subset(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',proper_subset2) ).
fof(f70_nnf,plain,
! [X,Y] :
( X != Y
| ~ proper_subset(X,Y) ),
inference(nnf_transformation,[status(thm)],[f70]) ).
fof(f70_sk,plain,
! [X,Y] :
( X != Y
| ~ proper_subset(X,Y) ),
inference(skolemisation,[status(esa)],[f70_nnf]) ).
cnf(c70,plain,
( X0 != X1
| ~ proper_subset(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f70_sk]) ).
cnf(f94,axiom,
( ~ member(U,Y)
| ~ member(U,X)
| ~ disjoint(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjoint1) ).
fof(f94_nnf,plain,
! [X,Y,U] :
( ~ member(U,Y)
| ~ member(U,X)
| ~ disjoint(X,Y) ),
inference(nnf_transformation,[status(thm)],[f94]) ).
fof(f94_sk,plain,
! [X,Y,U] :
( ~ member(U,Y)
| ~ member(U,X)
| ~ disjoint(X,Y) ),
inference(skolemisation,[status(esa)],[f94_nnf]) ).
cnf(c94,plain,
( ~ member(X2,X1)
| ~ member(X2,X0)
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f94_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c30,c57,c70,c94,c152]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t3506]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET025-8 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.13/0.38 % Computer : n020.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Thu Sep 24 09:17:18 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 15.48/2.45 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.48/2.45 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------