%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PRO011+1 : 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 : n006.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:37 PM UTC 2026
% Result : Theorem 0.17s 0.48s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 19
% Syntax : Number of formulae : 111 ( 17 unt; 9 def)
% Number of atoms : 313 ( 8 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 318 ( 116 ~; 114 |; 65 &)
% ( 11 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 22 ( 20 usr; 9 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 138 ( 0 sgn 116 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_02) ).
fof(f8,axiom,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).
fof(f9,axiom,
! [X0] :
( legal(X0)
=> arboreal(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_08) ).
fof(f10,axiom,
! [X0,X1] :
( ( legal(X0)
& earlier(X1,X0) )
=> legal(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_09) ).
fof(f11,axiom,
! [X0,X1] :
( precedes(X0,X1)
<=> ( earlier(X0,X1)
& legal(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_10) ).
fof(f16,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> precedes(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_15) ).
fof(f36,axiom,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2,X3] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& occurrence_of(X2,tptp4)
& next_subocc(X1,X2,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& next_subocc(X2,X3,tptp0)
& leaf_occ(X3,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_35) ).
fof(f38,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_37) ).
fof(f48,axiom,
tptp1 != tptp2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_47) ).
fof(f49,conjecture,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( leaf_occ(X2,X0)
& ( occurrence_of(X2,tptp1)
=> ~ ? [X3] :
( occurrence_of(X3,tptp2)
& subactivity_occurrence(X3,X0)
& min_precedes(X1,X3,tptp0) ) )
& ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0)
& min_precedes(X1,X4,tptp0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f50,negated_conjecture,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( leaf_occ(X2,X0)
& ( occurrence_of(X2,tptp1)
=> ~ ? [X3] :
( occurrence_of(X3,tptp2)
& subactivity_occurrence(X3,X0)
& min_precedes(X1,X3,tptp0) ) )
& ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0)
& min_precedes(X1,X4,tptp0) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f49]) ).
fof(f55,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f3]) ).
fof(f56,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f55]) ).
fof(f63,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f64,plain,
! [X0] :
( arboreal(X0)
| ~ legal(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f65,plain,
! [X0,X1] :
( legal(X1)
| ~ legal(X0)
| ~ earlier(X1,X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f66,plain,
! [X0,X1] :
( legal(X1)
| ~ legal(X0)
| ~ earlier(X1,X0) ),
inference(flattening,[],[f65]) ).
fof(f71,plain,
! [X0,X1,X2] :
( precedes(X0,X1)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f16]) ).
fof(f99,plain,
! [X0] :
( ? [X1,X2,X3] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& occurrence_of(X2,tptp4)
& next_subocc(X1,X2,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& next_subocc(X2,X3,tptp0)
& leaf_occ(X3,X0) )
| ~ occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f100,plain,
? [X0] :
( ! [X1,X2] :
( ~ leaf_occ(X2,X0)
| ( ? [X3] :
( occurrence_of(X3,tptp2)
& subactivity_occurrence(X3,X0)
& min_precedes(X1,X3,tptp0) )
& occurrence_of(X2,tptp1) )
| ( ? [X4] :
( occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0)
& min_precedes(X1,X4,tptp0) )
& occurrence_of(X2,tptp2) ) )
& occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f50]) ).
fof(f101,definition,
! [X0,X1,X2] :
( ( ? [X4] :
( occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0)
& min_precedes(X1,X4,tptp0) )
& occurrence_of(X2,tptp2) )
| ~ sP0(X0,X1,X2) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f102,plain,
? [X0] :
( ! [X1,X2] :
( ~ leaf_occ(X2,X0)
| ( ? [X3] :
( occurrence_of(X3,tptp2)
& subactivity_occurrence(X3,X0)
& min_precedes(X1,X3,tptp0) )
& occurrence_of(X2,tptp1) )
| sP0(X0,X1,X2) )
& occurrence_of(X0,tptp0) ),
inference(definition_folding,[],[f100,f101]) ).
fof(f104,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f63]) ).
fof(f105,plain,
! [X0,X1] :
( ( precedes(X0,X1)
| ~ earlier(X0,X1)
| ~ legal(X1) )
& ( ( earlier(X0,X1)
& legal(X1) )
| ~ precedes(X0,X1) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f106,plain,
! [X0,X1] :
( ( precedes(X0,X1)
| ~ earlier(X0,X1)
| ~ legal(X1) )
& ( ( earlier(X0,X1)
& legal(X1) )
| ~ precedes(X0,X1) ) ),
inference(flattening,[],[f105]) ).
fof(f125,plain,
! [X0] :
( ( occurrence_of(sK15(X0),tptp3)
& root_occ(sK15(X0),X0)
& occurrence_of(sK16(X0),tptp4)
& next_subocc(sK15(X0),sK16(X0),tptp0)
& ( occurrence_of(sK17(X0),tptp1)
| occurrence_of(sK17(X0),tptp2) )
& next_subocc(sK16(X0),sK17(X0),tptp0)
& leaf_occ(sK17(X0),X0) )
| ~ occurrence_of(X0,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15,sK16,sK17]),skolemize(X1,sK15(X0)),skolemize(X2,sK16(X0)),skolemize(X3,sK17(X0))],[f99]) ).
fof(f126,plain,
! [X0,X1,X2] :
( ( ? [X4] :
( occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0)
& min_precedes(X1,X4,tptp0) )
& occurrence_of(X2,tptp2) )
| ~ sP0(X0,X1,X2) ),
inference(nnf_transformation,[],[f101]) ).
fof(f127,plain,
! [X0,X1,X2] :
( ( ? [X3] :
( occurrence_of(X3,tptp1)
& subactivity_occurrence(X3,X0)
& min_precedes(X1,X3,tptp0) )
& occurrence_of(X2,tptp2) )
| ~ sP0(X0,X1,X2) ),
inference(rectify,[],[f126]) ).
fof(f128,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK18(X0,X1),tptp1)
& subactivity_occurrence(sK18(X0,X1),X0)
& min_precedes(X1,sK18(X0,X1),tptp0)
& occurrence_of(X2,tptp2) )
| ~ sP0(X0,X1,X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK18]),skolemize(X3,sK18(X0,X1))],[f127]) ).
fof(f129,plain,
( ! [X1,X2] :
( ~ leaf_occ(X2,sK19)
| ( occurrence_of(sK20(X1),tptp2)
& subactivity_occurrence(sK20(X1),sK19)
& min_precedes(X1,sK20(X1),tptp0)
& occurrence_of(X2,tptp1) )
| sP0(sK19,X1,X2) )
& occurrence_of(sK19,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19,sK20]),skolemize(X0,sK19),skolemize(X3,sK20(X1))],[f102]) ).
fof(f134,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f56]) ).
fof(f139,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ arboreal(X0)
| atomic(X1) ),
inference(cnf_transformation,[],[f104]) ).
fof(f141,plain,
! [X0] :
( ~ legal(X0)
| arboreal(X0) ),
inference(cnf_transformation,[],[f64]) ).
fof(f142,plain,
! [X0,X1] :
( ~ earlier(X1,X0)
| ~ legal(X0)
| legal(X1) ),
inference(cnf_transformation,[],[f66]) ).
fof(f143,plain,
! [X0,X1] :
( ~ precedes(X0,X1)
| legal(X1) ),
inference(cnf_transformation,[],[f106]) ).
fof(f144,plain,
! [X0,X1] :
( ~ precedes(X0,X1)
| earlier(X0,X1) ),
inference(cnf_transformation,[],[f106]) ).
fof(f155,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| precedes(X0,X1) ),
inference(cnf_transformation,[],[f71]) ).
fof(f193,plain,
! [X0] :
( leaf_occ(sK17(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f125]) ).
fof(f201,plain,
~ atomic(tptp0),
inference(cnf_transformation,[],[f38]) ).
fof(f211,plain,
tptp1 != tptp2,
inference(cnf_transformation,[],[f48]) ).
fof(f212,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| occurrence_of(X2,tptp2) ),
inference(cnf_transformation,[],[f128]) ).
fof(f213,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| min_precedes(X1,sK18(X0,X1),tptp0) ),
inference(cnf_transformation,[],[f128]) ).
fof(f216,plain,
occurrence_of(sK19,tptp0),
inference(cnf_transformation,[],[f129]) ).
fof(f217,plain,
! [X2,X1] :
( sP0(sK19,X1,X2)
| occurrence_of(X2,tptp1)
| ~ leaf_occ(X2,sK19) ),
inference(cnf_transformation,[],[f129]) ).
fof(f218,plain,
! [X2,X1] :
( min_precedes(X1,sK20(X1),tptp0)
| sP0(sK19,X1,X2)
| ~ leaf_occ(X2,sK19) ),
inference(cnf_transformation,[],[f129]) ).
fof(f226,plain,
( ~ arboreal(sK19)
| atomic(tptp0) ),
inference(resolution,[],[f139,f216]) ).
fof(f228,plain,
~ arboreal(sK19),
inference(forward_subsumption_resolution,[],[f226,f201]) ).
fof(f267,plain,
! [X0,X1] :
( occurrence_of(X0,tptp2)
| min_precedes(X1,sK20(X1),tptp0)
| ~ leaf_occ(X0,sK19) ),
inference(resolution,[],[f212,f218]) ).
fof(f276,definition,
( spl21_4
<=> ! [X1] : legal(X1) ),
introduced(definition,[new_symbols(definition,[spl21_4])],[avatar_definition]) ).
fof(f277,plain,
( ! [X1] : legal(X1)
| ~ spl21_4 ),
inference(avatar_component_clause,[],[f276]) ).
fof(f279,definition,
( spl21_5
<=> ! [X0] :
( occurrence_of(X0,tptp2)
| ~ leaf_occ(X0,sK19) ) ),
introduced(definition,[new_symbols(definition,[spl21_5])],[avatar_definition]) ).
fof(f280,plain,
( ! [X0] :
( ~ leaf_occ(X0,sK19)
| occurrence_of(X0,tptp2) )
| ~ spl21_5 ),
inference(avatar_component_clause,[],[f279]) ).
fof(f287,definition,
( spl21_7
<=> ! [X1] : legal(sK20(X1)) ),
introduced(definition,[new_symbols(definition,[spl21_7])],[avatar_definition]) ).
fof(f288,plain,
( ! [X1] : legal(sK20(X1))
| ~ spl21_7 ),
inference(avatar_component_clause,[],[f287]) ).
fof(f291,definition,
( spl21_8
<=> ! [X1] : earlier(X1,sK20(X1)) ),
introduced(definition,[new_symbols(definition,[spl21_8])],[avatar_definition]) ).
fof(f292,plain,
( ! [X1] : earlier(X1,sK20(X1))
| ~ spl21_8 ),
inference(avatar_component_clause,[],[f291]) ).
fof(f295,definition,
( spl21_9
<=> ! [X1] : precedes(X1,sK20(X1)) ),
introduced(definition,[new_symbols(definition,[spl21_9])],[avatar_definition]) ).
fof(f296,plain,
( ! [X1] : precedes(X1,sK20(X1))
| ~ spl21_9 ),
inference(avatar_component_clause,[],[f295]) ).
fof(f307,definition,
( spl21_12
<=> ! [X1] : min_precedes(X1,sK20(X1),tptp0) ),
introduced(definition,[new_symbols(definition,[spl21_12])],[avatar_definition]) ).
fof(f308,plain,
( ! [X1] : min_precedes(X1,sK20(X1),tptp0)
| ~ spl21_12 ),
inference(avatar_component_clause,[],[f307]) ).
fof(f309,plain,
( spl21_12
| spl21_5 ),
inference(avatar_split_clause,[],[f267,f279,f307]) ).
fof(f310,plain,
( occurrence_of(sK17(sK19),tptp2)
| ~ occurrence_of(sK19,tptp0)
| ~ spl21_5 ),
inference(resolution,[],[f280,f193]) ).
fof(f311,plain,
( occurrence_of(sK17(sK19),tptp2)
| ~ spl21_5 ),
inference(forward_subsumption_resolution,[],[f310,f216]) ).
fof(f344,plain,
( ! [X0] :
( ~ occurrence_of(sK17(sK19),X0)
| tptp2 = X0 )
| ~ spl21_5 ),
inference(resolution,[],[f134,f311]) ).
fof(f415,definition,
( spl21_22
<=> ! [X1] :
( occurrence_of(X1,tptp1)
| ~ leaf_occ(X1,sK19) ) ),
introduced(definition,[new_symbols(definition,[spl21_22])],[avatar_definition]) ).
fof(f416,plain,
( ! [X1] :
( ~ leaf_occ(X1,sK19)
| occurrence_of(X1,tptp1) )
| ~ spl21_22 ),
inference(avatar_component_clause,[],[f415]) ).
fof(f469,plain,
( occurrence_of(sK17(sK19),tptp1)
| ~ occurrence_of(sK19,tptp0)
| ~ spl21_22 ),
inference(resolution,[],[f416,f193]) ).
fof(f470,plain,
( occurrence_of(sK17(sK19),tptp1)
| ~ spl21_22 ),
inference(forward_subsumption_resolution,[],[f469,f216]) ).
fof(f475,plain,
( tptp1 = tptp2
| ~ spl21_5
| ~ spl21_22 ),
inference(resolution,[],[f470,f344]) ).
fof(f481,plain,
( $false
| ~ spl21_5
| ~ spl21_22 ),
inference(forward_subsumption_resolution,[],[f475,f211]) ).
fof(f482,plain,
( ~ spl21_5
| ~ spl21_22 ),
inference(avatar_contradiction_clause,[],[f481]) ).
fof(f542,plain,
! [X0,X1] :
( min_precedes(X0,sK18(sK19,X0),tptp0)
| occurrence_of(X1,tptp1)
| ~ leaf_occ(X1,sK19) ),
inference(resolution,[],[f213,f217]) ).
fof(f581,definition,
( spl21_42
<=> ! [X0] : min_precedes(X0,sK18(sK19,X0),tptp0) ),
introduced(definition,[new_symbols(definition,[spl21_42])],[avatar_definition]) ).
fof(f582,plain,
( ! [X0] : min_precedes(X0,sK18(sK19,X0),tptp0)
| ~ spl21_42 ),
inference(avatar_component_clause,[],[f581]) ).
fof(f583,plain,
( spl21_22
| spl21_42 ),
inference(avatar_split_clause,[],[f542,f581,f415]) ).
fof(f586,plain,
( ! [X0] : arboreal(X0)
| ~ spl21_4 ),
inference(resolution,[],[f277,f141]) ).
fof(f594,plain,
( $false
| ~ spl21_4 ),
inference(resolution,[],[f586,f228]) ).
fof(f595,plain,
~ spl21_4,
inference(avatar_contradiction_clause,[],[f594]) ).
fof(f660,plain,
( ! [X0] : earlier(X0,sK20(X0))
| ~ spl21_9 ),
inference(resolution,[],[f296,f144]) ).
fof(f661,plain,
( ! [X0] : legal(sK20(X0))
| ~ spl21_9 ),
inference(resolution,[],[f296,f143]) ).
fof(f662,plain,
( spl21_8
| ~ spl21_9 ),
inference(avatar_split_clause,[],[f660,f295,f291]) ).
fof(f671,plain,
( ! [X0] :
( ~ legal(sK20(X0))
| legal(X0) )
| ~ spl21_8 ),
inference(resolution,[],[f292,f142]) ).
fof(f673,plain,
( ! [X0] : legal(X0)
| ~ spl21_7
| ~ spl21_8 ),
inference(forward_subsumption_resolution,[],[f671,f288]) ).
fof(f674,plain,
( spl21_4
| ~ spl21_7
| ~ spl21_8 ),
inference(avatar_split_clause,[],[f673,f291,f287,f276]) ).
fof(f676,plain,
( spl21_7
| ~ spl21_9 ),
inference(avatar_split_clause,[],[f661,f295,f287]) ).
fof(f714,plain,
( ! [X0] : precedes(X0,sK20(X0))
| ~ spl21_12 ),
inference(resolution,[],[f308,f155]) ).
fof(f722,plain,
( spl21_9
| ~ spl21_12 ),
inference(avatar_split_clause,[],[f714,f307,f295]) ).
fof(f726,plain,
( ! [X0] : precedes(X0,sK18(sK19,X0))
| ~ spl21_42 ),
inference(resolution,[],[f582,f155]) ).
fof(f735,plain,
( ! [X0] : earlier(X0,sK18(sK19,X0))
| ~ spl21_42 ),
inference(resolution,[],[f726,f144]) ).
fof(f736,plain,
( ! [X0] : legal(sK18(sK19,X0))
| ~ spl21_42 ),
inference(resolution,[],[f726,f143]) ).
fof(f741,plain,
( ! [X0] :
( ~ legal(sK18(sK19,X0))
| legal(X0) )
| ~ spl21_42 ),
inference(resolution,[],[f735,f142]) ).
fof(f743,plain,
( ! [X0] : legal(X0)
| ~ spl21_42 ),
inference(forward_subsumption_resolution,[],[f741,f736]) ).
fof(f744,plain,
( spl21_4
| ~ spl21_42 ),
inference(avatar_split_clause,[],[f743,f581,f276]) ).
cnf(s11,plain,
( spl21_5
| spl21_12 ),
inference(sat_conversion,[],[f309]) ).
cnf(s31,plain,
( ~ spl21_5
| ~ spl21_22 ),
inference(sat_conversion,[],[f482]) ).
cnf(s41,plain,
( spl21_22
| spl21_42 ),
inference(sat_conversion,[],[f583]) ).
cnf(s43,plain,
~ spl21_4,
inference(sat_conversion,[],[f595]) ).
cnf(s47,plain,
( spl21_8
| ~ spl21_9 ),
inference(sat_conversion,[],[f662]) ).
cnf(s48,plain,
( spl21_4
| ~ spl21_7
| ~ spl21_8 ),
inference(sat_conversion,[],[f674]) ).
cnf(s49,plain,
( spl21_7
| ~ spl21_9 ),
inference(sat_conversion,[],[f676]) ).
cnf(s52,plain,
( spl21_9
| ~ spl21_12 ),
inference(sat_conversion,[],[f722]) ).
cnf(s53,plain,
( spl21_4
| ~ spl21_42 ),
inference(sat_conversion,[],[f744]) ).
cnf(s54,plain,
~ spl21_42,
inference(rat,[],[s53,s43]) ).
cnf(s55,plain,
spl21_22,
inference(rat,[],[s41,s54]) ).
cnf(s57,plain,
~ spl21_5,
inference(rat,[],[s31,s55]) ).
cnf(s82,plain,
spl21_12,
inference(rat,[],[s11,s57]) ).
cnf(s83,plain,
spl21_9,
inference(rat,[],[s52,s82]) ).
cnf(s84,plain,
spl21_7,
inference(rat,[],[s49,s83]) ).
cnf(s85,plain,
spl21_8,
inference(rat,[],[s47,s83]) ).
cnf(s86,plain,
$false,
inference(rat,[],[s48,s43,s85,s84]) ).
fof(f745,plain,
$false,
inference(avatar_sat_refutation,[],[s86]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO011+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38 % Computer : n006.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.05/0.38 % CPULimit : 300
% 0.05/0.38 % WCLimit : 300
% 0.05/0.38 % DateTime : Sun Sep 27 22:20:56 UTC 2026
% 0.05/0.38 % CPUTime :
% 0.05/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.05/0.41 Running first-order model finding
% 0.05/0.41 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.17/0.48 % (3383337)Will run a generic schedule for satisfiability detection.
% 0.17/0.48 % (3383344)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=926851912:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.48 % (3383343)% WARNING: option uhcvi not known.
% 0.17/0.48 % (3383342)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3117686635_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.48 % (3383343)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2255152024:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.48 % (3383345)dis+10_1_sil=32000:sp=arity:random_seed=3589452324:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.48 % (3383346)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1993762423:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.48 % (3383347)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1193718937:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.48 % (3383348)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3853031923:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.48 % Detected minimum model sizes of [4]
% 0.17/0.48 % Detected maximum model sizes of [max]
% 0.17/0.48 % TRYING [4]
% 0.17/0.48 % (3383345) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3383337-3383345"...
% 0.17/0.48 % (3383343) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3383337-3383343"...
% 0.17/0.48 % (3383345)...printing done.
% 0.17/0.48 % (3383343)...printing done.
% 0.17/0.48 % (3383347) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3383337-3383347"...
% 0.17/0.48 % (3383345)Refutation found. Thanks to Tanya!
% 0.17/0.48 % SZS status Theorem for theBenchmark
% 0.17/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.48 % (3383345)------------------------------
% 0.17/0.48 % (3383345)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.48 % (3383345)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.48 % (3383345)CaDiCaL version: 2.1.3
% 0.17/0.48 % (3383345)Termination reason: Refutation
% 0.17/0.48 % (3383345)Time elapsed: 0.015 s
% 0.17/0.48 % (3383345)Peak memory usage: 13 MB
% 0.17/0.48 % (3383345)Instructions burned: 19 (million)
% 0.17/0.48 % (3383337)Success in time 0.058 s
% 0.17/0.48 % Vampire exiting
%------------------------------------------------------------------------------