%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU371+1 : 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 : n001.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:53:02 PM UTC 2026
% Result : Theorem 0.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 45 ( 23 unt; 0 def)
% Number of atoms : 141 ( 37 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 140 ( 44 ~; 38 |; 55 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 22 ( 20 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 2 con; 0-2 aty)
% Number of variables : 48 ( 47 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f19,axiom,
! [X0] :
( rel_str(X0)
=> bottom_of_relstr(X0) = join_on_relstr(X0,empty_set) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d11_yellow_0) ).
fof(f22,axiom,
! [X0] : boole_POSet(X0) = poset_of_lattice(boole_lattice(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_yellow_1) ).
fof(f27,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] :
( strict_rel_str(boole_POSet(X0))
& rel_str(boole_POSet(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k3_yellow_1) ).
fof(f59,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))
& distributive_lattstr(boole_lattice(X0))
& modular_lattstr(boole_lattice(X0))
& lower_bounded_semilattstr(boole_lattice(X0))
& upper_bounded_semilattstr(boole_lattice(X0))
& bounded_lattstr(boole_lattice(X0))
& complemented_lattstr(boole_lattice(X0))
& boolean_lattstr(boole_lattice(X0))
& complete_latt_str(boole_lattice(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_knaster) ).
fof(f103,conjecture,
! [X0] : bottom_of_relstr(boole_POSet(X0)) = empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_yellow_1) ).
fof(f104,negated_conjecture,
~ ! [X0] : bottom_of_relstr(boole_POSet(X0)) = empty_set,
inference(negated_conjecture,[status(cth)],[f103]) ).
fof(f106,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& lattice(X0)
& complete_latt_str(X0)
& latt_str(X0) )
=> ! [X1] :
( join_of_latt_set(X0,X1) = join_on_relstr(poset_of_lattice(X0),X1)
& meet_of_latt_set(X0,X1) = meet_on_relstr(poset_of_lattice(X0),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t29_yellow_0) ).
fof(f109,axiom,
! [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(f112,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& lattice(X0)
& complete_latt_str(X0)
& latt_str(X0) )
=> ( ~ empty_carrier(X0)
& lattice(X0)
& lower_bounded_semilattstr(X0)
& latt_str(X0)
& bottom_of_semilattstr(X0) = join_of_latt_set(X0,empty_set) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t50_lattice3) ).
fof(f122,plain,
! [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))
& distributive_lattstr(boole_lattice(X0))
& lower_bounded_semilattstr(boole_lattice(X0))
& upper_bounded_semilattstr(boole_lattice(X0))
& bounded_lattstr(boole_lattice(X0))
& complemented_lattstr(boole_lattice(X0))
& boolean_lattstr(boole_lattice(X0))
& complete_latt_str(boole_lattice(X0)) ),
inference(pure_predicate_removal,[],[f59]) ).
fof(f160,plain,
! [X0] :
( bottom_of_relstr(X0) = join_on_relstr(X0,empty_set)
| ~ rel_str(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f221,plain,
? [X0] : empty_set != bottom_of_relstr(boole_POSet(X0)),
inference(ennf_transformation,[],[f104]) ).
fof(f223,plain,
! [X0] :
( ! [X1] :
( join_of_latt_set(X0,X1) = join_on_relstr(poset_of_lattice(X0),X1)
& meet_of_latt_set(X0,X1) = meet_on_relstr(poset_of_lattice(X0),X1) )
| empty_carrier(X0)
| ~ lattice(X0)
| ~ complete_latt_str(X0)
| ~ latt_str(X0) ),
inference(ennf_transformation,[],[f106]) ).
fof(f224,plain,
! [X0] :
( ! [X1] :
( join_of_latt_set(X0,X1) = join_on_relstr(poset_of_lattice(X0),X1)
& meet_of_latt_set(X0,X1) = meet_on_relstr(poset_of_lattice(X0),X1) )
| empty_carrier(X0)
| ~ lattice(X0)
| ~ complete_latt_str(X0)
| ~ latt_str(X0) ),
inference(flattening,[],[f223]) ).
fof(f231,plain,
! [X0] :
( ( ~ empty_carrier(X0)
& lattice(X0)
& lower_bounded_semilattstr(X0)
& latt_str(X0)
& bottom_of_semilattstr(X0) = join_of_latt_set(X0,empty_set) )
| empty_carrier(X0)
| ~ lattice(X0)
| ~ complete_latt_str(X0)
| ~ latt_str(X0) ),
inference(ennf_transformation,[],[f112]) ).
fof(f232,plain,
! [X0] :
( ( ~ empty_carrier(X0)
& lattice(X0)
& lower_bounded_semilattstr(X0)
& latt_str(X0)
& bottom_of_semilattstr(X0) = join_of_latt_set(X0,empty_set) )
| empty_carrier(X0)
| ~ lattice(X0)
| ~ complete_latt_str(X0)
| ~ latt_str(X0) ),
inference(flattening,[],[f231]) ).
fof(f274,plain,
empty_set != bottom_of_relstr(boole_POSet(sK30)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK30]),skolemize(X0,sK30)],[f221]) ).
fof(f332,plain,
! [X0] :
( ~ rel_str(X0)
| bottom_of_relstr(X0) = join_on_relstr(X0,empty_set) ),
inference(cnf_transformation,[],[f160]) ).
fof(f335,plain,
! [X0] : boole_POSet(X0) = poset_of_lattice(boole_lattice(X0)),
inference(cnf_transformation,[],[f22]) ).
fof(f342,plain,
! [X0] : latt_str(boole_lattice(X0)),
inference(cnf_transformation,[],[f27]) ).
fof(f357,plain,
! [X0] : rel_str(boole_POSet(X0)),
inference(cnf_transformation,[],[f36]) ).
fof(f381,plain,
! [X0] : complete_latt_str(boole_lattice(X0)),
inference(cnf_transformation,[],[f122]) ).
fof(f388,plain,
! [X0] : lattice(boole_lattice(X0)),
inference(cnf_transformation,[],[f122]) ).
fof(f396,plain,
! [X0] : ~ empty_carrier(boole_lattice(X0)),
inference(cnf_transformation,[],[f122]) ).
fof(f626,plain,
empty_set != bottom_of_relstr(boole_POSet(sK30)),
inference(cnf_transformation,[],[f274]) ).
fof(f629,plain,
! [X0,X1] :
( ~ complete_latt_str(X0)
| empty_carrier(X0)
| ~ lattice(X0)
| join_of_latt_set(X0,X1) = join_on_relstr(poset_of_lattice(X0),X1)
| ~ latt_str(X0) ),
inference(cnf_transformation,[],[f224]) ).
fof(f633,plain,
! [X0] : empty_set = bottom_of_semilattstr(boole_lattice(X0)),
inference(cnf_transformation,[],[f109]) ).
fof(f637,plain,
! [X0] :
( ~ complete_latt_str(X0)
| empty_carrier(X0)
| ~ lattice(X0)
| bottom_of_semilattstr(X0) = join_of_latt_set(X0,empty_set)
| ~ latt_str(X0) ),
inference(cnf_transformation,[],[f232]) ).
fof(f647,plain,
! [X0] : rel_str(poset_of_lattice(boole_lattice(X0))),
inference(definition_unfolding,[],[f357,f335]) ).
fof(f664,plain,
empty_set != bottom_of_relstr(poset_of_lattice(boole_lattice(sK30))),
inference(definition_unfolding,[],[f626,f335]) ).
fof(f828,plain,
! [X0] : bottom_of_relstr(poset_of_lattice(boole_lattice(X0))) = join_on_relstr(poset_of_lattice(boole_lattice(X0)),empty_set),
inference(resolution,[],[f332,f647]) ).
fof(f1283,plain,
! [X0] :
( empty_carrier(boole_lattice(X0))
| ~ lattice(boole_lattice(X0))
| bottom_of_semilattstr(boole_lattice(X0)) = join_of_latt_set(boole_lattice(X0),empty_set)
| ~ latt_str(boole_lattice(X0)) ),
inference(resolution,[],[f637,f381]) ).
fof(f1284,plain,
! [X0] :
( ~ lattice(boole_lattice(X0))
| bottom_of_semilattstr(boole_lattice(X0)) = join_of_latt_set(boole_lattice(X0),empty_set)
| ~ latt_str(boole_lattice(X0)) ),
inference(forward_subsumption_resolution,[],[f1283,f396]) ).
fof(f1285,plain,
! [X0] :
( bottom_of_semilattstr(boole_lattice(X0)) = join_of_latt_set(boole_lattice(X0),empty_set)
| ~ latt_str(boole_lattice(X0)) ),
inference(forward_subsumption_resolution,[],[f1284,f388]) ).
fof(f1286,plain,
! [X0] : bottom_of_semilattstr(boole_lattice(X0)) = join_of_latt_set(boole_lattice(X0),empty_set),
inference(forward_subsumption_resolution,[],[f1285,f342]) ).
fof(f1287,plain,
! [X0] : empty_set = join_of_latt_set(boole_lattice(X0),empty_set),
inference(forward_demodulation,[],[f1286,f633]) ).
fof(f1327,plain,
! [X0,X1] :
( empty_carrier(boole_lattice(X0))
| ~ lattice(boole_lattice(X0))
| join_of_latt_set(boole_lattice(X0),X1) = join_on_relstr(poset_of_lattice(boole_lattice(X0)),X1)
| ~ latt_str(boole_lattice(X0)) ),
inference(resolution,[],[f629,f381]) ).
fof(f1328,plain,
! [X0,X1] :
( ~ lattice(boole_lattice(X0))
| join_of_latt_set(boole_lattice(X0),X1) = join_on_relstr(poset_of_lattice(boole_lattice(X0)),X1)
| ~ latt_str(boole_lattice(X0)) ),
inference(forward_subsumption_resolution,[],[f1327,f396]) ).
fof(f1329,plain,
! [X0,X1] :
( join_of_latt_set(boole_lattice(X0),X1) = join_on_relstr(poset_of_lattice(boole_lattice(X0)),X1)
| ~ latt_str(boole_lattice(X0)) ),
inference(forward_subsumption_resolution,[],[f1328,f388]) ).
fof(f1330,plain,
! [X0,X1] : join_of_latt_set(boole_lattice(X0),X1) = join_on_relstr(poset_of_lattice(boole_lattice(X0)),X1),
inference(forward_subsumption_resolution,[],[f1329,f342]) ).
fof(f1940,plain,
! [X0] : bottom_of_relstr(poset_of_lattice(boole_lattice(X0))) = join_of_latt_set(boole_lattice(X0),empty_set),
inference(superposition,[],[f828,f1330]) ).
fof(f1943,plain,
! [X0] : empty_set = bottom_of_relstr(poset_of_lattice(boole_lattice(X0))),
inference(forward_demodulation,[],[f1940,f1287]) ).
fof(f1962,plain,
empty_set != empty_set,
inference(superposition,[],[f664,f1943]) ).
fof(f1965,plain,
$false,
inference(trivial_inequality_removal,[],[f1962]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU371+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n001.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 05:05:02 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/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.18/0.48 % (34685)Will run a generic schedule for satisfiability detection.
% 0.18/0.48 % (34693)dis+10_1_sil=32000:sp=arity:random_seed=1832363719:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.48 % (34691)% WARNING: option uhcvi not known.
% 0.18/0.48 % (34690)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4287893410_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.48 % (34692)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1449250909:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.48 % (34691)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1740461710:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.48 % (34694)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2540483907:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.48 % (34695)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=477198651:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.48 % (34696)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1682357487:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.48 % (34693) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-34685-34693"...
% 0.18/0.48 % (34693)...printing done.
% 0.18/0.48 % TRYING [1]
% 0.18/0.48 % (34693)Refutation found. Thanks to Tanya!
% 0.18/0.48 % SZS status Theorem for theBenchmark
% 0.18/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.48 % (34693)------------------------------
% 0.18/0.48 % (34693)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.48 % (34693)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.48 % (34693)CaDiCaL version: 2.1.3
% 0.18/0.48 % (34693)Termination reason: Refutation
% 0.18/0.48 % (34693)Time elapsed: 0.019 s
% 0.18/0.48 % (34693)Peak memory usage: 12 MB
% 0.18/0.48 % (34693)Instructions burned: 52 (million)
% 0.18/0.48 % (34685)Success in time 0.054 s
% 0.18/0.48 % Vampire exiting
%------------------------------------------------------------------------------