%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SEU159+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 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 : Thu Sep 24 02:19:27 PM UTC 2026
% Result : Theorem 3.57s 0.88s
% Output : CNFRefutation 3.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of formulae : 88 ( 6 unt; 9 def)
% Number of atoms : 342 ( 82 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 400 ( 146 ~; 169 |; 63 &)
% ( 20 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 10 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 189 ( 175 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,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(f11,axiom,
! [A,B,C] :
( C = set_union2(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,B)
| in(D,A) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f13,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f16,axiom,
! [A,B,C] :
( C = set_difference(A,B)
<=> ! [D] :
( in(D,C)
<=> ( ~ in(D,B)
& in(D,A) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f44,lemma,
! [A,B] :
( subset(A,singleton(B))
<=> ( A = singleton(B)
| A = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f62,lemma,
! [A] : subset(empty_set,A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f68,conjecture,
! [A,B,C] :
( subset(unordered_pair(A,B),C)
<=> ( in(B,C)
& in(A,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f69,negated_conjecture,
~ ! [A,B,C] :
( subset(unordered_pair(A,B),C)
<=> ( in(B,C)
& in(A,C) ) ),
inference(negated_conjecture,[status(cth)],[f68]) ).
fof(f122,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)],[f10]) ).
fof(f123,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)],[f122]) ).
fof(f124,plain,
( ! [A,B,C] :
( ( ( sK3_skl(C,B,A) = B
| sK3_skl(C,B,A) = A
| in(sK3_skl(C,B,A),C) )
& ( ( sK3_skl(C,B,A) != B
& sK3_skl(C,B,A) != A )
| ~ in(sK3_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,[sK3_skl]),skolemize(D,sK3_skl(C,B,A))],[f123]) ).
fof(f125,plain,
! [X0,X1,X2,X3] :
( X3 = X2
| X3 = X1
| ~ in(X3,X0)
| X0 != unordered_pair(X1,X2) ),
inference(cnf_transformation,[status(thm)],[f124]) ).
fof(f126,plain,
! [X0,X1,X2,X3] :
( X3 != X1
| in(X3,X0)
| X0 != unordered_pair(X1,X2) ),
inference(cnf_transformation,[status(thm)],[f124]) ).
fof(f127,plain,
! [X0,X1,X2,X3] :
( X3 != X2
| in(X3,X0)
| X0 != unordered_pair(X1,X2) ),
inference(cnf_transformation,[status(thm)],[f124]) ).
fof(f131,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_union2(A,B) )
& ( ! [D] :
( ( ( ~ in(D,B)
& ~ in(D,A) )
| in(D,C) )
& ( in(D,B)
| in(D,A)
| ~ in(D,C) ) )
| C != set_union2(A,B) ) ),
inference(NNF_transformation,[status(thm)],[f11]) ).
fof(f132,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_union2(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_union2(A,B) ) ),
inference(miniscoping,[status(thm)],[f131]) ).
fof(f133,plain,
( ! [A,B,C] :
( ( ( in(sK4_skl(C,B,A),B)
| in(sK4_skl(C,B,A),A)
| in(sK4_skl(C,B,A),C) )
& ( ( ~ in(sK4_skl(C,B,A),B)
& ~ in(sK4_skl(C,B,A),A) )
| ~ in(sK4_skl(C,B,A),C) ) )
| C = set_union2(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_union2(A,B) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4_skl]),skolemize(D,sK4_skl(C,B,A))],[f132]) ).
fof(f134,plain,
! [X0,X1,X2,X3] :
( in(X3,X2)
| in(X3,X1)
| ~ in(X3,X0)
| X0 != set_union2(X1,X2) ),
inference(cnf_transformation,[status(thm)],[f133]) ).
fof(f135,plain,
! [X0,X1,X2,X3] :
( ~ in(X3,X1)
| in(X3,X0)
| X0 != set_union2(X1,X2) ),
inference(cnf_transformation,[status(thm)],[f133]) ).
fof(f136,plain,
! [X0,X1,X2,X3] :
( ~ in(X3,X2)
| in(X3,X0)
| X0 != set_union2(X1,X2) ),
inference(cnf_transformation,[status(thm)],[f133]) ).
fof(f149,plain,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,B)
| ~ in(C,A) ) ),
inference(pre_NNF_transformation,[status(thm)],[f13]) ).
fof(f150,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)],[f149]) ).
fof(f151,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)],[f150]) ).
fof(f152,plain,
( ! [A,B] :
( ( ~ in(sK10_skl(B,A),B)
& in(sK10_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,[sK10_skl]),skolemize(C,sK10_skl(B,A))],[f151]) ).
fof(f153,plain,
! [X0,X1,X2] :
( in(X2,X1)
| ~ in(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f152]) ).
fof(f154,plain,
! [X0,X1] :
( in(sK10_skl(X1,X0),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f152]) ).
fof(f155,plain,
! [X0,X1] :
( ~ in(sK10_skl(X1,X0),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f152]) ).
fof(f174,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_difference(A,B) )
& ( ! [D] :
( ( in(D,B)
| ~ in(D,A)
| in(D,C) )
& ( ( ~ in(D,B)
& in(D,A) )
| ~ in(D,C) ) )
| C != set_difference(A,B) ) ),
inference(NNF_transformation,[status(thm)],[f16]) ).
fof(f175,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_difference(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_difference(A,B) ) ),
inference(miniscoping,[status(thm)],[f174]) ).
fof(f176,plain,
( ! [A,B,C] :
( ( ( ( ~ in(sK15_skl(C,B,A),B)
& in(sK15_skl(C,B,A),A) )
| in(sK15_skl(C,B,A),C) )
& ( in(sK15_skl(C,B,A),B)
| ~ in(sK15_skl(C,B,A),A)
| ~ in(sK15_skl(C,B,A),C) ) )
| C = set_difference(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_difference(A,B) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15_skl]),skolemize(D,sK15_skl(C,B,A))],[f175]) ).
fof(f178,plain,
! [X0,X1,X2,X3] :
( ~ in(X3,X2)
| ~ in(X3,X0)
| X0 != set_difference(X1,X2) ),
inference(cnf_transformation,[status(thm)],[f176]) ).
fof(f225,plain,
! [A,B] :
( ( ( A != singleton(B)
& A != empty_set )
| subset(A,singleton(B)) )
& ( A = singleton(B)
| A = empty_set
| ~ subset(A,singleton(B)) ) ),
inference(NNF_transformation,[status(thm)],[f44]) ).
fof(f226,plain,
( ! [A,B] :
( ( A != singleton(B)
& A != empty_set )
| subset(A,singleton(B)) )
& ! [A,B] :
( A = singleton(B)
| A = empty_set
| ~ subset(A,singleton(B)) ) ),
inference(miniscoping,[status(thm)],[f225]) ).
fof(f227,plain,
! [X0,X1] :
( X0 = singleton(X1)
| X0 = empty_set
| ~ subset(X0,singleton(X1)) ),
inference(cnf_transformation,[status(thm)],[f226]) ).
fof(f269,plain,
! [X0] : subset(empty_set,X0),
inference(cnf_transformation,[status(thm)],[f62]) ).
fof(f285,plain,
? [A,B,C] :
( subset(unordered_pair(A,B),C)
<~> ( in(B,C)
& in(A,C) ) ),
inference(pre_NNF_transformation,[status(thm)],[f69]) ).
fof(f286,plain,
? [A,B,C] :
( ( ~ in(B,C)
| ~ in(A,C)
| ~ subset(unordered_pair(A,B),C) )
& ( ( in(B,C)
& in(A,C) )
| subset(unordered_pair(A,B),C) ) ),
inference(NNF_transformation,[status(thm)],[f285]) ).
fof(f287,plain,
( ( ~ in(sK20_skl,sK21_skl)
| ~ in(sK19_skl,sK21_skl)
| ~ subset(unordered_pair(sK19_skl,sK20_skl),sK21_skl) )
& ( ( in(sK20_skl,sK21_skl)
& in(sK19_skl,sK21_skl) )
| subset(unordered_pair(sK19_skl,sK20_skl),sK21_skl) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19_skl,sK20_skl,sK21_skl]),skolemize(A,sK19_skl),skolemize(B,sK20_skl),skolemize(C,sK21_skl)],[f286]) ).
fof(f288,plain,
( in(sK19_skl,sK21_skl)
| subset(unordered_pair(sK19_skl,sK20_skl),sK21_skl) ),
inference(cnf_transformation,[status(thm)],[f287]) ).
fof(f289,plain,
( in(sK20_skl,sK21_skl)
| subset(unordered_pair(sK19_skl,sK20_skl),sK21_skl) ),
inference(cnf_transformation,[status(thm)],[f287]) ).
fof(f290,plain,
( ~ in(sK20_skl,sK21_skl)
| ~ in(sK19_skl,sK21_skl)
| ~ subset(unordered_pair(sK19_skl,sK20_skl),sK21_skl) ),
inference(cnf_transformation,[status(thm)],[f287]) ).
fof(f346,definition,
( sQ0_spl
<=> subset(unordered_pair(sK19_skl,sK20_skl),sK21_skl) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f347,plain,
( ~ sQ0_spl
| subset(unordered_pair(sK19_skl,sK20_skl),sK21_skl) ),
inference(component_clause,[status(thm)],[f346]) ).
fof(f348,plain,
( sQ0_spl
| ~ subset(unordered_pair(sK19_skl,sK20_skl),sK21_skl) ),
inference(component_clause,[status(thm)],[f346]) ).
fof(f349,definition,
( sQ1_spl
<=> in(sK19_skl,sK21_skl) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f352,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f288,f346,f349]) ).
fof(f353,definition,
( sQ2_spl
<=> in(sK20_skl,sK21_skl) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f354,plain,
( ~ sQ2_spl
| in(sK20_skl,sK21_skl) ),
inference(component_clause,[status(thm)],[f353]) ).
fof(f356,plain,
( sQ2_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f289,f346,f353]) ).
fof(f357,plain,
( ~ sQ2_spl
| ~ sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f290,f346,f349,f353]) ).
fof(f365,plain,
! [X0,X1,X2] :
( X0 = X2
| X0 = X1
| ~ in(X0,unordered_pair(X1,X2)) ),
inference(destructive_equality_resolution,[status(thm)],[f125]) ).
fof(f366,plain,
! [X0,X1] : in(X0,unordered_pair(X0,X1)),
inference(destructive_equality_resolution,[status(thm)],[f126]) ).
fof(f367,plain,
! [X0,X1] : in(X0,unordered_pair(X1,X0)),
inference(destructive_equality_resolution,[status(thm)],[f127]) ).
fof(f368,plain,
! [X0,X1,X2] :
( in(X0,X2)
| in(X0,X1)
| ~ in(X0,set_union2(X1,X2)) ),
inference(destructive_equality_resolution,[status(thm)],[f134]) ).
fof(f369,plain,
! [X0,X1,X2] :
( ~ in(X0,X1)
| in(X0,set_union2(X1,X2)) ),
inference(destructive_equality_resolution,[status(thm)],[f135]) ).
fof(f370,plain,
! [X0,X1,X2] :
( ~ in(X0,X2)
| in(X0,set_union2(X1,X2)) ),
inference(destructive_equality_resolution,[status(thm)],[f136]) ).
fof(f380,plain,
! [X0,X1,X2] :
( ~ in(X0,X2)
| ~ in(X0,set_difference(X1,X2)) ),
inference(destructive_equality_resolution,[status(thm)],[f178]) ).
fof(f498,plain,
! [X0] :
( ~ sQ2_spl
| in(sK20_skl,set_union2(sK21_skl,X0)) ),
inference(resolution,[status(thm)],[f369,f354]) ).
fof(f512,plain,
! [X0,X1] :
( ~ sQ2_spl
| in(sK20_skl,set_union2(X0,set_union2(sK21_skl,X1))) ),
inference(resolution,[status(thm)],[f498,f370]) ).
fof(f517,definition,
! [X0] :
( sQ5_spl
<=> in(sK20_skl,X0) ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f518,plain,
! [X0] :
( ~ sQ5_spl
| in(sK20_skl,X0) ),
inference(component_clause,[status(thm)],[f517]) ).
fof(f620,plain,
! [X0,X1] :
( ~ sQ2_spl
| in(sK20_skl,set_union2(sK21_skl,X1))
| in(sK20_skl,X0) ),
inference(resolution,[status(thm)],[f512,f368]) ).
fof(f628,definition,
! [X1] :
( sQ7_spl
<=> in(sK20_skl,set_union2(sK21_skl,X1)) ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f631,plain,
( ~ sQ2_spl
| sQ7_spl
| sQ5_spl ),
inference(split_clause,[status(thm)],[f620,f517,f628,f353]) ).
fof(f647,plain,
! [X0] :
( ~ sQ0_spl
| in(X0,sK21_skl)
| ~ in(X0,unordered_pair(sK19_skl,sK20_skl)) ),
inference(resolution,[status(thm)],[f347,f153]) ).
fof(f889,plain,
( ~ sQ0_spl
| in(sK20_skl,sK21_skl) ),
inference(resolution,[status(thm)],[f647,f367]) ).
fof(f890,plain,
( ~ sQ0_spl
| in(sK19_skl,sK21_skl) ),
inference(resolution,[status(thm)],[f647,f366]) ).
fof(f900,plain,
( ~ sQ0_spl
| sQ1_spl ),
inference(split_clause,[status(thm)],[f890,f349,f346]) ).
fof(f910,plain,
( sQ0_spl
| in(sK10_skl(sK21_skl,unordered_pair(sK19_skl,sK20_skl)),unordered_pair(sK19_skl,sK20_skl)) ),
inference(resolution,[status(thm)],[f348,f154]) ).
fof(f914,plain,
( ~ sQ0_spl
| sQ2_spl ),
inference(split_clause,[status(thm)],[f889,f353,f346]) ).
fof(f993,plain,
! [X0] :
( ~ sQ5_spl
| ~ in(sK20_skl,X0) ),
inference(resolution,[status(thm)],[f518,f380]) ).
fof(f1015,plain,
( ~ sQ5_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f993,f518]) ).
fof(f1016,plain,
~ sQ5_spl,
inference(contradiction_clause,[status(thm)],[f1015]) ).
fof(f1560,plain,
! [X0] :
( empty_set = singleton(X0)
| empty_set = empty_set ),
inference(resolution,[status(thm)],[f227,f269]) ).
fof(f1566,definition,
( sQ22_spl
<=> empty_set = empty_set ),
introduced(definition,[new_symbols(definition,[sQ22_spl])],[split_symbol_definition]) ).
fof(f1569,definition,
! [X0] :
( sQ23_spl
<=> empty_set = singleton(X0) ),
introduced(definition,[new_symbols(definition,[sQ23_spl])],[split_symbol_definition]) ).
fof(f1572,plain,
( sQ23_spl
| sQ22_spl ),
inference(split_clause,[status(thm)],[f1560,f1566,f1569]) ).
fof(f1574,plain,
( sQ0_spl
| sK10_skl(sK21_skl,unordered_pair(sK19_skl,sK20_skl)) = sK20_skl
| sK10_skl(sK21_skl,unordered_pair(sK19_skl,sK20_skl)) = sK19_skl ),
inference(resolution,[status(thm)],[f910,f365]) ).
fof(f1590,definition,
( sQ24_spl
<=> sK10_skl(sK21_skl,unordered_pair(sK19_skl,sK20_skl)) = sK19_skl ),
introduced(definition,[new_symbols(definition,[sQ24_spl])],[split_symbol_definition]) ).
fof(f1591,plain,
( ~ sQ24_spl
| sK10_skl(sK21_skl,unordered_pair(sK19_skl,sK20_skl)) = sK19_skl ),
inference(component_clause,[status(thm)],[f1590]) ).
fof(f1593,definition,
( sQ25_spl
<=> sK10_skl(sK21_skl,unordered_pair(sK19_skl,sK20_skl)) = sK20_skl ),
introduced(definition,[new_symbols(definition,[sQ25_spl])],[split_symbol_definition]) ).
fof(f1594,plain,
( ~ sQ25_spl
| sK10_skl(sK21_skl,unordered_pair(sK19_skl,sK20_skl)) = sK20_skl ),
inference(component_clause,[status(thm)],[f1593]) ).
fof(f1596,plain,
( sQ0_spl
| sQ25_spl
| sQ24_spl ),
inference(split_clause,[status(thm)],[f1574,f1590,f1593,f346]) ).
fof(f1610,plain,
( ~ sQ24_spl
| ~ in(sK19_skl,sK21_skl)
| subset(unordered_pair(sK19_skl,sK20_skl),sK21_skl) ),
inference(paramodulation,[status(thm)],[f1591,f155]) ).
fof(f1615,plain,
( ~ sQ24_spl
| ~ sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f1610,f346,f349,f1590]) ).
fof(f1620,plain,
( ~ sQ25_spl
| ~ in(sK20_skl,sK21_skl)
| subset(unordered_pair(sK19_skl,sK20_skl),sK21_skl) ),
inference(paramodulation,[status(thm)],[f1594,f155]) ).
fof(f1625,plain,
( ~ sQ25_spl
| ~ sQ2_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f1620,f346,f353,f1593]) ).
fof(f1626,plain,
$false,
inference(sat_refutation,[status(thm)],[f352,f356,f357,f631,f900,f914,f1016,f1572,f1596,f1615,f1625]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU159+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.33 % Computer : n013.cluster.edu
% 0.07/0.33 % Model : x86_64 x86_64
% 0.07/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.33 % Memory : 8046.5625MB
% 0.07/0.33 % OS : Linux 6.8.0-71-generic
% 0.07/0.33 % CPULimit : 300
% 0.07/0.33 % WCLimit : 300
% 0.07/0.33 % DateTime : Mon Sep 21 05:52:51 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.07/0.35 % Drodi V4.1.1
% 3.57/0.88 % Refutation found
% 3.57/0.88 % SZS status Theorem for theBenchmark: Theorem is valid
% 3.57/0.88 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.26/0.90 % Elapsed time: 0.548677 seconds
% 0.26/0.90 % CPU time: 4.117205 seconds
% 0.26/0.90 % Total memory used: 157.898 MB
% 0.26/0.90 % Net memory used: 150.552 MB
%------------------------------------------------------------------------------