%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU345+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:48:27 PM UTC 2026
% Result : Theorem 4.52s 1.22s
% Output : Refutation 5.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 39
% Number of leaves : 15
% Syntax : Number of formulae : 120 ( 24 unt; 2 def)
% Number of atoms : 469 ( 166 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 544 ( 195 ~; 248 |; 76 &)
% ( 12 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 19 ( 17 usr; 3 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 2 con; 0-3 aty)
% Number of variables : 189 ( 0 sgn 173 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f12,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& meet_semilatt_str(X0) )
=> ( lower_bounded_semilattstr(X0)
<=> ? [X1] :
( element(X1,the_carrier(X0))
& ! [X2] :
( element(X2,the_carrier(X0))
=> ( meet(X0,X1,X2) = X1
& meet(X0,X2,X1) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d13_lattices) ).
fof(f13,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& meet_semilatt_str(X0) )
=> ( lower_bounded_semilattstr(X0)
=> ! [X1] :
( element(X1,the_carrier(X0))
=> ( X1 = bottom_of_semilattstr(X0)
<=> ! [X2] :
( element(X2,the_carrier(X0))
=> ( meet(X0,X1,X2) = X1
& meet(X0,X2,X1) = X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d16_lattices) ).
fof(f15,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(f22,axiom,
! [X0] :
( strict_latt_str(boole_lattice(X0))
& latt_str(boole_lattice(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_lattice3) ).
fof(f36,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& meet_semilatt_str(X0) )
=> element(bottom_of_semilattstr(X0),the_carrier(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k5_lattices) ).
fof(f41,axiom,
! [X0] :
( latt_str(X0)
=> ( meet_semilatt_str(X0)
& join_semilatt_str(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_l3_lattices) ).
fof(f60,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(f91,axiom,
! [X0,X1] :
( element(X1,the_carrier(boole_lattice(X0)))
=> ! [X2] :
( element(X2,the_carrier(boole_lattice(X0)))
=> ( join(boole_lattice(X0),X1,X2) = set_union2(X1,X2)
& meet(boole_lattice(X0),X1,X2) = set_intersection2(X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_lattice3) ).
fof(f93,axiom,
! [X0] : set_intersection2(X0,empty_set) = empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_boole) ).
fof(f95,axiom,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(f96,conjecture,
! [X0] :
( lower_bounded_semilattstr(boole_lattice(X0))
& bottom_of_semilattstr(boole_lattice(X0)) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_lattice3) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( lower_bounded_semilattstr(boole_lattice(X0))
& bottom_of_semilattstr(boole_lattice(X0)) = empty_set ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(f121,plain,
! [X0] :
( ( lower_bounded_semilattstr(X0)
<=> ? [X1] :
( element(X1,the_carrier(X0))
& ! [X2] :
( ( meet(X0,X1,X2) = X1
& meet(X0,X2,X1) = X1 )
| ~ element(X2,the_carrier(X0)) ) ) )
| empty_carrier(X0)
| ~ meet_semilatt_str(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f122,plain,
! [X0] :
( ( lower_bounded_semilattstr(X0)
<=> ? [X1] :
( element(X1,the_carrier(X0))
& ! [X2] :
( ( meet(X0,X1,X2) = X1
& meet(X0,X2,X1) = X1 )
| ~ element(X2,the_carrier(X0)) ) ) )
| empty_carrier(X0)
| ~ meet_semilatt_str(X0) ),
inference(flattening,[],[f121]) ).
fof(f123,plain,
! [X0] :
( ! [X1] :
( ( X1 = bottom_of_semilattstr(X0)
<=> ! [X2] :
( ( meet(X0,X1,X2) = X1
& meet(X0,X2,X1) = X1 )
| ~ element(X2,the_carrier(X0)) ) )
| ~ element(X1,the_carrier(X0)) )
| ~ lower_bounded_semilattstr(X0)
| empty_carrier(X0)
| ~ meet_semilatt_str(X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f124,plain,
! [X0] :
( ! [X1] :
( ( X1 = bottom_of_semilattstr(X0)
<=> ! [X2] :
( ( meet(X0,X1,X2) = X1
& meet(X0,X2,X1) = X1 )
| ~ element(X2,the_carrier(X0)) ) )
| ~ element(X1,the_carrier(X0)) )
| ~ lower_bounded_semilattstr(X0)
| empty_carrier(X0)
| ~ meet_semilatt_str(X0) ),
inference(flattening,[],[f123]) ).
fof(f127,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,[],[f15]) ).
fof(f128,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,[],[f127]) ).
fof(f145,plain,
! [X0] :
( element(bottom_of_semilattstr(X0),the_carrier(X0))
| empty_carrier(X0)
| ~ meet_semilatt_str(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f146,plain,
! [X0] :
( element(bottom_of_semilattstr(X0),the_carrier(X0))
| empty_carrier(X0)
| ~ meet_semilatt_str(X0) ),
inference(flattening,[],[f145]) ).
fof(f151,plain,
! [X0] :
( ( meet_semilatt_str(X0)
& join_semilatt_str(X0) )
| ~ latt_str(X0) ),
inference(ennf_transformation,[],[f41]) ).
fof(f188,plain,
! [X0,X1] :
( ! [X2] :
( ( join(boole_lattice(X0),X1,X2) = set_union2(X1,X2)
& meet(boole_lattice(X0),X1,X2) = set_intersection2(X1,X2) )
| ~ element(X2,the_carrier(boole_lattice(X0))) )
| ~ element(X1,the_carrier(boole_lattice(X0))) ),
inference(ennf_transformation,[],[f91]) ).
fof(f192,plain,
? [X0] :
( ~ lower_bounded_semilattstr(boole_lattice(X0))
| empty_set != bottom_of_semilattstr(boole_lattice(X0)) ),
inference(ennf_transformation,[],[f97]) ).
fof(f199,plain,
! [X0] :
( ( ( lower_bounded_semilattstr(X0)
| ! [X1] :
( ~ element(X1,the_carrier(X0))
| ? [X2] :
( ( meet(X0,X1,X2) != X1
| meet(X0,X2,X1) != X1 )
& element(X2,the_carrier(X0)) ) ) )
& ( ? [X1] :
( element(X1,the_carrier(X0))
& ! [X2] :
( ( meet(X0,X1,X2) = X1
& meet(X0,X2,X1) = X1 )
| ~ element(X2,the_carrier(X0)) ) )
| ~ lower_bounded_semilattstr(X0) ) )
| empty_carrier(X0)
| ~ meet_semilatt_str(X0) ),
inference(nnf_transformation,[],[f122]) ).
fof(f200,plain,
! [X0] :
( ( ( lower_bounded_semilattstr(X0)
| ! [X1] :
( ~ element(X1,the_carrier(X0))
| ? [X2] :
( ( meet(X0,X1,X2) != X1
| meet(X0,X2,X1) != X1 )
& element(X2,the_carrier(X0)) ) ) )
& ( ? [X3] :
( element(X3,the_carrier(X0))
& ! [X4] :
( ( meet(X0,X3,X4) = X3
& meet(X0,X4,X3) = X3 )
| ~ element(X4,the_carrier(X0)) ) )
| ~ lower_bounded_semilattstr(X0) ) )
| empty_carrier(X0)
| ~ meet_semilatt_str(X0) ),
inference(rectify,[],[f199]) ).
fof(f201,plain,
! [X0] :
( ( ( lower_bounded_semilattstr(X0)
| ! [X1] :
( ~ element(X1,the_carrier(X0))
| ( ( meet(X0,X1,sK0(X0,X1)) != X1
| meet(X0,sK0(X0,X1),X1) != X1 )
& element(sK0(X0,X1),the_carrier(X0)) ) ) )
& ( ( element(sK1(X0),the_carrier(X0))
& ! [X4] :
( ( sK1(X0) = meet(X0,sK1(X0),X4)
& sK1(X0) = meet(X0,X4,sK1(X0)) )
| ~ element(X4,the_carrier(X0)) ) )
| ~ lower_bounded_semilattstr(X0) ) )
| empty_carrier(X0)
| ~ meet_semilatt_str(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0(X0,X1)),skolemize(X3,sK1(X0))],[f200]) ).
fof(f202,plain,
! [X0] :
( ! [X1] :
( ( ( X1 = bottom_of_semilattstr(X0)
| ? [X2] :
( ( meet(X0,X1,X2) != X1
| meet(X0,X2,X1) != X1 )
& element(X2,the_carrier(X0)) ) )
& ( ! [X2] :
( ( meet(X0,X1,X2) = X1
& meet(X0,X2,X1) = X1 )
| ~ element(X2,the_carrier(X0)) )
| bottom_of_semilattstr(X0) != X1 ) )
| ~ element(X1,the_carrier(X0)) )
| ~ lower_bounded_semilattstr(X0)
| empty_carrier(X0)
| ~ meet_semilatt_str(X0) ),
inference(nnf_transformation,[],[f124]) ).
fof(f203,plain,
! [X0] :
( ! [X1] :
( ( ( X1 = bottom_of_semilattstr(X0)
| ? [X2] :
( ( meet(X0,X1,X2) != X1
| meet(X0,X2,X1) != X1 )
& element(X2,the_carrier(X0)) ) )
& ( ! [X3] :
( ( meet(X0,X1,X3) = X1
& meet(X0,X3,X1) = X1 )
| ~ element(X3,the_carrier(X0)) )
| bottom_of_semilattstr(X0) != X1 ) )
| ~ element(X1,the_carrier(X0)) )
| ~ lower_bounded_semilattstr(X0)
| empty_carrier(X0)
| ~ meet_semilatt_str(X0) ),
inference(rectify,[],[f202]) ).
fof(f204,plain,
! [X0] :
( ! [X1] :
( ( ( X1 = bottom_of_semilattstr(X0)
| ( ( meet(X0,X1,sK2(X0,X1)) != X1
| meet(X0,sK2(X0,X1),X1) != X1 )
& element(sK2(X0,X1),the_carrier(X0)) ) )
& ( ! [X3] :
( ( meet(X0,X1,X3) = X1
& meet(X0,X3,X1) = X1 )
| ~ element(X3,the_carrier(X0)) )
| bottom_of_semilattstr(X0) != X1 ) )
| ~ element(X1,the_carrier(X0)) )
| ~ lower_bounded_semilattstr(X0)
| empty_carrier(X0)
| ~ meet_semilatt_str(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f203]) ).
fof(f205,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,[],[f128]) ).
fof(f206,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,[],[f205]) ).
fof(f207,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,[],[f206]) ).
fof(f208,plain,
! [X0,X1] :
( ( ( X1 = boole_lattice(X0)
| powerset(X0) != the_carrier(X1)
| ( ( apply_binary(the_L_join(X1),sK3(X0,X1),sK4(X0,X1)) != subset_union2(X0,sK3(X0,X1),sK4(X0,X1))
| apply_binary(the_L_meet(X1),sK3(X0,X1),sK4(X0,X1)) != subset_intersection2(X0,sK3(X0,X1),sK4(X0,X1)) )
& element(sK4(X0,X1),powerset(X0))
& element(sK3(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,[sK3,sK4]),skolemize(X2,sK3(X0,X1)),skolemize(X3,sK4(X0,X1))],[f207]) ).
fof(f226,plain,
( ~ lower_bounded_semilattstr(boole_lattice(sK21))
| empty_set != bottom_of_semilattstr(boole_lattice(sK21)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK21]),skolemize(X0,sK21)],[f192]) ).
fof(f227,plain,
! [X0,X1] :
( ( element(X0,powerset(X1))
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ element(X0,powerset(X1)) ) ),
inference(nnf_transformation,[],[f98]) ).
fof(f242,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f249,plain,
! [X0,X1] :
( ~ meet_semilatt_str(X0)
| ~ element(X1,the_carrier(X0))
| element(sK0(X0,X1),the_carrier(X0))
| empty_carrier(X0)
| lower_bounded_semilattstr(X0) ),
inference(cnf_transformation,[],[f201]) ).
fof(f250,plain,
! [X0,X1] :
( meet(X0,sK0(X0,X1),X1) != X1
| ~ element(X1,the_carrier(X0))
| meet(X0,X1,sK0(X0,X1)) != X1
| lower_bounded_semilattstr(X0)
| empty_carrier(X0)
| ~ meet_semilatt_str(X0) ),
inference(cnf_transformation,[],[f201]) ).
fof(f251,plain,
! [X3,X0,X1] :
( meet(X0,X3,X1) = X1
| ~ element(X3,the_carrier(X0))
| bottom_of_semilattstr(X0) != X1
| ~ element(X1,the_carrier(X0))
| ~ lower_bounded_semilattstr(X0)
| empty_carrier(X0)
| ~ meet_semilatt_str(X0) ),
inference(cnf_transformation,[],[f204]) ).
fof(f258,plain,
! [X0,X1] :
( powerset(X0) = the_carrier(X1)
| boole_lattice(X0) != X1
| ~ strict_latt_str(X1)
| ~ latt_str(X1) ),
inference(cnf_transformation,[],[f208]) ).
fof(f267,plain,
! [X0] : latt_str(boole_lattice(X0)),
inference(cnf_transformation,[],[f22]) ).
fof(f274,plain,
! [X0] :
( ~ meet_semilatt_str(X0)
| empty_carrier(X0)
| element(bottom_of_semilattstr(X0),the_carrier(X0)) ),
inference(cnf_transformation,[],[f146]) ).
fof(f279,plain,
! [X0] :
( ~ latt_str(X0)
| meet_semilatt_str(X0) ),
inference(cnf_transformation,[],[f151]) ).
fof(f311,plain,
! [X0] : strict_latt_str(boole_lattice(X0)),
inference(cnf_transformation,[],[f60]) ).
fof(f312,plain,
! [X0] : ~ empty_carrier(boole_lattice(X0)),
inference(cnf_transformation,[],[f60]) ).
fof(f375,plain,
! [X2,X0,X1] :
( ~ element(X1,the_carrier(boole_lattice(X0)))
| ~ element(X2,the_carrier(boole_lattice(X0)))
| set_intersection2(X1,X2) = meet(boole_lattice(X0),X1,X2) ),
inference(cnf_transformation,[],[f188]) ).
fof(f378,plain,
! [X0] : empty_set = set_intersection2(X0,empty_set),
inference(cnf_transformation,[],[f93]) ).
fof(f380,plain,
! [X0] : subset(empty_set,X0),
inference(cnf_transformation,[],[f95]) ).
fof(f381,plain,
( ~ lower_bounded_semilattstr(boole_lattice(sK21))
| empty_set != bottom_of_semilattstr(boole_lattice(sK21)) ),
inference(cnf_transformation,[],[f226]) ).
fof(f383,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f227]) ).
fof(f391,plain,
! [X3,X0] :
( bottom_of_semilattstr(X0) = meet(X0,X3,bottom_of_semilattstr(X0))
| ~ element(X3,the_carrier(X0))
| ~ element(bottom_of_semilattstr(X0),the_carrier(X0))
| ~ lower_bounded_semilattstr(X0)
| empty_carrier(X0)
| ~ meet_semilatt_str(X0) ),
inference(equality_resolution,[],[f251]) ).
fof(f392,plain,
! [X0] :
( powerset(X0) = the_carrier(boole_lattice(X0))
| ~ strict_latt_str(boole_lattice(X0))
| ~ latt_str(boole_lattice(X0)) ),
inference(equality_resolution,[],[f258]) ).
fof(f396,definition,
( spl22_1
<=> empty_set = bottom_of_semilattstr(boole_lattice(sK21)) ),
introduced(definition,[new_symbols(definition,[spl22_1])],[avatar_definition]) ).
fof(f397,plain,
( empty_set != bottom_of_semilattstr(boole_lattice(sK21))
| spl22_1 ),
inference(avatar_component_clause,[],[f396]) ).
fof(f399,definition,
( spl22_2
<=> lower_bounded_semilattstr(boole_lattice(sK21)) ),
introduced(definition,[new_symbols(definition,[spl22_2])],[avatar_definition]) ).
fof(f400,plain,
( ~ lower_bounded_semilattstr(boole_lattice(sK21))
| spl22_2 ),
inference(avatar_component_clause,[],[f399]) ).
fof(f401,plain,
( ~ spl22_1
| ~ spl22_2 ),
inference(avatar_split_clause,[],[f381,f399,f396]) ).
fof(f404,plain,
! [X0] :
( powerset(X0) = the_carrier(boole_lattice(X0))
| ~ latt_str(boole_lattice(X0)) ),
inference(forward_subsumption_resolution,[],[f392,f311]) ).
fof(f405,plain,
! [X3,X0] :
( ~ lower_bounded_semilattstr(X0)
| ~ element(X3,the_carrier(X0))
| bottom_of_semilattstr(X0) = meet(X0,X3,bottom_of_semilattstr(X0))
| empty_carrier(X0)
| ~ meet_semilatt_str(X0) ),
inference(forward_subsumption_resolution,[],[f391,f274]) ).
fof(f409,plain,
! [X0] : powerset(X0) = the_carrier(boole_lattice(X0)),
inference(forward_subsumption_resolution,[],[f404,f267]) ).
fof(f410,plain,
! [X2,X0,X1] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| set_intersection2(X1,X2) = meet(boole_lattice(X0),X1,X2) ),
inference(superposition,[],[f375,f409]) ).
fof(f411,plain,
! [X0] : meet_semilatt_str(boole_lattice(X0)),
inference(resolution,[],[f279,f267]) ).
fof(f412,plain,
! [X0] :
( empty_carrier(boole_lattice(X0))
| element(bottom_of_semilattstr(boole_lattice(X0)),the_carrier(boole_lattice(X0))) ),
inference(resolution,[],[f411,f274]) ).
fof(f413,plain,
! [X0] : element(bottom_of_semilattstr(boole_lattice(X0)),the_carrier(boole_lattice(X0))),
inference(forward_subsumption_resolution,[],[f412,f312]) ).
fof(f414,plain,
! [X0] : element(bottom_of_semilattstr(boole_lattice(X0)),powerset(X0)),
inference(forward_demodulation,[],[f413,f409]) ).
fof(f415,plain,
! [X0,X1] :
( ~ element(X0,powerset(X1))
| set_intersection2(X0,bottom_of_semilattstr(boole_lattice(X1))) = meet(boole_lattice(X1),X0,bottom_of_semilattstr(boole_lattice(X1))) ),
inference(resolution,[],[f414,f410]) ).
fof(f416,plain,
! [X0,X1] :
( ~ element(X0,the_carrier(boole_lattice(X1)))
| element(sK0(boole_lattice(X1),X0),the_carrier(boole_lattice(X1)))
| empty_carrier(boole_lattice(X1))
| lower_bounded_semilattstr(boole_lattice(X1)) ),
inference(resolution,[],[f249,f411]) ).
fof(f417,plain,
! [X0,X1] :
( ~ element(X0,the_carrier(boole_lattice(X1)))
| element(sK0(boole_lattice(X1),X0),the_carrier(boole_lattice(X1)))
| lower_bounded_semilattstr(boole_lattice(X1)) ),
inference(forward_subsumption_resolution,[],[f416,f312]) ).
fof(f418,plain,
! [X0,X1] :
( ~ element(X0,powerset(X1))
| element(sK0(boole_lattice(X1),X0),the_carrier(boole_lattice(X1)))
| lower_bounded_semilattstr(boole_lattice(X1)) ),
inference(forward_demodulation,[],[f417,f409]) ).
fof(f419,plain,
! [X0,X1] :
( ~ element(X0,powerset(X1))
| element(sK0(boole_lattice(X1),X0),powerset(X1))
| lower_bounded_semilattstr(boole_lattice(X1)) ),
inference(forward_demodulation,[],[f418,f409]) ).
fof(f434,plain,
! [X0] : empty_set = set_intersection2(empty_set,X0),
inference(superposition,[],[f378,f242]) ).
fof(f516,plain,
! [X0] : element(empty_set,powerset(X0)),
inference(resolution,[],[f383,f380]) ).
fof(f628,plain,
! [X0,X1] :
( ~ element(X0,powerset(X1))
| set_intersection2(X0,empty_set) = meet(boole_lattice(X1),X0,empty_set) ),
inference(resolution,[],[f516,f410]) ).
fof(f629,plain,
! [X0] : set_intersection2(empty_set,bottom_of_semilattstr(boole_lattice(X0))) = meet(boole_lattice(X0),empty_set,bottom_of_semilattstr(boole_lattice(X0))),
inference(resolution,[],[f516,f415]) ).
fof(f630,plain,
! [X0] :
( element(sK0(boole_lattice(X0),empty_set),powerset(X0))
| lower_bounded_semilattstr(boole_lattice(X0)) ),
inference(resolution,[],[f516,f419]) ).
fof(f643,plain,
! [X0] : empty_set = meet(boole_lattice(X0),empty_set,bottom_of_semilattstr(boole_lattice(X0))),
inference(forward_demodulation,[],[f629,f434]) ).
fof(f644,plain,
! [X0,X1] :
( ~ element(X0,powerset(X1))
| empty_set = meet(boole_lattice(X1),X0,empty_set) ),
inference(forward_demodulation,[],[f628,f378]) ).
fof(f676,plain,
! [X0,X1] :
( ~ element(X1,powerset(X0))
| lower_bounded_semilattstr(boole_lattice(X0))
| set_intersection2(X1,sK0(boole_lattice(X0),empty_set)) = meet(boole_lattice(X0),X1,sK0(boole_lattice(X0),empty_set)) ),
inference(resolution,[],[f630,f410]) ).
fof(f687,plain,
! [X0] :
( lower_bounded_semilattstr(boole_lattice(X0))
| empty_set = meet(boole_lattice(X0),sK0(boole_lattice(X0),empty_set),empty_set) ),
inference(resolution,[],[f630,f644]) ).
fof(f697,plain,
! [X0,X1] :
( empty_set = meet(boole_lattice(X0),sK0(boole_lattice(X0),empty_set),empty_set)
| ~ element(X1,the_carrier(boole_lattice(X0)))
| bottom_of_semilattstr(boole_lattice(X0)) = meet(boole_lattice(X0),X1,bottom_of_semilattstr(boole_lattice(X0)))
| empty_carrier(boole_lattice(X0))
| ~ meet_semilatt_str(boole_lattice(X0)) ),
inference(resolution,[],[f687,f405]) ).
fof(f698,plain,
! [X0,X1] :
( empty_set = meet(boole_lattice(X0),sK0(boole_lattice(X0),empty_set),empty_set)
| ~ element(X1,the_carrier(boole_lattice(X0)))
| bottom_of_semilattstr(boole_lattice(X0)) = meet(boole_lattice(X0),X1,bottom_of_semilattstr(boole_lattice(X0)))
| ~ meet_semilatt_str(boole_lattice(X0)) ),
inference(forward_subsumption_resolution,[],[f697,f312]) ).
fof(f702,plain,
! [X0,X1] :
( empty_set = meet(boole_lattice(X0),sK0(boole_lattice(X0),empty_set),empty_set)
| ~ element(X1,the_carrier(boole_lattice(X0)))
| bottom_of_semilattstr(boole_lattice(X0)) = meet(boole_lattice(X0),X1,bottom_of_semilattstr(boole_lattice(X0))) ),
inference(forward_subsumption_resolution,[],[f698,f411]) ).
fof(f706,plain,
! [X0,X1] :
( ~ element(X1,powerset(X0))
| empty_set = meet(boole_lattice(X0),sK0(boole_lattice(X0),empty_set),empty_set)
| bottom_of_semilattstr(boole_lattice(X0)) = meet(boole_lattice(X0),X1,bottom_of_semilattstr(boole_lattice(X0))) ),
inference(forward_demodulation,[],[f702,f409]) ).
fof(f713,plain,
! [X0] :
( lower_bounded_semilattstr(boole_lattice(X0))
| set_intersection2(empty_set,sK0(boole_lattice(X0),empty_set)) = meet(boole_lattice(X0),empty_set,sK0(boole_lattice(X0),empty_set)) ),
inference(resolution,[],[f676,f516]) ).
fof(f727,plain,
! [X0] :
( lower_bounded_semilattstr(boole_lattice(X0))
| empty_set = meet(boole_lattice(X0),empty_set,sK0(boole_lattice(X0),empty_set)) ),
inference(forward_demodulation,[],[f713,f434]) ).
fof(f747,plain,
! [X0] :
( empty_set = meet(boole_lattice(X0),sK0(boole_lattice(X0),empty_set),empty_set)
| bottom_of_semilattstr(boole_lattice(X0)) = meet(boole_lattice(X0),empty_set,bottom_of_semilattstr(boole_lattice(X0))) ),
inference(resolution,[],[f706,f516]) ).
fof(f756,plain,
! [X0] :
( empty_set = meet(boole_lattice(X0),sK0(boole_lattice(X0),empty_set),empty_set)
| empty_set = bottom_of_semilattstr(boole_lattice(X0)) ),
inference(forward_demodulation,[],[f747,f643]) ).
fof(f758,plain,
! [X0] :
( empty_set != empty_set
| ~ element(empty_set,the_carrier(boole_lattice(X0)))
| empty_set != meet(boole_lattice(X0),empty_set,sK0(boole_lattice(X0),empty_set))
| lower_bounded_semilattstr(boole_lattice(X0))
| empty_carrier(boole_lattice(X0))
| ~ meet_semilatt_str(boole_lattice(X0))
| empty_set = bottom_of_semilattstr(boole_lattice(X0)) ),
inference(superposition,[],[f250,f756]) ).
fof(f759,plain,
! [X0] :
( ~ element(empty_set,the_carrier(boole_lattice(X0)))
| empty_set != meet(boole_lattice(X0),empty_set,sK0(boole_lattice(X0),empty_set))
| lower_bounded_semilattstr(boole_lattice(X0))
| empty_carrier(boole_lattice(X0))
| ~ meet_semilatt_str(boole_lattice(X0))
| empty_set = bottom_of_semilattstr(boole_lattice(X0)) ),
inference(trivial_inequality_removal,[],[f758]) ).
fof(f760,plain,
! [X0] :
( ~ element(empty_set,the_carrier(boole_lattice(X0)))
| lower_bounded_semilattstr(boole_lattice(X0))
| empty_carrier(boole_lattice(X0))
| ~ meet_semilatt_str(boole_lattice(X0))
| empty_set = bottom_of_semilattstr(boole_lattice(X0)) ),
inference(forward_subsumption_resolution,[],[f759,f727]) ).
fof(f761,plain,
! [X0] :
( ~ element(empty_set,the_carrier(boole_lattice(X0)))
| lower_bounded_semilattstr(boole_lattice(X0))
| ~ meet_semilatt_str(boole_lattice(X0))
| empty_set = bottom_of_semilattstr(boole_lattice(X0)) ),
inference(forward_subsumption_resolution,[],[f760,f312]) ).
fof(f762,plain,
! [X0] :
( ~ element(empty_set,the_carrier(boole_lattice(X0)))
| lower_bounded_semilattstr(boole_lattice(X0))
| empty_set = bottom_of_semilattstr(boole_lattice(X0)) ),
inference(forward_subsumption_resolution,[],[f761,f411]) ).
fof(f763,plain,
! [X0] :
( ~ element(empty_set,powerset(X0))
| lower_bounded_semilattstr(boole_lattice(X0))
| empty_set = bottom_of_semilattstr(boole_lattice(X0)) ),
inference(forward_demodulation,[],[f762,f409]) ).
fof(f764,plain,
! [X0] :
( lower_bounded_semilattstr(boole_lattice(X0))
| empty_set = bottom_of_semilattstr(boole_lattice(X0)) ),
inference(forward_subsumption_resolution,[],[f763,f516]) ).
fof(f768,plain,
! [X0,X1] :
( empty_set = bottom_of_semilattstr(boole_lattice(X0))
| ~ element(X1,the_carrier(boole_lattice(X0)))
| bottom_of_semilattstr(boole_lattice(X0)) = meet(boole_lattice(X0),X1,bottom_of_semilattstr(boole_lattice(X0)))
| empty_carrier(boole_lattice(X0))
| ~ meet_semilatt_str(boole_lattice(X0)) ),
inference(resolution,[],[f764,f405]) ).
fof(f769,plain,
! [X0,X1] :
( empty_set = bottom_of_semilattstr(boole_lattice(X0))
| ~ element(X1,the_carrier(boole_lattice(X0)))
| bottom_of_semilattstr(boole_lattice(X0)) = meet(boole_lattice(X0),X1,bottom_of_semilattstr(boole_lattice(X0)))
| ~ meet_semilatt_str(boole_lattice(X0)) ),
inference(forward_subsumption_resolution,[],[f768,f312]) ).
fof(f773,plain,
! [X0,X1] :
( empty_set = bottom_of_semilattstr(boole_lattice(X0))
| ~ element(X1,the_carrier(boole_lattice(X0)))
| bottom_of_semilattstr(boole_lattice(X0)) = meet(boole_lattice(X0),X1,bottom_of_semilattstr(boole_lattice(X0))) ),
inference(forward_subsumption_resolution,[],[f769,f411]) ).
fof(f777,plain,
! [X0,X1] :
( ~ element(X1,powerset(X0))
| empty_set = bottom_of_semilattstr(boole_lattice(X0))
| bottom_of_semilattstr(boole_lattice(X0)) = meet(boole_lattice(X0),X1,bottom_of_semilattstr(boole_lattice(X0))) ),
inference(forward_demodulation,[],[f773,f409]) ).
fof(f784,plain,
! [X0] :
( empty_set = bottom_of_semilattstr(boole_lattice(X0))
| bottom_of_semilattstr(boole_lattice(X0)) = meet(boole_lattice(X0),empty_set,bottom_of_semilattstr(boole_lattice(X0))) ),
inference(resolution,[],[f777,f516]) ).
fof(f793,plain,
! [X0] :
( empty_set = bottom_of_semilattstr(boole_lattice(X0))
| empty_set = bottom_of_semilattstr(boole_lattice(X0)) ),
inference(forward_demodulation,[],[f784,f643]) ).
fof(f794,plain,
! [X0] : empty_set = bottom_of_semilattstr(boole_lattice(X0)),
inference(duplicate_literal_removal,[],[f793]) ).
fof(f796,plain,
( $false
| spl22_1 ),
inference(unit_resulting_resolution,[],[f794,f397]) ).
fof(f812,plain,
spl22_1,
inference(avatar_contradiction_clause,[],[f796]) ).
fof(f818,plain,
( empty_set = meet(boole_lattice(sK21),sK0(boole_lattice(sK21),empty_set),empty_set)
| spl22_2 ),
inference(resolution,[],[f400,f687]) ).
fof(f819,plain,
( empty_set != empty_set
| ~ element(empty_set,the_carrier(boole_lattice(sK21)))
| empty_set != meet(boole_lattice(sK21),empty_set,sK0(boole_lattice(sK21),empty_set))
| lower_bounded_semilattstr(boole_lattice(sK21))
| empty_carrier(boole_lattice(sK21))
| ~ meet_semilatt_str(boole_lattice(sK21))
| spl22_2 ),
inference(superposition,[],[f250,f818]) ).
fof(f820,plain,
( ~ element(empty_set,the_carrier(boole_lattice(sK21)))
| empty_set != meet(boole_lattice(sK21),empty_set,sK0(boole_lattice(sK21),empty_set))
| lower_bounded_semilattstr(boole_lattice(sK21))
| empty_carrier(boole_lattice(sK21))
| ~ meet_semilatt_str(boole_lattice(sK21))
| spl22_2 ),
inference(trivial_inequality_removal,[],[f819]) ).
fof(f821,plain,
( ~ element(empty_set,the_carrier(boole_lattice(sK21)))
| lower_bounded_semilattstr(boole_lattice(sK21))
| empty_carrier(boole_lattice(sK21))
| ~ meet_semilatt_str(boole_lattice(sK21))
| spl22_2 ),
inference(forward_subsumption_resolution,[],[f820,f727]) ).
fof(f822,plain,
( ~ element(empty_set,the_carrier(boole_lattice(sK21)))
| empty_carrier(boole_lattice(sK21))
| ~ meet_semilatt_str(boole_lattice(sK21))
| spl22_2 ),
inference(forward_subsumption_resolution,[],[f821,f400]) ).
fof(f823,plain,
( ~ element(empty_set,the_carrier(boole_lattice(sK21)))
| ~ meet_semilatt_str(boole_lattice(sK21))
| spl22_2 ),
inference(forward_subsumption_resolution,[],[f822,f312]) ).
fof(f824,plain,
( ~ element(empty_set,the_carrier(boole_lattice(sK21)))
| spl22_2 ),
inference(forward_subsumption_resolution,[],[f823,f411]) ).
fof(f825,plain,
( ~ element(empty_set,powerset(sK21))
| spl22_2 ),
inference(forward_demodulation,[],[f824,f409]) ).
fof(f826,plain,
( $false
| spl22_2 ),
inference(forward_subsumption_resolution,[],[f825,f516]) ).
fof(f827,plain,
spl22_2,
inference(avatar_contradiction_clause,[],[f826]) ).
cnf(s1,plain,
( ~ spl22_1
| ~ spl22_2 ),
inference(sat_conversion,[],[f401]) ).
cnf(s4,plain,
spl22_1,
inference(sat_conversion,[],[f812]) ).
cnf(s5,plain,
spl22_2,
inference(sat_conversion,[],[f827]) ).
cnf(s6,plain,
$false,
inference(rat,[],[s1,s5,s4]) ).
fof(f828,plain,
$false,
inference(avatar_sat_refutation,[],[s6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU345+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.31 % Computer : n012.cluster.edu
% 0.03/0.31 % Model : x86_64 x86_64
% 0.03/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.31 % Memory : 8046.5625MB
% 0.03/0.31 % OS : Linux 6.8.0-71-generic
% 0.03/0.31 % CPULimit : 300
% 0.03/0.31 % WCLimit : 300
% 0.03/0.31 % DateTime : Mon Sep 28 04:49:04 UTC 2026
% 0.03/0.31 % CPUTime :
% 0.03/0.31 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.33 Running first-order theorem proving
% 0.08/0.33 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
% 4.52/1.22 % (3024349)Detected formulas, will run a generic FOF schedule.
% 4.52/1.22 % (3024357)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3662721100:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.52/1.22 % (3024356)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=477196764:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.52/1.22 % (3024358)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3272780804:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.52/1.22 % (3024354)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=3049177118:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.52/1.22 % (3024359)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3103182774:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.52/1.22 % (3024355)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=1523641186:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.52/1.22 % (3024360)dis-21_1_sil=8000:lcm=predicate:random_seed=2525242771: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)
% 4.52/1.22 % (3024357)Refutation not found, incomplete strategy
% 4.52/1.22 % (3024357)------------------------------
% 4.52/1.22 % (3024357)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.52/1.22 % (3024357)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/1.22 % (3024357)CaDiCaL version: 2.1.3
% 4.52/1.22 % (3024357)Termination reason: Refutation not found, incomplete strategy
% 4.52/1.22 % (3024357)Time elapsed: 0.001 s
% 4.52/1.22 % (3024357)Peak memory usage: 88 MB
% 4.52/1.22 % (3024358)Refutation not found, incomplete strategy
% 4.52/1.22 % (3024358)------------------------------
% 4.52/1.22 % (3024358)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.52/1.22 % (3024358)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/1.22 % (3024358)CaDiCaL version: 2.1.3
% 4.52/1.22 % (3024358)Termination reason: Refutation not found, incomplete strategy
% 4.52/1.22 % (3024358)Time elapsed: 0.002 s
% 4.52/1.22 % (3024358)Peak memory usage: 88 MB
% 4.52/1.22 % (3024358)Instructions burned: 5 (million)
% 4.52/1.22 % (3024360)Instruction limit reached!
% 4.52/1.22 % (3024360)------------------------------
% 4.52/1.22 % (3024360)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.52/1.22 % (3024360)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/1.22 % (3024360)CaDiCaL version: 2.1.3
% 4.52/1.22 % (3024360)Termination reason: Instruction limit
% 4.52/1.22 % (3024360)Termination phase: Saturation
% 4.52/1.22 % (3024360)Time elapsed: 0.040 s
% 4.52/1.22 % (3024360)Peak memory usage: 92 MB
% 4.52/1.22 % (3024360)Instructions burned: 129 (million)
% 4.52/1.22 % (3024359)Instruction limit reached!
% 4.52/1.22 % (3024359)------------------------------
% 4.52/1.22 % (3024359)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.52/1.22 % (3024359)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/1.22 % (3024359)CaDiCaL version: 2.1.3
% 4.52/1.22 % (3024359)Termination reason: Instruction limit
% 4.52/1.22 % (3024359)Termination phase: Saturation
% 4.52/1.22 % (3024359)Time elapsed: 0.053 s
% 4.52/1.22 % (3024359)Peak memory usage: 90 MB
% 4.52/1.22 % (3024359)Instructions burned: 140 (million)
% 4.52/1.22 % (3024368)lrs+10_1_sil=8000:sp=occurrence:random_seed=525806441:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 4.52/1.22 % (3024358)------------------------------
% 4.52/1.22 % (3024358)------------------------------
% 4.52/1.22 % (3024357)------------------------------
% 4.52/1.22 % (3024357)------------------------------
% 4.52/1.22 % (3024369)lrs+10_1_sil=32000:urr=on:br=off:random_seed=45418423:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/157Mi)
% 4.52/1.22 % (3024369)Refutation not found, incomplete strategy
% 4.52/1.22 % (3024369)------------------------------
% 4.52/1.22 % (3024369)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.52/1.22 % (3024369)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/1.22 % (3024369)CaDiCaL version: 2.1.3
% 4.52/1.22 % (3024369)Termination reason: Refutation not found, incomplete strategy
% 4.52/1.22 % (3024369)Time elapsed: 0.001 s
% 4.52/1.22 % (3024369)Peak memory usage: 89 MB
% 4.52/1.22 % (3024369)Instructions burned: 3 (million)
% 4.52/1.22 % (3024368)Instruction limit reached!
% 4.52/1.22 % (3024368)------------------------------
% 4.52/1.22 % (3024368)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.52/1.22 % (3024368)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/1.22 % (3024368)CaDiCaL version: 2.1.3
% 4.52/1.22 % (3024368)Termination reason: Instruction limit
% 4.52/1.22 % (3024368)Termination phase: Saturation
% 4.52/1.22 % (3024368)Time elapsed: 0.098 s
% 4.52/1.22 % (3024368)Peak memory usage: 93 MB
% 4.52/1.22 % (3024368)Instructions burned: 287 (million)
% 4.52/1.22 % (3024372)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1690866242:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.52/1.22 % (3024373)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=4170783488:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 4.52/1.22 % (3024372)Refutation not found, incomplete strategy
% 4.52/1.22 % (3024372)------------------------------
% 4.52/1.22 % (3024372)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.52/1.22 % (3024372)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/1.22 % (3024372)CaDiCaL version: 2.1.3
% 4.52/1.22 % (3024372)Termination reason: Refutation not found, incomplete strategy
% 4.52/1.22 % (3024372)Time elapsed: 0.002 s
% 4.52/1.22 % (3024372)Peak memory usage: 88 MB
% 4.52/1.22 % (3024372)Instructions burned: 4 (million)
% 4.52/1.22 % (3024369)------------------------------
% 4.52/1.22 % (3024369)------------------------------
% 4.52/1.22 % (3024373)Instruction limit reached!
% 4.52/1.22 % (3024373)------------------------------
% 4.52/1.22 % (3024373)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.52/1.22 % (3024373)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/1.22 % (3024373)CaDiCaL version: 2.1.3
% 4.52/1.22 % (3024373)Termination reason: Instruction limit
% 4.52/1.22 % (3024373)Termination phase: Saturation
% 4.52/1.22 % (3024373)Time elapsed: 0.075 s
% 4.52/1.22 % (3024373)Peak memory usage: 92 MB
% 4.52/1.22 % (3024373)Instructions burned: 250 (million)
% 4.52/1.22 % (3024374)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=393340911:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2996 on theBenchmark for (2996ds/294Mi)
% 4.52/1.22 % (3024374)Refutation not found, incomplete strategy
% 4.52/1.22 % (3024374)------------------------------
% 4.52/1.22 % (3024374)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.52/1.22 % (3024374)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/1.22 % (3024374)CaDiCaL version: 2.1.3
% 4.52/1.22 % (3024374)Termination reason: Refutation not found, incomplete strategy
% 4.52/1.22 % (3024374)Time elapsed: 0.002 s
% 4.52/1.22 % (3024374)Peak memory usage: 88 MB
% 4.52/1.22 % (3024374)Instructions burned: 5 (million)
% 4.52/1.22 % (3024372)------------------------------
% 4.52/1.22 % (3024372)------------------------------
% 4.52/1.22 % (3024377)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=1342303728:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 4.52/1.22 % (3024355)First to succeed.
% 4.52/1.22 % (3024355)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3024349"
% 4.52/1.22 % (3024378)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=2208147030:cts=off:i=113:fsr=off:ss=included:sgt=4_2995 on theBenchmark for (2995ds/113Mi)
% 4.52/1.22 % (3024378)Instruction limit reached!
% 4.52/1.22 % (3024378)------------------------------
% 4.52/1.22 % (3024378)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.52/1.22 % (3024378)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/1.22 % (3024378)CaDiCaL version: 2.1.3
% 4.52/1.22 % (3024378)Termination reason: Instruction limit
% 4.52/1.22 % (3024378)Termination phase: Saturation
% 4.52/1.22 % (3024378)Time elapsed: 0.042 s
% 4.52/1.22 % (3024378)Peak memory usage: 90 MB
% 4.52/1.22 % (3024378)Instructions burned: 115 (million)
% 4.52/1.22 % (3024374)------------------------------
% 4.52/1.22 % (3024374)------------------------------
% 4.52/1.22 % (3024381)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=480314096:i=127:av=off:fsr=off:sup=off_2994 on theBenchmark for (2994ds/127Mi)
% 4.52/1.22 % (3024381)Refutation not found, incomplete strategy
% 4.52/1.22 % (3024381)------------------------------
% 4.52/1.22 % (3024381)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.52/1.22 % (3024381)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/1.22 % (3024381)CaDiCaL version: 2.1.3
% 4.52/1.22 % (3024381)Termination reason: Refutation not found, incomplete strategy
% 4.52/1.22 % (3024381)Time elapsed: 0.003 s
% 4.52/1.22 % (3024381)Peak memory usage: 88 MB
% 4.52/1.22 % (3024381)Instructions burned: 9 (million)
% 4.52/1.22 % (3024355)Refutation found. Thanks to Tanya!
% 4.52/1.22 % SZS status Theorem for theBenchmark
% 4.52/1.22 % SZS output start Proof for theBenchmark
% See solution above
% 5.07/1.31 % (3024355)------------------------------
% 5.07/1.31 % (3024355)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.07/1.31 % (3024355)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.07/1.31 % (3024355)CaDiCaL version: 2.1.3
% 5.07/1.31 % (3024355)Termination reason: Refutation
% 5.07/1.31 % (3024355)Time elapsed: 0.414 s
% 5.07/1.31 % (3024355)Peak memory usage: 129 MB
% 5.07/1.31 % (3024355)Instructions burned: 1092 (million)
% 5.07/1.31 % (3024355)------------------------------
% 5.07/1.31 % (3024355)------------------------------
% 5.07/1.31 % (3024349)Success in time 0.688 s
% 5.07/1.31 % Vampire exiting
%------------------------------------------------------------------------------