%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SEU154+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n018.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 : Thu Sep 24 02:19:25 PM UTC 2026
% Result : Theorem 0.13s 0.74s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 46 ( 6 unt; 0 def)
% Number of atoms : 181 ( 47 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 213 ( 78 ~; 84 |; 40 &)
% ( 8 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 136 ( 128 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [A,B] :
( A = B
<=> ( subset(B,A)
& subset(A,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [A,B] :
( B = singleton(A)
<=> ! [C] :
( in(C,B)
<=> C = A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [A,B,C] :
( C = set_intersection2(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,B)
& in(D,A) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [A,B] :
( disjoint(A,B)
<=> set_intersection2(A,B) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f13,conjecture,
! [A,B] :
( ~ in(A,B)
=> disjoint(singleton(A),B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,negated_conjecture,
~ ! [A,B] :
( ~ in(A,B)
=> disjoint(singleton(A),B) ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f19,axiom,
! [A] : subset(empty_set,A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f23,plain,
! [A,B] :
( ( ~ subset(B,A)
| ~ subset(A,B)
| A = B )
& ( ( subset(B,A)
& subset(A,B) )
| A != B ) ),
inference(NNF_transformation,[status(thm)],[f3]) ).
fof(f24,plain,
( ! [A,B] :
( ~ subset(B,A)
| ~ subset(A,B)
| A = B )
& ! [A,B] :
( ( subset(B,A)
& subset(A,B) )
| A != B ) ),
inference(miniscoping,[status(thm)],[f23]) ).
fof(f27,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[status(thm)],[f24]) ).
fof(f28,plain,
! [A,B] :
( ( ? [C] :
( ( C = A
| in(C,B) )
& ( C != A
| ~ in(C,B) ) )
| B = singleton(A) )
& ( ! [C] :
( ( C != A
| in(C,B) )
& ( C = A
| ~ in(C,B) ) )
| B != singleton(A) ) ),
inference(NNF_transformation,[status(thm)],[f4]) ).
fof(f29,plain,
( ! [A,B] :
( ? [C] :
( ( C = A
| in(C,B) )
& ( C != A
| ~ in(C,B) ) )
| B = singleton(A) )
& ! [A,B] :
( ( ! [C] :
( C != A
| in(C,B) )
& ! [C] :
( C = A
| ~ in(C,B) ) )
| B != singleton(A) ) ),
inference(miniscoping,[status(thm)],[f28]) ).
fof(f30,plain,
( ! [A,B] :
( ( ( sK0_skl(B,A) = A
| in(sK0_skl(B,A),B) )
& ( sK0_skl(B,A) != A
| ~ in(sK0_skl(B,A),B) ) )
| B = singleton(A) )
& ! [A,B] :
( ( ! [C] :
( C != A
| in(C,B) )
& ! [C] :
( C = A
| ~ in(C,B) ) )
| B != singleton(A) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(C,sK0_skl(B,A))],[f29]) ).
fof(f31,plain,
! [X0,X1,X2] :
( X2 = X1
| ~ in(X2,X0)
| X0 != singleton(X1) ),
inference(cnf_transformation,[status(thm)],[f30]) ).
fof(f35,plain,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,B)
| ~ in(C,A) ) ),
inference(pre_NNF_transformation,[status(thm)],[f5]) ).
fof(f36,plain,
! [A,B] :
( ( ? [C] :
( ~ in(C,B)
& in(C,A) )
| subset(A,B) )
& ( ! [C] :
( in(C,B)
| ~ in(C,A) )
| ~ subset(A,B) ) ),
inference(NNF_transformation,[status(thm)],[f35]) ).
fof(f37,plain,
( ! [A,B] :
( ? [C] :
( ~ in(C,B)
& in(C,A) )
| subset(A,B) )
& ! [A,B] :
( ! [C] :
( in(C,B)
| ~ in(C,A) )
| ~ subset(A,B) ) ),
inference(miniscoping,[status(thm)],[f36]) ).
fof(f38,plain,
( ! [A,B] :
( ( ~ in(sK1_skl(B,A),B)
& in(sK1_skl(B,A),A) )
| subset(A,B) )
& ! [A,B] :
( ! [C] :
( in(C,B)
| ~ in(C,A) )
| ~ subset(A,B) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1_skl]),skolemize(C,sK1_skl(B,A))],[f37]) ).
fof(f40,plain,
! [X0,X1] :
( in(sK1_skl(X1,X0),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f38]) ).
fof(f42,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)],[f6]) ).
fof(f43,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) )
& ! [A,B,C] :
( ( ! [D] :
( ~ in(D,B)
| ~ in(D,A)
| in(D,C) )
& ! [D] :
( ( in(D,B)
& in(D,A) )
| ~ in(D,C) ) )
| C != set_intersection2(A,B) ) ),
inference(miniscoping,[status(thm)],[f42]) ).
fof(f44,plain,
( ! [A,B,C] :
( ( ( ( in(sK2_skl(C,B,A),B)
& in(sK2_skl(C,B,A),A) )
| in(sK2_skl(C,B,A),C) )
& ( ~ in(sK2_skl(C,B,A),B)
| ~ in(sK2_skl(C,B,A),A)
| ~ in(sK2_skl(C,B,A),C) ) )
| C = set_intersection2(A,B) )
& ! [A,B,C] :
( ( ! [D] :
( ~ in(D,B)
| ~ in(D,A)
| in(D,C) )
& ! [D] :
( ( in(D,B)
& in(D,A) )
| ~ in(D,C) ) )
| C != set_intersection2(A,B) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl]),skolemize(D,sK2_skl(C,B,A))],[f43]) ).
fof(f45,plain,
! [X0,X1,X2,X3] :
( in(X3,X1)
| ~ in(X3,X0)
| X0 != set_intersection2(X1,X2) ),
inference(cnf_transformation,[status(thm)],[f44]) ).
fof(f46,plain,
! [X0,X1,X2,X3] :
( in(X3,X2)
| ~ in(X3,X0)
| X0 != set_intersection2(X1,X2) ),
inference(cnf_transformation,[status(thm)],[f44]) ).
fof(f51,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)],[f7]) ).
fof(f52,plain,
( ! [A,B] :
( set_intersection2(A,B) != empty_set
| disjoint(A,B) )
& ! [A,B] :
( set_intersection2(A,B) = empty_set
| ~ disjoint(A,B) ) ),
inference(miniscoping,[status(thm)],[f51]) ).
fof(f54,plain,
! [X0,X1] :
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f52]) ).
fof(f58,plain,
? [A,B] :
( ~ disjoint(singleton(A),B)
& ~ in(A,B) ),
inference(pre_NNF_transformation,[status(thm)],[f14]) ).
fof(f59,plain,
( ~ disjoint(singleton(sK3_skl),sK4_skl)
& ~ in(sK3_skl,sK4_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3_skl,sK4_skl]),skolemize(A,sK3_skl),skolemize(B,sK4_skl)],[f58]) ).
fof(f60,plain,
~ in(sK3_skl,sK4_skl),
inference(cnf_transformation,[status(thm)],[f59]) ).
fof(f61,plain,
~ disjoint(singleton(sK3_skl),sK4_skl),
inference(cnf_transformation,[status(thm)],[f59]) ).
fof(f70,plain,
! [X0] : subset(empty_set,X0),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f73,plain,
! [X0,X1] :
( X0 = X1
| ~ in(X0,singleton(X1)) ),
inference(destructive_equality_resolution,[status(thm)],[f31]) ).
fof(f75,plain,
! [X0,X1,X2] :
( in(X0,X1)
| ~ in(X0,set_intersection2(X1,X2)) ),
inference(destructive_equality_resolution,[status(thm)],[f45]) ).
fof(f76,plain,
! [X0,X1,X2] :
( in(X0,X2)
| ~ in(X0,set_intersection2(X1,X2)) ),
inference(destructive_equality_resolution,[status(thm)],[f46]) ).
fof(f84,plain,
! [X0] :
( ~ subset(X0,empty_set)
| X0 = empty_set ),
inference(resolution,[status(thm)],[f27,f70]) ).
fof(f98,plain,
! [X0,X1,X2] :
( subset(set_intersection2(X1,X2),X0)
| in(sK1_skl(X0,set_intersection2(X1,X2)),X1) ),
inference(resolution,[status(thm)],[f75,f40]) ).
fof(f103,plain,
! [X0,X1,X2] :
( subset(set_intersection2(X1,X2),X0)
| in(sK1_skl(X0,set_intersection2(X1,X2)),X2) ),
inference(resolution,[status(thm)],[f76,f40]) ).
fof(f127,plain,
! [X0,X1,X2] :
( sK1_skl(X2,set_intersection2(singleton(X0),X1)) = X0
| subset(set_intersection2(singleton(X0),X1),X2) ),
inference(resolution,[status(thm)],[f98,f73]) ).
fof(f837,plain,
! [X0,X1,X2] :
( subset(set_intersection2(singleton(X0),X1),X2)
| subset(set_intersection2(singleton(X0),X1),X2)
| in(X0,X1) ),
inference(paramodulation,[status(thm)],[f127,f103]) ).
fof(f845,plain,
! [X0,X1,X2] :
( subset(set_intersection2(singleton(X0),X1),X2)
| in(X0,X1) ),
inference(duplicate_literals_removal,[status(thm)],[f837]) ).
fof(f851,plain,
! [X0,X1] :
( set_intersection2(singleton(X0),X1) = empty_set
| in(X0,X1) ),
inference(resolution,[status(thm)],[f845,f84]) ).
fof(f872,plain,
! [X0,X1] :
( disjoint(singleton(X0),X1)
| in(X0,X1) ),
inference(resolution,[status(thm)],[f851,f54]) ).
fof(f1121,plain,
in(sK3_skl,sK4_skl),
inference(resolution,[status(thm)],[f872,f61]) ).
fof(f1124,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f1121,f60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU154+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.36 % Computer : n018.cluster.edu
% 0.07/0.36 % Model : x86_64 x86_64
% 0.07/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.36 % Memory : 8046.5625MB
% 0.07/0.36 % OS : Linux 6.8.0-71-generic
% 0.07/0.36 % CPULimit : 300
% 0.07/0.36 % WCLimit : 300
% 0.07/0.36 % DateTime : Mon Sep 21 05:55:13 UTC 2026
% 0.07/0.36 % CPUTime :
% 0.07/0.38 % Drodi V4.1.1
% 0.13/0.74 % Refutation found
% 0.13/0.74 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.74 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.78 % Elapsed time: 0.400785 seconds
% 0.13/0.78 % CPU time: 2.625543 seconds
% 0.13/0.78 % Total memory used: 126.822 MB
% 0.13/0.78 % Net memory used: 121.855 MB
%------------------------------------------------------------------------------