%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET910+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n005.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:44:16 PM UTC 2026
% Result : Theorem 4.77s 6.20s
% Output : Proof 4.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 19 unt; 0 def)
% Number of atoms : 43 ( 21 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 32 ( 20 ~; 6 |; 2 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-4 aty)
% Number of variables : 32 ( 2 sgn 16 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,conjecture,
! [A,B] :
( set_intersection2(A,singleton(B)) = singleton(B)
=> in(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t51_zfmisc_1) ).
fof(f5_neg,negated_conjecture,
~ ! [A,B] :
( set_intersection2(A,singleton(B)) = singleton(B)
=> in(B,A) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f5_nnf,plain,
? [A,B] :
( ~ in(B,A)
& set_intersection2(A,singleton(B)) = singleton(B) ),
inference(nnf_transformation,[status(thm)],[f5_neg]) ).
fof(f5_sk,plain,
( ~ in(sk3,sk2)
& set_intersection2(sk2,singleton(sk3)) = singleton(sk3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk2,sk3])],[f5_nnf]) ).
cnf(c6,plain,
~ in(sk3,sk2),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(t9,plain,
ifeq(in(sk3,sk2),true,false,true) = true,
inference(equality_encoding,[status(esa)],[c6]) ).
fof(f6,axiom,
! [A,B] :
( set_intersection2(A,singleton(B)) = singleton(B)
=> in(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l30_zfmisc_1) ).
fof(f6_nnf,plain,
! [A,B] :
( in(B,A)
| set_intersection2(A,singleton(B)) != singleton(B) ),
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
! [A,B] :
( in(B,A)
| set_intersection2(A,singleton(B)) != singleton(B) ),
inference(skolemisation,[status(esa)],[f6_nnf]) ).
cnf(c7,plain,
( in(X1,X0)
| set_intersection2(X0,singleton(X1)) != singleton(X1) ),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(hi4,axiom,
ifeq(set_intersection2(X0,singleton(X1)),singleton(X1),in(X1,X0),true) = true,
inference(equality_encoding,[status(esa)],[c7]) ).
cnf(c5,plain,
set_intersection2(sk2,singleton(sk3)) = singleton(sk3),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(hi3,negated_conjecture,
set_intersection2(sk2,singleton(sk3)) = singleton(sk3),
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(t2,plain,
in(sk3,sk2) = true,
inference(hyper_resolution,[status(thm)],[hi4,hi3]) ).
cnf(t15,plain,
in(sk3,sk2) = true,
inference(orient,[status(thm)],[t2]) ).
cnf(t23,plain,
ifeq(true,true,false,true) = true,
inference(step,[status(thm)],[t9,t15]) ).
cnf(t5,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t12,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t5]) ).
cnf(t24,plain,
false = true,
inference(step,[status(thm)],[t23,t12]) ).
cnf(t21,plain,
false = true,
inference(orient,[status(thm)],[t24]) ).
fof(f2,axiom,
! [A,B] :
( in(A,B)
=> ~ in(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(f2_nnf,plain,
! [A,B] :
( ~ in(B,A)
| ~ in(A,B) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [A,B] :
( ~ in(B,A)
| ~ in(A,B) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
fof(f4,axiom,
? [A] : ~ empty(A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc2_xboole_0) ).
fof(f4_nnf,plain,
? [A] : ~ empty(A),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
~ empty(sk1),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk1])],[f4_nnf]) ).
cnf(c4,plain,
~ empty(sk1),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c2,c4,c6]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t21]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET910+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/5.37 % Computer : n005.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Thu Sep 24 12:21:38 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.77/6.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.77/6.20 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------