%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET795+4 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 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 : Tue Sep 29 12:41:57 PM UTC 2026
% Result : Theorem 2.59s 1.28s
% Output : Refutation 3.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of formulae : 73 ( 11 unt; 3 def)
% Number of atoms : 284 ( 24 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 325 ( 114 ~; 115 |; 65 &)
% ( 9 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 4 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 149 ( 0 sgn 137 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( X0 = X1
| X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair) ).
fof(f12,axiom,
! [X0,X1] :
( order(X0,X1)
<=> ( ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) )
& ! [X2,X3] :
( ( member(X2,X1)
& member(X3,X1) )
=> ( ( apply(X0,X2,X3)
& apply(X0,X3,X2) )
=> X2 = X3 ) )
& ! [X2,X3,X4] :
( ( member(X2,X1)
& member(X3,X1)
& member(X4,X1) )
=> ( ( apply(X0,X2,X3)
& apply(X0,X3,X4) )
=> apply(X0,X2,X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).
fof(f14,axiom,
! [X0,X1,X2] :
( upper_bound(X2,X0,X1)
<=> ! [X3] :
( member(X3,X1)
=> apply(X0,X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',upper_bound) ).
fof(f20,axiom,
! [X0,X1,X2,X3] :
( least_upper_bound(X0,X1,X2,X3)
<=> ( member(X0,X1)
& upper_bound(X0,X2,X1)
& ! [X4] :
( ( member(X4,X3)
& upper_bound(X4,X2,X1) )
=> apply(X2,X0,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',least_upper_bound) ).
fof(f22,conjecture,
! [X0,X1,X2,X3] :
( ( order(X0,X1)
& member(X2,X1)
& member(X3,X1)
& apply(X0,X2,X3) )
=> least_upper_bound(X3,unordered_pair(X2,X3),X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIV7) ).
fof(f23,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( order(X0,X1)
& member(X2,X1)
& member(X3,X1)
& apply(X0,X2,X3) )
=> least_upper_bound(X3,unordered_pair(X2,X3),X0,X1) ),
inference(negated_conjecture,[status(cth)],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( order(X0,X1)
<=> ( ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) )
& ! [X3,X4] :
( ( member(X3,X1)
& member(X4,X1) )
=> ( ( apply(X0,X3,X4)
& apply(X0,X4,X3) )
=> X3 = X4 ) )
& ! [X5,X6,X7] :
( ( member(X5,X1)
& member(X6,X1)
& member(X7,X1) )
=> ( ( apply(X0,X5,X6)
& apply(X0,X6,X7) )
=> apply(X0,X5,X7) ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f25,plain,
! [X0,X1,X2,X3] :
( ( member(X0,X1)
& upper_bound(X0,X2,X1)
& ! [X4] :
( ( member(X4,X3)
& upper_bound(X4,X2,X1) )
=> apply(X2,X0,X4) ) )
=> least_upper_bound(X0,X1,X2,X3) ),
inference(unused_predicate_definition_removal,[],[f20]) ).
fof(f26,plain,
! [X0,X1] :
( order(X0,X1)
=> ( ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) )
& ! [X3,X4] :
( ( member(X3,X1)
& member(X4,X1) )
=> ( ( apply(X0,X3,X4)
& apply(X0,X4,X3) )
=> X3 = X4 ) )
& ! [X5,X6,X7] :
( ( member(X5,X1)
& member(X6,X1)
& member(X7,X1) )
=> ( ( apply(X0,X5,X6)
& apply(X0,X6,X7) )
=> apply(X0,X5,X7) ) ) ) ),
inference(unused_predicate_definition_removal,[],[f24]) ).
fof(f29,plain,
! [X0,X1] :
( ( ! [X2] :
( apply(X0,X2,X2)
| ~ member(X2,X1) )
& ! [X3,X4] :
( X3 = X4
| ~ apply(X0,X3,X4)
| ~ apply(X0,X4,X3)
| ~ member(X3,X1)
| ~ member(X4,X1) )
& ! [X5,X6,X7] :
( apply(X0,X5,X7)
| ~ apply(X0,X5,X6)
| ~ apply(X0,X6,X7)
| ~ member(X5,X1)
| ~ member(X6,X1)
| ~ member(X7,X1) ) )
| ~ order(X0,X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f30,plain,
! [X0,X1] :
( ( ! [X2] :
( apply(X0,X2,X2)
| ~ member(X2,X1) )
& ! [X3,X4] :
( X3 = X4
| ~ apply(X0,X3,X4)
| ~ apply(X0,X4,X3)
| ~ member(X3,X1)
| ~ member(X4,X1) )
& ! [X5,X6,X7] :
( apply(X0,X5,X7)
| ~ apply(X0,X5,X6)
| ~ apply(X0,X6,X7)
| ~ member(X5,X1)
| ~ member(X6,X1)
| ~ member(X7,X1) ) )
| ~ order(X0,X1) ),
inference(flattening,[],[f29]) ).
fof(f31,plain,
! [X0,X1,X2] :
( upper_bound(X2,X0,X1)
<=> ! [X3] :
( apply(X0,X3,X2)
| ~ member(X3,X1) ) ),
inference(ennf_transformation,[],[f14]) ).
fof(f32,plain,
! [X0,X1,X2,X3] :
( least_upper_bound(X0,X1,X2,X3)
| ~ member(X0,X1)
| ~ upper_bound(X0,X2,X1)
| ? [X4] :
( ~ apply(X2,X0,X4)
& member(X4,X3)
& upper_bound(X4,X2,X1) ) ),
inference(ennf_transformation,[],[f25]) ).
fof(f33,plain,
! [X0,X1,X2,X3] :
( least_upper_bound(X0,X1,X2,X3)
| ~ member(X0,X1)
| ~ upper_bound(X0,X2,X1)
| ? [X4] :
( ~ apply(X2,X0,X4)
& member(X4,X3)
& upper_bound(X4,X2,X1) ) ),
inference(flattening,[],[f32]) ).
fof(f34,plain,
? [X0,X1,X2,X3] :
( ~ least_upper_bound(X3,unordered_pair(X2,X3),X0,X1)
& order(X0,X1)
& member(X2,X1)
& member(X3,X1)
& apply(X0,X2,X3) ),
inference(ennf_transformation,[],[f23]) ).
fof(f35,plain,
? [X0,X1,X2,X3] :
( ~ least_upper_bound(X3,unordered_pair(X2,X3),X0,X1)
& order(X0,X1)
& member(X2,X1)
& member(X3,X1)
& apply(X0,X2,X3) ),
inference(flattening,[],[f34]) ).
fof(f47,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X1
& X0 != X2 ) )
& ( X0 = X1
| X0 = X2
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f48,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X1
& X0 != X2 ) )
& ( X0 = X1
| X0 = X2
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f47]) ).
fof(f55,plain,
! [X0,X1,X2] :
( ( upper_bound(X2,X0,X1)
| ? [X3] :
( ~ apply(X0,X3,X2)
& member(X3,X1) ) )
& ( ! [X3] :
( apply(X0,X3,X2)
| ~ member(X3,X1) )
| ~ upper_bound(X2,X0,X1) ) ),
inference(nnf_transformation,[],[f31]) ).
fof(f56,plain,
! [X0,X1,X2] :
( ( upper_bound(X2,X0,X1)
| ? [X3] :
( ~ apply(X0,X3,X2)
& member(X3,X1) ) )
& ( ! [X4] :
( apply(X0,X4,X2)
| ~ member(X4,X1) )
| ~ upper_bound(X2,X0,X1) ) ),
inference(rectify,[],[f55]) ).
fof(f57,plain,
! [X0,X1,X2] :
( ( upper_bound(X2,X0,X1)
| ( ~ apply(X0,sK3(X0,X1,X2),X2)
& member(sK3(X0,X1,X2),X1) ) )
& ( ! [X4] :
( apply(X0,X4,X2)
| ~ member(X4,X1) )
| ~ upper_bound(X2,X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X3,sK3(X0,X1,X2))],[f56]) ).
fof(f58,plain,
! [X0,X1,X2,X3] :
( least_upper_bound(X0,X1,X2,X3)
| ~ member(X0,X1)
| ~ upper_bound(X0,X2,X1)
| ( ~ apply(X2,X0,sK4(X0,X1,X2,X3))
& member(sK4(X0,X1,X2,X3),X3)
& upper_bound(sK4(X0,X1,X2,X3),X2,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X4,sK4(X0,X1,X2,X3))],[f33]) ).
fof(f59,plain,
( ~ least_upper_bound(sK8,unordered_pair(sK7,sK8),sK5,sK6)
& order(sK5,sK6)
& member(sK7,sK6)
& member(sK8,sK6)
& apply(sK5,sK7,sK8) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8]),skolemize(X0,sK5),skolemize(X1,sK6),skolemize(X2,sK7),skolemize(X3,sK8)],[f35]) ).
fof(f77,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f48]) ).
fof(f78,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| X0 != X2 ),
inference(cnf_transformation,[],[f48]) ).
fof(f88,plain,
! [X2,X0,X1] :
( apply(X0,X2,X2)
| ~ member(X2,X1)
| ~ order(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f89,plain,
! [X2,X0,X1,X4] :
( apply(X0,X4,X2)
| ~ member(X4,X1)
| ~ upper_bound(X2,X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f90,plain,
! [X2,X0,X1] :
( upper_bound(X2,X0,X1)
| member(sK3(X0,X1,X2),X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f91,plain,
! [X2,X0,X1] :
( upper_bound(X2,X0,X1)
| ~ apply(X0,sK3(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f57]) ).
fof(f92,plain,
! [X2,X3,X0,X1] :
( upper_bound(sK4(X0,X1,X2,X3),X2,X1)
| ~ member(X0,X1)
| ~ upper_bound(X0,X2,X1)
| least_upper_bound(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f58]) ).
fof(f94,plain,
! [X2,X3,X0,X1] :
( ~ apply(X2,X0,sK4(X0,X1,X2,X3))
| ~ member(X0,X1)
| ~ upper_bound(X0,X2,X1)
| least_upper_bound(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f58]) ).
fof(f95,plain,
apply(sK5,sK7,sK8),
inference(cnf_transformation,[],[f59]) ).
fof(f96,plain,
member(sK8,sK6),
inference(cnf_transformation,[],[f59]) ).
fof(f98,plain,
order(sK5,sK6),
inference(cnf_transformation,[],[f59]) ).
fof(f99,plain,
~ least_upper_bound(sK8,unordered_pair(sK7,sK8),sK5,sK6),
inference(cnf_transformation,[],[f59]) ).
fof(f102,plain,
! [X2,X1] : member(X2,unordered_pair(X1,X2)),
inference(equality_resolution,[],[f78]) ).
fof(f143,definition,
( spl9_2
<=> upper_bound(sK8,sK5,unordered_pair(sK7,sK8)) ),
introduced(definition,[new_symbols(definition,[spl9_2])],[avatar_definition]) ).
fof(f144,plain,
( upper_bound(sK8,sK5,unordered_pair(sK7,sK8))
| ~ spl9_2 ),
inference(avatar_component_clause,[],[f143]) ).
fof(f145,plain,
( ~ upper_bound(sK8,sK5,unordered_pair(sK7,sK8))
| spl9_2 ),
inference(avatar_component_clause,[],[f143]) ).
fof(f147,plain,
( ~ apply(sK5,sK3(sK5,unordered_pair(sK7,sK8),sK8),sK8)
| spl9_2 ),
inference(resolution,[],[f145,f91]) ).
fof(f148,plain,
( member(sK3(sK5,unordered_pair(sK7,sK8),sK8),unordered_pair(sK7,sK8))
| spl9_2 ),
inference(resolution,[],[f145,f90]) ).
fof(f151,plain,
( sK8 = sK3(sK5,unordered_pair(sK7,sK8),sK8)
| sK7 = sK3(sK5,unordered_pair(sK7,sK8),sK8)
| spl9_2 ),
inference(resolution,[],[f148,f77]) ).
fof(f153,definition,
( spl9_3
<=> sK7 = sK3(sK5,unordered_pair(sK7,sK8),sK8) ),
introduced(definition,[new_symbols(definition,[spl9_3])],[avatar_definition]) ).
fof(f155,plain,
( sK7 = sK3(sK5,unordered_pair(sK7,sK8),sK8)
| ~ spl9_3 ),
inference(avatar_component_clause,[],[f153]) ).
fof(f157,definition,
( spl9_4
<=> sK8 = sK3(sK5,unordered_pair(sK7,sK8),sK8) ),
introduced(definition,[new_symbols(definition,[spl9_4])],[avatar_definition]) ).
fof(f159,plain,
( sK8 = sK3(sK5,unordered_pair(sK7,sK8),sK8)
| ~ spl9_4 ),
inference(avatar_component_clause,[],[f157]) ).
fof(f160,plain,
( spl9_3
| spl9_4
| spl9_2 ),
inference(avatar_split_clause,[],[f151,f143,f157,f153]) ).
fof(f161,plain,
! [X2,X3,X0,X1,X4] :
( least_upper_bound(X0,X1,X2,X3)
| ~ upper_bound(X0,X2,X1)
| ~ member(X0,X1)
| ~ member(X0,X4)
| ~ upper_bound(sK4(X0,X1,X2,X3),X2,X4) ),
inference(resolution,[],[f94,f89]) ).
fof(f163,plain,
( ~ apply(sK5,sK7,sK8)
| spl9_2
| ~ spl9_3 ),
inference(superposition,[],[f147,f155]) ).
fof(f164,plain,
( $false
| spl9_2
| ~ spl9_3 ),
inference(forward_subsumption_resolution,[],[f163,f95]) ).
fof(f165,plain,
( spl9_2
| ~ spl9_3 ),
inference(avatar_contradiction_clause,[],[f164]) ).
fof(f174,plain,
( ~ apply(sK5,sK8,sK8)
| spl9_2
| ~ spl9_4 ),
inference(superposition,[],[f147,f159]) ).
fof(f194,plain,
( ! [X0] :
( ~ order(sK5,X0)
| ~ member(sK8,X0) )
| spl9_2
| ~ spl9_4 ),
inference(resolution,[],[f174,f88]) ).
fof(f210,plain,
( ~ member(sK8,sK6)
| spl9_2
| ~ spl9_4 ),
inference(resolution,[],[f194,f98]) ).
fof(f211,plain,
( $false
| spl9_2
| ~ spl9_4 ),
inference(forward_subsumption_resolution,[],[f210,f96]) ).
fof(f212,plain,
( spl9_2
| ~ spl9_4 ),
inference(avatar_contradiction_clause,[],[f211]) ).
fof(f264,plain,
! [X0] :
( ~ upper_bound(sK8,sK5,unordered_pair(sK7,sK8))
| ~ member(sK8,unordered_pair(sK7,sK8))
| ~ member(sK8,X0)
| ~ upper_bound(sK4(sK8,unordered_pair(sK7,sK8),sK5,sK6),sK5,X0) ),
inference(resolution,[],[f161,f99]) ).
fof(f265,plain,
( ! [X0] :
( ~ member(sK8,unordered_pair(sK7,sK8))
| ~ member(sK8,X0)
| ~ upper_bound(sK4(sK8,unordered_pair(sK7,sK8),sK5,sK6),sK5,X0) )
| ~ spl9_2 ),
inference(forward_subsumption_resolution,[],[f264,f144]) ).
fof(f266,plain,
( ! [X0] :
( ~ upper_bound(sK4(sK8,unordered_pair(sK7,sK8),sK5,sK6),sK5,X0)
| ~ member(sK8,X0) )
| ~ spl9_2 ),
inference(forward_subsumption_resolution,[],[f265,f102]) ).
fof(f268,plain,
( ~ member(sK8,unordered_pair(sK7,sK8))
| ~ member(sK8,unordered_pair(sK7,sK8))
| ~ upper_bound(sK8,sK5,unordered_pair(sK7,sK8))
| least_upper_bound(sK8,unordered_pair(sK7,sK8),sK5,sK6)
| ~ spl9_2 ),
inference(resolution,[],[f266,f92]) ).
fof(f271,plain,
( ~ member(sK8,unordered_pair(sK7,sK8))
| ~ upper_bound(sK8,sK5,unordered_pair(sK7,sK8))
| least_upper_bound(sK8,unordered_pair(sK7,sK8),sK5,sK6)
| ~ spl9_2 ),
inference(duplicate_literal_removal,[],[f268]) ).
fof(f272,plain,
( ~ upper_bound(sK8,sK5,unordered_pair(sK7,sK8))
| least_upper_bound(sK8,unordered_pair(sK7,sK8),sK5,sK6)
| ~ spl9_2 ),
inference(forward_subsumption_resolution,[],[f271,f102]) ).
fof(f273,plain,
( least_upper_bound(sK8,unordered_pair(sK7,sK8),sK5,sK6)
| ~ spl9_2 ),
inference(forward_subsumption_resolution,[],[f272,f144]) ).
fof(f274,plain,
( $false
| ~ spl9_2 ),
inference(forward_subsumption_resolution,[],[f273,f99]) ).
fof(f275,plain,
~ spl9_2,
inference(avatar_contradiction_clause,[],[f274]) ).
cnf(s2,plain,
( spl9_2
| spl9_3
| spl9_4 ),
inference(sat_conversion,[],[f160]) ).
cnf(s3,plain,
( spl9_2
| ~ spl9_3 ),
inference(sat_conversion,[],[f165]) ).
cnf(s4,plain,
( spl9_2
| ~ spl9_4 ),
inference(sat_conversion,[],[f212]) ).
cnf(s5,plain,
~ spl9_2,
inference(sat_conversion,[],[f275]) ).
cnf(s6,plain,
~ spl9_4,
inference(rat,[],[s4,s5]) ).
cnf(s7,plain,
~ spl9_3,
inference(rat,[],[s3,s5]) ).
cnf(s8,plain,
$false,
inference(rat,[],[s2,s6,s7,s5]) ).
fof(f276,plain,
$false,
inference(avatar_sat_refutation,[],[s8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET795+4 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n004.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 02:50:07 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.59/1.28 % (4102416)Detected formulas, will run a generic FOF schedule.
% 2.59/1.28 % (4102556)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2921678019:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.59/1.28 % (4102561)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2059509931:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.59/1.28 % (4102559)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=437139115:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.59/1.28 % (4102552)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3087077215:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.59/1.28 % (4102554)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2944864500:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.59/1.28 % (4102557)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3435671837:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.59/1.28 % (4102557)Refutation not found, incomplete strategy
% 2.59/1.28 % (4102557)------------------------------
% 2.59/1.28 % (4102557)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.59/1.28 % (4102557)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.59/1.28 % (4102557)CaDiCaL version: 2.1.3
% 2.59/1.28 % (4102557)Termination reason: Refutation not found, incomplete strategy
% 2.59/1.28 % (4102557)Time elapsed: 0.002 s
% 2.59/1.28 % (4102557)Peak memory usage: 88 MB
% 2.59/1.28 % (4102557)Instructions burned: 1 (million)
% 2.59/1.28 % (4102564)dis-21_1_sil=8000:lcm=predicate:random_seed=1352811785:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.59/1.28 % (4102561)First to succeed.
% 2.59/1.28 % (4102561)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4102416"
% 2.59/1.28 % (4102559)Also succeeded, but the first one will report.
% 2.59/1.28 % (4102564)Instruction limit reached!
% 2.59/1.28 % (4102564)------------------------------
% 2.59/1.28 % (4102564)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.59/1.28 % (4102564)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.59/1.28 % (4102564)CaDiCaL version: 2.1.3
% 2.59/1.28 % (4102564)Termination reason: Instruction limit
% 2.59/1.28 % (4102564)Termination phase: Saturation
% 2.59/1.28 % (4102564)Time elapsed: 0.049 s
% 2.59/1.28 % (4102564)Peak memory usage: 88 MB
% 2.59/1.28 % (4102564)Instructions burned: 131 (million)
% 2.59/1.28 % (4102587)lrs+10_1_sil=8000:sp=occurrence:random_seed=3130105123:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.59/1.28 % (4102587)Also succeeded, but the first one will report.
% 2.59/1.28 % (4102557)------------------------------
% 2.59/1.28 % (4102557)------------------------------
% 2.59/1.28 % (4102561)Refutation found. Thanks to Tanya!
% 2.59/1.28 % SZS status Theorem for theBenchmark
% 2.59/1.28 % SZS output start Proof for theBenchmark
% See solution above
% 3.36/1.38 % (4102561)------------------------------
% 3.36/1.38 % (4102561)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.36/1.38 % (4102561)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.36/1.38 % (4102561)CaDiCaL version: 2.1.3
% 3.36/1.38 % (4102561)Termination reason: Refutation
% 3.36/1.38 % (4102561)Time elapsed: 0.011 s
% 3.36/1.38 % (4102561)Peak memory usage: 89 MB
% 3.36/1.38 % (4102561)Instructions burned: 13 (million)
% 3.36/1.38 % (4102561)------------------------------
% 3.36/1.38 % (4102561)------------------------------
% 3.36/1.38 % (4102416)Success in time 0.421 s
% 3.36/1.38 % Vampire exiting
%------------------------------------------------------------------------------