%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LAT014-1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 11:45:50 AM UTC 2026
% Result : Unsatisfiable 3.33s 1.46s
% Output : Refutation 3.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 38 ( 38 unt; 8 def)
% Number of atoms : 38 ( 37 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 76 ( 76 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X2,X0,X1] : join(X0,meet(X1,meet(X0,X2))) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mckenzie1) ).
fof(f2,negated_conjecture,
! [X2,X0,X1] : meet(X0,join(X1,join(X0,X2))) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mckenzie2) ).
fof(f4,negated_conjecture,
! [X2,X0,X1] : meet(meet(join(X0,X1),join(X1,X2)),X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mckenzie4) ).
fof(f5,negated_conjecture,
meet(a,join(a,b)) != a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_absorbtion) ).
fof(f6,plain,
a != meet(a,join(a,b)),
inference(reorient_equations,[],[f5]) ).
fof(f7,definition,
! [X2,X0,X1] : sF0(X1,X0,X2) = meet(X1,meet(X0,X2)),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f8,plain,
! [X2,X0,X1] : meet(X1,meet(X0,X2)) = sF0(X1,X0,X2),
inference(reorient_equations,[],[f7]) ).
fof(f9,definition,
! [X2,X0,X1] : sF1(X0,X1,X2) = join(X0,sF0(X1,X0,X2)),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f10,plain,
! [X2,X0,X1] : join(X0,sF0(X1,X0,X2)) = sF1(X0,X1,X2),
inference(reorient_equations,[],[f9]) ).
fof(f11,plain,
! [X2,X0,X1] : sF1(X0,X1,X2) = X0,
inference(definition_folding,[],[f1,f10,f8]) ).
fof(f12,definition,
! [X2,X0,X1] : sF2(X1,X0,X2) = join(X1,join(X0,X2)),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f13,plain,
! [X2,X0,X1] : join(X1,join(X0,X2)) = sF2(X1,X0,X2),
inference(reorient_equations,[],[f12]) ).
fof(f14,definition,
! [X2,X0,X1] : sF3(X0,X1,X2) = meet(X0,sF2(X1,X0,X2)),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f15,plain,
! [X2,X0,X1] : meet(X0,sF2(X1,X0,X2)) = sF3(X0,X1,X2),
inference(reorient_equations,[],[f14]) ).
fof(f16,plain,
! [X2,X0,X1] : sF3(X0,X1,X2) = X0,
inference(definition_folding,[],[f2,f15,f13]) ).
fof(f22,definition,
! [X2,X0,X1] : sF6(X0,X1,X2) = meet(join(X0,X1),join(X1,X2)),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f23,plain,
! [X2,X0,X1] : meet(join(X0,X1),join(X1,X2)) = sF6(X0,X1,X2),
inference(reorient_equations,[],[f22]) ).
fof(f24,definition,
! [X2,X0,X1] : sF7(X0,X1,X2) = meet(sF6(X0,X1,X2),X1),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f25,plain,
! [X2,X0,X1] : meet(sF6(X0,X1,X2),X1) = sF7(X0,X1,X2),
inference(reorient_equations,[],[f24]) ).
fof(f26,plain,
! [X2,X0,X1] : sF7(X0,X1,X2) = X1,
inference(definition_folding,[],[f4,f25,f23]) ).
fof(f27,definition,
sF8 = join(a,b),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f28,plain,
join(a,b) = sF8,
inference(reorient_equations,[],[f27]) ).
fof(f29,definition,
sF9 = meet(a,sF8),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f30,plain,
meet(a,sF8) = sF9,
inference(reorient_equations,[],[f29]) ).
fof(f31,plain,
a != sF9,
inference(definition_folding,[],[f6,f30,f28]) ).
fof(f32,plain,
! [X2,X0,X1] : meet(sF6(X0,X1,X2),X1) = X1,
inference(forward_demodulation,[],[f26,f25]) ).
fof(f34,plain,
! [X2,X0,X1] : meet(X0,sF2(X1,X0,X2)) = X0,
inference(forward_demodulation,[],[f16,f15]) ).
fof(f35,plain,
! [X2,X0,X1] : join(X0,sF0(X1,X0,X2)) = X0,
inference(forward_demodulation,[],[f11,f10]) ).
fof(f36,plain,
! [X2,X0,X1] : meet(meet(join(X0,X1),join(X1,X2)),X1) = X1,
inference(forward_demodulation,[],[f32,f23]) ).
fof(f38,plain,
! [X2,X0,X1] : meet(X0,join(X1,join(X0,X2))) = X0,
inference(forward_demodulation,[],[f34,f13]) ).
fof(f39,plain,
! [X2,X0,X1] : join(X0,meet(X1,meet(X0,X2))) = X0,
inference(forward_demodulation,[],[f35,f8]) ).
fof(f40,plain,
! [X0] : a = meet(a,join(X0,sF8)),
inference(superposition,[],[f38,f28]) ).
fof(f43,plain,
! [X0,X1] : join(X0,meet(X1,X0)) = X0,
inference(superposition,[],[f39,f38]) ).
fof(f82,plain,
! [X0] : join(X0,X0) = X0,
inference(superposition,[],[f43,f36]) ).
fof(f92,plain,
a = meet(a,sF8),
inference(superposition,[],[f40,f82]) ).
fof(f93,plain,
a = sF9,
inference(forward_demodulation,[],[f92,f30]) ).
fof(f97,plain,
a != a,
inference(superposition,[],[f31,f93]) ).
fof(f98,plain,
$false,
inference(trivial_inequality_removal,[],[f97]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT014-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n005.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 13:56:17 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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
% 3.33/1.46 % (4003247)Detected a unit-equality problem, will run specialized UEQ schedule.
% 3.33/1.46 % (4003330)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=2846609874:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 3.33/1.46 % (4003330)First to succeed.
% 3.33/1.46 % (4003330)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4003247"
% 3.33/1.46 % (4003331)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=4009752767:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 3.33/1.46 % (4003327)lrs+11_1_ncem=casc2026/models/loop6.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=203987889:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 3.33/1.46 % (4003332)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=4101432625:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 3.33/1.46 % (4003326)lrs+1002_1_ncem=casc2026/models/loop7.pt:sil=128000:tgt=ground:npcc=on:drc=off:sp=reverse_frequency:spb=goal:acc=on:s2agt=16:kmz=on:sac=on:random_seed=3743264406:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 3.33/1.46 % (4003329)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=3003531526:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 3.33/1.46 % (4003329)Also succeeded, but the first one will report.
% 3.33/1.46 % (4003331)Also succeeded, but the first one will report.
% 3.33/1.46 % (4003332)Also succeeded, but the first one will report.
% 3.33/1.46 % (4003328)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=4101052827:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 3.33/1.46 % (4003330)Refutation found. Thanks to Tanya!
% 3.33/1.46 % SZS status Unsatisfiable for theBenchmark
% 3.33/1.46 % SZS output start Proof for theBenchmark
% See solution above
% 3.33/1.46 % (4003330)------------------------------
% 3.33/1.46 % (4003330)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.33/1.46 % (4003330)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.33/1.46 % (4003330)CaDiCaL version: 2.1.3
% 3.33/1.46 % (4003330)Termination reason: Refutation
% 3.33/1.46 % (4003330)Time elapsed: 0.003 s
% 3.33/1.46 % (4003330)Peak memory usage: 88 MB
% 3.33/1.46 % (4003330)Instructions burned: 5 (million)
% 3.33/1.46 % (4003330)------------------------------
% 3.33/1.46 % (4003330)------------------------------
% 3.33/1.46 % (4003247)Success in time 0.39 s
% 3.33/1.46 % Vampire exiting
%------------------------------------------------------------------------------