%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PRO014+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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 12:30:39 PM UTC 2026
% Result : Theorem 0.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of formulae : 101 ( 17 unt; 8 def)
% Number of atoms : 380 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 455 ( 176 ~; 216 |; 49 &)
% ( 10 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 16 ( 15 usr; 9 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-1 aty)
% Number of variables : 102 ( 0 sgn 84 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2,X3] :
( ( min_precedes(X0,X1,X3)
& min_precedes(X1,X2,X3) )
=> min_precedes(X0,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
fof(f5,axiom,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> ( min_precedes(X0,X1,X2)
& ~ ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_04) ).
fof(f33,axiom,
! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& next_subocc(X3,X4,tptp0)
& leaf(X4,tptp0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_32) ).
fof(f46,conjecture,
! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2,X3] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& leaf(X3,tptp0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f47,negated_conjecture,
~ ! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2,X3] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& leaf(X3,tptp0) ) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f50,plain,
! [X0,X1,X2,X3] :
( min_precedes(X0,X2,X3)
| ~ min_precedes(X0,X1,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(ennf_transformation,[],[f1]) ).
fof(f51,plain,
! [X0,X1,X2,X3] :
( min_precedes(X0,X2,X3)
| ~ min_precedes(X0,X1,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(flattening,[],[f50]) ).
fof(f58,plain,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> ( min_precedes(X0,X1,X2)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f92,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& next_subocc(X3,X4,tptp0)
& leaf(X4,tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f33]) ).
fof(f93,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& next_subocc(X3,X4,tptp0)
& leaf(X4,tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(flattening,[],[f92]) ).
fof(f94,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f47]) ).
fof(f95,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(flattening,[],[f94]) ).
fof(f96,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X0,X1,X3)
| ~ min_precedes(X1,X2,X3)
| min_precedes(X0,X2,X3) ),
inference(cnf_transformation,[],[f51]) ).
fof(f103,plain,
! [X2,X0,X1] :
( min_precedes(X0,X1,X2)
| ~ next_subocc(X0,X1,X2) ),
inference(cnf_transformation,[],[f58]) ).
fof(f155,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK15(X0),tptp1)
| occurrence_of(sK15(X0),tptp2) ),
inference(cnf_transformation,[],[f93]) ).
fof(f156,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| leaf(sK15(X0),tptp0) ),
inference(cnf_transformation,[],[f93]) ).
fof(f157,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(sK14(X0),sK15(X0),tptp0) ),
inference(cnf_transformation,[],[f93]) ).
fof(f158,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(sK13(X0),sK14(X0),tptp0) ),
inference(cnf_transformation,[],[f93]) ).
fof(f160,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK13(X0),tptp0) ),
inference(cnf_transformation,[],[f93]) ).
fof(f161,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK13(X0),tptp3) ),
inference(cnf_transformation,[],[f93]) ).
fof(f174,plain,
! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ~ occurrence_of(X3,tptp1)
| ~ next_subocc(sK16,X2,tptp0)
| ~ occurrence_of(X2,tptp3) ),
inference(cnf_transformation,[],[f95]) ).
fof(f175,plain,
! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ~ occurrence_of(X3,tptp2)
| ~ next_subocc(sK16,X2,tptp0)
| ~ occurrence_of(X2,tptp3) ),
inference(cnf_transformation,[],[f95]) ).
fof(f176,plain,
~ leaf_occ(sK16,sK17),
inference(cnf_transformation,[],[f95]) ).
fof(f177,plain,
arboreal(sK16),
inference(cnf_transformation,[],[f95]) ).
fof(f178,plain,
subactivity_occurrence(sK16,sK17),
inference(cnf_transformation,[],[f95]) ).
fof(f179,plain,
occurrence_of(sK17,tptp0),
inference(cnf_transformation,[],[f95]) ).
fof(f183,plain,
! [X2,X0,X1] :
( next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(consistent_polarity_flipping,[],[f103]) ).
fof(f226,plain,
! [X0,X1] :
( ~ arboreal(X0)
| ~ leaf_occ(X0,X1)
| subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK13(X0),tptp3) ),
inference(consistent_polarity_flipping,[],[f161]) ).
fof(f227,plain,
! [X0,X1] :
( ~ arboreal(X0)
| ~ leaf_occ(X0,X1)
| subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ next_subocc(X0,sK13(X0),tptp0) ),
inference(consistent_polarity_flipping,[],[f160]) ).
fof(f229,plain,
! [X0,X1] :
( ~ arboreal(X0)
| ~ leaf_occ(X0,X1)
| subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ next_subocc(sK13(X0),sK14(X0),tptp0) ),
inference(consistent_polarity_flipping,[],[f158]) ).
fof(f230,plain,
! [X0,X1] :
( ~ arboreal(X0)
| ~ leaf_occ(X0,X1)
| subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ next_subocc(sK14(X0),sK15(X0),tptp0) ),
inference(consistent_polarity_flipping,[],[f157]) ).
fof(f231,plain,
! [X0,X1] :
( ~ arboreal(X0)
| ~ leaf_occ(X0,X1)
| subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| leaf(sK15(X0),tptp0) ),
inference(consistent_polarity_flipping,[],[f156]) ).
fof(f232,plain,
! [X0,X1] :
( ~ arboreal(X0)
| ~ leaf_occ(X0,X1)
| subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK15(X0),tptp1)
| occurrence_of(sK15(X0),tptp2) ),
inference(consistent_polarity_flipping,[],[f155]) ).
fof(f239,plain,
~ subactivity_occurrence(sK16,sK17),
inference(consistent_polarity_flipping,[],[f178]) ).
fof(f240,plain,
leaf_occ(sK16,sK17),
inference(consistent_polarity_flipping,[],[f176]) ).
fof(f241,plain,
! [X2,X3] :
( ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0)
| ~ occurrence_of(X3,tptp2)
| next_subocc(sK16,X2,tptp0)
| ~ occurrence_of(X2,tptp3) ),
inference(consistent_polarity_flipping,[],[f175]) ).
fof(f242,plain,
! [X2,X3] :
( ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0)
| ~ occurrence_of(X3,tptp1)
| next_subocc(sK16,X2,tptp0)
| ~ occurrence_of(X2,tptp3) ),
inference(consistent_polarity_flipping,[],[f174]) ).
fof(f339,plain,
! [X0] :
( ~ leaf_occ(sK16,X0)
| subactivity_occurrence(sK16,X0)
| ~ occurrence_of(X0,tptp0)
| occurrence_of(sK13(sK16),tptp3) ),
inference(resolution,[],[f226,f177]) ).
fof(f341,definition,
( spl18_1
<=> occurrence_of(sK13(sK16),tptp3) ),
introduced(definition,[new_symbols(definition,[spl18_1])],[avatar_definition]) ).
fof(f343,plain,
( occurrence_of(sK13(sK16),tptp3)
| ~ spl18_1 ),
inference(avatar_component_clause,[],[f341]) ).
fof(f345,definition,
( spl18_2
<=> ! [X0] :
( ~ leaf_occ(sK16,X0)
| ~ occurrence_of(X0,tptp0)
| subactivity_occurrence(sK16,X0) ) ),
introduced(definition,[new_symbols(definition,[spl18_2])],[avatar_definition]) ).
fof(f346,plain,
( ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ leaf_occ(sK16,X0)
| subactivity_occurrence(sK16,X0) )
| ~ spl18_2 ),
inference(avatar_component_clause,[],[f345]) ).
fof(f347,plain,
( spl18_1
| spl18_2 ),
inference(avatar_split_clause,[],[f339,f345,f341]) ).
fof(f354,plain,
( ~ leaf_occ(sK16,sK17)
| subactivity_occurrence(sK16,sK17)
| ~ spl18_2 ),
inference(resolution,[],[f346,f179]) ).
fof(f355,plain,
( subactivity_occurrence(sK16,sK17)
| ~ spl18_2 ),
inference(forward_subsumption_resolution,[],[f354,f240]) ).
fof(f356,plain,
( $false
| ~ spl18_2 ),
inference(forward_subsumption_resolution,[],[f355,f239]) ).
fof(f357,plain,
~ spl18_2,
inference(avatar_contradiction_clause,[],[f356]) ).
fof(f364,plain,
! [X0] :
( ~ leaf_occ(sK16,X0)
| subactivity_occurrence(sK16,X0)
| ~ occurrence_of(X0,tptp0)
| leaf(sK15(sK16),tptp0) ),
inference(resolution,[],[f231,f177]) ).
fof(f366,definition,
( spl18_4
<=> leaf(sK15(sK16),tptp0) ),
introduced(definition,[new_symbols(definition,[spl18_4])],[avatar_definition]) ).
fof(f368,plain,
( leaf(sK15(sK16),tptp0)
| ~ spl18_4 ),
inference(avatar_component_clause,[],[f366]) ).
fof(f369,plain,
( spl18_4
| spl18_2 ),
inference(avatar_split_clause,[],[f364,f345,f366]) ).
fof(f370,plain,
! [X0] :
( ~ leaf_occ(sK16,X0)
| subactivity_occurrence(sK16,X0)
| ~ occurrence_of(X0,tptp0)
| ~ next_subocc(sK16,sK13(sK16),tptp0) ),
inference(resolution,[],[f227,f177]) ).
fof(f372,definition,
( spl18_5
<=> next_subocc(sK16,sK13(sK16),tptp0) ),
introduced(definition,[new_symbols(definition,[spl18_5])],[avatar_definition]) ).
fof(f374,plain,
( ~ next_subocc(sK16,sK13(sK16),tptp0)
| spl18_5 ),
inference(avatar_component_clause,[],[f372]) ).
fof(f375,plain,
( ~ spl18_5
| spl18_2 ),
inference(avatar_split_clause,[],[f370,f345,f372]) ).
fof(f376,plain,
! [X0] :
( ~ leaf_occ(sK16,X0)
| subactivity_occurrence(sK16,X0)
| ~ occurrence_of(X0,tptp0)
| ~ next_subocc(sK13(sK16),sK14(sK16),tptp0) ),
inference(resolution,[],[f229,f177]) ).
fof(f378,definition,
( spl18_6
<=> next_subocc(sK13(sK16),sK14(sK16),tptp0) ),
introduced(definition,[new_symbols(definition,[spl18_6])],[avatar_definition]) ).
fof(f380,plain,
( ~ next_subocc(sK13(sK16),sK14(sK16),tptp0)
| spl18_6 ),
inference(avatar_component_clause,[],[f378]) ).
fof(f381,plain,
( ~ spl18_6
| spl18_2 ),
inference(avatar_split_clause,[],[f376,f345,f378]) ).
fof(f382,plain,
! [X0] :
( ~ leaf_occ(sK16,X0)
| subactivity_occurrence(sK16,X0)
| ~ occurrence_of(X0,tptp0)
| ~ next_subocc(sK14(sK16),sK15(sK16),tptp0) ),
inference(resolution,[],[f230,f177]) ).
fof(f384,definition,
( spl18_7
<=> next_subocc(sK14(sK16),sK15(sK16),tptp0) ),
introduced(definition,[new_symbols(definition,[spl18_7])],[avatar_definition]) ).
fof(f386,plain,
( ~ next_subocc(sK14(sK16),sK15(sK16),tptp0)
| spl18_7 ),
inference(avatar_component_clause,[],[f384]) ).
fof(f387,plain,
( ~ spl18_7
| spl18_2 ),
inference(avatar_split_clause,[],[f382,f345,f384]) ).
fof(f388,plain,
! [X0] :
( ~ leaf_occ(sK16,X0)
| subactivity_occurrence(sK16,X0)
| ~ occurrence_of(X0,tptp0)
| occurrence_of(sK15(sK16),tptp1)
| occurrence_of(sK15(sK16),tptp2) ),
inference(resolution,[],[f232,f177]) ).
fof(f390,definition,
( spl18_8
<=> occurrence_of(sK15(sK16),tptp2) ),
introduced(definition,[new_symbols(definition,[spl18_8])],[avatar_definition]) ).
fof(f394,definition,
( spl18_9
<=> occurrence_of(sK15(sK16),tptp1) ),
introduced(definition,[new_symbols(definition,[spl18_9])],[avatar_definition]) ).
fof(f396,plain,
( occurrence_of(sK15(sK16),tptp1)
| ~ spl18_9 ),
inference(avatar_component_clause,[],[f394]) ).
fof(f397,plain,
( spl18_8
| spl18_9
| spl18_2 ),
inference(avatar_split_clause,[],[f388,f345,f394,f390]) ).
fof(f593,plain,
( min_precedes(sK13(sK16),sK14(sK16),tptp0)
| spl18_6 ),
inference(resolution,[],[f380,f183]) ).
fof(f625,plain,
( min_precedes(sK14(sK16),sK15(sK16),tptp0)
| spl18_7 ),
inference(resolution,[],[f386,f183]) ).
fof(f939,plain,
( ! [X0] :
( ~ min_precedes(sK14(sK16),X0,tptp0)
| min_precedes(sK13(sK16),X0,tptp0) )
| spl18_6 ),
inference(resolution,[],[f593,f96]) ).
fof(f2063,plain,
( min_precedes(sK13(sK16),sK15(sK16),tptp0)
| spl18_6
| spl18_7 ),
inference(resolution,[],[f939,f625]) ).
fof(f2067,plain,
( ~ leaf(sK15(sK16),tptp0)
| ~ occurrence_of(sK15(sK16),tptp1)
| next_subocc(sK16,sK13(sK16),tptp0)
| ~ occurrence_of(sK13(sK16),tptp3)
| spl18_6
| spl18_7 ),
inference(resolution,[],[f2063,f242]) ).
fof(f2068,plain,
( ~ leaf(sK15(sK16),tptp0)
| ~ occurrence_of(sK15(sK16),tptp2)
| next_subocc(sK16,sK13(sK16),tptp0)
| ~ occurrence_of(sK13(sK16),tptp3)
| spl18_6
| spl18_7 ),
inference(resolution,[],[f2063,f241]) ).
fof(f2098,plain,
( ~ occurrence_of(sK15(sK16),tptp2)
| next_subocc(sK16,sK13(sK16),tptp0)
| ~ occurrence_of(sK13(sK16),tptp3)
| ~ spl18_4
| spl18_6
| spl18_7 ),
inference(forward_subsumption_resolution,[],[f2068,f368]) ).
fof(f2099,plain,
( ~ occurrence_of(sK15(sK16),tptp1)
| next_subocc(sK16,sK13(sK16),tptp0)
| ~ occurrence_of(sK13(sK16),tptp3)
| ~ spl18_4
| spl18_6
| spl18_7 ),
inference(forward_subsumption_resolution,[],[f2067,f368]) ).
fof(f2100,plain,
( ~ occurrence_of(sK15(sK16),tptp2)
| ~ occurrence_of(sK13(sK16),tptp3)
| ~ spl18_4
| spl18_5
| spl18_6
| spl18_7 ),
inference(forward_subsumption_resolution,[],[f2098,f374]) ).
fof(f2101,plain,
( next_subocc(sK16,sK13(sK16),tptp0)
| ~ occurrence_of(sK13(sK16),tptp3)
| ~ spl18_4
| spl18_6
| spl18_7
| ~ spl18_9 ),
inference(forward_subsumption_resolution,[],[f2099,f396]) ).
fof(f2102,plain,
( ~ occurrence_of(sK15(sK16),tptp2)
| ~ spl18_1
| ~ spl18_4
| spl18_5
| spl18_6
| spl18_7 ),
inference(forward_subsumption_resolution,[],[f2100,f343]) ).
fof(f2103,plain,
( ~ occurrence_of(sK13(sK16),tptp3)
| ~ spl18_4
| spl18_5
| spl18_6
| spl18_7
| ~ spl18_9 ),
inference(forward_subsumption_resolution,[],[f2101,f374]) ).
fof(f2104,plain,
( ~ spl18_8
| ~ spl18_1
| ~ spl18_4
| spl18_5
| spl18_6
| spl18_7 ),
inference(avatar_split_clause,[],[f2102,f384,f378,f372,f366,f341,f390]) ).
fof(f2105,plain,
( $false
| ~ spl18_1
| ~ spl18_4
| spl18_5
| spl18_6
| spl18_7
| ~ spl18_9 ),
inference(forward_subsumption_resolution,[],[f2103,f343]) ).
fof(f2106,plain,
( ~ spl18_1
| ~ spl18_4
| spl18_5
| spl18_6
| spl18_7
| ~ spl18_9 ),
inference(avatar_contradiction_clause,[],[f2105]) ).
cnf(s1,plain,
( spl18_1
| spl18_2 ),
inference(sat_conversion,[],[f347]) ).
cnf(s3,plain,
~ spl18_2,
inference(sat_conversion,[],[f357]) ).
cnf(s4,plain,
( spl18_2
| spl18_4 ),
inference(sat_conversion,[],[f369]) ).
cnf(s5,plain,
( spl18_2
| ~ spl18_5 ),
inference(sat_conversion,[],[f375]) ).
cnf(s6,plain,
( spl18_2
| ~ spl18_6 ),
inference(sat_conversion,[],[f381]) ).
cnf(s7,plain,
( spl18_2
| ~ spl18_7 ),
inference(sat_conversion,[],[f387]) ).
cnf(s8,plain,
( spl18_2
| spl18_8
| spl18_9 ),
inference(sat_conversion,[],[f397]) ).
cnf(s140,plain,
( ~ spl18_1
| ~ spl18_4
| spl18_5
| spl18_6
| spl18_7
| ~ spl18_8 ),
inference(sat_conversion,[],[f2104]) ).
cnf(s141,plain,
( ~ spl18_1
| ~ spl18_4
| spl18_5
| spl18_6
| spl18_7
| ~ spl18_9 ),
inference(sat_conversion,[],[f2106]) ).
cnf(s142,plain,
~ spl18_7,
inference(rat,[],[s7,s3]) ).
cnf(s143,plain,
~ spl18_6,
inference(rat,[],[s6,s3]) ).
cnf(s144,plain,
~ spl18_5,
inference(rat,[],[s5,s3]) ).
cnf(s145,plain,
spl18_4,
inference(rat,[],[s4,s3]) ).
cnf(s155,plain,
spl18_1,
inference(rat,[],[s1,s3]) ).
cnf(s156,plain,
~ spl18_9,
inference(rat,[],[s141,s145,s142,s143,s144,s155]) ).
cnf(s157,plain,
~ spl18_8,
inference(rat,[],[s140,s145,s142,s143,s144,s155]) ).
cnf(s159,plain,
$false,
inference(rat,[],[s8,s3,s156,s157]) ).
fof(f2107,plain,
$false,
inference(avatar_sat_refutation,[],[s159]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO014+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n002.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 22:24:52 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.48 % (3949122)Will run a generic schedule for satisfiability detection.
% 0.18/0.48 % (3949128)% WARNING: option uhcvi not known.
% 0.18/0.48 % (3949128)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1769865372:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.48 % (3949127)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3750189102_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.48 % (3949130)dis+10_1_sil=32000:sp=arity:random_seed=2859564958:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.48 % (3949129)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=223367762:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.48 % (3949131)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=175698746:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.48 % (3949133)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2086231251:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.48 % (3949132)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3315253215:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.48 % Detected minimum model sizes of [4]
% 0.18/0.48 % Detected maximum model sizes of [max]
% 0.18/0.48 % TRYING [4]
% 0.18/0.48 % TRYING [5]
% 0.18/0.48 % (3949128) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3949122-3949128"...
% 0.18/0.48 % (3949128)...printing done.
% 0.18/0.48 % (3949128)Refutation found. Thanks to Tanya!
% 0.18/0.48 % SZS status Theorem for theBenchmark
% 0.18/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.49 % (3949128)------------------------------
% 0.18/0.49 % (3949128)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.49 % (3949128)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.49 % (3949128)CaDiCaL version: 2.1.3
% 0.18/0.49 % (3949128)Termination reason: Refutation
% 0.18/0.49 % (3949128)Time elapsed: 0.025 s
% 0.18/0.49 % (3949128)Peak memory usage: 13 MB
% 0.18/0.49 % (3949128)Instructions burned: 60 (million)
% 0.18/0.49 % (3949122)Success in time 0.055 s
% 0.18/0.49 % Vampire exiting
%------------------------------------------------------------------------------