%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET914+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n013.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 27.24s 4.34s
% Output : Proof 27.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 7 unt; 0 def)
% Number of atoms : 121 ( 46 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 146 ( 56 ~; 51 |; 33 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 69 ( 5 sgn 42 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [A,B] :
( disjoint(A,B)
<=> set_intersection2(A,B) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f6_nnf,plain,
! [A,B] :
( ( set_intersection2(A,B) != empty_set
| disjoint(A,B) )
& ( set_intersection2(A,B) = empty_set
| ~ disjoint(A,B) ) ),
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
! [A,B] :
( ( set_intersection2(A,B) != empty_set
| disjoint(A,B) )
& ( set_intersection2(A,B) = empty_set
| ~ disjoint(A,B) ) ),
inference(skolemisation,[status(esa)],[f6_nnf]) ).
cnf(c23,plain,
( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
fof(f12,conjecture,
! [A,B,C] :
~ ( in(A,C)
& disjoint(unordered_pair(A,B),C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t55_zfmisc_1) ).
fof(f12_neg,negated_conjecture,
~ ! [A,B,C] :
~ ( in(A,C)
& disjoint(unordered_pair(A,B),C) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f12_nnf,plain,
? [A,B,C] :
( in(A,C)
& disjoint(unordered_pair(A,B),C) ),
inference(nnf_transformation,[status(thm)],[f12_neg]) ).
fof(f12_sk,plain,
( in(sk5,sk7)
& disjoint(unordered_pair(sk5,sk6),sk7) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk5,sk6,sk7])],[f12_nnf]) ).
cnf(c30,plain,
disjoint(unordered_pair(sk5,sk6),sk7),
inference(cnf_transformation,[status(esa)],[f12_sk]) ).
cnf(p37,plain,
set_intersection2(sk7,unordered_pair(sk5,sk6)) = empty_set,
inference(resolution,[status(thm)],[c23,c30]) ).
fof(f5,axiom,
! [A,B,C] :
( C = set_intersection2(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,B)
& in(D,A) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f5_nnf,plain,
! [A,B,C] :
( ( ? [D] :
( ( in(D,B)
& in(D,A)
& ~ in(D,C) )
| ( ( ~ in(D,B)
| ~ in(D,A) )
& in(D,C) ) )
| C = set_intersection2(A,B) )
& ( ! [D] :
( ( ~ in(D,B)
| ~ in(D,A)
| in(D,C) )
& ( ( in(D,B)
& in(D,A) )
| ~ in(D,C) ) )
| C != set_intersection2(A,B) ) ),
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
! [C,A,B,D] :
( ( ( in(sk2(A,B,C),B)
& in(sk2(A,B,C),A)
& ~ in(sk2(A,B,C),C) )
| ( ( ~ in(sk2(A,B,C),B)
| ~ in(sk2(A,B,C),A) )
& in(sk2(A,B,C),C) )
| C = set_intersection2(A,B) )
& ( ( ( ~ in(D,B)
| ~ in(D,A)
| in(D,C) )
& ( ( in(D,B)
& in(D,A) )
| ~ in(D,C) ) )
| C != set_intersection2(A,B) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk2])],[f5_nnf]) ).
cnf(c16,plain,
( ~ in(X3,X1)
| ~ in(X3,X0)
| in(X3,X2)
| X2 != set_intersection2(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(p137,plain,
( ~ in(X1,unordered_pair(sk5,sk6))
| ~ in(X1,sk7)
| in(X1,X0)
| X0 != empty_set ),
inference(superposition,[status(thm)],[p37,c16]) ).
cnf(p140,plain,
( ~ in(X0,unordered_pair(sk5,sk6))
| ~ in(X0,sk7)
| in(X0,empty_set) ),
inference(equality_resolution,[status(thm)],[p137]) ).
cnf(c31,plain,
in(sk5,sk7),
inference(cnf_transformation,[status(esa)],[f12_sk]) ).
cnf(p143,plain,
( ~ in(sk5,unordered_pair(sk5,sk6))
| in(sk5,empty_set) ),
inference(resolution,[status(thm)],[p140,c31]) ).
fof(f4,axiom,
! [A,B,C] :
( C = unordered_pair(A,B)
<=> ! [D] :
( in(D,C)
<=> ( D = B
| D = A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(f4_nnf,plain,
! [A,B,C] :
( ( ? [D] :
( ( ( D = B
| D = A )
& ~ in(D,C) )
| ( D != B
& D != A
& in(D,C) ) )
| C = unordered_pair(A,B) )
& ( ! [D] :
( ( ( D != B
& D != A )
| in(D,C) )
& ( D = B
| D = A
| ~ in(D,C) ) )
| C != unordered_pair(A,B) ) ),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
! [C,A,B,D] :
( ( ( ( sk1(A,B,C) = B
| sk1(A,B,C) = A )
& ~ in(sk1(A,B,C),C) )
| ( sk1(A,B,C) != B
& sk1(A,B,C) != A
& in(sk1(A,B,C),C) )
| C = unordered_pair(A,B) )
& ( ( ( ( D != B
& D != A )
| in(D,C) )
& ( D = B
| D = A
| ~ in(D,C) ) )
| C != unordered_pair(A,B) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk1])],[f4_nnf]) ).
cnf(c6,plain,
( X3 != X0
| in(X3,X2)
| X2 != unordered_pair(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(p45,plain,
( X0 != X1
| in(X0,unordered_pair(X1,X2)) ),
inference(equality_resolution,[status(thm)],[c6]) ).
cnf(p48,plain,
in(X0,unordered_pair(X0,X1)),
inference(equality_resolution,[status(thm)],[p45]) ).
cnf(p149,plain,
in(sk5,empty_set),
inference(resolution,[status(thm)],[p143,p48]) ).
fof(f3,axiom,
! [A] :
( A = empty_set
<=> ! [B] : ~ in(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f3_nnf,plain,
! [A] :
( ( ? [B] : in(B,A)
| A = empty_set )
& ( ! [B] : ~ in(B,A)
| A != empty_set ) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [A,B] :
( ( in(sk0(A),A)
| A = empty_set )
& ( ~ in(B,A)
| A != empty_set ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f3_nnf]) ).
cnf(c3,plain,
( ~ in(X1,X0)
| X0 != empty_set ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(p34,plain,
~ in(X0,empty_set),
inference(equality_resolution,[status(thm)],[c3]) ).
cnf(p151,plain,
$false,
inference(resolution,[status(thm)],[p149,p34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET914+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/0.37 % Computer : n013.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Thu Sep 24 12:21:22 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 27.24/4.34 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.24/4.34 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------