%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SYN551+2 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n016.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 03:16:46 PM UTC 2026
% Result : Theorem 0.10s 0.40s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 16
% Syntax : Number of formulae : 101 ( 4 unt; 15 def)
% Number of atoms : 339 ( 152 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 412 ( 174 ~; 196 |; 15 &)
% ( 25 <=>; 0 =>; 0 <=; 2 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 17 ( 15 usr; 15 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 90 ( 74 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ? [X] :
! [Y] :
( Y = f(g(Y))
<=> X = Y )
<=> ? [X] :
! [Y] :
( Y = g(f(Y))
<=> X = Y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ ( ? [X] :
! [Y] :
( Y = f(g(Y))
<=> X = Y )
<=> ? [X] :
! [Y] :
( Y = g(f(Y))
<=> X = Y ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ? [X] :
! [Y] :
( Y = f(g(Y))
<=> X = Y )
<~> ? [X] :
! [Y] :
( Y = g(f(Y))
<=> X = Y ) ),
inference(pre_NNF_transformation,[status(thm)],[f2]) ).
fof(f4,definition,
! [X,Y] :
( sP0_prd(Y,X)
<=> ( Y = f(g(Y))
<=> X = Y ) ),
introduced(definition,[new_symbols(definition,[sP0_prd])],[]) ).
fof(f5,plain,
( ? [X] :
! [Y] : sP0_prd(Y,X)
<~> ? [X] :
! [Y] :
( Y = g(f(Y))
<=> X = Y ) ),
inference(formula_renaming,[status(thm)],[f3,f4]) ).
fof(f6,plain,
( ( ! [X] :
? [Y] :
( ( X = Y
| Y = g(f(Y)) )
& ( X != Y
| Y != g(f(Y)) ) )
| ! [X] :
? [Y] : ~ sP0_prd(Y,X) )
& ( ? [X] :
! [Y] :
( ( X != Y
| Y = g(f(Y)) )
& ( X = Y
| Y != g(f(Y)) ) )
| ? [X] :
! [Y] : sP0_prd(Y,X) ) ),
inference(NNF_transformation,[status(thm)],[f5]) ).
fof(f7,plain,
( ( ! [X] :
? [Y] :
( ( X = Y
| Y = g(f(Y)) )
& ( X != Y
| Y != g(f(Y)) ) )
| ! [X] :
? [Y] : ~ sP0_prd(Y,X) )
& ( ? [X] :
( ! [Y] :
( X != Y
| Y = g(f(Y)) )
& ! [Y] :
( X = Y
| Y != g(f(Y)) ) )
| ? [X] :
! [Y] : sP0_prd(Y,X) ) ),
inference(miniscoping,[status(thm)],[f6]) ).
fof(f8,plain,
( ( ! [X] :
( ( X = sK3_skl(X)
| sK3_skl(X) = g(f(sK3_skl(X))) )
& ( X != sK3_skl(X)
| sK3_skl(X) != g(f(sK3_skl(X))) ) )
| ! [X] : ~ sP0_prd(sK2_skl(X),X) )
& ( ( ! [Y] :
( sK1_skl != Y
| Y = g(f(Y)) )
& ! [Y] :
( sK1_skl = Y
| Y != g(f(Y)) ) )
| ! [Y] : sP0_prd(Y,sK0_skl) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl,sK2_skl,sK3_skl]),skolemize(X,sK0_skl),skolemize(X,sK1_skl),skolemize(Y,sK2_skl(X)),skolemize(Y,sK3_skl(X))],[f7]) ).
fof(f9,plain,
! [X0,X1] :
( sK1_skl = X1
| X1 != g(f(X1))
| sP0_prd(X0,sK0_skl) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( sK1_skl != X1
| X1 = g(f(X1))
| sP0_prd(X0,sK0_skl) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f11,plain,
! [X0,X1] :
( X1 != sK3_skl(X1)
| sK3_skl(X1) != g(f(sK3_skl(X1)))
| ~ sP0_prd(sK2_skl(X0),X0) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f12,plain,
! [X0,X1] :
( X1 = sK3_skl(X1)
| sK3_skl(X1) = g(f(sK3_skl(X1)))
| ~ sP0_prd(sK2_skl(X0),X0) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f13,plain,
! [X,Y] :
( ( ( ( X = Y
| Y = f(g(Y)) )
& ( X != Y
| Y != f(g(Y)) ) )
| sP0_prd(Y,X) )
& ( ( ( X != Y
| Y = f(g(Y)) )
& ( X = Y
| Y != f(g(Y)) ) )
| ~ sP0_prd(Y,X) ) ),
inference(NNF_transformation,[status(thm)],[f4]) ).
fof(f14,plain,
( ! [X,Y] :
( ( ( X = Y
| Y = f(g(Y)) )
& ( X != Y
| Y != f(g(Y)) ) )
| sP0_prd(Y,X) )
& ! [X,Y] :
( ( ( X != Y
| Y = f(g(Y)) )
& ( X = Y
| Y != f(g(Y)) ) )
| ~ sP0_prd(Y,X) ) ),
inference(miniscoping,[status(thm)],[f13]) ).
fof(f15,plain,
! [X0,X1] :
( X1 = X0
| X0 != f(g(X0))
| ~ sP0_prd(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f14]) ).
fof(f16,plain,
! [X0,X1] :
( X1 != X0
| X0 = f(g(X0))
| ~ sP0_prd(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f14]) ).
fof(f17,plain,
! [X0,X1] :
( X1 != X0
| X0 != f(g(X0))
| sP0_prd(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f14]) ).
fof(f18,plain,
! [X0,X1] :
( X1 = X0
| X0 = f(g(X0))
| sP0_prd(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f14]) ).
fof(f19,definition,
! [X0] :
( sQ0_spl
<=> sP0_prd(X0,sK0_skl) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f20,plain,
! [X0] :
( ~ sQ0_spl
| sP0_prd(X0,sK0_skl) ),
inference(component_clause,[status(thm)],[f19]) ).
fof(f22,definition,
! [X1] :
( sQ1_spl
<=> ( sK1_skl = X1
| X1 != g(f(X1)) ) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f23,plain,
! [X0] :
( ~ sQ1_spl
| sK1_skl = X0
| X0 != g(f(X0)) ),
inference(component_clause,[status(thm)],[f22]) ).
fof(f25,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f9,f19,f22]) ).
fof(f26,definition,
! [X1] :
( sQ2_spl
<=> ( sK1_skl != X1
| X1 = g(f(X1)) ) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f27,plain,
! [X0] :
( ~ sQ2_spl
| sK1_skl != X0
| X0 = g(f(X0)) ),
inference(component_clause,[status(thm)],[f26]) ).
fof(f29,plain,
( sQ2_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f10,f19,f26]) ).
fof(f30,definition,
! [X0] :
( sQ3_spl
<=> ~ sP0_prd(sK2_skl(X0),X0) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f31,plain,
! [X0] :
( ~ sQ3_spl
| ~ sP0_prd(sK2_skl(X0),X0) ),
inference(component_clause,[status(thm)],[f30]) ).
fof(f33,definition,
! [X1] :
( sQ4_spl
<=> ( X1 != sK3_skl(X1)
| sK3_skl(X1) != g(f(sK3_skl(X1))) ) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f34,plain,
! [X0] :
( ~ sQ4_spl
| X0 != sK3_skl(X0)
| sK3_skl(X0) != g(f(sK3_skl(X0))) ),
inference(component_clause,[status(thm)],[f33]) ).
fof(f36,plain,
( sQ4_spl
| sQ3_spl ),
inference(split_clause,[status(thm)],[f11,f30,f33]) ).
fof(f37,definition,
! [X1] :
( sQ5_spl
<=> ( X1 = sK3_skl(X1)
| sK3_skl(X1) = g(f(sK3_skl(X1))) ) ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f38,plain,
! [X0] :
( ~ sQ5_spl
| X0 = sK3_skl(X0)
| sK3_skl(X0) = g(f(sK3_skl(X0))) ),
inference(component_clause,[status(thm)],[f37]) ).
fof(f40,plain,
( sQ5_spl
| sQ3_spl ),
inference(split_clause,[status(thm)],[f12,f30,f37]) ).
fof(f41,plain,
! [X0] :
( X0 = f(g(X0))
| ~ sP0_prd(X0,X0) ),
inference(destructive_equality_resolution,[status(thm)],[f16]) ).
fof(f42,plain,
! [X0] :
( X0 != f(g(X0))
| sP0_prd(X0,X0) ),
inference(destructive_equality_resolution,[status(thm)],[f17]) ).
fof(f43,plain,
! [X0] :
( ~ sQ0_spl
| sK0_skl = X0
| X0 != f(g(X0)) ),
inference(resolution,[status(thm)],[f15,f20]) ).
fof(f44,plain,
( ~ sQ0_spl
| sK0_skl = f(g(sK0_skl)) ),
inference(resolution,[status(thm)],[f41,f20]) ).
fof(f45,plain,
( ~ sQ0_spl
| ~ sQ3_spl
| $false ),
inference(resolution,[status(thm)],[f31,f20]) ).
fof(f46,plain,
( ~ sQ0_spl
| ~ sQ3_spl ),
inference(contradiction_clause,[status(thm)],[f45]) ).
fof(f52,definition,
( sQ7_spl
<=> sK0_skl = sK0_skl ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f54,plain,
( sQ7_spl
| sK0_skl != sK0_skl ),
inference(component_clause,[status(thm)],[f52]) ).
fof(f56,plain,
( ~ sQ2_spl
| sK1_skl = g(f(sK1_skl)) ),
inference(destructive_equality_resolution,[status(thm)],[f27]) ).
fof(f61,plain,
( ~ sQ2_spl
| f(sK1_skl) != f(sK1_skl)
| sP0_prd(f(sK1_skl),f(sK1_skl)) ),
inference(paramodulation,[status(thm)],[f56,f42]) ).
fof(f66,definition,
( sQ9_spl
<=> sP0_prd(f(sK1_skl),f(sK1_skl)) ),
introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition]) ).
fof(f69,definition,
( sQ10_spl
<=> f(sK1_skl) = f(sK1_skl) ),
introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).
fof(f71,plain,
( sQ10_spl
| f(sK1_skl) != f(sK1_skl) ),
inference(component_clause,[status(thm)],[f69]) ).
fof(f72,plain,
( ~ sQ2_spl
| ~ sQ10_spl
| sQ9_spl ),
inference(split_clause,[status(thm)],[f61,f66,f69,f26]) ).
fof(f73,plain,
! [X0] :
( ~ sQ3_spl
| X0 = sK2_skl(X0)
| sK2_skl(X0) = f(g(sK2_skl(X0))) ),
inference(resolution,[status(thm)],[f31,f18]) ).
fof(f83,plain,
( sQ7_spl
| $false ),
inference(trivial_equality_resolution,[status(thm)],[f54]) ).
fof(f84,plain,
sQ7_spl,
inference(contradiction_clause,[status(thm)],[f83]) ).
fof(f103,plain,
! [X0] :
( ~ sQ3_spl
| ~ sQ1_spl
| X0 = sK2_skl(X0)
| sK1_skl = g(sK2_skl(X0))
| g(sK2_skl(X0)) != g(sK2_skl(X0)) ),
inference(paramodulation,[status(thm)],[f73,f23]) ).
fof(f105,plain,
! [X0] :
( ~ sQ3_spl
| ~ sQ1_spl
| X0 = sK2_skl(X0)
| sK1_skl = g(sK2_skl(X0)) ),
inference(trivial_equality_resolution,[status(thm)],[f103]) ).
fof(f108,plain,
! [X0] :
( ~ sQ3_spl
| ~ sQ1_spl
| X0 = sK2_skl(X0)
| X0 = sK2_skl(X0)
| sK2_skl(X0) = f(sK1_skl) ),
inference(paramodulation,[status(thm)],[f105,f73]) ).
fof(f110,plain,
! [X0] :
( ~ sQ3_spl
| ~ sQ1_spl
| X0 = sK2_skl(X0)
| sK2_skl(X0) = f(sK1_skl) ),
inference(duplicate_literals_removal,[status(thm)],[f108]) ).
fof(f115,definition,
( sQ13_spl
<=> g(sK0_skl) = g(sK0_skl) ),
introduced(definition,[new_symbols(definition,[sQ13_spl])],[split_symbol_definition]) ).
fof(f117,plain,
( sQ13_spl
| g(sK0_skl) != g(sK0_skl) ),
inference(component_clause,[status(thm)],[f115]) ).
fof(f138,plain,
( sQ13_spl
| $false ),
inference(trivial_equality_resolution,[status(thm)],[f117]) ).
fof(f139,plain,
sQ13_spl,
inference(contradiction_clause,[status(thm)],[f138]) ).
fof(f144,plain,
! [X0] :
( ~ sQ5_spl
| ~ sQ0_spl
| X0 = sK3_skl(X0)
| sK0_skl = f(sK3_skl(X0))
| f(sK3_skl(X0)) != f(sK3_skl(X0)) ),
inference(paramodulation,[status(thm)],[f38,f43]) ).
fof(f145,plain,
! [X0] :
( ~ sQ5_spl
| ~ sQ0_spl
| X0 = sK3_skl(X0)
| sK0_skl = f(sK3_skl(X0)) ),
inference(trivial_equality_resolution,[status(thm)],[f144]) ).
fof(f150,plain,
! [X0] :
( ~ sQ5_spl
| ~ sQ0_spl
| X0 = sK3_skl(X0)
| X0 = sK3_skl(X0)
| sK3_skl(X0) = g(sK0_skl) ),
inference(paramodulation,[status(thm)],[f145,f38]) ).
fof(f195,plain,
! [X0] :
( ~ sQ3_spl
| ~ sQ1_spl
| sK2_skl(X0) = X0
| f(sK1_skl) != X0 ),
inference(equality_factoring,[status(thm)],[f110]) ).
fof(f207,plain,
( ~ sQ3_spl
| ~ sQ1_spl
| sK2_skl(f(sK1_skl)) = f(sK1_skl) ),
inference(destructive_equality_resolution,[status(thm)],[f195]) ).
fof(f210,plain,
! [X0] :
( ~ sQ1_spl
| ~ sQ5_spl
| sK1_skl = sK3_skl(X0)
| X0 = sK3_skl(X0) ),
inference(resolution,[status(thm)],[f38,f23]) ).
fof(f222,plain,
! [X0] :
( ~ sQ1_spl
| ~ sQ5_spl
| sK3_skl(X0) = sK1_skl
| X0 != sK1_skl ),
inference(equality_factoring,[status(thm)],[f210]) ).
fof(f224,plain,
( ~ sQ1_spl
| ~ sQ5_spl
| sK3_skl(sK1_skl) = sK1_skl ),
inference(destructive_equality_resolution,[status(thm)],[f222]) ).
fof(f236,definition,
( sQ18_spl
<=> sK3_skl(sK1_skl) = sK1_skl ),
introduced(definition,[new_symbols(definition,[sQ18_spl])],[split_symbol_definition]) ).
fof(f238,plain,
( sQ18_spl
| sK3_skl(sK1_skl) != sK1_skl ),
inference(component_clause,[status(thm)],[f236]) ).
fof(f247,plain,
( ~ sQ1_spl
| ~ sQ5_spl
| ~ sQ4_spl
| sK1_skl != sK3_skl(sK1_skl)
| sK3_skl(sK1_skl) != g(f(sK1_skl)) ),
inference(paramodulation,[status(thm)],[f224,f34]) ).
fof(f262,definition,
( sQ22_spl
<=> sK3_skl(sK1_skl) = g(f(sK1_skl)) ),
introduced(definition,[new_symbols(definition,[sQ22_spl])],[split_symbol_definition]) ).
fof(f264,plain,
( sQ22_spl
| sK3_skl(sK1_skl) != g(f(sK1_skl)) ),
inference(component_clause,[status(thm)],[f262]) ).
fof(f266,plain,
( ~ sQ1_spl
| ~ sQ5_spl
| ~ sQ4_spl
| ~ sQ18_spl
| ~ sQ22_spl ),
inference(split_clause,[status(thm)],[f247,f262,f236,f33,f37,f22]) ).
fof(f282,plain,
( sQ10_spl
| $false ),
inference(trivial_equality_resolution,[status(thm)],[f71]) ).
fof(f283,plain,
sQ10_spl,
inference(contradiction_clause,[status(thm)],[f282]) ).
fof(f284,plain,
( sQ22_spl
| ~ sQ1_spl
| ~ sQ5_spl
| sK1_skl != g(f(sK1_skl)) ),
inference(forward_demodulation,[status(thm)],[f224,f264]) ).
fof(f285,plain,
( sQ22_spl
| ~ sQ1_spl
| ~ sQ5_spl
| ~ sQ2_spl
| sK1_skl != sK1_skl ),
inference(forward_demodulation,[status(thm)],[f56,f284]) ).
fof(f286,plain,
( sQ22_spl
| ~ sQ1_spl
| ~ sQ5_spl
| ~ sQ2_spl
| $false ),
inference(trivial_equality_resolution,[status(thm)],[f285]) ).
fof(f287,plain,
( sQ22_spl
| ~ sQ1_spl
| ~ sQ5_spl
| ~ sQ2_spl ),
inference(contradiction_clause,[status(thm)],[f286]) ).
fof(f288,plain,
( sQ18_spl
| ~ sQ1_spl
| ~ sQ5_spl
| sK1_skl != sK1_skl ),
inference(forward_demodulation,[status(thm)],[f224,f238]) ).
fof(f289,plain,
( sQ18_spl
| ~ sQ1_spl
| ~ sQ5_spl
| $false ),
inference(trivial_equality_resolution,[status(thm)],[f288]) ).
fof(f290,plain,
( sQ18_spl
| ~ sQ1_spl
| ~ sQ5_spl ),
inference(contradiction_clause,[status(thm)],[f289]) ).
fof(f311,plain,
( ~ sQ3_spl
| ~ sQ1_spl
| ~ sP0_prd(f(sK1_skl),f(sK1_skl)) ),
inference(paramodulation,[status(thm)],[f207,f31]) ).
fof(f320,plain,
( ~ sQ3_spl
| ~ sQ1_spl
| ~ sQ9_spl ),
inference(split_clause,[status(thm)],[f311,f66,f22,f30]) ).
fof(f323,plain,
! [X0] :
( ~ sQ5_spl
| ~ sQ0_spl
| X0 = sK3_skl(X0)
| sK3_skl(X0) = g(sK0_skl) ),
inference(duplicate_literals_removal,[status(thm)],[f150]) ).
fof(f363,plain,
! [X0] :
( ~ sQ5_spl
| ~ sQ0_spl
| sK3_skl(X0) = X0
| g(sK0_skl) != X0 ),
inference(equality_factoring,[status(thm)],[f323]) ).
fof(f377,plain,
( ~ sQ5_spl
| ~ sQ0_spl
| sK3_skl(g(sK0_skl)) = g(sK0_skl) ),
inference(destructive_equality_resolution,[status(thm)],[f363]) ).
fof(f442,plain,
( ~ sQ5_spl
| ~ sQ0_spl
| ~ sQ4_spl
| g(sK0_skl) != sK3_skl(g(sK0_skl))
| sK3_skl(g(sK0_skl)) != g(f(g(sK0_skl))) ),
inference(paramodulation,[status(thm)],[f377,f34]) ).
fof(f443,definition,
( sQ26_spl
<=> g(sK0_skl) = sK3_skl(g(sK0_skl)) ),
introduced(definition,[new_symbols(definition,[sQ26_spl])],[split_symbol_definition]) ).
fof(f445,plain,
( sQ26_spl
| g(sK0_skl) != sK3_skl(g(sK0_skl)) ),
inference(component_clause,[status(thm)],[f443]) ).
fof(f461,definition,
( sQ30_spl
<=> sK3_skl(g(sK0_skl)) = g(f(g(sK0_skl))) ),
introduced(definition,[new_symbols(definition,[sQ30_spl])],[split_symbol_definition]) ).
fof(f463,plain,
( sQ30_spl
| sK3_skl(g(sK0_skl)) != g(f(g(sK0_skl))) ),
inference(component_clause,[status(thm)],[f461]) ).
fof(f465,plain,
( ~ sQ5_spl
| ~ sQ0_spl
| ~ sQ4_spl
| ~ sQ26_spl
| ~ sQ30_spl ),
inference(split_clause,[status(thm)],[f442,f461,f443,f33,f19,f37]) ).
fof(f466,plain,
( sQ30_spl
| ~ sQ5_spl
| ~ sQ0_spl
| g(sK0_skl) != g(f(g(sK0_skl))) ),
inference(forward_demodulation,[status(thm)],[f377,f463]) ).
fof(f467,plain,
( sQ30_spl
| ~ sQ5_spl
| ~ sQ0_spl
| g(sK0_skl) != g(sK0_skl) ),
inference(forward_demodulation,[status(thm)],[f44,f466]) ).
fof(f468,plain,
( sQ30_spl
| ~ sQ5_spl
| ~ sQ0_spl
| $false ),
inference(trivial_equality_resolution,[status(thm)],[f467]) ).
fof(f469,plain,
( sQ30_spl
| ~ sQ5_spl
| ~ sQ0_spl ),
inference(contradiction_clause,[status(thm)],[f468]) ).
fof(f479,plain,
( sQ26_spl
| ~ sQ5_spl
| ~ sQ0_spl
| g(sK0_skl) != g(sK0_skl) ),
inference(forward_demodulation,[status(thm)],[f377,f445]) ).
fof(f480,plain,
( sQ26_spl
| ~ sQ5_spl
| ~ sQ0_spl
| $false ),
inference(trivial_equality_resolution,[status(thm)],[f479]) ).
fof(f481,plain,
( sQ26_spl
| ~ sQ5_spl
| ~ sQ0_spl ),
inference(contradiction_clause,[status(thm)],[f480]) ).
fof(f482,plain,
$false,
inference(sat_refutation,[status(thm)],[f25,f29,f36,f40,f46,f72,f84,f139,f266,f283,f287,f290,f320,f465,f469,f481]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN551+2 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n016.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 11:13:11 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.38 % Drodi V4.1.1
% 0.10/0.40 % Refutation found
% 0.10/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.43 % Elapsed time: 0.048584 seconds
% 0.10/0.43 % CPU time: 0.165988 seconds
% 0.10/0.43 % Total memory used: 39.159 MB
% 0.10/0.43 % Net memory used: 38.875 MB
%------------------------------------------------------------------------------