%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : GRA003+1 : TPTP v9.3.1. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n008.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 12:30:38 PM UTC 2026
% Result : Theorem 0.11s 0.41s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of formulae : 91 ( 14 unt; 11 def)
% Number of atoms : 335 ( 50 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 381 ( 137 ~; 124 |; 94 &)
% ( 13 <=>; 8 =>; 0 <=; 5 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 22 ( 20 usr; 11 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 186 ( 166 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [V1,V2,P] :
( path(V1,V2,P)
=> ( ? [E] :
( ( ( P = path_cons(E,empty)
& V2 = head_of(E) )
<~> ? [TP] :
( P = path_cons(E,TP)
& path(head_of(E),V2,TP) ) )
& V1 = tail_of(E)
& edge(E) )
& vertex(V2)
& vertex(V1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [V1,V2,P,E] :
( ( on_path(E,P)
& path(V1,V2,P) )
=> ( in_path(tail_of(E),P)
& in_path(head_of(E),P)
& edge(E) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [P,V1,V2] :
( path(V1,V2,P)
=> ! [E1,E2] :
( precedes(E1,E2,P)
=> ( ( sequential(E1,E2)
<~> ? [E3] :
( precedes(E3,E2,P)
& sequential(E1,E3) ) )
& on_path(E2,P)
& on_path(E1,P) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [V1,V2,SP] :
( shortest_path(V1,V2,SP)
<=> ( ! [P] :
( path(V1,V2,P)
=> less_or_equal(length_of(SP),length_of(P)) )
& V1 != V2
& path(V1,V2,SP) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,axiom,
! [V1,V2,E1,E2,P] :
( ( precedes(E1,E2,P)
& shortest_path(V1,V2,P) )
=> ( ~ precedes(E2,E1,P)
& ~ ? [E3] :
( head_of(E3) = head_of(E2)
& tail_of(E3) = tail_of(E1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f18,conjecture,
! [V1,V2,E1,E2,P] :
( ( precedes(E1,E2,P)
& shortest_path(V1,V2,P) )
=> ( path(V1,V2,P)
& E1 != E2
& edge(E2)
& edge(E1)
& V1 != V2
& vertex(V2)
& vertex(V1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f19,negated_conjecture,
~ ! [V1,V2,E1,E2,P] :
( ( precedes(E1,E2,P)
& shortest_path(V1,V2,P) )
=> ( path(V1,V2,P)
& E1 != E2
& edge(E2)
& edge(E1)
& V1 != V2
& vertex(V2)
& vertex(V1) ) ),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f37,plain,
! [V1,V2,P] :
( ( ? [E] :
( ( ( P = path_cons(E,empty)
& V2 = head_of(E) )
<~> ? [TP] :
( P = path_cons(E,TP)
& path(head_of(E),V2,TP) ) )
& V1 = tail_of(E)
& edge(E) )
& vertex(V2)
& vertex(V1) )
| ~ path(V1,V2,P) ),
inference(pre_NNF_transformation,[status(thm)],[f5]) ).
fof(f38,definition,
! [V2,P,E] :
( sP1_prd(E,P,V2)
<=> ( P = path_cons(E,empty)
& V2 = head_of(E) ) ),
introduced(definition,[new_symbols(definition,[sP1_prd])],[]) ).
fof(f39,plain,
! [V1,V2,P] :
( ( ? [E] :
( ( sP1_prd(E,P,V2)
<~> ? [TP] :
( P = path_cons(E,TP)
& path(head_of(E),V2,TP) ) )
& V1 = tail_of(E)
& edge(E) )
& vertex(V2)
& vertex(V1) )
| ~ path(V1,V2,P) ),
inference(formula_renaming,[status(thm)],[f37,f38]) ).
fof(f40,plain,
! [V1,V2,P] :
( ( ? [E] :
( ( ! [TP] :
( P != path_cons(E,TP)
| ~ path(head_of(E),V2,TP) )
| ~ sP1_prd(E,P,V2) )
& ( ? [TP] :
( P = path_cons(E,TP)
& path(head_of(E),V2,TP) )
| sP1_prd(E,P,V2) )
& V1 = tail_of(E)
& edge(E) )
& vertex(V2)
& vertex(V1) )
| ~ path(V1,V2,P) ),
inference(NNF_transformation,[status(thm)],[f39]) ).
fof(f41,plain,
! [V1,V2,P] :
( ( ( ! [TP] :
( P != path_cons(sK1_skl(P,V2,V1),TP)
| ~ path(head_of(sK1_skl(P,V2,V1)),V2,TP) )
| ~ sP1_prd(sK1_skl(P,V2,V1),P,V2) )
& ( ( P = path_cons(sK1_skl(P,V2,V1),sK2_skl(P,V2,V1))
& path(head_of(sK1_skl(P,V2,V1)),V2,sK2_skl(P,V2,V1)) )
| sP1_prd(sK1_skl(P,V2,V1),P,V2) )
& V1 = tail_of(sK1_skl(P,V2,V1))
& edge(sK1_skl(P,V2,V1))
& vertex(V2)
& vertex(V1) )
| ~ path(V1,V2,P) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1_skl,sK2_skl]),skolemize(E,sK1_skl(P,V2,V1)),skolemize(TP,sK2_skl(P,V2,V1))],[f40]) ).
fof(f42,plain,
! [X0,X1,X2] :
( vertex(X0)
| ~ path(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f41]) ).
fof(f43,plain,
! [X0,X1,X2] :
( vertex(X1)
| ~ path(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f41]) ).
fof(f49,plain,
! [V1,V2,P,E] :
( ( in_path(tail_of(E),P)
& in_path(head_of(E),P)
& edge(E) )
| ~ on_path(E,P)
| ~ path(V1,V2,P) ),
inference(pre_NNF_transformation,[status(thm)],[f6]) ).
fof(f50,plain,
! [P,E] :
( ( in_path(tail_of(E),P)
& in_path(head_of(E),P)
& edge(E) )
| ~ on_path(E,P)
| ! [V1,V2] : ~ path(V1,V2,P) ),
inference(miniscoping,[status(thm)],[f49]) ).
fof(f51,plain,
! [X0,X1,X2,X3] :
( edge(X3)
| ~ on_path(X3,X2)
| ~ path(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f50]) ).
fof(f71,plain,
! [P,V1,V2] :
( ! [E1,E2] :
( ( ( sequential(E1,E2)
<~> ? [E3] :
( precedes(E3,E2,P)
& sequential(E1,E3) ) )
& on_path(E2,P)
& on_path(E1,P) )
| ~ precedes(E1,E2,P) )
| ~ path(V1,V2,P) ),
inference(pre_NNF_transformation,[status(thm)],[f10]) ).
fof(f72,plain,
! [P,V1,V2] :
( ! [E1,E2] :
( ( ( ! [E3] :
( ~ precedes(E3,E2,P)
| ~ sequential(E1,E3) )
| ~ sequential(E1,E2) )
& ( ? [E3] :
( precedes(E3,E2,P)
& sequential(E1,E3) )
| sequential(E1,E2) )
& on_path(E2,P)
& on_path(E1,P) )
| ~ precedes(E1,E2,P) )
| ~ path(V1,V2,P) ),
inference(NNF_transformation,[status(thm)],[f71]) ).
fof(f73,plain,
! [P] :
( ! [E1,E2] :
( ( ( ! [E3] :
( ~ precedes(E3,E2,P)
| ~ sequential(E1,E3) )
| ~ sequential(E1,E2) )
& ( ? [E3] :
( precedes(E3,E2,P)
& sequential(E1,E3) )
| sequential(E1,E2) )
& on_path(E2,P)
& on_path(E1,P) )
| ~ precedes(E1,E2,P) )
| ! [V1,V2] : ~ path(V1,V2,P) ),
inference(miniscoping,[status(thm)],[f72]) ).
fof(f74,plain,
! [P] :
( ! [E1,E2] :
( ( ( ! [E3] :
( ~ precedes(E3,E2,P)
| ~ sequential(E1,E3) )
| ~ sequential(E1,E2) )
& ( ( precedes(sK4_skl(E2,E1,P),E2,P)
& sequential(E1,sK4_skl(E2,E1,P)) )
| sequential(E1,E2) )
& on_path(E2,P)
& on_path(E1,P) )
| ~ precedes(E1,E2,P) )
| ! [V1,V2] : ~ path(V1,V2,P) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4_skl]),skolemize(E3,sK4_skl(E2,E1,P))],[f73]) ).
fof(f75,plain,
! [X0,X1,X2,X3,X4] :
( on_path(X3,X2)
| ~ precedes(X3,X4,X2)
| ~ path(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f74]) ).
fof(f76,plain,
! [X0,X1,X2,X3,X4] :
( on_path(X4,X2)
| ~ precedes(X3,X4,X2)
| ~ path(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f74]) ).
fof(f80,plain,
! [V1,V2,SP] :
( shortest_path(V1,V2,SP)
<=> ( ! [P] :
( less_or_equal(length_of(SP),length_of(P))
| ~ path(V1,V2,P) )
& V1 != V2
& path(V1,V2,SP) ) ),
inference(pre_NNF_transformation,[status(thm)],[f11]) ).
fof(f81,plain,
! [V1,V2,SP] :
( ( ? [P] :
( ~ less_or_equal(length_of(SP),length_of(P))
& path(V1,V2,P) )
| V1 = V2
| ~ path(V1,V2,SP)
| shortest_path(V1,V2,SP) )
& ( ( ! [P] :
( less_or_equal(length_of(SP),length_of(P))
| ~ path(V1,V2,P) )
& V1 != V2
& path(V1,V2,SP) )
| ~ shortest_path(V1,V2,SP) ) ),
inference(NNF_transformation,[status(thm)],[f80]) ).
fof(f82,plain,
( ! [V1,V2,SP] :
( ? [P] :
( ~ less_or_equal(length_of(SP),length_of(P))
& path(V1,V2,P) )
| V1 = V2
| ~ path(V1,V2,SP)
| shortest_path(V1,V2,SP) )
& ! [V1,V2,SP] :
( ( ! [P] :
( less_or_equal(length_of(SP),length_of(P))
| ~ path(V1,V2,P) )
& V1 != V2
& path(V1,V2,SP) )
| ~ shortest_path(V1,V2,SP) ) ),
inference(miniscoping,[status(thm)],[f81]) ).
fof(f83,plain,
( ! [V1,V2,SP] :
( ( ~ less_or_equal(length_of(SP),length_of(sK5_skl(SP,V2,V1)))
& path(V1,V2,sK5_skl(SP,V2,V1)) )
| V1 = V2
| ~ path(V1,V2,SP)
| shortest_path(V1,V2,SP) )
& ! [V1,V2,SP] :
( ( ! [P] :
( less_or_equal(length_of(SP),length_of(P))
| ~ path(V1,V2,P) )
& V1 != V2
& path(V1,V2,SP) )
| ~ shortest_path(V1,V2,SP) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5_skl]),skolemize(P,sK5_skl(SP,V2,V1))],[f82]) ).
fof(f84,plain,
! [X0,X1,X2] :
( path(X0,X1,X2)
| ~ shortest_path(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f83]) ).
fof(f85,plain,
! [X0,X1,X2] :
( X0 != X1
| ~ shortest_path(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f83]) ).
fof(f89,plain,
! [V1,V2,E1,E2,P] :
( ( ~ precedes(E2,E1,P)
& ! [E3] :
( head_of(E3) != head_of(E2)
| tail_of(E3) != tail_of(E1) ) )
| ~ precedes(E1,E2,P)
| ~ shortest_path(V1,V2,P) ),
inference(pre_NNF_transformation,[status(thm)],[f12]) ).
fof(f90,plain,
! [E1,E2,P] :
( ( ~ precedes(E2,E1,P)
& ! [E3] :
( head_of(E3) != head_of(E2)
| tail_of(E3) != tail_of(E1) ) )
| ~ precedes(E1,E2,P)
| ! [V1,V2] : ~ shortest_path(V1,V2,P) ),
inference(miniscoping,[status(thm)],[f89]) ).
fof(f91,plain,
! [X0,X1,X2,X3,X4,X5] :
( head_of(X5) != head_of(X4)
| tail_of(X5) != tail_of(X3)
| ~ precedes(X3,X4,X2)
| ~ shortest_path(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f90]) ).
fof(f116,plain,
? [V1,V2,E1,E2,P] :
( ( ~ path(V1,V2,P)
| E1 = E2
| ~ edge(E2)
| ~ edge(E1)
| V1 = V2
| ~ vertex(V2)
| ~ vertex(V1) )
& precedes(E1,E2,P)
& shortest_path(V1,V2,P) ),
inference(pre_NNF_transformation,[status(thm)],[f19]) ).
fof(f117,plain,
( ( ~ path(sK8_skl,sK9_skl,sK12_skl)
| sK10_skl = sK11_skl
| ~ edge(sK11_skl)
| ~ edge(sK10_skl)
| sK8_skl = sK9_skl
| ~ vertex(sK9_skl)
| ~ vertex(sK8_skl) )
& precedes(sK10_skl,sK11_skl,sK12_skl)
& shortest_path(sK8_skl,sK9_skl,sK12_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8_skl,sK9_skl,sK10_skl,sK11_skl,sK12_skl]),skolemize(V1,sK8_skl),skolemize(V2,sK9_skl),skolemize(E1,sK10_skl),skolemize(E2,sK11_skl),skolemize(P,sK12_skl)],[f116]) ).
fof(f118,plain,
shortest_path(sK8_skl,sK9_skl,sK12_skl),
inference(cnf_transformation,[status(thm)],[f117]) ).
fof(f119,plain,
precedes(sK10_skl,sK11_skl,sK12_skl),
inference(cnf_transformation,[status(thm)],[f117]) ).
fof(f120,plain,
( ~ path(sK8_skl,sK9_skl,sK12_skl)
| sK10_skl = sK11_skl
| ~ edge(sK11_skl)
| ~ edge(sK10_skl)
| sK8_skl = sK9_skl
| ~ vertex(sK9_skl)
| ~ vertex(sK8_skl) ),
inference(cnf_transformation,[status(thm)],[f117]) ).
fof(f150,definition,
( sQ5_spl
<=> vertex(sK8_skl) ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f152,plain,
( sQ5_spl
| ~ vertex(sK8_skl) ),
inference(component_clause,[status(thm)],[f150]) ).
fof(f153,definition,
( sQ6_spl
<=> vertex(sK9_skl) ),
introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).
fof(f155,plain,
( sQ6_spl
| ~ vertex(sK9_skl) ),
inference(component_clause,[status(thm)],[f153]) ).
fof(f156,definition,
( sQ7_spl
<=> sK8_skl = sK9_skl ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f157,plain,
( ~ sQ7_spl
| sK8_skl = sK9_skl ),
inference(component_clause,[status(thm)],[f156]) ).
fof(f159,definition,
( sQ8_spl
<=> edge(sK10_skl) ),
introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).
fof(f161,plain,
( sQ8_spl
| ~ edge(sK10_skl) ),
inference(component_clause,[status(thm)],[f159]) ).
fof(f162,definition,
( sQ9_spl
<=> edge(sK11_skl) ),
introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition]) ).
fof(f164,plain,
( sQ9_spl
| ~ edge(sK11_skl) ),
inference(component_clause,[status(thm)],[f162]) ).
fof(f165,definition,
( sQ10_spl
<=> sK10_skl = sK11_skl ),
introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).
fof(f166,plain,
( ~ sQ10_spl
| sK10_skl = sK11_skl ),
inference(component_clause,[status(thm)],[f165]) ).
fof(f168,definition,
( sQ11_spl
<=> path(sK8_skl,sK9_skl,sK12_skl) ),
introduced(definition,[new_symbols(definition,[sQ11_spl])],[split_symbol_definition]) ).
fof(f170,plain,
( sQ11_spl
| ~ path(sK8_skl,sK9_skl,sK12_skl) ),
inference(component_clause,[status(thm)],[f168]) ).
fof(f171,plain,
( ~ sQ11_spl
| sQ10_spl
| ~ sQ9_spl
| ~ sQ8_spl
| sQ7_spl
| ~ sQ6_spl
| ~ sQ5_spl ),
inference(split_clause,[status(thm)],[f120,f150,f153,f156,f159,f162,f165,f168]) ).
fof(f175,plain,
! [X0,X1] : ~ shortest_path(X0,X0,X1),
inference(destructive_equality_resolution,[status(thm)],[f85]) ).
fof(f182,definition,
! [X0,X1] :
( sQ12_spl
<=> ~ path(X0,X1,sK12_skl) ),
introduced(definition,[new_symbols(definition,[sQ12_spl])],[split_symbol_definition]) ).
fof(f183,plain,
! [X0,X1] :
( ~ sQ12_spl
| ~ path(X0,X1,sK12_skl) ),
inference(component_clause,[status(thm)],[f182]) ).
fof(f200,plain,
path(sK8_skl,sK9_skl,sK12_skl),
inference(resolution,[status(thm)],[f84,f118]) ).
fof(f201,plain,
( ~ sQ12_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f200,f183]) ).
fof(f202,plain,
~ sQ12_spl,
inference(contradiction_clause,[status(thm)],[f201]) ).
fof(f203,plain,
vertex(sK9_skl),
inference(resolution,[status(thm)],[f200,f43]) ).
fof(f204,plain,
vertex(sK8_skl),
inference(resolution,[status(thm)],[f200,f42]) ).
fof(f205,plain,
( sQ11_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f170,f200]) ).
fof(f206,plain,
sQ11_spl,
inference(contradiction_clause,[status(thm)],[f205]) ).
fof(f208,plain,
( ~ sQ10_spl
| precedes(sK10_skl,sK10_skl,sK12_skl) ),
inference(backward_demodulation,[status(thm)],[f166,f119]) ).
fof(f224,plain,
! [X0,X1,X2,X3,X4] :
( head_of(X3) != head_of(X4)
| ~ precedes(X3,X4,X2)
| ~ shortest_path(X0,X1,X2) ),
inference(equality_resolution,[status(thm)],[f91]) ).
fof(f246,plain,
! [X0,X1,X2,X3] :
( ~ precedes(X3,X3,X2)
| ~ shortest_path(X0,X1,X2) ),
inference(equality_resolution,[status(thm)],[f224]) ).
fof(f247,plain,
! [X0] : ~ precedes(X0,X0,sK12_skl),
inference(resolution,[status(thm)],[f246,f118]) ).
fof(f253,plain,
! [X0] :
( edge(X0)
| ~ on_path(X0,sK12_skl) ),
inference(resolution,[status(thm)],[f51,f200]) ).
fof(f264,plain,
! [X0,X1] :
( on_path(sK10_skl,sK12_skl)
| ~ path(X0,X1,sK12_skl) ),
inference(resolution,[status(thm)],[f75,f119]) ).
fof(f265,definition,
( sQ19_spl
<=> on_path(sK10_skl,sK12_skl) ),
introduced(definition,[new_symbols(definition,[sQ19_spl])],[split_symbol_definition]) ).
fof(f266,plain,
( ~ sQ19_spl
| on_path(sK10_skl,sK12_skl) ),
inference(component_clause,[status(thm)],[f265]) ).
fof(f268,plain,
( sQ19_spl
| sQ12_spl ),
inference(split_clause,[status(thm)],[f264,f182,f265]) ).
fof(f269,plain,
( ~ sQ19_spl
| edge(sK10_skl) ),
inference(resolution,[status(thm)],[f266,f253]) ).
fof(f270,plain,
! [X0,X1] :
( on_path(sK11_skl,sK12_skl)
| ~ path(X0,X1,sK12_skl) ),
inference(resolution,[status(thm)],[f76,f119]) ).
fof(f271,definition,
( sQ20_spl
<=> on_path(sK11_skl,sK12_skl) ),
introduced(definition,[new_symbols(definition,[sQ20_spl])],[split_symbol_definition]) ).
fof(f272,plain,
( ~ sQ20_spl
| on_path(sK11_skl,sK12_skl) ),
inference(component_clause,[status(thm)],[f271]) ).
fof(f274,plain,
( sQ20_spl
| sQ12_spl ),
inference(split_clause,[status(thm)],[f270,f182,f271]) ).
fof(f275,plain,
( ~ sQ20_spl
| edge(sK11_skl) ),
inference(resolution,[status(thm)],[f272,f253]) ).
fof(f276,plain,
( ~ sQ20_spl
| sQ9_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f275,f164]) ).
fof(f277,plain,
( ~ sQ20_spl
| sQ9_spl ),
inference(contradiction_clause,[status(thm)],[f276]) ).
fof(f278,plain,
( sQ8_spl
| ~ sQ19_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f161,f269]) ).
fof(f279,plain,
( sQ8_spl
| ~ sQ19_spl ),
inference(contradiction_clause,[status(thm)],[f278]) ).
fof(f282,plain,
( ~ sQ7_spl
| shortest_path(sK8_skl,sK8_skl,sK12_skl) ),
inference(backward_demodulation,[status(thm)],[f157,f118]) ).
fof(f283,plain,
( ~ sQ7_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f282,f175]) ).
fof(f284,plain,
~ sQ7_spl,
inference(contradiction_clause,[status(thm)],[f283]) ).
fof(f285,plain,
( sQ6_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f203,f155]) ).
fof(f286,plain,
sQ6_spl,
inference(contradiction_clause,[status(thm)],[f285]) ).
fof(f287,plain,
( sQ5_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f152,f204]) ).
fof(f288,plain,
sQ5_spl,
inference(contradiction_clause,[status(thm)],[f287]) ).
fof(f289,plain,
( ~ sQ10_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f208,f247]) ).
fof(f290,plain,
~ sQ10_spl,
inference(contradiction_clause,[status(thm)],[f289]) ).
fof(f291,plain,
$false,
inference(sat_refutation,[status(thm)],[f171,f202,f206,f268,f274,f277,f279,f284,f286,f288,f290]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRA003+1 : TPTP v9.3.1. Bugfixed v3.2.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.37 % Computer : n008.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 18:18:54 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.38 % Drodi V4.1.1
% 0.11/0.41 % Refutation found
% 0.11/0.41 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.45 % Elapsed time: 0.057544 seconds
% 0.11/0.45 % CPU time: 0.164712 seconds
% 0.11/0.45 % Total memory used: 82.840 MB
% 0.11/0.45 % Net memory used: 82.747 MB
%------------------------------------------------------------------------------