%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL154-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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 11:51:21 AM UTC 2026
% Result : Unsatisfiable 4.95s 1.68s
% Output : Refutation 5.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 29
% Syntax : Number of formulae : 121 ( 121 unt; 19 def)
% Number of atoms : 121 ( 120 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 27 ( 27 usr; 15 con; 0-3 aty)
% Number of variables : 97 ( 97 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X0] : implies(truth,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wajsberg_1) ).
fof(f2,axiom,
! [X2,X0,X1] : implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))) = truth,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wajsberg_2) ).
fof(f3,plain,
! [X2,X0,X1] : truth = implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))),
inference(reorient_equations,[],[f2]) ).
fof(f4,negated_conjecture,
! [X0,X1] : implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wajsberg_3) ).
fof(f5,axiom,
! [X0,X1] : implies(implies(not(X0),not(X1)),implies(X1,X0)) = truth,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wajsberg_4) ).
fof(f6,plain,
! [X0,X1] : truth = implies(implies(not(X0),not(X1)),implies(X1,X0)),
inference(reorient_equations,[],[f5]) ).
fof(f7,negated_conjecture,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or_definition) ).
fof(f9,axiom,
! [X0,X1] : or(X0,X1) = or(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or_commutativity) ).
fof(f10,negated_conjecture,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_definition) ).
fof(f13,negated_conjecture,
! [X0,X1] : xor(X0,X1) = or(and(X0,not(X1)),and(not(X0),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xor_definition) ).
fof(f19,negated_conjecture,
not(truth) = falsehood,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',false_definition) ).
fof(f20,negated_conjecture,
xor(x,falsehood) != x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_alternative_wajsberg_axiom) ).
fof(f21,plain,
x != xor(x,falsehood),
inference(reorient_equations,[],[f20]) ).
fof(f22,plain,
! [X0,X1] : and(X0,X1) = not(implies(not(not(X0)),not(X1))),
inference(definition_unfolding,[],[f10,f7]) ).
fof(f23,plain,
! [X0,X1] : xor(X0,X1) = implies(not(not(implies(not(not(X0)),not(not(X1))))),not(implies(not(not(not(X0))),not(X1)))),
inference(definition_unfolding,[],[f13,f7,f22,f22]) ).
fof(f26,plain,
! [X0,X1] : implies(not(X0),X1) = implies(not(X1),X0),
inference(definition_unfolding,[],[f9,f7,f7]) ).
fof(f32,plain,
x != implies(not(not(implies(not(not(x)),not(not(falsehood))))),not(implies(not(not(not(x))),not(falsehood)))),
inference(definition_unfolding,[],[f21,f23]) ).
fof(f33,definition,
! [X0] : sF0(X0) = implies(truth,X0),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f34,plain,
! [X0] : implies(truth,X0) = sF0(X0),
inference(reorient_equations,[],[f33]) ).
fof(f35,plain,
! [X0] : sF0(X0) = X0,
inference(definition_folding,[],[f1,f34]) ).
fof(f36,definition,
! [X2,X0,X1] : sF1(X1,X2,X0) = implies(implies(X1,X2),implies(X0,X2)),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f37,plain,
! [X2,X0,X1] : implies(implies(X1,X2),implies(X0,X2)) = sF1(X1,X2,X0),
inference(reorient_equations,[],[f36]) ).
fof(f38,definition,
! [X2,X0,X1] : sF2(X0,X1,X2) = implies(implies(X0,X1),sF1(X1,X2,X0)),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f39,plain,
! [X2,X0,X1] : implies(implies(X0,X1),sF1(X1,X2,X0)) = sF2(X0,X1,X2),
inference(reorient_equations,[],[f38]) ).
fof(f40,plain,
! [X2,X0,X1] : truth = sF2(X0,X1,X2),
inference(definition_folding,[],[f3,f39,f37]) ).
fof(f41,definition,
! [X0,X1] : sF3(X0,X1) = implies(implies(X0,X1),X1),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f42,plain,
! [X0,X1] : implies(implies(X0,X1),X1) = sF3(X0,X1),
inference(reorient_equations,[],[f41]) ).
fof(f43,plain,
! [X0,X1] : sF3(X0,X1) = sF3(X1,X0),
inference(definition_folding,[],[f4,f42,f42]) ).
fof(f44,definition,
! [X0,X1] : sF4(X0,X1) = implies(not(X0),not(X1)),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f45,plain,
! [X0,X1] : implies(not(X0),not(X1)) = sF4(X0,X1),
inference(reorient_equations,[],[f44]) ).
fof(f46,definition,
! [X0,X1] : sF5(X0,X1) = implies(sF4(X0,X1),implies(X1,X0)),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f47,plain,
! [X0,X1] : implies(sF4(X0,X1),implies(X1,X0)) = sF5(X0,X1),
inference(reorient_equations,[],[f46]) ).
fof(f48,plain,
! [X0,X1] : truth = sF5(X0,X1),
inference(definition_folding,[],[f6,f47,f45]) ).
fof(f49,definition,
! [X0,X1] : sF6(X0,X1) = implies(not(X0),X1),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f50,plain,
! [X0,X1] : implies(not(X0),X1) = sF6(X0,X1),
inference(reorient_equations,[],[f49]) ).
fof(f58,plain,
! [X0,X1] : sF6(X0,X1) = sF6(X1,X0),
inference(definition_folding,[],[f26,f50,f50]) ).
fof(f96,definition,
sF26 = not(truth),
introduced(definition,[new_symbols(definition,[sF26])],[function_definition]) ).
fof(f97,plain,
not(truth) = sF26,
inference(reorient_equations,[],[f96]) ).
fof(f98,plain,
falsehood = sF26,
inference(definition_folding,[],[f19,f97]) ).
fof(f99,definition,
sF27 = not(x),
introduced(definition,[new_symbols(definition,[sF27])],[function_definition]) ).
fof(f100,plain,
not(x) = sF27,
inference(reorient_equations,[],[f99]) ).
fof(f101,definition,
sF28 = not(sF27),
introduced(definition,[new_symbols(definition,[sF28])],[function_definition]) ).
fof(f102,plain,
not(sF27) = sF28,
inference(reorient_equations,[],[f101]) ).
fof(f103,definition,
sF29 = not(falsehood),
introduced(definition,[new_symbols(definition,[sF29])],[function_definition]) ).
fof(f104,plain,
not(falsehood) = sF29,
inference(reorient_equations,[],[f103]) ).
fof(f105,definition,
sF30 = not(sF29),
introduced(definition,[new_symbols(definition,[sF30])],[function_definition]) ).
fof(f106,plain,
not(sF29) = sF30,
inference(reorient_equations,[],[f105]) ).
fof(f107,definition,
sF31 = implies(sF28,sF30),
introduced(definition,[new_symbols(definition,[sF31])],[function_definition]) ).
fof(f108,plain,
implies(sF28,sF30) = sF31,
inference(reorient_equations,[],[f107]) ).
fof(f109,definition,
sF32 = not(sF31),
introduced(definition,[new_symbols(definition,[sF32])],[function_definition]) ).
fof(f110,plain,
not(sF31) = sF32,
inference(reorient_equations,[],[f109]) ).
fof(f111,definition,
sF33 = not(sF32),
introduced(definition,[new_symbols(definition,[sF33])],[function_definition]) ).
fof(f112,plain,
not(sF32) = sF33,
inference(reorient_equations,[],[f111]) ).
fof(f113,definition,
sF34 = not(sF28),
introduced(definition,[new_symbols(definition,[sF34])],[function_definition]) ).
fof(f114,plain,
not(sF28) = sF34,
inference(reorient_equations,[],[f113]) ).
fof(f115,definition,
sF35 = implies(sF34,sF29),
introduced(definition,[new_symbols(definition,[sF35])],[function_definition]) ).
fof(f116,plain,
implies(sF34,sF29) = sF35,
inference(reorient_equations,[],[f115]) ).
fof(f117,definition,
sF36 = not(sF35),
introduced(definition,[new_symbols(definition,[sF36])],[function_definition]) ).
fof(f118,plain,
not(sF35) = sF36,
inference(reorient_equations,[],[f117]) ).
fof(f119,definition,
sF37 = implies(sF33,sF36),
introduced(definition,[new_symbols(definition,[sF37])],[function_definition]) ).
fof(f120,plain,
implies(sF33,sF36) = sF37,
inference(reorient_equations,[],[f119]) ).
fof(f121,plain,
x != sF37,
inference(definition_folding,[],[f32,f120,f118,f116,f104,f114,f102,f100,f112,f110,f108,f106,f104,f102,f100]) ).
fof(f122,plain,
! [X0,X1] : implies(not(X1),X0) = sF6(X0,X1),
inference(forward_demodulation,[],[f58,f50]) ).
fof(f124,plain,
! [X0,X1] : truth = implies(sF4(X0,X1),implies(X1,X0)),
inference(forward_demodulation,[],[f48,f47]) ).
fof(f125,plain,
! [X0,X1] : implies(implies(X1,X0),X0) = sF3(X0,X1),
inference(forward_demodulation,[],[f43,f42]) ).
fof(f126,plain,
! [X2,X0,X1] : truth = implies(implies(X0,X1),sF1(X1,X2,X0)),
inference(forward_demodulation,[],[f40,f39]) ).
fof(f127,plain,
! [X0] : implies(truth,X0) = X0,
inference(forward_demodulation,[],[f35,f34]) ).
fof(f128,plain,
! [X0,X1] : implies(not(X0),X1) = implies(not(X1),X0),
inference(forward_demodulation,[],[f122,f50]) ).
fof(f130,plain,
! [X0,X1] : truth = implies(implies(not(X0),not(X1)),implies(X1,X0)),
inference(forward_demodulation,[],[f124,f45]) ).
fof(f131,plain,
! [X0,X1] : implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
inference(forward_demodulation,[],[f125,f42]) ).
fof(f132,plain,
! [X2,X0,X1] : truth = implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))),
inference(forward_demodulation,[],[f126,f37]) ).
fof(f137,plain,
! [X0] : implies(not(X0),falsehood) = implies(sF29,X0),
inference(superposition,[],[f128,f104]) ).
fof(f148,plain,
! [X0] : implies(not(X0),truth) = implies(sF26,X0),
inference(superposition,[],[f128,f97]) ).
fof(f163,plain,
! [X0] : implies(not(X0),truth) = implies(falsehood,X0),
inference(forward_demodulation,[],[f148,f98]) ).
fof(f181,plain,
implies(sF29,x) = implies(sF27,falsehood),
inference(superposition,[],[f137,f100]) ).
fof(f185,plain,
implies(sF29,sF27) = implies(sF28,falsehood),
inference(superposition,[],[f137,f102]) ).
fof(f189,plain,
implies(sF29,sF32) = implies(sF33,falsehood),
inference(superposition,[],[f137,f112]) ).
fof(f231,plain,
! [X0] : truth = implies(implies(not(X0),not(truth)),X0),
inference(superposition,[],[f130,f127]) ).
fof(f256,plain,
! [X0] : truth = implies(implies(not(X0),sF26),X0),
inference(forward_demodulation,[],[f231,f97]) ).
fof(f269,plain,
! [X0] : truth = implies(implies(not(X0),falsehood),X0),
inference(forward_demodulation,[],[f256,f98]) ).
fof(f280,plain,
! [X0] : truth = implies(implies(sF29,X0),X0),
inference(forward_demodulation,[],[f269,f137]) ).
fof(f394,plain,
implies(implies(sF29,sF34),sF34) = implies(sF35,sF29),
inference(superposition,[],[f131,f116]) ).
fof(f404,plain,
truth = implies(sF35,sF29),
inference(forward_demodulation,[],[f394,f280]) ).
fof(f417,plain,
implies(implies(sF29,sF35),sF35) = implies(truth,sF29),
inference(superposition,[],[f131,f404]) ).
fof(f420,plain,
sF29 = implies(implies(sF29,sF35),sF35),
inference(forward_demodulation,[],[f417,f127]) ).
fof(f423,plain,
truth = sF29,
inference(forward_demodulation,[],[f420,f280]) ).
fof(f427,plain,
implies(sF28,falsehood) = implies(truth,sF27),
inference(superposition,[],[f185,f423]) ).
fof(f428,plain,
not(truth) = sF30,
inference(superposition,[],[f106,f423]) ).
fof(f429,plain,
sF35 = implies(sF34,truth),
inference(superposition,[],[f116,f423]) ).
fof(f430,plain,
sF26 = sF30,
inference(forward_demodulation,[],[f428,f97]) ).
fof(f431,plain,
sF27 = implies(sF28,falsehood),
inference(forward_demodulation,[],[f427,f127]) ).
fof(f433,plain,
falsehood = sF30,
inference(forward_demodulation,[],[f430,f98]) ).
fof(f436,plain,
sF31 = implies(sF28,falsehood),
inference(superposition,[],[f108,f433]) ).
fof(f478,plain,
sF27 = sF31,
inference(forward_demodulation,[],[f436,f431]) ).
fof(f480,plain,
not(sF27) = sF32,
inference(superposition,[],[f110,f478]) ).
fof(f481,plain,
sF28 = sF32,
inference(forward_demodulation,[],[f480,f102]) ).
fof(f569,plain,
! [X0,X1] : truth = implies(implies(truth,X1),implies(implies(X1,X0),X0)),
inference(superposition,[],[f132,f127]) ).
fof(f634,plain,
! [X0,X1] : truth = implies(X1,implies(implies(X1,X0),X0)),
inference(forward_demodulation,[],[f569,f127]) ).
fof(f1191,plain,
implies(falsehood,sF28) = implies(sF34,truth),
inference(superposition,[],[f163,f114]) ).
fof(f1224,plain,
sF35 = implies(falsehood,sF28),
inference(forward_demodulation,[],[f1191,f429]) ).
fof(f1245,plain,
implies(implies(sF28,falsehood),falsehood) = implies(sF35,sF28),
inference(superposition,[],[f131,f1224]) ).
fof(f1248,plain,
implies(sF27,falsehood) = implies(sF35,sF28),
inference(forward_demodulation,[],[f1245,f431]) ).
fof(f1251,plain,
implies(sF29,x) = implies(sF35,sF28),
inference(forward_demodulation,[],[f1248,f181]) ).
fof(f1254,plain,
implies(truth,x) = implies(sF35,sF28),
inference(forward_demodulation,[],[f1251,f423]) ).
fof(f1257,plain,
x = implies(sF35,sF28),
inference(forward_demodulation,[],[f1254,f127]) ).
fof(f1555,plain,
truth = implies(sF34,implies(sF35,sF29)),
inference(superposition,[],[f634,f116]) ).
fof(f1600,plain,
truth = implies(sF34,truth),
inference(forward_demodulation,[],[f1555,f404]) ).
fof(f1647,plain,
truth = sF35,
inference(forward_demodulation,[],[f1600,f429]) ).
fof(f1696,plain,
not(truth) = sF36,
inference(superposition,[],[f118,f1647]) ).
fof(f1701,plain,
x = implies(truth,sF28),
inference(superposition,[],[f1257,f1647]) ).
fof(f1705,plain,
x = sF28,
inference(forward_demodulation,[],[f1701,f127]) ).
fof(f1709,plain,
sF26 = sF36,
inference(forward_demodulation,[],[f1696,f97]) ).
fof(f1711,plain,
falsehood = sF36,
inference(forward_demodulation,[],[f1709,f98]) ).
fof(f1714,plain,
sF37 = implies(sF33,falsehood),
inference(superposition,[],[f120,f1711]) ).
fof(f1728,plain,
sF37 = implies(sF29,sF32),
inference(forward_demodulation,[],[f1714,f189]) ).
fof(f1732,plain,
sF37 = implies(sF29,sF28),
inference(forward_demodulation,[],[f1728,f481]) ).
fof(f1734,plain,
sF37 = implies(truth,sF28),
inference(forward_demodulation,[],[f1732,f423]) ).
fof(f1735,plain,
sF28 = sF37,
inference(forward_demodulation,[],[f1734,f127]) ).
fof(f1770,plain,
x != sF28,
inference(superposition,[],[f121,f1735]) ).
fof(f1771,plain,
sF28 != sF28,
inference(forward_demodulation,[],[f1770,f1705]) ).
fof(f1772,plain,
$false,
inference(trivial_inequality_removal,[],[f1771]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL154-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.47 % Computer : n004.cluster.edu
% 0.22/0.47 % Model : x86_64 x86_64
% 0.22/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.47 % Memory : 8046.5625MB
% 0.22/0.47 % OS : Linux 6.8.0-71-generic
% 0.22/0.47 % CPULimit : 300
% 0.22/0.47 % WCLimit : 300
% 0.22/0.47 % DateTime : Sun Sep 27 15:23:52 UTC 2026
% 0.22/0.47 % CPUTime :
% 0.22/0.47 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.53 Running first-order theorem proving
% 0.27/0.53 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.95/1.68 % (3660813)Detected a unit-equality problem, will run specialized UEQ schedule.
% 4.95/1.68 % (3660820)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=3936278384:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 4.95/1.68 % (3660818)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=247912310:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 4.95/1.68 % (3660819)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=1537706440:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 4.95/1.68 % (3660821)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=493142936:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 4.95/1.68 % (3660823)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=2782582531:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 4.95/1.68 % (3660822)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=4253198029:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 4.95/1.68 % (3660824)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=2795407508:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 4.95/1.68 % (3660822)First to succeed.
% 4.95/1.68 % (3660822)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3660813"
% 4.95/1.68 % (3660824)Also succeeded, but the first one will report.
% 4.95/1.68 % (3660821)Also succeeded, but the first one will report.
% 4.95/1.68 % (3660823)Instruction limit reached!
% 4.95/1.68 % (3660823)------------------------------
% 4.95/1.68 % (3660823)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.95/1.68 % (3660823)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.95/1.68 % (3660823)CaDiCaL version: 2.1.3
% 4.95/1.68 % (3660823)Termination reason: Instruction limit
% 4.95/1.68 % (3660823)Termination phase: Saturation
% 4.95/1.68 % (3660823)Time elapsed: 0.262 s
% 4.95/1.68 % (3660823)Peak memory usage: 90 MB
% 4.95/1.68 % (3660823)Instructions burned: 257 (million)
% 4.95/1.68 % (3660822)Refutation found. Thanks to Tanya!
% 4.95/1.68 % SZS status Unsatisfiable for theBenchmark
% 4.95/1.68 % SZS output start Proof for theBenchmark
% See solution above
% 5.77/1.88 % (3660822)------------------------------
% 5.77/1.88 % (3660822)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.77/1.88 % (3660822)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.77/1.88 % (3660822)CaDiCaL version: 2.1.3
% 5.77/1.88 % (3660822)Termination reason: Refutation
% 5.77/1.88 % (3660822)Time elapsed: 0.053 s
% 5.77/1.88 % (3660822)Peak memory usage: 89 MB
% 5.77/1.88 % (3660822)Instructions burned: 54 (million)
% 5.77/1.88 % (3660822)------------------------------
% 5.77/1.88 % (3660822)------------------------------
% 5.77/1.88 % (3660813)Success in time 0.733 s
% 5.77/1.88 % Vampire exiting
%------------------------------------------------------------------------------