%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SEU120+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 : n001.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:16 PM UTC 2026
% Result : Theorem 0.09s 0.37s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 7 unt; 1 def)
% Number of atoms : 93 ( 19 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 105 ( 46 ~; 33 |; 23 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 77 ( 60 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [A] :
( A = empty_set
<=> ! [B] : ~ in(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [A,B] :
( disjoint(A,B)
<=> set_intersection2(A,B) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,conjecture,
! [A,B] :
( ~ ( disjoint(A,B)
& ? [C] : in(C,set_intersection2(A,B)) )
& ~ ( ! [C] : ~ in(C,set_intersection2(A,B))
& ~ disjoint(A,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f13,negated_conjecture,
~ ! [A,B] :
( ~ ( disjoint(A,B)
& ? [C] : in(C,set_intersection2(A,B)) )
& ~ ( ! [C] : ~ in(C,set_intersection2(A,B))
& ~ disjoint(A,B) ) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f17,plain,
! [A] :
( ( ? [B] : in(B,A)
| A = empty_set )
& ( ! [B] : ~ in(B,A)
| A != empty_set ) ),
inference(NNF_transformation,[status(thm)],[f3]) ).
fof(f18,plain,
( ! [A] :
( ? [B] : in(B,A)
| A = empty_set )
& ! [A] :
( ! [B] : ~ in(B,A)
| A != empty_set ) ),
inference(miniscoping,[status(thm)],[f17]) ).
fof(f19,plain,
( ! [A] :
( in(sK0_skl(A),A)
| A = empty_set )
& ! [A] :
( ! [B] : ~ in(B,A)
| A != empty_set ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(B,sK0_skl(A))],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( ~ in(X1,X0)
| X0 != empty_set ),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f21,plain,
! [X0] :
( in(sK0_skl(X0),X0)
| X0 = empty_set ),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f22,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)],[f4]) ).
fof(f23,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)],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f23]) ).
fof(f25,plain,
! [X0,X1] :
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f23]) ).
fof(f35,plain,
? [A,B] :
( ( disjoint(A,B)
& ? [C] : in(C,set_intersection2(A,B)) )
| ( ! [C] : ~ in(C,set_intersection2(A,B))
& ~ disjoint(A,B) ) ),
inference(pre_NNF_transformation,[status(thm)],[f13]) ).
fof(f36,definition,
! [A,B] :
( sP0_prd(B,A)
<=> ( ! [C] : ~ in(C,set_intersection2(A,B))
& ~ disjoint(A,B) ) ),
introduced(definition,[new_symbols(definition,[sP0_prd])],[]) ).
fof(f37,plain,
? [A,B] :
( ( disjoint(A,B)
& ? [C] : in(C,set_intersection2(A,B)) )
| sP0_prd(B,A) ),
inference(formula_renaming,[status(thm)],[f35,f36]) ).
fof(f38,plain,
( ? [A,B] :
( disjoint(A,B)
& ? [C] : in(C,set_intersection2(A,B)) )
| ? [A,B] : sP0_prd(B,A) ),
inference(miniscoping,[status(thm)],[f37]) ).
fof(f39,plain,
( ( disjoint(sK5_skl,sK6_skl)
& in(sK7_skl,set_intersection2(sK5_skl,sK6_skl)) )
| sP0_prd(sK4_skl,sK3_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3_skl,sK4_skl,sK5_skl,sK6_skl,sK7_skl]),skolemize(A,sK3_skl),skolemize(B,sK4_skl),skolemize(A,sK5_skl),skolemize(B,sK6_skl),skolemize(C,sK7_skl)],[f38]) ).
fof(f40,plain,
( in(sK7_skl,set_intersection2(sK5_skl,sK6_skl))
| sP0_prd(sK4_skl,sK3_skl) ),
inference(cnf_transformation,[status(thm)],[f39]) ).
fof(f41,plain,
( disjoint(sK5_skl,sK6_skl)
| sP0_prd(sK4_skl,sK3_skl) ),
inference(cnf_transformation,[status(thm)],[f39]) ).
fof(f42,plain,
! [A,B] :
( ( ? [C] : in(C,set_intersection2(A,B))
| disjoint(A,B)
| sP0_prd(B,A) )
& ( ( ! [C] : ~ in(C,set_intersection2(A,B))
& ~ disjoint(A,B) )
| ~ sP0_prd(B,A) ) ),
inference(NNF_transformation,[status(thm)],[f36]) ).
fof(f43,plain,
( ! [A,B] :
( ? [C] : in(C,set_intersection2(A,B))
| disjoint(A,B)
| sP0_prd(B,A) )
& ! [A,B] :
( ( ! [C] : ~ in(C,set_intersection2(A,B))
& ~ disjoint(A,B) )
| ~ sP0_prd(B,A) ) ),
inference(miniscoping,[status(thm)],[f42]) ).
fof(f44,plain,
( ! [A,B] :
( in(sK8_skl(B,A),set_intersection2(A,B))
| disjoint(A,B)
| sP0_prd(B,A) )
& ! [A,B] :
( ( ! [C] : ~ in(C,set_intersection2(A,B))
& ~ disjoint(A,B) )
| ~ sP0_prd(B,A) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8_skl]),skolemize(C,sK8_skl(B,A))],[f43]) ).
fof(f45,plain,
! [X0,X1] :
( ~ disjoint(X1,X0)
| ~ sP0_prd(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f44]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ~ in(X2,set_intersection2(X1,X0))
| ~ sP0_prd(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f44]) ).
fof(f48,plain,
! [X0] : ~ in(X0,empty_set),
inference(destructive_equality_resolution,[status(thm)],[f20]) ).
fof(f57,plain,
! [X0,X1] :
( ~ sP0_prd(X1,X0)
| set_intersection2(X0,X1) = empty_set ),
inference(resolution,[status(thm)],[f21,f46]) ).
fof(f62,plain,
! [X0,X1] :
( ~ sP0_prd(X1,X0)
| set_intersection2(X0,X1) != empty_set ),
inference(resolution,[status(thm)],[f25,f45]) ).
fof(f77,plain,
disjoint(sK5_skl,sK6_skl),
inference(backward_subsumption_resolution,[status(thm)],[f41,f80]) ).
fof(f78,plain,
in(sK7_skl,set_intersection2(sK5_skl,sK6_skl)),
inference(backward_subsumption_resolution,[status(thm)],[f40,f80]) ).
fof(f80,plain,
! [X0,X1] : ~ sP0_prd(X0,X1),
inference(forward_subsumption_resolution,[status(thm)],[f62,f57]) ).
fof(f81,plain,
set_intersection2(sK5_skl,sK6_skl) = empty_set,
inference(resolution,[status(thm)],[f77,f24]) ).
fof(f89,plain,
in(sK7_skl,empty_set),
inference(backward_demodulation,[status(thm)],[f81,f78]) ).
fof(f90,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f89,f48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU120+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.34 % Computer : n001.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Mon Sep 21 05:56:59 UTC 2026
% 0.09/0.34 % CPUTime :
% 0.09/0.35 % Drodi V4.1.1
% 0.09/0.37 % Refutation found
% 0.09/0.37 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.40 % Elapsed time: 0.050571 seconds
% 0.09/0.40 % CPU time: 0.124409 seconds
% 0.09/0.40 % Total memory used: 76.330 MB
% 0.09/0.40 % Net memory used: 76.018 MB
%------------------------------------------------------------------------------