%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU354+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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:52:59 PM UTC 2026
% Result : Theorem 3.88s 1.14s
% Output : Refutation 3.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 12
% Syntax : Number of formulae : 86 ( 25 unt; 3 def)
% Number of atoms : 247 ( 87 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 267 ( 106 ~; 101 |; 44 &)
% ( 9 <=>; 6 =>; 0 <=; 1 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 3 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 3 con; 0-3 aty)
% Number of variables : 82 ( 0 sgn 70 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f74,axiom,
! [X0,X1] :
( ( strict_latt_str(X1)
& latt_str(X1) )
=> ( X1 = boole_lattice(X0)
<=> ( the_carrier(X1) = powerset(X0)
& ! [X2] :
( element(X2,powerset(X0))
=> ! [X3] :
( element(X3,powerset(X0))
=> ( apply_binary(the_L_join(X1),X2,X3) = subset_union2(X0,X2,X3)
& apply_binary(the_L_meet(X1),X2,X3) = subset_intersection2(X0,X2,X3) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_lattice3) ).
fof(f102,axiom,
! [X0,X1] :
( element(X1,X0)
=> ( proper_element(X1,X0)
<=> X1 != union(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tex_2) ).
fof(f121,axiom,
! [X0] : cast_to_subset(X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_subset_1) ).
fof(f166,axiom,
! [X0] :
( strict_latt_str(boole_lattice(X0))
& latt_str(boole_lattice(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_lattice3) ).
fof(f187,axiom,
! [X0] : element(cast_to_subset(X0),powerset(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_subset_1) ).
fof(f277,axiom,
! [X0] :
( ~ empty_carrier(boole_lattice(X0))
& strict_latt_str(boole_lattice(X0))
& join_commutative(boole_lattice(X0))
& join_associative(boole_lattice(X0))
& meet_commutative(boole_lattice(X0))
& meet_associative(boole_lattice(X0))
& meet_absorbing(boole_lattice(X0))
& join_absorbing(boole_lattice(X0))
& lattice(boole_lattice(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc2_lattice3) ).
fof(f398,axiom,
! [X0] : k1_pcomps_1(X0) = powerset(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k1_pcomps_1) ).
fof(f627,conjecture,
! [X0,X1] :
( element(X1,powerset(X0))
=> ( proper_element(X1,powerset(X0))
<=> X1 != X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_tex_2) ).
fof(f628,negated_conjecture,
~ ! [X0,X1] :
( element(X1,powerset(X0))
=> ( proper_element(X1,powerset(X0))
<=> X1 != X0 ) ),
inference(negated_conjecture,[status(cth)],[f627]) ).
fof(f668,axiom,
! [X0] : union(powerset(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t99_zfmisc_1) ).
fof(f831,plain,
! [X0,X1] :
( ( X1 = boole_lattice(X0)
<=> ( the_carrier(X1) = powerset(X0)
& ! [X2] :
( ! [X3] :
( ( apply_binary(the_L_join(X1),X2,X3) = subset_union2(X0,X2,X3)
& apply_binary(the_L_meet(X1),X2,X3) = subset_intersection2(X0,X2,X3) )
| ~ element(X3,powerset(X0)) )
| ~ element(X2,powerset(X0)) ) ) )
| ~ strict_latt_str(X1)
| ~ latt_str(X1) ),
inference(ennf_transformation,[],[f74]) ).
fof(f832,plain,
! [X0,X1] :
( ( X1 = boole_lattice(X0)
<=> ( the_carrier(X1) = powerset(X0)
& ! [X2] :
( ! [X3] :
( ( apply_binary(the_L_join(X1),X2,X3) = subset_union2(X0,X2,X3)
& apply_binary(the_L_meet(X1),X2,X3) = subset_intersection2(X0,X2,X3) )
| ~ element(X3,powerset(X0)) )
| ~ element(X2,powerset(X0)) ) ) )
| ~ strict_latt_str(X1)
| ~ latt_str(X1) ),
inference(flattening,[],[f831]) ).
fof(f860,plain,
! [X0,X1] :
( ( proper_element(X1,X0)
<=> X1 != union(X0) )
| ~ element(X1,X0) ),
inference(ennf_transformation,[],[f102]) ).
fof(f1465,plain,
? [X0,X1] :
( ( proper_element(X1,powerset(X0))
<~> X1 != X0 )
& element(X1,powerset(X0)) ),
inference(ennf_transformation,[],[f628]) ).
fof(f1660,plain,
! [X0,X1] :
( ( ( X1 = boole_lattice(X0)
| powerset(X0) != the_carrier(X1)
| ? [X2] :
( ? [X3] :
( ( apply_binary(the_L_join(X1),X2,X3) != subset_union2(X0,X2,X3)
| apply_binary(the_L_meet(X1),X2,X3) != subset_intersection2(X0,X2,X3) )
& element(X3,powerset(X0)) )
& element(X2,powerset(X0)) ) )
& ( ( the_carrier(X1) = powerset(X0)
& ! [X2] :
( ! [X3] :
( ( apply_binary(the_L_join(X1),X2,X3) = subset_union2(X0,X2,X3)
& apply_binary(the_L_meet(X1),X2,X3) = subset_intersection2(X0,X2,X3) )
| ~ element(X3,powerset(X0)) )
| ~ element(X2,powerset(X0)) ) )
| boole_lattice(X0) != X1 ) )
| ~ strict_latt_str(X1)
| ~ latt_str(X1) ),
inference(nnf_transformation,[],[f832]) ).
fof(f1661,plain,
! [X0,X1] :
( ( ( X1 = boole_lattice(X0)
| powerset(X0) != the_carrier(X1)
| ? [X2] :
( ? [X3] :
( ( apply_binary(the_L_join(X1),X2,X3) != subset_union2(X0,X2,X3)
| apply_binary(the_L_meet(X1),X2,X3) != subset_intersection2(X0,X2,X3) )
& element(X3,powerset(X0)) )
& element(X2,powerset(X0)) ) )
& ( ( the_carrier(X1) = powerset(X0)
& ! [X2] :
( ! [X3] :
( ( apply_binary(the_L_join(X1),X2,X3) = subset_union2(X0,X2,X3)
& apply_binary(the_L_meet(X1),X2,X3) = subset_intersection2(X0,X2,X3) )
| ~ element(X3,powerset(X0)) )
| ~ element(X2,powerset(X0)) ) )
| boole_lattice(X0) != X1 ) )
| ~ strict_latt_str(X1)
| ~ latt_str(X1) ),
inference(flattening,[],[f1660]) ).
fof(f1662,plain,
! [X0,X1] :
( ( ( X1 = boole_lattice(X0)
| powerset(X0) != the_carrier(X1)
| ? [X2] :
( ? [X3] :
( ( apply_binary(the_L_join(X1),X2,X3) != subset_union2(X0,X2,X3)
| apply_binary(the_L_meet(X1),X2,X3) != subset_intersection2(X0,X2,X3) )
& element(X3,powerset(X0)) )
& element(X2,powerset(X0)) ) )
& ( ( the_carrier(X1) = powerset(X0)
& ! [X4] :
( ! [X5] :
( ( apply_binary(the_L_join(X1),X4,X5) = subset_union2(X0,X4,X5)
& apply_binary(the_L_meet(X1),X4,X5) = subset_intersection2(X0,X4,X5) )
| ~ element(X5,powerset(X0)) )
| ~ element(X4,powerset(X0)) ) )
| boole_lattice(X0) != X1 ) )
| ~ strict_latt_str(X1)
| ~ latt_str(X1) ),
inference(rectify,[],[f1661]) ).
fof(f1663,plain,
! [X0,X1] :
( ( ( X1 = boole_lattice(X0)
| powerset(X0) != the_carrier(X1)
| ( ( apply_binary(the_L_join(X1),sK84(X0,X1),sK85(X0,X1)) != subset_union2(X0,sK84(X0,X1),sK85(X0,X1))
| apply_binary(the_L_meet(X1),sK84(X0,X1),sK85(X0,X1)) != subset_intersection2(X0,sK84(X0,X1),sK85(X0,X1)) )
& element(sK85(X0,X1),powerset(X0))
& element(sK84(X0,X1),powerset(X0)) ) )
& ( ( the_carrier(X1) = powerset(X0)
& ! [X4] :
( ! [X5] :
( ( apply_binary(the_L_join(X1),X4,X5) = subset_union2(X0,X4,X5)
& apply_binary(the_L_meet(X1),X4,X5) = subset_intersection2(X0,X4,X5) )
| ~ element(X5,powerset(X0)) )
| ~ element(X4,powerset(X0)) ) )
| boole_lattice(X0) != X1 ) )
| ~ strict_latt_str(X1)
| ~ latt_str(X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK84,sK85]),skolemize(X2,sK84(X0,X1)),skolemize(X3,sK85(X0,X1))],[f1662]) ).
fof(f1723,plain,
! [X0,X1] :
( ( ( proper_element(X1,X0)
| union(X0) = X1 )
& ( X1 != union(X0)
| ~ proper_element(X1,X0) ) )
| ~ element(X1,X0) ),
inference(nnf_transformation,[],[f860]) ).
fof(f2241,plain,
? [X0,X1] :
( ( X0 = X1
| ~ proper_element(X1,powerset(X0)) )
& ( X1 != X0
| proper_element(X1,powerset(X0)) )
& element(X1,powerset(X0)) ),
inference(nnf_transformation,[],[f1465]) ).
fof(f2242,plain,
? [X0,X1] :
( ( X0 = X1
| ~ proper_element(X1,powerset(X0)) )
& ( X1 != X0
| proper_element(X1,powerset(X0)) )
& element(X1,powerset(X0)) ),
inference(flattening,[],[f2241]) ).
fof(f2243,plain,
( ( sK498 = sK499
| ~ proper_element(sK499,powerset(sK498)) )
& ( sK498 != sK499
| proper_element(sK499,powerset(sK498)) )
& element(sK499,powerset(sK498)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK498,sK499]),skolemize(X0,sK498),skolemize(X1,sK499)],[f2242]) ).
fof(f2472,plain,
! [X0,X1] :
( powerset(X0) = the_carrier(X1)
| boole_lattice(X0) != X1
| ~ strict_latt_str(X1)
| ~ latt_str(X1) ),
inference(cnf_transformation,[],[f1663]) ).
fof(f2569,plain,
! [X0,X1] :
( union(X0) != X1
| ~ proper_element(X1,X0)
| ~ element(X1,X0) ),
inference(cnf_transformation,[],[f1723]) ).
fof(f2570,plain,
! [X0,X1] :
( ~ element(X1,X0)
| union(X0) = X1
| proper_element(X1,X0) ),
inference(cnf_transformation,[],[f1723]) ).
fof(f2647,plain,
! [X0] : cast_to_subset(X0) = X0,
inference(cnf_transformation,[],[f121]) ).
fof(f2788,plain,
! [X0] : latt_str(boole_lattice(X0)),
inference(cnf_transformation,[],[f166]) ).
fof(f2805,plain,
! [X0] : element(cast_to_subset(X0),powerset(X0)),
inference(cnf_transformation,[],[f187]) ).
fof(f2930,plain,
! [X0] : strict_latt_str(boole_lattice(X0)),
inference(cnf_transformation,[],[f277]) ).
fof(f3260,plain,
! [X0] : powerset(X0) = k1_pcomps_1(X0),
inference(cnf_transformation,[],[f398]) ).
fof(f4042,plain,
element(sK499,powerset(sK498)),
inference(cnf_transformation,[],[f2243]) ).
fof(f4043,plain,
( sK498 != sK499
| proper_element(sK499,powerset(sK498)) ),
inference(cnf_transformation,[],[f2243]) ).
fof(f4044,plain,
( sK498 = sK499
| ~ proper_element(sK499,powerset(sK498)) ),
inference(cnf_transformation,[],[f2243]) ).
fof(f4104,plain,
! [X0] : union(powerset(X0)) = X0,
inference(cnf_transformation,[],[f668]) ).
fof(f4179,plain,
! [X0,X1] :
( the_carrier(X1) = k1_pcomps_1(X0)
| boole_lattice(X0) != X1
| ~ strict_latt_str(X1)
| ~ latt_str(X1) ),
inference(definition_unfolding,[],[f2472,f3260]) ).
fof(f4304,plain,
! [X0] : element(cast_to_subset(X0),k1_pcomps_1(X0)),
inference(definition_unfolding,[],[f2805,f3260]) ).
fof(f4792,plain,
( sK498 = sK499
| ~ proper_element(sK499,k1_pcomps_1(sK498)) ),
inference(definition_unfolding,[],[f4044,f3260]) ).
fof(f4793,plain,
( sK498 != sK499
| proper_element(sK499,k1_pcomps_1(sK498)) ),
inference(definition_unfolding,[],[f4043,f3260]) ).
fof(f4794,plain,
element(sK499,k1_pcomps_1(sK498)),
inference(definition_unfolding,[],[f4042,f3260]) ).
fof(f4815,plain,
! [X0] : union(k1_pcomps_1(X0)) = X0,
inference(definition_unfolding,[],[f4104,f3260]) ).
fof(f4859,plain,
! [X0] :
( k1_pcomps_1(X0) = the_carrier(boole_lattice(X0))
| ~ strict_latt_str(boole_lattice(X0))
| ~ latt_str(boole_lattice(X0)) ),
inference(equality_resolution,[],[f4179]) ).
fof(f4902,plain,
! [X0] :
( ~ proper_element(union(X0),X0)
| ~ element(union(X0),X0) ),
inference(equality_resolution,[],[f2569]) ).
fof(f5077,definition,
sF504 = k1_pcomps_1(sK498),
introduced(definition,[new_symbols(definition,[sF504])],[function_definition]) ).
fof(f5078,plain,
k1_pcomps_1(sK498) = sF504,
inference(reorient_equations,[],[f5077]) ).
fof(f5079,plain,
( sK498 = sK499
| ~ proper_element(sK499,sF504) ),
inference(definition_folding,[],[f4792,f5078]) ).
fof(f5080,plain,
( sK498 != sK499
| proper_element(sK499,sF504) ),
inference(definition_folding,[],[f4793,f5078]) ).
fof(f5081,plain,
element(sK499,sF504),
inference(definition_folding,[],[f4794,f5078]) ).
fof(f5104,definition,
( spl505_1
<=> proper_element(sK499,sF504) ),
introduced(definition,[new_symbols(definition,[spl505_1])],[avatar_definition]) ).
fof(f5105,plain,
( ~ proper_element(sK499,sF504)
| spl505_1 ),
inference(avatar_component_clause,[],[f5104]) ).
fof(f5106,plain,
( proper_element(sK499,sF504)
| ~ spl505_1 ),
inference(avatar_component_clause,[],[f5104]) ).
fof(f5108,definition,
( spl505_2
<=> sK498 = sK499 ),
introduced(definition,[new_symbols(definition,[spl505_2])],[avatar_definition]) ).
fof(f5109,plain,
( sK498 = sK499
| ~ spl505_2 ),
inference(avatar_component_clause,[],[f5108]) ).
fof(f5110,plain,
( sK498 != sK499
| spl505_2 ),
inference(avatar_component_clause,[],[f5108]) ).
fof(f5111,plain,
( spl505_1
| ~ spl505_2 ),
inference(avatar_split_clause,[],[f5080,f5108,f5104]) ).
fof(f5112,plain,
( ~ spl505_1
| spl505_2 ),
inference(avatar_split_clause,[],[f5079,f5108,f5104]) ).
fof(f5413,plain,
! [X0] :
( k1_pcomps_1(X0) = the_carrier(boole_lattice(X0))
| ~ latt_str(boole_lattice(X0)) ),
inference(forward_subsumption_resolution,[],[f4859,f2930]) ).
fof(f5440,plain,
! [X0] : k1_pcomps_1(X0) = the_carrier(boole_lattice(X0)),
inference(forward_subsumption_resolution,[],[f5413,f2788]) ).
fof(f5443,plain,
( ~ proper_element(sK499,k1_pcomps_1(sK498))
| spl505_1 ),
inference(forward_demodulation,[],[f5105,f5078]) ).
fof(f5450,plain,
( ~ proper_element(sK499,the_carrier(boole_lattice(sK498)))
| spl505_1 ),
inference(forward_demodulation,[],[f5443,f5440]) ).
fof(f5895,plain,
! [X0] : element(X0,k1_pcomps_1(X0)),
inference(superposition,[],[f4304,f2647]) ).
fof(f5896,plain,
! [X0] : element(X0,the_carrier(boole_lattice(X0))),
inference(forward_demodulation,[],[f5895,f5440]) ).
fof(f11258,plain,
! [X0] :
( ~ proper_element(X0,k1_pcomps_1(X0))
| ~ element(X0,k1_pcomps_1(X0)) ),
inference(superposition,[],[f4902,f4815]) ).
fof(f11299,plain,
! [X0] :
( ~ proper_element(X0,the_carrier(boole_lattice(X0)))
| ~ element(X0,k1_pcomps_1(X0)) ),
inference(forward_demodulation,[],[f11258,f5440]) ).
fof(f11318,plain,
! [X0] :
( ~ element(X0,the_carrier(boole_lattice(X0)))
| ~ proper_element(X0,the_carrier(boole_lattice(X0))) ),
inference(forward_demodulation,[],[f11299,f5440]) ).
fof(f11319,plain,
! [X0] : ~ proper_element(X0,the_carrier(boole_lattice(X0))),
inference(forward_subsumption_resolution,[],[f11318,f5896]) ).
fof(f15077,plain,
( sK499 = union(sF504)
| proper_element(sK499,sF504) ),
inference(resolution,[],[f2570,f5081]) ).
fof(f15082,plain,
( sK499 = union(k1_pcomps_1(sK498))
| proper_element(sK499,sF504) ),
inference(forward_demodulation,[],[f15077,f5078]) ).
fof(f15110,plain,
( sK498 = sK499
| proper_element(sK499,sF504) ),
inference(forward_demodulation,[],[f15082,f4815]) ).
fof(f15136,plain,
( proper_element(sK499,sF504)
| spl505_2 ),
inference(forward_subsumption_resolution,[],[f15110,f5110]) ).
fof(f15142,plain,
( proper_element(sK499,k1_pcomps_1(sK498))
| spl505_2 ),
inference(forward_demodulation,[],[f15136,f5078]) ).
fof(f15148,plain,
( proper_element(sK499,the_carrier(boole_lattice(sK498)))
| spl505_2 ),
inference(forward_demodulation,[],[f15142,f5440]) ).
fof(f15149,plain,
( $false
| spl505_1
| spl505_2 ),
inference(forward_subsumption_resolution,[],[f15148,f5450]) ).
fof(f15150,plain,
( spl505_1
| spl505_2 ),
inference(avatar_contradiction_clause,[],[f15149]) ).
fof(f15151,plain,
( proper_element(sK499,k1_pcomps_1(sK498))
| ~ spl505_1 ),
inference(forward_demodulation,[],[f5106,f5078]) ).
fof(f15153,plain,
( proper_element(sK499,the_carrier(boole_lattice(sK498)))
| ~ spl505_1 ),
inference(forward_demodulation,[],[f15151,f5440]) ).
fof(f15154,plain,
( proper_element(sK498,the_carrier(boole_lattice(sK498)))
| ~ spl505_1
| ~ spl505_2 ),
inference(forward_demodulation,[],[f15153,f5109]) ).
fof(f15155,plain,
( $false
| ~ spl505_1
| ~ spl505_2 ),
inference(forward_subsumption_resolution,[],[f15154,f11319]) ).
fof(f15156,plain,
( ~ spl505_1
| ~ spl505_2 ),
inference(avatar_contradiction_clause,[],[f15155]) ).
cnf(s1,plain,
( spl505_1
| ~ spl505_2 ),
inference(sat_conversion,[],[f5111]) ).
cnf(s2,plain,
( ~ spl505_1
| spl505_2 ),
inference(sat_conversion,[],[f5112]) ).
cnf(s215,plain,
( spl505_1
| spl505_2 ),
inference(sat_conversion,[],[f15150]) ).
cnf(s216,plain,
( ~ spl505_1
| ~ spl505_2 ),
inference(sat_conversion,[],[f15156]) ).
cnf(s222,plain,
spl505_1,
inference(rat,[],[s1,s215]) ).
cnf(s223,plain,
~ spl505_2,
inference(rat,[],[s216,s222]) ).
cnf(s224,plain,
$false,
inference(rat,[],[s2,s223,s222]) ).
fof(f15157,plain,
$false,
inference(avatar_sat_refutation,[],[s224]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU354+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 % Computer : n020.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 28 04:54:19 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.44 Running first-order model finding
% 0.11/0.44 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
% 3.88/1.14 % (4031775)Will run a generic schedule for satisfiability detection.
% 3.88/1.14 % (4031783)dis+10_1_sil=32000:sp=arity:random_seed=3294162154:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.88/1.14 % (4031781)% WARNING: option uhcvi not known.
% 3.88/1.14 % (4031782)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4150330742:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.88/1.14 % (4031784)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3063469164:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.88/1.14 % (4031781)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=608805815:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.88/1.14 % (4031780)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2952943415_2999 on theBenchmark for (2999ds/0Mi)
% 3.88/1.14 % (4031785)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1466979248:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.88/1.14 % (4031786)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3895082875:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.88/1.14 % (4031783)Instruction limit reached!
% 3.88/1.14 % (4031783)------------------------------
% 3.88/1.14 % (4031783)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.88/1.14 % (4031783)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.88/1.14 % (4031783)CaDiCaL version: 2.1.3
% 3.88/1.14 % (4031783)Termination reason: Instruction limit
% 3.88/1.14 % (4031783)Termination phase: Saturation
% 3.88/1.14 % (4031783)Time elapsed: 0.055 s
% 3.88/1.14 % (4031783)Peak memory usage: 15 MB
% 3.88/1.14 % (4031783)Instructions burned: 103 (million)
% 3.88/1.14 % (4031794)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1022233797:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 3.88/1.14 % (4031784)Instruction limit reached!
% 3.88/1.14 % (4031784)------------------------------
% 3.88/1.14 % (4031784)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.88/1.14 % (4031784)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.88/1.14 % (4031784)CaDiCaL version: 2.1.3
% 3.88/1.14 % (4031784)Termination reason: Instruction limit
% 3.88/1.14 % (4031784)Termination phase: Blocked clause elimination
% 3.88/1.14 % (4031784)Time elapsed: 0.107 s
% 3.88/1.14 % (4031784)Peak memory usage: 14 MB
% 3.88/1.14 % (4031784)Instructions burned: 117 (million)
% 3.88/1.14 % (4031785)Instruction limit reached!
% 3.88/1.14 % (4031785)------------------------------
% 3.88/1.14 % (4031785)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.88/1.14 % (4031785)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.88/1.14 % (4031785)CaDiCaL version: 2.1.3
% 3.88/1.14 % (4031785)Termination reason: Instruction limit
% 3.88/1.14 % (4031785)Termination phase: Saturation
% 3.88/1.14 % (4031785)Time elapsed: 0.131 s
% 3.88/1.14 % (4031785)Peak memory usage: 15 MB
% 3.88/1.14 % (4031785)Instructions burned: 132 (million)
% 3.88/1.14 % (4031796)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2515331292:i=131:bd=preordered:fsd=on_2997 on theBenchmark for (2997ds/131Mi)
% 3.88/1.14 % (4031786)Instruction limit reached!
% 3.88/1.14 % (4031786)------------------------------
% 3.88/1.14 % (4031786)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.88/1.14 % (4031786)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.88/1.14 % (4031786)CaDiCaL version: 2.1.3
% 3.88/1.14 % (4031786)Termination reason: Instruction limit
% 3.88/1.14 % (4031786)Termination phase: Saturation
% 3.88/1.14 % (4031786)Time elapsed: 0.160 s
% 3.88/1.14 % (4031786)Peak memory usage: 17 MB
% 3.88/1.14 % (4031786)Instructions burned: 160 (million)
% 3.88/1.14 % (4031797)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=4219019477:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2997 on theBenchmark for (2997ds/684Mi)
% 3.88/1.14 % (4031799)ott-21_1_sil=16000:fs=off:random_seed=4036104727:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 3.88/1.14 % TRYING [1]
% 3.88/1.14 % TRYING [2]
% 3.88/1.14 % (4031796)Instruction limit reached!
% 3.88/1.14 % (4031796)------------------------------
% 3.88/1.14 % (4031796)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.88/1.14 % (4031796)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.88/1.14 % (4031796)CaDiCaL version: 2.1.3
% 3.88/1.14 % (4031796)Termination reason: Instruction limit
% 3.88/1.14 % (4031796)Termination phase: Saturation
% 3.88/1.14 % (4031796)Time elapsed: 0.118 s
% 3.88/1.14 % (4031796)Peak memory usage: 15 MB
% 3.88/1.14 % (4031796)Instructions burned: 131 (million)
% 3.88/1.14 % (4031802)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=588875687:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 3.88/1.14 % TRYING [3]
% 3.88/1.14 % (4031794)Instruction limit reached!
% 3.88/1.14 % (4031794)------------------------------
% 3.88/1.14 % (4031794)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.88/1.14 % (4031794)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.88/1.14 % (4031794)CaDiCaL version: 2.1.3
% 3.88/1.14 % (4031794)Termination reason: Instruction limit
% 3.88/1.14 % (4031794)Termination phase: Finite model building constraint generation
% 3.88/1.14 % (4031794)Time elapsed: 0.230 s
% 3.88/1.14 % (4031794)Peak memory usage: 32 MB
% 3.88/1.14 % (4031794)Instructions burned: 719 (million)
% 3.88/1.14 % (4031799)Instruction limit reached!
% 3.88/1.14 % (4031799)------------------------------
% 3.88/1.14 % (4031799)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.88/1.14 % (4031799)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.88/1.14 % (4031799)CaDiCaL version: 2.1.3
% 3.88/1.14 % (4031799)Termination reason: Instruction limit
% 3.88/1.14 % (4031799)Termination phase: Saturation
% 3.88/1.14 % (4031799)Time elapsed: 0.117 s
% 3.88/1.14 % (4031799)Peak memory usage: 16 MB
% 3.88/1.14 % (4031799)Instructions burned: 180 (million)
% 3.88/1.14 % (4031804)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3710790525:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 3.88/1.14 % (4031805)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2670983762:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 3.88/1.14 % TRYING [1]
% 3.88/1.14 % TRYING [2]
% 3.88/1.14 % TRYING [1]
% 3.88/1.14 % TRYING [2]
% 3.88/1.14 % TRYING [3]
% 3.88/1.14 % (4031804)Instruction limit reached!
% 3.88/1.14 % (4031804)------------------------------
% 3.88/1.14 % (4031804)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.88/1.14 % (4031804)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.88/1.14 % (4031804)CaDiCaL version: 2.1.3
% 3.88/1.14 % (4031804)Termination reason: Instruction limit
% 3.88/1.14 % (4031804)Termination phase: Finite model building SAT solving
% 3.88/1.14 % (4031804)Time elapsed: 0.230 s
% 3.88/1.14 % (4031804)Peak memory usage: 35 MB
% 3.88/1.14 % (4031804)Instructions burned: 866 (million)
% 3.88/1.14 % (4031808)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3128798911:i=889:ins=1_2993 on theBenchmark for (2993ds/889Mi)
% 3.88/1.14 % (4031805) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4031775-4031805"...
% 3.88/1.14 % (4031805)...printing done.
% 3.88/1.14 % (4031805)Refutation found. Thanks to Tanya!
% 3.88/1.14 % SZS status Theorem for theBenchmark
% 3.88/1.14 % SZS output start Proof for theBenchmark
% See solution above
% 3.88/1.14 % (4031805)------------------------------
% 3.88/1.14 % (4031805)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.88/1.14 % (4031805)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.88/1.14 % (4031805)CaDiCaL version: 2.1.3
% 3.88/1.14 % (4031805)Termination reason: Refutation
% 3.88/1.14 % (4031805)Time elapsed: 0.248 s
% 3.88/1.14 % (4031805)Peak memory usage: 21 MB
% 3.88/1.14 % (4031805)Instructions burned: 390 (million)
% 3.88/1.14 % (4031775)Success in time 0.679 s
% 3.88/1.14 % Vampire exiting
%------------------------------------------------------------------------------