%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRA008+2 : TPTP v9.3.1. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 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 : Tue Sep 29 10:08:26 AM UTC 2026
% Result : Theorem 0.84s 0.63s
% Output : Refutation 0.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 13
% Syntax : Number of formulae : 107 ( 22 unt; 8 def)
% Number of atoms : 330 ( 57 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 390 ( 167 ~; 159 |; 46 &)
% ( 10 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 10 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 130 ( 0 sgn 115 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( edge(X0)
=> head_of(X0) != tail_of(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',no_loops) ).
fof(f8,axiom,
! [X0,X1] :
( sequential(X0,X1)
<=> ( edge(X0)
& edge(X1)
& X0 != X1
& head_of(X0) = tail_of(X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',sequential_defn) ).
fof(f13,axiom,
! [X0,X1,X2] :
( triangle(X0,X1,X2)
<=> ( edge(X0)
& edge(X1)
& edge(X2)
& sequential(X0,X1)
& sequential(X1,X2)
& sequential(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',triangle_defn) ).
fof(f18,axiom,
( complete
=> ! [X0,X1,X2,X3,X4] :
( ( shortest_path(X0,X1,X4)
& precedes(X2,X3,X4) )
=> ? [X5] :
( edge(X5)
& tail_of(X5) = head_of(X3)
& head_of(X5) = tail_of(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',back_edge) ).
fof(f19,conjecture,
( complete
=> ! [X0,X1,X2,X3,X4] :
( ( shortest_path(X0,X1,X4)
& precedes(X2,X3,X4)
& sequential(X2,X3) )
=> ? [X5] : triangle(X2,X3,X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_is_triangle) ).
fof(f20,negated_conjecture,
~ ( complete
=> ! [X0,X1,X2,X3,X4] :
( ( shortest_path(X0,X1,X4)
& precedes(X2,X3,X4)
& sequential(X2,X3) )
=> ? [X5] : triangle(X2,X3,X5) ) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( edge(X0)
& edge(X1)
& edge(X2)
& sequential(X0,X1)
& sequential(X1,X2)
& sequential(X2,X0) )
=> triangle(X0,X1,X2) ),
inference(unused_predicate_definition_removal,[],[f13]) ).
fof(f22,plain,
! [X0] :
( head_of(X0) != tail_of(X0)
| ~ edge(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f39,plain,
! [X0,X1,X2] :
( triangle(X0,X1,X2)
| ~ edge(X0)
| ~ edge(X1)
| ~ edge(X2)
| ~ sequential(X0,X1)
| ~ sequential(X1,X2)
| ~ sequential(X2,X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f40,plain,
! [X0,X1,X2] :
( triangle(X0,X1,X2)
| ~ edge(X0)
| ~ edge(X1)
| ~ edge(X2)
| ~ sequential(X0,X1)
| ~ sequential(X1,X2)
| ~ sequential(X2,X0) ),
inference(flattening,[],[f39]) ).
fof(f45,plain,
( ! [X0,X1,X2,X3,X4] :
( ? [X5] :
( edge(X5)
& tail_of(X5) = head_of(X3)
& head_of(X5) = tail_of(X2) )
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4) )
| ~ complete ),
inference(ennf_transformation,[],[f18]) ).
fof(f46,plain,
( ! [X0,X1,X2,X3,X4] :
( ? [X5] :
( edge(X5)
& tail_of(X5) = head_of(X3)
& head_of(X5) = tail_of(X2) )
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4) )
| ~ complete ),
inference(flattening,[],[f45]) ).
fof(f47,plain,
( ? [X0,X1,X2,X3,X4] :
( ! [X5] : ~ triangle(X2,X3,X5)
& shortest_path(X0,X1,X4)
& precedes(X2,X3,X4)
& sequential(X2,X3) )
& complete ),
inference(ennf_transformation,[],[f20]) ).
fof(f48,plain,
( ? [X0,X1,X2,X3,X4] :
( ! [X5] : ~ triangle(X2,X3,X5)
& shortest_path(X0,X1,X4)
& precedes(X2,X3,X4)
& sequential(X2,X3) )
& complete ),
inference(flattening,[],[f47]) ).
fof(f57,plain,
! [X0,X1] :
( ( sequential(X0,X1)
| ~ edge(X0)
| ~ edge(X1)
| X0 = X1
| head_of(X0) != tail_of(X1) )
& ( ( edge(X0)
& edge(X1)
& X0 != X1
& head_of(X0) = tail_of(X1) )
| ~ sequential(X0,X1) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f58,plain,
! [X0,X1] :
( ( sequential(X0,X1)
| ~ edge(X0)
| ~ edge(X1)
| X0 = X1
| head_of(X0) != tail_of(X1) )
& ( ( edge(X0)
& edge(X1)
& X0 != X1
& head_of(X0) = tail_of(X1) )
| ~ sequential(X0,X1) ) ),
inference(flattening,[],[f57]) ).
fof(f68,plain,
( ! [X0,X1,X2,X3,X4] :
( ( edge(sK8(X2,X3))
& head_of(X3) = tail_of(sK8(X2,X3))
& tail_of(X2) = head_of(sK8(X2,X3)) )
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4) )
| ~ complete ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X5,sK8(X2,X3))],[f46]) ).
fof(f69,plain,
( ! [X5] : ~ triangle(sK11,sK12,X5)
& shortest_path(sK9,sK10,sK13)
& precedes(sK11,sK12,sK13)
& sequential(sK11,sK12)
& complete ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10,sK11,sK12,sK13]),skolemize(X0,sK9),skolemize(X1,sK10),skolemize(X2,sK11),skolemize(X3,sK12),skolemize(X4,sK13)],[f48]) ).
fof(f70,plain,
! [X0] :
( ~ edge(X0)
| head_of(X0) != tail_of(X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f96,plain,
! [X0,X1] :
( ~ sequential(X0,X1)
| head_of(X0) = tail_of(X1) ),
inference(cnf_transformation,[],[f58]) ).
fof(f98,plain,
! [X0,X1] :
( ~ sequential(X0,X1)
| edge(X1) ),
inference(cnf_transformation,[],[f58]) ).
fof(f99,plain,
! [X0,X1] :
( ~ sequential(X0,X1)
| edge(X0) ),
inference(cnf_transformation,[],[f58]) ).
fof(f100,plain,
! [X0,X1] :
( ~ edge(X1)
| ~ edge(X0)
| sequential(X0,X1)
| X0 = X1
| head_of(X0) != tail_of(X1) ),
inference(cnf_transformation,[],[f58]) ).
fof(f115,plain,
! [X2,X0,X1] :
( ~ edge(X2)
| ~ edge(X0)
| ~ edge(X1)
| triangle(X0,X1,X2)
| ~ sequential(X0,X1)
| ~ sequential(X1,X2)
| ~ sequential(X2,X0) ),
inference(cnf_transformation,[],[f40]) ).
fof(f123,plain,
! [X2,X3,X0,X1,X4] :
( tail_of(X2) = head_of(sK8(X2,X3))
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4)
| ~ complete ),
inference(cnf_transformation,[],[f68]) ).
fof(f124,plain,
! [X2,X3,X0,X1,X4] :
( head_of(X3) = tail_of(sK8(X2,X3))
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4)
| ~ complete ),
inference(cnf_transformation,[],[f68]) ).
fof(f125,plain,
! [X2,X3,X0,X1,X4] :
( edge(sK8(X2,X3))
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4)
| ~ complete ),
inference(cnf_transformation,[],[f68]) ).
fof(f126,plain,
complete,
inference(cnf_transformation,[],[f69]) ).
fof(f127,plain,
sequential(sK11,sK12),
inference(cnf_transformation,[],[f69]) ).
fof(f128,plain,
precedes(sK11,sK12,sK13),
inference(cnf_transformation,[],[f69]) ).
fof(f129,plain,
shortest_path(sK9,sK10,sK13),
inference(cnf_transformation,[],[f69]) ).
fof(f130,plain,
! [X5] : ~ triangle(sK11,sK12,X5),
inference(cnf_transformation,[],[f69]) ).
fof(f138,plain,
! [X2,X3,X0,X1,X4] :
( ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4)
| tail_of(X2) = head_of(sK8(X2,X3)) ),
inference(forward_subsumption_resolution,[],[f123,f126]) ).
fof(f139,plain,
! [X2,X3,X0,X1,X4] :
( ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4)
| head_of(X3) = tail_of(sK8(X2,X3)) ),
inference(forward_subsumption_resolution,[],[f124,f126]) ).
fof(f140,plain,
! [X2,X3,X0,X1,X4] :
( ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4)
| edge(sK8(X2,X3)) ),
inference(forward_subsumption_resolution,[],[f125,f126]) ).
fof(f150,plain,
! [X0,X1] :
( ~ shortest_path(X0,X1,sK13)
| edge(sK8(sK11,sK12)) ),
inference(resolution,[],[f140,f128]) ).
fof(f152,definition,
( spl14_1
<=> edge(sK8(sK11,sK12)) ),
introduced(definition,[new_symbols(definition,[spl14_1])],[avatar_definition]) ).
fof(f154,plain,
( edge(sK8(sK11,sK12))
| ~ spl14_1 ),
inference(avatar_component_clause,[],[f152]) ).
fof(f156,definition,
( spl14_2
<=> ! [X0,X1] : ~ shortest_path(X0,X1,sK13) ),
introduced(definition,[new_symbols(definition,[spl14_2])],[avatar_definition]) ).
fof(f157,plain,
( ! [X0,X1] : ~ shortest_path(X0,X1,sK13)
| ~ spl14_2 ),
inference(avatar_component_clause,[],[f156]) ).
fof(f158,plain,
( spl14_1
| spl14_2 ),
inference(avatar_split_clause,[],[f150,f156,f152]) ).
fof(f159,plain,
! [X0,X1] :
( ~ shortest_path(X0,X1,sK13)
| tail_of(sK11) = head_of(sK8(sK11,sK12)) ),
inference(resolution,[],[f138,f128]) ).
fof(f160,plain,
( $false
| ~ spl14_2 ),
inference(resolution,[],[f157,f129]) ).
fof(f161,plain,
~ spl14_2,
inference(avatar_contradiction_clause,[],[f160]) ).
fof(f163,definition,
( spl14_3
<=> tail_of(sK11) = head_of(sK8(sK11,sK12)) ),
introduced(definition,[new_symbols(definition,[spl14_3])],[avatar_definition]) ).
fof(f165,plain,
( tail_of(sK11) = head_of(sK8(sK11,sK12))
| ~ spl14_3 ),
inference(avatar_component_clause,[],[f163]) ).
fof(f166,plain,
( spl14_3
| spl14_2 ),
inference(avatar_split_clause,[],[f159,f156,f163]) ).
fof(f167,plain,
! [X0,X1] :
( ~ shortest_path(X0,X1,sK13)
| head_of(sK12) = tail_of(sK8(sK11,sK12)) ),
inference(resolution,[],[f139,f128]) ).
fof(f169,definition,
( spl14_4
<=> head_of(sK12) = tail_of(sK8(sK11,sK12)) ),
introduced(definition,[new_symbols(definition,[spl14_4])],[avatar_definition]) ).
fof(f171,plain,
( head_of(sK12) = tail_of(sK8(sK11,sK12))
| ~ spl14_4 ),
inference(avatar_component_clause,[],[f169]) ).
fof(f172,plain,
( spl14_4
| spl14_2 ),
inference(avatar_split_clause,[],[f167,f156,f169]) ).
fof(f183,plain,
edge(sK12),
inference(resolution,[],[f98,f127]) ).
fof(f186,plain,
edge(sK11),
inference(resolution,[],[f99,f127]) ).
fof(f202,plain,
head_of(sK12) != tail_of(sK12),
inference(resolution,[],[f70,f183]) ).
fof(f203,plain,
tail_of(sK11) != head_of(sK11),
inference(resolution,[],[f70,f186]) ).
fof(f212,plain,
tail_of(sK12) = head_of(sK11),
inference(resolution,[],[f96,f127]) ).
fof(f220,plain,
head_of(sK12) != head_of(sK11),
inference(backward_demodulation,[],[f202,f212]) ).
fof(f303,plain,
( ! [X0] :
( ~ edge(X0)
| sequential(X0,sK8(sK11,sK12))
| sK8(sK11,sK12) = X0
| head_of(X0) != tail_of(sK8(sK11,sK12)) )
| ~ spl14_1 ),
inference(resolution,[],[f100,f154]) ).
fof(f304,plain,
! [X0] :
( ~ edge(X0)
| sequential(X0,sK11)
| sK11 = X0
| head_of(X0) != tail_of(sK11) ),
inference(resolution,[],[f100,f186]) ).
fof(f307,plain,
( ! [X0] :
( ~ edge(X0)
| head_of(X0) != head_of(sK12)
| sequential(X0,sK8(sK11,sK12))
| sK8(sK11,sK12) = X0 )
| ~ spl14_1
| ~ spl14_4 ),
inference(forward_demodulation,[],[f303,f171]) ).
fof(f572,plain,
( ! [X0,X1] :
( ~ edge(X0)
| ~ edge(X1)
| triangle(X0,X1,sK8(sK11,sK12))
| ~ sequential(X0,X1)
| ~ sequential(X1,sK8(sK11,sK12))
| ~ sequential(sK8(sK11,sK12),X0) )
| ~ spl14_1 ),
inference(resolution,[],[f115,f154]) ).
fof(f577,plain,
( ! [X0,X1] :
( ~ edge(X0)
| triangle(X0,X1,sK8(sK11,sK12))
| ~ sequential(X0,X1)
| ~ sequential(X1,sK8(sK11,sK12))
| ~ sequential(sK8(sK11,sK12),X0) )
| ~ spl14_1 ),
inference(forward_subsumption_resolution,[],[f572,f98]) ).
fof(f584,plain,
( ! [X0,X1] :
( ~ sequential(X0,X1)
| triangle(X0,X1,sK8(sK11,sK12))
| ~ sequential(X1,sK8(sK11,sK12))
| ~ sequential(sK8(sK11,sK12),X0) )
| ~ spl14_1 ),
inference(forward_subsumption_resolution,[],[f577,f98]) ).
fof(f1138,plain,
( sequential(sK8(sK11,sK12),sK11)
| sK11 = sK8(sK11,sK12)
| tail_of(sK11) != head_of(sK8(sK11,sK12))
| ~ spl14_1 ),
inference(resolution,[],[f304,f154]) ).
fof(f1141,plain,
( sequential(sK8(sK11,sK12),sK11)
| sK11 = sK8(sK11,sK12)
| ~ spl14_1
| ~ spl14_3 ),
inference(forward_subsumption_resolution,[],[f1138,f165]) ).
fof(f1147,definition,
( spl14_105
<=> sK11 = sK8(sK11,sK12) ),
introduced(definition,[new_symbols(definition,[spl14_105])],[avatar_definition]) ).
fof(f1149,plain,
( sK11 = sK8(sK11,sK12)
| ~ spl14_105 ),
inference(avatar_component_clause,[],[f1147]) ).
fof(f1151,definition,
( spl14_106
<=> sequential(sK8(sK11,sK12),sK11) ),
introduced(definition,[new_symbols(definition,[spl14_106])],[avatar_definition]) ).
fof(f1153,plain,
( sequential(sK8(sK11,sK12),sK11)
| ~ spl14_106 ),
inference(avatar_component_clause,[],[f1151]) ).
fof(f1154,plain,
( spl14_105
| spl14_106
| ~ spl14_1
| ~ spl14_3 ),
inference(avatar_split_clause,[],[f1141,f163,f152,f1151,f1147]) ).
fof(f1189,plain,
( tail_of(sK11) = head_of(sK11)
| ~ spl14_3
| ~ spl14_105 ),
inference(backward_demodulation,[],[f165,f1149]) ).
fof(f1235,plain,
( $false
| ~ spl14_3
| ~ spl14_105 ),
inference(forward_subsumption_resolution,[],[f1189,f203]) ).
fof(f1236,plain,
( ~ spl14_3
| ~ spl14_105 ),
inference(avatar_contradiction_clause,[],[f1235]) ).
fof(f1461,plain,
( head_of(sK12) != head_of(sK12)
| sequential(sK12,sK8(sK11,sK12))
| sK12 = sK8(sK11,sK12)
| ~ spl14_1
| ~ spl14_4 ),
inference(resolution,[],[f307,f183]) ).
fof(f1462,plain,
( sequential(sK12,sK8(sK11,sK12))
| sK12 = sK8(sK11,sK12)
| ~ spl14_1
| ~ spl14_4 ),
inference(trivial_inequality_removal,[],[f1461]) ).
fof(f1464,definition,
( spl14_121
<=> sK12 = sK8(sK11,sK12) ),
introduced(definition,[new_symbols(definition,[spl14_121])],[avatar_definition]) ).
fof(f1466,plain,
( sK12 = sK8(sK11,sK12)
| ~ spl14_121 ),
inference(avatar_component_clause,[],[f1464]) ).
fof(f1468,definition,
( spl14_122
<=> sequential(sK12,sK8(sK11,sK12)) ),
introduced(definition,[new_symbols(definition,[spl14_122])],[avatar_definition]) ).
fof(f1470,plain,
( sequential(sK12,sK8(sK11,sK12))
| ~ spl14_122 ),
inference(avatar_component_clause,[],[f1468]) ).
fof(f1471,plain,
( spl14_121
| spl14_122
| ~ spl14_1
| ~ spl14_4 ),
inference(avatar_split_clause,[],[f1462,f169,f152,f1468,f1464]) ).
fof(f1510,plain,
( head_of(sK12) = tail_of(sK12)
| ~ spl14_4
| ~ spl14_121 ),
inference(backward_demodulation,[],[f171,f1466]) ).
fof(f1583,plain,
( head_of(sK12) = head_of(sK11)
| ~ spl14_4
| ~ spl14_121 ),
inference(forward_demodulation,[],[f1510,f212]) ).
fof(f1592,plain,
( $false
| ~ spl14_4
| ~ spl14_121 ),
inference(forward_subsumption_resolution,[],[f1583,f220]) ).
fof(f1593,plain,
( ~ spl14_4
| ~ spl14_121 ),
inference(avatar_contradiction_clause,[],[f1592]) ).
fof(f1679,plain,
( triangle(sK11,sK12,sK8(sK11,sK12))
| ~ sequential(sK12,sK8(sK11,sK12))
| ~ sequential(sK8(sK11,sK12),sK11)
| ~ spl14_1 ),
inference(resolution,[],[f584,f127]) ).
fof(f1682,plain,
( ~ sequential(sK12,sK8(sK11,sK12))
| ~ sequential(sK8(sK11,sK12),sK11)
| ~ spl14_1 ),
inference(forward_subsumption_resolution,[],[f1679,f130]) ).
fof(f1683,plain,
( ~ sequential(sK8(sK11,sK12),sK11)
| ~ spl14_1
| ~ spl14_122 ),
inference(forward_subsumption_resolution,[],[f1682,f1470]) ).
fof(f1684,plain,
( $false
| ~ spl14_1
| ~ spl14_106
| ~ spl14_122 ),
inference(forward_subsumption_resolution,[],[f1683,f1153]) ).
fof(f1685,plain,
( ~ spl14_1
| ~ spl14_106
| ~ spl14_122 ),
inference(avatar_contradiction_clause,[],[f1684]) ).
cnf(s1,plain,
( spl14_1
| spl14_2 ),
inference(sat_conversion,[],[f158]) ).
cnf(s2,plain,
~ spl14_2,
inference(sat_conversion,[],[f161]) ).
cnf(s3,plain,
( spl14_2
| spl14_3 ),
inference(sat_conversion,[],[f166]) ).
cnf(s4,plain,
( spl14_2
| spl14_4 ),
inference(sat_conversion,[],[f172]) ).
cnf(s88,plain,
( ~ spl14_1
| ~ spl14_3
| spl14_105
| spl14_106 ),
inference(sat_conversion,[],[f1154]) ).
cnf(s95,plain,
( ~ spl14_3
| ~ spl14_105 ),
inference(sat_conversion,[],[f1236]) ).
cnf(s102,plain,
( ~ spl14_1
| ~ spl14_4
| spl14_121
| spl14_122 ),
inference(sat_conversion,[],[f1471]) ).
cnf(s110,plain,
( ~ spl14_4
| ~ spl14_121 ),
inference(sat_conversion,[],[f1593]) ).
cnf(s111,plain,
( ~ spl14_1
| ~ spl14_106
| ~ spl14_122 ),
inference(sat_conversion,[],[f1685]) ).
cnf(s133,plain,
spl14_4,
inference(rat,[],[s4,s2]) ).
cnf(s134,plain,
spl14_3,
inference(rat,[],[s3,s2]) ).
cnf(s135,plain,
~ spl14_121,
inference(rat,[],[s110,s133]) ).
cnf(s136,plain,
~ spl14_105,
inference(rat,[],[s95,s134]) ).
cnf(s137,plain,
spl14_1,
inference(rat,[],[s1,s2]) ).
cnf(s138,plain,
spl14_122,
inference(rat,[],[s102,s133,s135,s137]) ).
cnf(s139,plain,
spl14_106,
inference(rat,[],[s88,s134,s136,s137]) ).
cnf(s140,plain,
$false,
inference(rat,[],[s111,s137,s138,s139]) ).
fof(f1686,plain,
$false,
inference(avatar_sat_refutation,[],[s140]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRA008+2 : TPTP v9.3.1. Bugfixed v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 % Computer : n004.cluster.edu
% 0.11/0.40 % Model : x86_64 x86_64
% 0.11/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.40 % Memory : 8046.5625MB
% 0.11/0.40 % OS : Linux 6.8.0-71-generic
% 0.11/0.40 % CPULimit : 300
% 0.11/0.40 % WCLimit : 300
% 0.11/0.40 % DateTime : Sun Sep 27 08:47:22 UTC 2026
% 0.11/0.40 % CPUTime :
% 0.11/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.43 Running first-order model finding
% 0.11/0.43 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.84/0.63 % (3209745)Will run a generic schedule for satisfiability detection.
% 0.84/0.63 % (3209754)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2649953933:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.84/0.63 % (3209751)% WARNING: option uhcvi not known.
% 0.84/0.63 % (3209750)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3641330538_2999 on theBenchmark for (2999ds/0Mi)
% 0.84/0.63 % (3209755)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2511197500:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.84/0.63 % (3209751)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2645704664:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.84/0.63 % (3209752)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3021517562:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.84/0.63 % (3209753)dis+10_1_sil=32000:sp=arity:random_seed=184644201:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.84/0.63 % (3209756)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=775564473:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.84/0.63 % TRYING [1]
% 0.84/0.63 % TRYING [2]
% 0.84/0.63 % TRYING [3]
% 0.84/0.63 % TRYING [4]
% 0.84/0.63 % (3209754)Instruction limit reached!
% 0.84/0.63 % (3209754)------------------------------
% 0.84/0.63 % (3209754)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.84/0.63 % (3209754)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.84/0.63 % (3209754)CaDiCaL version: 2.1.3
% 0.84/0.63 % (3209754)Termination reason: Instruction limit
% 0.84/0.63 % (3209754)Termination phase: Saturation
% 0.84/0.63 % (3209754)Time elapsed: 0.039 s
% 0.84/0.63 % (3209754)Peak memory usage: 12 MB
% 0.84/0.63 % (3209754)Instructions burned: 119 (million)
% 0.84/0.63 % (3209764)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1173470022:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.84/0.63 % TRYING [1]
% 0.84/0.63 % TRYING [2]
% 0.84/0.63 % TRYING [3]
% 0.84/0.63 % TRYING [5]
% 0.84/0.63 % (3209753)Instruction limit reached!
% 0.84/0.63 % (3209753)------------------------------
% 0.84/0.63 % (3209753)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.84/0.63 % (3209753)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.84/0.63 % (3209753)CaDiCaL version: 2.1.3
% 0.84/0.63 % (3209753)Termination reason: Instruction limit
% 0.84/0.63 % (3209753)Termination phase: Saturation
% 0.84/0.63 % (3209753)Time elapsed: 0.065 s
% 0.84/0.63 % (3209753)Peak memory usage: 12 MB
% 0.84/0.63 % (3209753)Instructions burned: 103 (million)
% 0.84/0.63 % TRYING [4]
% 0.84/0.63 % (3209755)Instruction limit reached!
% 0.84/0.63 % (3209755)------------------------------
% 0.84/0.63 % (3209755)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.84/0.63 % (3209755)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.84/0.63 % (3209755)CaDiCaL version: 2.1.3
% 0.84/0.63 % (3209755)Termination reason: Instruction limit
% 0.84/0.63 % (3209755)Termination phase: Saturation
% 0.84/0.63 % (3209755)Time elapsed: 0.071 s
% 0.84/0.63 % (3209755)Peak memory usage: 12 MB
% 0.84/0.63 % (3209755)Instructions burned: 132 (million)
% 0.84/0.63 % (3209766)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=90560646:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.84/0.63 % (3209767)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1795474424:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.84/0.63 % (3209756)Instruction limit reached!
% 0.84/0.63 % (3209756)------------------------------
% 0.84/0.63 % (3209756)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.84/0.63 % (3209756)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.84/0.63 % (3209756)CaDiCaL version: 2.1.3
% 0.84/0.63 % (3209756)Termination reason: Instruction limit
% 0.84/0.63 % (3209756)Termination phase: Saturation
% 0.84/0.63 % (3209756)Time elapsed: 0.098 s
% 0.84/0.63 % (3209756)Peak memory usage: 14 MB
% 0.84/0.63 % (3209756)Instructions burned: 160 (million)
% 0.84/0.63 % (3209770)ott-21_1_sil=16000:fs=off:random_seed=2464785282:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.84/0.63 % TRYING [6]
% 0.84/0.63 % (3209766) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3209745-3209766"...
% 0.84/0.63 % (3209766)...printing done.
% 0.84/0.63 % (3209766)Refutation found. Thanks to Tanya!
% 0.84/0.63 % SZS status Theorem for theBenchmark
% 0.84/0.63 % SZS output start Proof for theBenchmark
% See solution above
% 0.84/0.63 % (3209766)------------------------------
% 0.84/0.63 % (3209766)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.84/0.63 % (3209766)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.84/0.63 % (3209766)CaDiCaL version: 2.1.3
% 0.84/0.63 % (3209766)Termination reason: Refutation
% 0.84/0.63 % (3209766)Time elapsed: 0.065 s
% 0.84/0.63 % (3209766)Peak memory usage: 14 MB
% 0.84/0.63 % (3209766)Instructions burned: 101 (million)
% 0.84/0.63 % (3209745)Success in time 0.187 s
% 0.84/0.63 % Vampire exiting
%------------------------------------------------------------------------------