%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SET791+4 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n026.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:37 PM UTC 2026
% Result : Theorem 0.13s 0.41s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 62 ( 6 unt; 6 def)
% Number of atoms : 333 ( 28 equ)
% Maximal formula atoms : 16 ( 5 avg)
% Number of connectives : 437 ( 166 ~; 165 |; 83 &)
% ( 14 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 5 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 187 ( 168 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [R,E] :
( order(R,E)
<=> ( ! [X,Y,Z] :
( ( member(Z,E)
& member(Y,E)
& member(X,E) )
=> ( ( apply(R,Y,Z)
& apply(R,X,Y) )
=> apply(R,X,Z) ) )
& ! [X,Y] :
( ( member(Y,E)
& member(X,E) )
=> ( ( apply(R,Y,X)
& apply(R,X,Y) )
=> X = Y ) )
& ! [X] :
( member(X,E)
=> apply(R,X,X) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [R,E,M] :
( greatest(M,R,E)
<=> ( ! [X] :
( member(X,E)
=> apply(R,X,M) )
& member(M,E) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [R,E,M] :
( max(M,R,E)
<=> ( ! [X] :
( ( apply(R,M,X)
& member(X,E) )
=> M = X )
& member(M,E) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f11,conjecture,
! [R,E,M] :
( ( greatest(M,R,E)
& order(R,E) )
=> max(M,R,E) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,negated_conjecture,
~ ! [R,E,M] :
( ( greatest(M,R,E)
& order(R,E) )
=> max(M,R,E) ),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f13,plain,
! [R,E] :
( order(R,E)
<=> ( ! [X,Y,Z] :
( apply(R,X,Z)
| ~ apply(R,Y,Z)
| ~ apply(R,X,Y)
| ~ member(Z,E)
| ~ member(Y,E)
| ~ member(X,E) )
& ! [X,Y] :
( X = Y
| ~ apply(R,Y,X)
| ~ apply(R,X,Y)
| ~ member(Y,E)
| ~ member(X,E) )
& ! [X] :
( apply(R,X,X)
| ~ member(X,E) ) ) ),
inference(pre_NNF_transformation,[status(thm)],[f1]) ).
fof(f14,definition,
! [R,E] :
( sP0_prd(E,R)
<=> ( ! [X,Y] :
( X = Y
| ~ apply(R,Y,X)
| ~ apply(R,X,Y)
| ~ member(Y,E)
| ~ member(X,E) )
& ! [X] :
( apply(R,X,X)
| ~ member(X,E) ) ) ),
introduced(definition,[new_symbols(definition,[sP0_prd])],[]) ).
fof(f15,plain,
! [R,E] :
( order(R,E)
<=> ( ! [X,Y,Z] :
( apply(R,X,Z)
| ~ apply(R,Y,Z)
| ~ apply(R,X,Y)
| ~ member(Z,E)
| ~ member(Y,E)
| ~ member(X,E) )
& sP0_prd(E,R) ) ),
inference(formula_renaming,[status(thm)],[f13,f14]) ).
fof(f16,plain,
! [R,E] :
( ( ? [X,Y,Z] :
( ~ apply(R,X,Z)
& apply(R,Y,Z)
& apply(R,X,Y)
& member(Z,E)
& member(Y,E)
& member(X,E) )
| ~ sP0_prd(E,R)
| order(R,E) )
& ( ( ! [X,Y,Z] :
( apply(R,X,Z)
| ~ apply(R,Y,Z)
| ~ apply(R,X,Y)
| ~ member(Z,E)
| ~ member(Y,E)
| ~ member(X,E) )
& sP0_prd(E,R) )
| ~ order(R,E) ) ),
inference(NNF_transformation,[status(thm)],[f15]) ).
fof(f17,plain,
( ! [R,E] :
( ? [X,Y,Z] :
( ~ apply(R,X,Z)
& apply(R,Y,Z)
& apply(R,X,Y)
& member(Z,E)
& member(Y,E)
& member(X,E) )
| ~ sP0_prd(E,R)
| order(R,E) )
& ! [R,E] :
( ( ! [X,Y,Z] :
( apply(R,X,Z)
| ~ apply(R,Y,Z)
| ~ apply(R,X,Y)
| ~ member(Z,E)
| ~ member(Y,E)
| ~ member(X,E) )
& sP0_prd(E,R) )
| ~ order(R,E) ) ),
inference(miniscoping,[status(thm)],[f16]) ).
fof(f18,plain,
( ! [R,E] :
( ( ~ apply(R,sK0_skl(E,R),sK2_skl(E,R))
& apply(R,sK1_skl(E,R),sK2_skl(E,R))
& apply(R,sK0_skl(E,R),sK1_skl(E,R))
& member(sK2_skl(E,R),E)
& member(sK1_skl(E,R),E)
& member(sK0_skl(E,R),E) )
| ~ sP0_prd(E,R)
| order(R,E) )
& ! [R,E] :
( ( ! [X,Y,Z] :
( apply(R,X,Z)
| ~ apply(R,Y,Z)
| ~ apply(R,X,Y)
| ~ member(Z,E)
| ~ member(Y,E)
| ~ member(X,E) )
& sP0_prd(E,R) )
| ~ order(R,E) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl,sK2_skl]),skolemize(X,sK0_skl(E,R)),skolemize(Y,sK1_skl(E,R)),skolemize(Z,sK2_skl(E,R))],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( sP0_prd(X1,X0)
| ~ order(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f18]) ).
fof(f51,plain,
! [R,E,M] :
( greatest(M,R,E)
<=> ( ! [X] :
( apply(R,X,M)
| ~ member(X,E) )
& member(M,E) ) ),
inference(pre_NNF_transformation,[status(thm)],[f5]) ).
fof(f52,plain,
! [R,E,M] :
( ( ? [X] :
( ~ apply(R,X,M)
& member(X,E) )
| ~ member(M,E)
| greatest(M,R,E) )
& ( ( ! [X] :
( apply(R,X,M)
| ~ member(X,E) )
& member(M,E) )
| ~ greatest(M,R,E) ) ),
inference(NNF_transformation,[status(thm)],[f51]) ).
fof(f53,plain,
( ! [R,E,M] :
( ? [X] :
( ~ apply(R,X,M)
& member(X,E) )
| ~ member(M,E)
| greatest(M,R,E) )
& ! [R,E,M] :
( ( ! [X] :
( apply(R,X,M)
| ~ member(X,E) )
& member(M,E) )
| ~ greatest(M,R,E) ) ),
inference(miniscoping,[status(thm)],[f52]) ).
fof(f54,plain,
( ! [R,E,M] :
( ( ~ apply(R,sK7_skl(M,E,R),M)
& member(sK7_skl(M,E,R),E) )
| ~ member(M,E)
| greatest(M,R,E) )
& ! [R,E,M] :
( ( ! [X] :
( apply(R,X,M)
| ~ member(X,E) )
& member(M,E) )
| ~ greatest(M,R,E) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7_skl]),skolemize(X,sK7_skl(M,E,R))],[f53]) ).
fof(f55,plain,
! [X0,X1,X2] :
( member(X0,X2)
| ~ greatest(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f54]) ).
fof(f56,plain,
! [X0,X1,X2,X3] :
( apply(X1,X3,X0)
| ~ member(X3,X2)
| ~ greatest(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f54]) ).
fof(f67,plain,
! [R,E,M] :
( max(M,R,E)
<=> ( ! [X] :
( M = X
| ~ apply(R,M,X)
| ~ member(X,E) )
& member(M,E) ) ),
inference(pre_NNF_transformation,[status(thm)],[f7]) ).
fof(f68,plain,
! [R,E,M] :
( ( ? [X] :
( M != X
& apply(R,M,X)
& member(X,E) )
| ~ member(M,E)
| max(M,R,E) )
& ( ( ! [X] :
( M = X
| ~ apply(R,M,X)
| ~ member(X,E) )
& member(M,E) )
| ~ max(M,R,E) ) ),
inference(NNF_transformation,[status(thm)],[f67]) ).
fof(f69,plain,
( ! [R,E,M] :
( ? [X] :
( M != X
& apply(R,M,X)
& member(X,E) )
| ~ member(M,E)
| max(M,R,E) )
& ! [R,E,M] :
( ( ! [X] :
( M = X
| ~ apply(R,M,X)
| ~ member(X,E) )
& member(M,E) )
| ~ max(M,R,E) ) ),
inference(miniscoping,[status(thm)],[f68]) ).
fof(f70,plain,
( ! [R,E,M] :
( ( M != sK9_skl(M,E,R)
& apply(R,M,sK9_skl(M,E,R))
& member(sK9_skl(M,E,R),E) )
| ~ member(M,E)
| max(M,R,E) )
& ! [R,E,M] :
( ( ! [X] :
( M = X
| ~ apply(R,M,X)
| ~ member(X,E) )
& member(M,E) )
| ~ max(M,R,E) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9_skl]),skolemize(X,sK9_skl(M,E,R))],[f69]) ).
fof(f73,plain,
! [X0,X1,X2] :
( member(sK9_skl(X0,X2,X1),X2)
| ~ member(X0,X2)
| max(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f70]) ).
fof(f74,plain,
! [X0,X1,X2] :
( apply(X1,X0,sK9_skl(X0,X2,X1))
| ~ member(X0,X2)
| max(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f70]) ).
fof(f75,plain,
! [X0,X1,X2] :
( X0 != sK9_skl(X0,X2,X1)
| ~ member(X0,X2)
| max(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f70]) ).
fof(f105,plain,
? [R,E,M] :
( ~ max(M,R,E)
& greatest(M,R,E)
& order(R,E) ),
inference(pre_NNF_transformation,[status(thm)],[f12]) ).
fof(f106,plain,
( ~ max(sK15_skl,sK13_skl,sK14_skl)
& greatest(sK15_skl,sK13_skl,sK14_skl)
& order(sK13_skl,sK14_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13_skl,sK14_skl,sK15_skl]),skolemize(R,sK13_skl),skolemize(E,sK14_skl),skolemize(M,sK15_skl)],[f105]) ).
fof(f107,plain,
order(sK13_skl,sK14_skl),
inference(cnf_transformation,[status(thm)],[f106]) ).
fof(f108,plain,
greatest(sK15_skl,sK13_skl,sK14_skl),
inference(cnf_transformation,[status(thm)],[f106]) ).
fof(f109,plain,
~ max(sK15_skl,sK13_skl,sK14_skl),
inference(cnf_transformation,[status(thm)],[f106]) ).
fof(f110,definition,
! [R,E,X] :
( sP1_prd(X,E,R)
<=> ( apply(R,X,X)
| ~ member(X,E) ) ),
introduced(definition,[new_symbols(definition,[sP1_prd])],[]) ).
fof(f111,plain,
! [R,E] :
( sP0_prd(E,R)
<=> ( ! [X,Y] :
( X = Y
| ~ apply(R,Y,X)
| ~ apply(R,X,Y)
| ~ member(Y,E)
| ~ member(X,E) )
& ! [X] : sP1_prd(X,E,R) ) ),
inference(formula_renaming,[status(thm)],[f14,f110]) ).
fof(f112,plain,
! [R,E] :
( ( ? [X,Y] :
( X != Y
& apply(R,Y,X)
& apply(R,X,Y)
& member(Y,E)
& member(X,E) )
| ? [X] : ~ sP1_prd(X,E,R)
| sP0_prd(E,R) )
& ( ( ! [X,Y] :
( X = Y
| ~ apply(R,Y,X)
| ~ apply(R,X,Y)
| ~ member(Y,E)
| ~ member(X,E) )
& ! [X] : sP1_prd(X,E,R) )
| ~ sP0_prd(E,R) ) ),
inference(NNF_transformation,[status(thm)],[f111]) ).
fof(f113,plain,
( ! [R,E] :
( ? [X,Y] :
( X != Y
& apply(R,Y,X)
& apply(R,X,Y)
& member(Y,E)
& member(X,E) )
| ? [X] : ~ sP1_prd(X,E,R)
| sP0_prd(E,R) )
& ! [R,E] :
( ( ! [X,Y] :
( X = Y
| ~ apply(R,Y,X)
| ~ apply(R,X,Y)
| ~ member(Y,E)
| ~ member(X,E) )
& ! [X] : sP1_prd(X,E,R) )
| ~ sP0_prd(E,R) ) ),
inference(miniscoping,[status(thm)],[f112]) ).
fof(f114,plain,
( ! [R,E] :
( ( sK17_skl(E,R) != sK18_skl(E,R)
& apply(R,sK18_skl(E,R),sK17_skl(E,R))
& apply(R,sK17_skl(E,R),sK18_skl(E,R))
& member(sK18_skl(E,R),E)
& member(sK17_skl(E,R),E) )
| ~ sP1_prd(sK16_skl(E,R),E,R)
| sP0_prd(E,R) )
& ! [R,E] :
( ( ! [X,Y] :
( X = Y
| ~ apply(R,Y,X)
| ~ apply(R,X,Y)
| ~ member(Y,E)
| ~ member(X,E) )
& ! [X] : sP1_prd(X,E,R) )
| ~ sP0_prd(E,R) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK16_skl,sK17_skl,sK18_skl]),skolemize(X,sK16_skl(E,R)),skolemize(X,sK17_skl(E,R)),skolemize(Y,sK18_skl(E,R))],[f113]) ).
fof(f116,plain,
! [X0,X1,X2,X3] :
( X2 = X3
| ~ apply(X1,X3,X2)
| ~ apply(X1,X2,X3)
| ~ member(X3,X0)
| ~ member(X2,X0)
| ~ sP0_prd(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f114]) ).
fof(f129,definition,
( sQ0_spl
<=> member(sK15_skl,sK14_skl) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f131,plain,
( sQ0_spl
| ~ member(sK15_skl,sK14_skl) ),
inference(component_clause,[status(thm)],[f129]) ).
fof(f142,plain,
! [X0] :
( sQ0_spl
| ~ greatest(sK15_skl,X0,sK14_skl) ),
inference(resolution,[status(thm)],[f131,f55]) ).
fof(f148,plain,
( sQ0_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f108,f142]) ).
fof(f149,plain,
sQ0_spl,
inference(contradiction_clause,[status(thm)],[f148]) ).
fof(f274,definition,
( sQ5_spl
<=> member(sK9_skl(sK15_skl,sK14_skl,sK13_skl),sK14_skl) ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f276,plain,
( sQ5_spl
| ~ member(sK9_skl(sK15_skl,sK14_skl,sK13_skl),sK14_skl) ),
inference(component_clause,[status(thm)],[f274]) ).
fof(f296,plain,
! [X0,X1,X2,X3] :
( ~ order(X3,X1)
| X0 = X2
| ~ apply(X3,X2,X0)
| ~ apply(X3,X0,X2)
| ~ member(X2,X1)
| ~ member(X0,X1) ),
inference(resolution,[status(thm)],[f116,f19]) ).
fof(f297,plain,
! [X0,X1] :
( X0 = X1
| ~ apply(sK13_skl,X1,X0)
| ~ apply(sK13_skl,X0,X1)
| ~ member(X1,sK14_skl)
| ~ member(X0,sK14_skl) ),
inference(resolution,[status(thm)],[f296,f107]) ).
fof(f310,plain,
! [X0,X1,X2] :
( ~ member(X1,X2)
| ~ greatest(X0,sK13_skl,X2)
| X0 = X1
| ~ apply(sK13_skl,X0,X1)
| ~ member(X1,sK14_skl)
| ~ member(X0,sK14_skl) ),
inference(resolution,[status(thm)],[f297,f56]) ).
fof(f598,plain,
! [X0] :
( ~ member(X0,sK14_skl)
| sK15_skl = X0
| ~ apply(sK13_skl,sK15_skl,X0)
| ~ member(X0,sK14_skl)
| ~ member(sK15_skl,sK14_skl) ),
inference(resolution,[status(thm)],[f310,f108]) ).
fof(f600,definition,
! [X0] :
( sQ13_spl
<=> ( ~ member(X0,sK14_skl)
| sK15_skl = X0
| ~ apply(sK13_skl,sK15_skl,X0)
| ~ member(X0,sK14_skl) ) ),
introduced(definition,[new_symbols(definition,[sQ13_spl])],[split_symbol_definition]) ).
fof(f601,plain,
! [X0] :
( ~ sQ13_spl
| ~ member(X0,sK14_skl)
| sK15_skl = X0
| ~ apply(sK13_skl,sK15_skl,X0)
| ~ member(X0,sK14_skl) ),
inference(component_clause,[status(thm)],[f600]) ).
fof(f603,plain,
( sQ13_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f598,f129,f600]) ).
fof(f604,plain,
! [X0] :
( ~ sQ13_spl
| sK15_skl = X0
| ~ apply(sK13_skl,sK15_skl,X0)
| ~ member(X0,sK14_skl) ),
inference(duplicate_literals_removal,[status(thm)],[f601]) ).
fof(f605,plain,
! [X0] :
( ~ sQ13_spl
| ~ member(sK15_skl,X0)
| max(sK15_skl,sK13_skl,X0)
| sK15_skl = sK9_skl(sK15_skl,X0,sK13_skl)
| ~ member(sK9_skl(sK15_skl,X0,sK13_skl),sK14_skl) ),
inference(resolution,[status(thm)],[f604,f74]) ).
fof(f611,plain,
! [X0] :
( ~ sQ13_spl
| ~ member(sK15_skl,X0)
| max(sK15_skl,sK13_skl,X0)
| ~ member(sK9_skl(sK15_skl,X0,sK13_skl),sK14_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f605,f75]) ).
fof(f629,plain,
( ~ sQ13_spl
| ~ member(sK15_skl,sK14_skl)
| ~ member(sK9_skl(sK15_skl,sK14_skl,sK13_skl),sK14_skl) ),
inference(resolution,[status(thm)],[f611,f109]) ).
fof(f635,plain,
( ~ sQ13_spl
| ~ sQ0_spl
| ~ sQ5_spl ),
inference(split_clause,[status(thm)],[f629,f274,f129,f600]) ).
fof(f637,plain,
( sQ5_spl
| ~ member(sK15_skl,sK14_skl)
| max(sK15_skl,sK13_skl,sK14_skl) ),
inference(resolution,[status(thm)],[f276,f73]) ).
fof(f645,definition,
( sQ15_spl
<=> max(sK15_skl,sK13_skl,sK14_skl) ),
introduced(definition,[new_symbols(definition,[sQ15_spl])],[split_symbol_definition]) ).
fof(f646,plain,
( ~ sQ15_spl
| max(sK15_skl,sK13_skl,sK14_skl) ),
inference(component_clause,[status(thm)],[f645]) ).
fof(f648,plain,
( sQ5_spl
| ~ sQ0_spl
| sQ15_spl ),
inference(split_clause,[status(thm)],[f637,f645,f129,f274]) ).
fof(f649,plain,
( ~ sQ15_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f646,f109]) ).
fof(f650,plain,
~ sQ15_spl,
inference(contradiction_clause,[status(thm)],[f649]) ).
fof(f651,plain,
$false,
inference(sat_refutation,[status(thm)],[f149,f603,f635,f648,f650]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET791+4 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.34 % Computer : n026.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:41:06 UTC 2026
% 0.09/0.34 % CPUTime :
% 0.09/0.35 % Drodi V4.1.1
% 0.13/0.41 % Refutation found
% 0.13/0.41 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.45 % Elapsed time: 0.095399 seconds
% 0.13/0.45 % CPU time: 0.447785 seconds
% 0.13/0.45 % Total memory used: 86.542 MB
% 0.13/0.45 % Net memory used: 85.790 MB
%------------------------------------------------------------------------------