%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRA008+2 : TPTP v9.3.1. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n004.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 : Fri Sep 25 01:23:35 PM UTC 2026
% Result : Theorem 4.08s 1.42s
% Output : CNFRefutation 4.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 5
% Syntax : Number of formulae : 90 ( 21 unt; 0 def)
% Number of atoms : 294 ( 81 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 359 ( 155 ~; 148 |; 46 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 2 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 192 ( 0 sgn 177 !; 15 ?; 96 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( edge(X0)
=> head_of(X0) != tail_of(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',no_loops) ).
fof(f8,axiom,
! [X0,X1] :
( sequential(X0,X1)
<=> ( head_of(X0) = tail_of(X1)
& X0 != X1
& edge(X1)
& edge(X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',sequential_defn) ).
fof(f13,axiom,
! [X0,X1,X2] :
( triangle(X0,X1,X2)
<=> ( sequential(X2,X0)
& sequential(X1,X2)
& sequential(X0,X1)
& edge(X2)
& edge(X1)
& edge(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',triangle_defn) ).
fof(f18,axiom,
( complete
=> ! [X0,X1,X2,X3,X4] :
( ( precedes(X2,X3,X4)
& shortest_path(X0,X1,X4) )
=> ? [X5] :
( head_of(X5) = tail_of(X2)
& tail_of(X5) = head_of(X3)
& edge(X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',back_edge) ).
fof(f19,conjecture,
( complete
=> ! [X0,X1,X2,X3,X4] :
( ( sequential(X2,X3)
& precedes(X2,X3,X4)
& shortest_path(X0,X1,X4) )
=> ? [X5] : triangle(X2,X3,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_is_triangle) ).
fof(f20,negated_conjecture,
~ ( complete
=> ! [X0,X1,X2,X3,X4] :
( ( sequential(X2,X3)
& precedes(X2,X3,X4)
& shortest_path(X0,X1,X4) )
=> ? [X5] : triangle(X2,X3,X5) ) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( sequential(X2,X0)
& sequential(X1,X2)
& sequential(X0,X1)
& edge(X2)
& edge(X1)
& edge(X0) )
=> triangle(X0,X1,X2) ),
inference(unused_predicate_definition_removal,[],[f13]) ).
fof(f24,plain,
( ~ complete
| ! [X0,X1,X2,X3,X4] :
( ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4)
| ? [X5] :
( head_of(X5) = tail_of(X2)
& tail_of(X5) = head_of(X3)
& edge(X5) ) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f25,plain,
( ~ complete
| ! [X0,X1,X2,X3,X4] :
( ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4)
| ? [X5] :
( head_of(X5) = tail_of(X2)
& tail_of(X5) = head_of(X3)
& edge(X5) ) ) ),
inference(flattening,[],[f24]) ).
fof(f26,plain,
( complete
& ? [X0,X1,X2,X3,X4] :
( sequential(X2,X3)
& precedes(X2,X3,X4)
& shortest_path(X0,X1,X4)
& ! [X5] : ~ triangle(X2,X3,X5) ) ),
inference(ennf_transformation,[],[f20]) ).
fof(f27,plain,
( complete
& ? [X0,X1,X2,X3,X4] :
( sequential(X2,X3)
& precedes(X2,X3,X4)
& shortest_path(X0,X1,X4)
& ! [X5] : ~ triangle(X2,X3,X5) ) ),
inference(flattening,[],[f26]) ).
fof(f28,plain,
! [X0] :
( ~ edge(X0)
| head_of(X0) != tail_of(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ~ sequential(X2,X0)
| ~ sequential(X1,X2)
| ~ sequential(X0,X1)
| ~ edge(X2)
| ~ edge(X1)
| ~ edge(X0)
| triangle(X0,X1,X2) ),
inference(ennf_transformation,[],[f21]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ~ sequential(X2,X0)
| ~ sequential(X1,X2)
| ~ sequential(X0,X1)
| ~ edge(X2)
| ~ edge(X1)
| ~ edge(X0)
| triangle(X0,X1,X2) ),
inference(flattening,[],[f33]) ).
fof(f36,plain,
( ~ complete
| ! [X0,X1,X2,X3,X4] :
( ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4)
| ( tail_of(X2) = head_of(sK0(X2,X3))
& head_of(X3) = tail_of(sK0(X2,X3))
& edge(sK0(X2,X3)) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X5,sK0(X2,X3))],[f25]) ).
fof(f37,plain,
( complete
& sequential(sK3,sK4)
& precedes(sK3,sK4,sK5)
& shortest_path(sK1,sK2,sK5)
& ! [X5] : ~ triangle(sK3,sK4,X5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3),skolemize(X3,sK4),skolemize(X4,sK5)],[f27]) ).
fof(f38,plain,
! [X0,X1] :
( ( ~ sequential(X0,X1)
| ( head_of(X0) = tail_of(X1)
& X0 != X1
& edge(X1)
& edge(X0) ) )
& ( head_of(X0) != tail_of(X1)
| X0 = X1
| ~ edge(X1)
| ~ edge(X0)
| sequential(X0,X1) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f39,plain,
! [X0,X1] :
( ( ~ sequential(X0,X1)
| ( head_of(X0) = tail_of(X1)
& X0 != X1
& edge(X1)
& edge(X0) ) )
& ( head_of(X0) != tail_of(X1)
| X0 = X1
| ~ edge(X1)
| ~ edge(X0)
| sequential(X0,X1) ) ),
inference(flattening,[],[f38]) ).
fof(f43,plain,
! [X2,X3,X0,X1,X4] :
( ~ complete
| ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4)
| tail_of(X2) = head_of(sK0(X2,X3)) ),
inference(cnf_transformation,[],[f36]) ).
fof(f44,plain,
! [X2,X3,X0,X1,X4] :
( ~ complete
| ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4)
| head_of(X3) = tail_of(sK0(X2,X3)) ),
inference(cnf_transformation,[],[f36]) ).
fof(f45,plain,
! [X2,X3,X0,X1,X4] :
( ~ complete
| ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4)
| edge(sK0(X2,X3)) ),
inference(cnf_transformation,[],[f36]) ).
fof(f46,plain,
complete,
inference(cnf_transformation,[],[f37]) ).
fof(f47,plain,
sequential(sK3,sK4),
inference(cnf_transformation,[],[f37]) ).
fof(f48,plain,
precedes(sK3,sK4,sK5),
inference(cnf_transformation,[],[f37]) ).
fof(f49,plain,
shortest_path(sK1,sK2,sK5),
inference(cnf_transformation,[],[f37]) ).
fof(f50,plain,
! [X5] : ~ triangle(sK3,sK4,X5),
inference(cnf_transformation,[],[f37]) ).
fof(f51,plain,
! [X0] :
( ~ edge(X0)
| head_of(X0) != tail_of(X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f52,plain,
! [X0,X1] :
( ~ sequential(X0,X1)
| head_of(X0) = tail_of(X1) ),
inference(cnf_transformation,[],[f39]) ).
fof(f54,plain,
! [X0,X1] :
( ~ sequential(X0,X1)
| edge(X1) ),
inference(cnf_transformation,[],[f39]) ).
fof(f55,plain,
! [X0,X1] :
( ~ sequential(X0,X1)
| edge(X0) ),
inference(cnf_transformation,[],[f39]) ).
fof(f56,plain,
! [X0,X1] :
( head_of(X0) != tail_of(X1)
| X0 = X1
| ~ edge(X1)
| ~ edge(X0)
| sequential(X0,X1) ),
inference(cnf_transformation,[],[f39]) ).
fof(f65,plain,
! [X2,X0,X1] :
( ~ sequential(X2,X0)
| ~ sequential(X1,X2)
| ~ sequential(X0,X1)
| ~ edge(X2)
| ~ edge(X1)
| ~ edge(X0)
| triangle(X0,X1,X2) ),
inference(cnf_transformation,[],[f34]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( edge(sK0(X3,X4))
| ~ complete
| ~ precedes(X3,X4,X2)
| ~ shortest_path(X0,X1,X2) ),
inference(cnf_transformation,[],[f45]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ( tail_of(sK0(X3,X4)) = head_of(X4) )
| ~ complete
| ~ precedes(X3,X4,X2)
| ~ shortest_path(X0,X1,X2) ),
inference(cnf_transformation,[],[f44]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ( head_of(sK0(X3,X4)) = tail_of(X3) )
| ~ complete
| ~ precedes(X3,X4,X2)
| ~ shortest_path(X0,X1,X2) ),
inference(cnf_transformation,[],[f43]) ).
tcf(c_52,negated_conjecture,
! [X0: $i] : ~ triangle(sK3,sK4,X0),
inference(cnf_transformation,[],[f50]) ).
tcf(c_53,negated_conjecture,
shortest_path(sK1,sK2,sK5),
inference(cnf_transformation,[],[f49]) ).
tcf(c_54,negated_conjecture,
precedes(sK3,sK4,sK5),
inference(cnf_transformation,[],[f48]) ).
tcf(c_55,negated_conjecture,
sequential(sK3,sK4),
inference(cnf_transformation,[],[f47]) ).
tcf(c_56,negated_conjecture,
complete,
inference(cnf_transformation,[],[f46]) ).
tcf(c_57,plain,
! [X0: $i] :
( ~ edge(X0)
| ( head_of(X0) != tail_of(X0) ) ),
inference(cnf_transformation,[],[f51]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( sequential(X0,X1)
| ( X0 = X1 )
| ~ edge(X1)
| ~ edge(X0)
| ( head_of(X0) != tail_of(X1) ) ),
inference(cnf_transformation,[],[f56]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( edge(X0)
| ~ sequential(X0,X1) ),
inference(cnf_transformation,[],[f55]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( edge(X1)
| ~ sequential(X0,X1) ),
inference(cnf_transformation,[],[f54]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] :
( ( head_of(X0) = tail_of(X1) )
| ~ sequential(X0,X1) ),
inference(cnf_transformation,[],[f52]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i,X2: $i] :
( triangle(X1,X2,X0)
| ~ edge(X2)
| ~ edge(X1)
| ~ edge(X0)
| ~ sequential(X2,X0)
| ~ sequential(X1,X2)
| ~ sequential(X0,X1) ),
inference(cnf_transformation,[],[f65]) ).
tcf(c_87,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( edge(sK0(X3,X4))
| ~ shortest_path(X0,X1,X2)
| ~ precedes(X3,X4,X2) ),
inference(global_subsumption_just,[status(thm)],[c_49,c_56,c_49]) ).
tcf(c_88,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( edge(sK0(X3,X4))
| ~ precedes(X3,X4,X2)
| ~ shortest_path(X0,X1,X2) ),
inference(renaming,[status(thm)],[c_87]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ( head_of(sK0(X3,X4)) = tail_of(X3) )
| ~ shortest_path(X0,X1,X2)
| ~ precedes(X3,X4,X2) ),
inference(global_subsumption_just,[status(thm)],[c_51,c_56,c_51]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ( head_of(sK0(X3,X4)) = tail_of(X3) )
| ~ precedes(X3,X4,X2)
| ~ shortest_path(X0,X1,X2) ),
inference(renaming,[status(thm)],[c_89]) ).
tcf(c_91,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ( tail_of(sK0(X3,X4)) = head_of(X4) )
| ~ shortest_path(X0,X1,X2)
| ~ precedes(X3,X4,X2) ),
inference(global_subsumption_just,[status(thm)],[c_50,c_56,c_50]) ).
tcf(c_92,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ( tail_of(sK0(X3,X4)) = head_of(X4) )
| ~ precedes(X3,X4,X2)
| ~ shortest_path(X0,X1,X2) ),
inference(renaming,[status(thm)],[c_91]) ).
tcf(c_93,plain,
! [X0: $i,X1: $i,X2: $i] :
( triangle(X1,X2,X0)
| ~ edge(X2)
| ~ sequential(X2,X0)
| ~ sequential(X1,X2)
| ~ sequential(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_71,c_60,c_59,c_71]) ).
tcf(c_124,plain,
! [X0: $i,X1: $i,X2: $i] :
( triangle(X1,X2,X0)
| ~ sequential(X2,X0)
| ~ sequential(X1,X2)
| ~ sequential(X0,X1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_93,c_59]) ).
tcf(c_402,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ sequential(X3,X1)
| ~ sequential(X2,X3)
| ~ sequential(X1,X2)
| ( X3 != sK4 )
| ( X2 != sK3 )
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_52,c_124]) ).
tcf(c_403,plain,
! [X0: $i] :
( ~ sequential(sK3,sK4)
| ~ sequential(sK4,X0)
| ~ sequential(X0,sK3) ),
inference(unflattening,[status(thm)],[c_402]) ).
tcf(c_404,plain,
! [X0: $i] :
( ~ sequential(X0,sK3)
| ~ sequential(sK4,X0) ),
inference(global_subsumption_just,[status(thm)],[c_403,c_55,c_403]) ).
tcf(c_405,plain,
! [X0: $i] :
( ~ sequential(sK4,X0)
| ~ sequential(X0,sK3) ),
inference(renaming,[status(thm)],[c_404]) ).
tcf(c_414,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ( tail_of(sK0(X3,X4)) = head_of(X4) )
| ~ precedes(X3,X4,X2)
| ( X2 != sK5 )
| ( X1 != sK2 )
| ( X0 != sK1 ) ),
inference(resolution_lifted,[status(thm)],[c_92,c_53]) ).
tcf(c_415,plain,
! [X0: $i,X1: $i] :
( ( tail_of(sK0(X0,X1)) = head_of(X1) )
| ~ precedes(X0,X1,sK5) ),
inference(unflattening,[status(thm)],[c_414]) ).
tcf(c_423,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ( head_of(sK0(X3,X4)) = tail_of(X3) )
| ~ precedes(X3,X4,X2)
| ( X2 != sK5 )
| ( X1 != sK2 )
| ( X0 != sK1 ) ),
inference(resolution_lifted,[status(thm)],[c_90,c_53]) ).
tcf(c_424,plain,
! [X0: $i,X1: $i] :
( ( head_of(sK0(X0,X1)) = tail_of(X0) )
| ~ precedes(X0,X1,sK5) ),
inference(unflattening,[status(thm)],[c_423]) ).
tcf(c_432,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( edge(sK0(X3,X4))
| ~ precedes(X3,X4,X2)
| ( X2 != sK5 )
| ( X1 != sK2 )
| ( X0 != sK1 ) ),
inference(resolution_lifted,[status(thm)],[c_88,c_53]) ).
tcf(c_433,plain,
! [X0: $i,X1: $i] :
( edge(sK0(X0,X1))
| ~ precedes(X0,X1,sK5) ),
inference(unflattening,[status(thm)],[c_432]) ).
tcf(c_1098,plain,
edge(sK0(sK3,sK4)),
inference(superposition,[status(thm)],[c_54,c_433]) ).
tcf(c_1108,plain,
tail_of(sK0(sK3,sK4)) = head_of(sK4),
inference(superposition,[status(thm)],[c_54,c_415]) ).
tcf(c_1113,plain,
edge(sK3),
inference(superposition,[status(thm)],[c_55,c_59]) ).
tcf(c_1118,plain,
edge(sK4),
inference(superposition,[status(thm)],[c_55,c_60]) ).
tcf(c_1133,plain,
head_of(sK0(sK3,sK4)) = tail_of(sK3),
inference(superposition,[status(thm)],[c_54,c_424]) ).
tcf(c_1182,plain,
( ~ edge(sK0(sK3,sK4))
| ( head_of(sK0(sK3,sK4)) != head_of(sK4) ) ),
inference(superposition,[status(thm)],[c_1108,c_57]) ).
tcf(c_1183,plain,
( ~ edge(sK0(sK3,sK4))
| ( head_of(sK4) != tail_of(sK3) ) ),
inference(light_normalisation,[status(thm)],[c_1182,c_1133]) ).
tcf(c_1184,plain,
head_of(sK4) != tail_of(sK3),
inference(forward_subsumption_resolution,[status(thm)],[c_1183,c_1098]) ).
tcf(c_1189,plain,
head_of(sK3) = tail_of(sK4),
inference(superposition,[status(thm)],[c_55,c_62]) ).
tcf(c_1200,plain,
! [X0: $i] :
( sequential(sK0(sK3,sK4),X0)
| ( sK0(sK3,sK4) = X0 )
| ~ edge(X0)
| ~ edge(sK0(sK3,sK4))
| ( tail_of(X0) != tail_of(sK3) ) ),
inference(superposition,[status(thm)],[c_1133,c_58]) ).
tcf(c_1201,plain,
! [X0: $i] :
( sequential(X0,sK0(sK3,sK4))
| ( sK0(sK3,sK4) = X0 )
| ~ edge(X0)
| ~ edge(sK0(sK3,sK4))
| ( head_of(X0) != head_of(sK4) ) ),
inference(superposition,[status(thm)],[c_1108,c_58]) ).
tcf(c_1202,plain,
! [X0: $i] :
( sequential(X0,sK0(sK3,sK4))
| ( sK0(sK3,sK4) = X0 )
| ~ edge(X0)
| ( head_of(X0) != head_of(sK4) ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1201,c_1098]) ).
tcf(c_1207,plain,
! [X0: $i] :
( sequential(sK0(sK3,sK4),X0)
| ( sK0(sK3,sK4) = X0 )
| ~ edge(X0)
| ( tail_of(X0) != tail_of(sK3) ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1200,c_1098]) ).
tcf(c_1214,plain,
( ~ edge(sK4)
| ( head_of(sK3) != head_of(sK4) ) ),
inference(superposition,[status(thm)],[c_1189,c_57]) ).
tcf(c_1222,plain,
head_of(sK3) != head_of(sK4),
inference(forward_subsumption_resolution,[status(thm)],[c_1214,c_1118]) ).
tcf(c_1293,plain,
( sequential(sK4,sK0(sK3,sK4))
| ( sK0(sK3,sK4) = sK4 )
| ~ edge(sK4) ),
inference(equality_resolution,[status(thm)],[c_1202]) ).
tcf(c_1294,plain,
( sequential(sK4,sK0(sK3,sK4))
| ( sK0(sK3,sK4) = sK4 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1293,c_1118]) ).
tcf(c_1314,plain,
( sequential(sK0(sK3,sK4),sK3)
| ( sK0(sK3,sK4) = sK3 )
| ~ edge(sK3) ),
inference(equality_resolution,[status(thm)],[c_1207]) ).
tcf(c_1315,plain,
( sequential(sK0(sK3,sK4),sK3)
| ( sK0(sK3,sK4) = sK3 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1314,c_1113]) ).
tcf(c_1478,plain,
( ( sK0(sK3,sK4) = sK3 )
| ~ sequential(sK4,sK0(sK3,sK4)) ),
inference(superposition,[status(thm)],[c_1315,c_405]) ).
tcf(c_1485,plain,
( ( sK0(sK3,sK4) = sK4 )
| ( sK0(sK3,sK4) = sK3 ) ),
inference(superposition,[status(thm)],[c_1294,c_1478]) ).
tcf(c_1498,plain,
( ( head_of(sK4) = tail_of(sK4) )
| ( sK0(sK3,sK4) = sK3 ) ),
inference(superposition,[status(thm)],[c_1485,c_1108]) ).
tcf(c_1502,plain,
( ( head_of(sK3) = head_of(sK4) )
| ( sK0(sK3,sK4) = sK3 ) ),
inference(light_normalisation,[status(thm)],[c_1498,c_1189]) ).
tcf(c_1503,plain,
sK0(sK3,sK4) = sK3,
inference(forward_subsumption_resolution,[status(thm)],[c_1502,c_1222]) ).
tcf(c_1512,plain,
head_of(sK4) = tail_of(sK3),
inference(demodulation,[status(thm)],[c_1108,c_1503]) ).
tcf(c_1514,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1512,c_1184]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRA008+2 : TPTP v9.3.1. Bugfixed v3.2.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.16/0.44 % Computer : n004.cluster.edu
% 0.16/0.44 % Model : x86_64 x86_64
% 0.16/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.44 % Memory : 8046.5625MB
% 0.16/0.44 % OS : Linux 6.8.0-71-generic
% 0.16/0.44 % CPULimit : 300
% 0.16/0.44 % WCLimit : 300
% 0.16/0.44 % DateTime : Wed Sep 23 12:43:53 UTC 2026
% 0.16/0.44 % CPUTime :
% 0.16/0.44 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.16/0.50 Running first-order theorem proving
% 0.16/0.50 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.27/0.52
% 0.27/0.52 % ======== iProver multi-core TPTP/SMT =========
% 0.27/0.52
% 0.27/0.52 % Detected problem language: tptp
% 0.27/0.54 % Proving...
% 4.08/1.42 % SZS status Started for theBenchmark.p
% 4.08/1.42 % SZS status Theorem for theBenchmark.p
% 4.08/1.42
% 4.08/1.42 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.08/1.42
% 4.08/1.42 % ------ iProver source info
% 4.08/1.42
% 4.08/1.42 % git: date: 2026-07-19 20:42:38 +0200
% 4.08/1.42 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.08/1.42 % git: non_committed_changes: false
% 4.08/1.42
% 4.08/1.42 % ------ Parsing...
% 4.08/1.42 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.08/1.42
% 4.08/1.42 % ------ Preprocessing... sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 4.08/1.42
% 4.08/1.42 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.08/1.42
% 4.08/1.42 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.08/1.42 % ------ Proving...
% 4.08/1.42 % ------ Problem Properties
% 4.08/1.42
% 4.08/1.42 %
% 4.08/1.42 % clauses 22
% 4.08/1.42 % conjectures 2
% 4.08/1.42 % EPR 7
% 4.08/1.42 % Horn 16
% 4.08/1.42 % unary 3
% 4.08/1.42 % binary 11
% 4.08/1.42 % lits 64
% 4.08/1.43 % lits eq 26
% 4.08/1.43 % fd_pure 0
% 4.08/1.43 % fd_pseudo 0
% 4.08/1.43 % fd_cond 0
% 4.08/1.43 % fd_pseudo_cond 3
% 4.08/1.43 % AC symbols 0
% 4.08/1.43
% 4.08/1.43 % ------ Schedule dynamic 5 is on
% 4.08/1.43
% 4.08/1.43 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.08/1.43
% 4.08/1.43
% 4.08/1.43 % ------
% 4.08/1.43 % Current options:
% 4.08/1.43 % ------
% 4.08/1.43
% 4.08/1.43
% 4.08/1.43 %
% 4.08/1.43
% 4.08/1.43 % ------ Proving...
% 4.08/1.43 %
% 4.08/1.43
% 4.08/1.43 % SZS status Theorem for theBenchmark.p
% 4.08/1.43
% 4.08/1.43 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.08/1.43
% 4.08/1.43
%------------------------------------------------------------------------------