%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SET914+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n017.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:10:57 PM UTC 2026
% Result : Theorem 0.09s 0.37s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 15 unt; 0 def)
% Number of atoms : 157 ( 63 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 184 ( 68 ~; 69 |; 41 &)
% ( 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 : 113 ( 101 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [A,B] : unordered_pair(A,B) = unordered_pair(B,A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [A,B] : set_intersection2(A,B) = set_intersection2(B,A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [A] :
( A = empty_set
<=> ! [B] : ~ in(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [A,B,C] :
( C = unordered_pair(A,B)
<=> ! [D] :
( in(D,C)
<=> ( D = B
| D = A ) ) ),
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,C] :
~ ( in(A,C)
& disjoint(unordered_pair(A,B),C) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,negated_conjecture,
~ ! [A,B,C] :
~ ( in(A,C)
& disjoint(unordered_pair(A,B),C) ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f17,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f18,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f19,plain,
! [A] :
( ( ? [B] : in(B,A)
| A = empty_set )
& ( ! [B] : ~ in(B,A)
| A != empty_set ) ),
inference(NNF_transformation,[status(thm)],[f4]) ).
fof(f20,plain,
( ! [A] :
( ? [B] : in(B,A)
| A = empty_set )
& ! [A] :
( ! [B] : ~ in(B,A)
| A != empty_set ) ),
inference(miniscoping,[status(thm)],[f19]) ).
fof(f21,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))],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( ~ in(X1,X0)
| X0 != empty_set ),
inference(cnf_transformation,[status(thm)],[f21]) ).
fof(f24,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)],[f5]) ).
fof(f25,plain,
( ! [A,B,C] :
( ? [D] :
( ( D = B
| D = A
| in(D,C) )
& ( ( D != B
& D != A )
| ~ in(D,C) ) )
| C = unordered_pair(A,B) )
& ! [A,B,C] :
( ( ! [D] :
( ( D != B
& D != A )
| in(D,C) )
& ! [D] :
( D = B
| D = A
| ~ in(D,C) ) )
| C != unordered_pair(A,B) ) ),
inference(miniscoping,[status(thm)],[f24]) ).
fof(f26,plain,
( ! [A,B,C] :
( ( ( sK1_skl(C,B,A) = B
| sK1_skl(C,B,A) = A
| in(sK1_skl(C,B,A),C) )
& ( ( sK1_skl(C,B,A) != B
& sK1_skl(C,B,A) != A )
| ~ in(sK1_skl(C,B,A),C) ) )
| C = unordered_pair(A,B) )
& ! [A,B,C] :
( ( ! [D] :
( ( D != B
& D != A )
| in(D,C) )
& ! [D] :
( D = B
| D = A
| ~ in(D,C) ) )
| C != unordered_pair(A,B) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1_skl]),skolemize(D,sK1_skl(C,B,A))],[f25]) ).
fof(f29,plain,
! [X0,X1,X2,X3] :
( X3 != X2
| in(X3,X0)
| X0 != unordered_pair(X1,X2) ),
inference(cnf_transformation,[status(thm)],[f26]) ).
fof(f33,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(f34,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)],[f33]) ).
fof(f35,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))],[f34]) ).
fof(f38,plain,
! [X0,X1,X2,X3] :
( ~ in(X3,X2)
| ~ in(X3,X1)
| in(X3,X0)
| X0 != set_intersection2(X1,X2) ),
inference(cnf_transformation,[status(thm)],[f35]) ).
fof(f42,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(f43,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)],[f42]) ).
fof(f44,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f43]) ).
fof(f55,plain,
? [A,B,C] :
( in(A,C)
& disjoint(unordered_pair(A,B),C) ),
inference(pre_NNF_transformation,[status(thm)],[f14]) ).
fof(f56,plain,
? [A,C] :
( in(A,C)
& ? [B] : disjoint(unordered_pair(A,B),C) ),
inference(miniscoping,[status(thm)],[f55]) ).
fof(f57,plain,
( in(sK5_skl,sK6_skl)
& disjoint(unordered_pair(sK5_skl,sK7_skl),sK6_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5_skl,sK6_skl,sK7_skl]),skolemize(A,sK5_skl),skolemize(C,sK6_skl),skolemize(B,sK7_skl)],[f56]) ).
fof(f58,plain,
disjoint(unordered_pair(sK5_skl,sK7_skl),sK6_skl),
inference(cnf_transformation,[status(thm)],[f57]) ).
fof(f59,plain,
in(sK5_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f57]) ).
fof(f60,plain,
! [X0] : ~ in(X0,empty_set),
inference(destructive_equality_resolution,[status(thm)],[f22]) ).
fof(f63,plain,
! [X0,X1] : in(X0,unordered_pair(X1,X0)),
inference(destructive_equality_resolution,[status(thm)],[f29]) ).
fof(f66,plain,
! [X0,X1,X2] :
( ~ in(X0,X2)
| ~ in(X0,X1)
| in(X0,set_intersection2(X1,X2)) ),
inference(destructive_equality_resolution,[status(thm)],[f38]) ).
fof(f70,plain,
disjoint(unordered_pair(sK7_skl,sK5_skl),sK6_skl),
inference(backward_demodulation,[status(thm)],[f17,f58]) ).
fof(f94,plain,
set_intersection2(unordered_pair(sK7_skl,sK5_skl),sK6_skl) = empty_set,
inference(resolution,[status(thm)],[f44,f70]) ).
fof(f95,plain,
set_intersection2(sK6_skl,unordered_pair(sK7_skl,sK5_skl)) = empty_set,
inference(forward_demodulation,[status(thm)],[f18,f94]) ).
fof(f137,plain,
! [X0] :
( ~ in(sK5_skl,X0)
| in(sK5_skl,set_intersection2(X0,sK6_skl)) ),
inference(resolution,[status(thm)],[f66,f59]) ).
fof(f141,plain,
! [X0] : in(sK5_skl,set_intersection2(unordered_pair(X0,sK5_skl),sK6_skl)),
inference(resolution,[status(thm)],[f137,f63]) ).
fof(f144,plain,
! [X0] : in(sK5_skl,set_intersection2(sK6_skl,unordered_pair(X0,sK5_skl))),
inference(forward_demodulation,[status(thm)],[f18,f141]) ).
fof(f151,plain,
in(sK5_skl,empty_set),
inference(paramodulation,[status(thm)],[f95,f144]) ).
fof(f156,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f151,f60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET914+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n017.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 05:38:56 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.36 % 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.14/0.40 % Elapsed time: 0.040127 seconds
% 0.14/0.40 % CPU time: 0.095816 seconds
% 0.14/0.40 % Total memory used: 22.743 MB
% 0.14/0.40 % Net memory used: 22.684 MB
%------------------------------------------------------------------------------