%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET022-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n019.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:32 PM UTC 2026
% Result : Unsatisfiable 22.31s 3.39s
% Output : Proof 22.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 11
% Syntax : Number of formulae : 76 ( 48 unt; 0 def)
% Number of atoms : 112 ( 48 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 94 ( 58 ~; 36 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-4 aty)
% Number of variables : 68 ( 4 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f10,axiom,
( little_set(f2(X))
| ~ ordered_pair_predicate(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair_predicate1) ).
fof(f10_nnf,plain,
! [X] :
( little_set(f2(X))
| ~ ordered_pair_predicate(X) ),
inference(nnf_transformation,[status(thm)],[f10]) ).
fof(f10_sk,plain,
! [X] :
( little_set(f2(X))
| ~ ordered_pair_predicate(X) ),
inference(skolemisation,[status(esa)],[f10_nnf]) ).
cnf(c10,plain,
( little_set(f2(X0))
| ~ ordered_pair_predicate(X0) ),
inference(cnf_transformation,[status(esa)],[f10_sk]) ).
cnf(t41,plain,
ifeq(ordered_pair_predicate(X1),true,little_set(f2(X1)),true) = true,
inference(equality_encoding,[status(esa)],[c10]) ).
cnf(t363,plain,
ifeq(ordered_pair_predicate(X1),true,little_set(f2(X1)),true) = true,
inference(orient,[status(thm)],[t41]) ).
cnf(f145,axiom,
( first(ordered_pair(X,Y)) = X
| ~ little_set(Y)
| ~ little_set(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',property_of_first) ).
fof(f145_nnf,plain,
! [X,Y] :
( first(ordered_pair(X,Y)) = X
| ~ little_set(Y)
| ~ little_set(X) ),
inference(nnf_transformation,[status(thm)],[f145]) ).
fof(f145_sk,plain,
! [X,Y] :
( first(ordered_pair(X,Y)) = X
| ~ little_set(Y)
| ~ little_set(X) ),
inference(skolemisation,[status(esa)],[f145_nnf]) ).
cnf(c145,plain,
( first(ordered_pair(X0,X1)) = X0
| ~ little_set(X1)
| ~ little_set(X0) ),
inference(cnf_transformation,[status(esa)],[f145_sk]) ).
cnf(t110,plain,
ifeq(little_set(X1),true,ifeq(little_set(X2),true,first(ordered_pair(X1,X2)),X1),X1) = X1,
inference(equality_encoding,[status(esa)],[c145]) ).
cnf(t176,plain,
ifeq(little_set(X1),true,ifeq(little_set(X2),true,first(ordered_pair(X1,X2)),X1),X1) = X1,
inference(orient,[status(thm)],[t110]) ).
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(t118,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(t360,plain,
ifeq(ordered_pair_predicate(X1),true,X1,ordered_pair(f2(X1),f3(X1))) = ordered_pair(f2(X1),f3(X1)),
inference(orient,[status(thm)],[t118]) ).
cnf(f147,hypothesis,
ordered_pair_predicate(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_ordered_pair_predicate) ).
fof(f147_nnf,plain,
ordered_pair_predicate(a),
inference(nnf_transformation,[status(thm)],[f147]) ).
cnf(c147,plain,
ordered_pair_predicate(a),
inference(cnf_transformation,[status(esa)],[f147_nnf]) ).
cnf(t4,plain,
ordered_pair_predicate(a) = true,
inference(equality_encoding,[status(esa)],[c147]) ).
cnf(t720,plain,
ordered_pair_predicate(a) = true,
inference(orient,[status(thm)],[t4]) ).
cnf(t726,plain,
ordered_pair(f2(a),f3(a)) = ifeq(true,true,a,ordered_pair(f2(a),f3(a))),
inference(cp,[status(thm)],[t360,t720]) ).
cnf(t15,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t164,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t15]) ).
cnf(t2983,plain,
ordered_pair(f2(a),f3(a)) = a,
inference(step,[status(thm)],[t726,t164]) ).
cnf(t2818,plain,
ordered_pair(f2(a),f3(a)) = a,
inference(orient,[status(thm)],[t2983]) ).
cnf(t2822,plain,
f2(a) = ifeq(little_set(f2(a)),true,ifeq(little_set(f3(a)),true,first(a),f2(a)),f2(a)),
inference(cp,[status(thm)],[t176,t2818]) ).
cnf(t725,plain,
true = ifeq(true,true,little_set(f2(a)),true),
inference(cp,[status(thm)],[t363,t720]) ).
cnf(t2941,plain,
true = little_set(f2(a)),
inference(step,[status(thm)],[t725,t164]) ).
cnf(t1077,plain,
little_set(f2(a)) = true,
inference(orient,[status(thm)],[t2941]) ).
cnf(t2984,plain,
f2(a) = ifeq(true,true,ifeq(little_set(f3(a)),true,first(a),f2(a)),f2(a)),
inference(step,[status(thm)],[t2822,t1077]) ).
cnf(t2985,plain,
f2(a) = ifeq(little_set(f3(a)),true,first(a),f2(a)),
inference(step,[status(thm)],[t2984,t164]) ).
cnf(f11,axiom,
( little_set(f3(X))
| ~ ordered_pair_predicate(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair_predicate2) ).
fof(f11_nnf,plain,
! [X] :
( little_set(f3(X))
| ~ ordered_pair_predicate(X) ),
inference(nnf_transformation,[status(thm)],[f11]) ).
fof(f11_sk,plain,
! [X] :
( little_set(f3(X))
| ~ ordered_pair_predicate(X) ),
inference(skolemisation,[status(esa)],[f11_nnf]) ).
cnf(c11,plain,
( little_set(f3(X0))
| ~ ordered_pair_predicate(X0) ),
inference(cnf_transformation,[status(esa)],[f11_sk]) ).
cnf(t42,plain,
ifeq(ordered_pair_predicate(X1),true,little_set(f3(X1)),true) = true,
inference(equality_encoding,[status(esa)],[c11]) ).
cnf(t364,plain,
ifeq(ordered_pair_predicate(X1),true,little_set(f3(X1)),true) = true,
inference(orient,[status(thm)],[t42]) ).
cnf(t724,plain,
true = ifeq(true,true,little_set(f3(a)),true),
inference(cp,[status(thm)],[t364,t720]) ).
cnf(t2940,plain,
true = little_set(f3(a)),
inference(step,[status(thm)],[t724,t164]) ).
cnf(t1021,plain,
little_set(f3(a)) = true,
inference(orient,[status(thm)],[t2940]) ).
cnf(t2986,plain,
f2(a) = ifeq(true,true,first(a),f2(a)),
inference(step,[status(thm)],[t2985,t1021]) ).
cnf(t2987,plain,
f2(a) = first(a),
inference(step,[status(thm)],[t2986,t164]) ).
cnf(t2899,plain,
f2(a) = first(a),
inference(orient,[status(thm)],[t2987]) ).
cnf(t2900,plain,
true = ifeq(ordered_pair_predicate(a),true,little_set(first(a)),true),
inference(cp,[status(thm)],[t363,t2899]) ).
cnf(t2994,plain,
true = ifeq(true,true,little_set(first(a)),true),
inference(step,[status(thm)],[t2900,t720]) ).
cnf(t2995,plain,
true = little_set(first(a)),
inference(step,[status(thm)],[t2994,t164]) ).
cnf(f148,negated_conjecture,
~ little_set(first(a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_first_component_is_small) ).
fof(f148_nnf,plain,
~ little_set(first(a)),
inference(nnf_transformation,[status(thm)],[f148]) ).
fof(f148_sk,plain,
~ little_set(first(a)),
inference(skolemisation,[status(esa)],[f148_nnf]) ).
cnf(c148,plain,
~ little_set(first(a)),
inference(cnf_transformation,[status(esa)],[f148_sk]) ).
cnf(t6,plain,
little_set(first(a)) = false,
inference(equality_encoding,[status(esa)],[c148]) ).
cnf(t463,plain,
little_set(first(a)) = false,
inference(orient,[status(thm)],[t6]) ).
cnf(t2996,plain,
true = false,
inference(step,[status(thm)],[t2995,t463]) ).
cnf(t2907,plain,
false = true,
inference(orient,[status(thm)],[t2996]) ).
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,c148]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t2907]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET022-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.18/0.43 % Computer : n019.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Thu Sep 24 09:14:34 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.43 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 22.31/3.39 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 22.31/3.39 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------