%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL109-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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:57:39 AM UTC 2026
% Result : Unsatisfiable 4.21s 1.13s
% Output : Refutation 4.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 12
% Syntax : Number of formulae : 75 ( 75 unt; 4 def)
% Number of atoms : 75 ( 74 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 49 ( 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] : implies(truth,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wajsberg_1) ).
fof(f3,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(f4,plain,
! [X2,X0,X1] : truth = implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))),
inference(reorient_equations,[],[f3]) ).
fof(f5,axiom,
! [X0,X1] : implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wajsberg_3) ).
fof(f13,axiom,
! [X0,X1] : implies(X0,implies(X1,X0)) = truth,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_4) ).
fof(f14,plain,
! [X0,X1] : truth = implies(X0,implies(X1,X0)),
inference(reorient_equations,[],[f13]) ).
fof(f19,axiom,
! [X2,X0,X1] : implies(X0,implies(X1,X2)) = implies(X1,implies(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_7) ).
fof(f22,axiom,
! [X0] : not(not(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_9) ).
fof(f23,axiom,
! [X0,X1] : implies(not(X0),not(X1)) = implies(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_10) ).
fof(f24,plain,
! [X0,X1] : implies(X1,X0) = implies(not(X0),not(X1)),
inference(reorient_equations,[],[f23]) ).
fof(f25,negated_conjecture,
implies(implies(implies(a,b),implies(b,a)),implies(b,a)) != truth,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_wajsberg_mv_4) ).
fof(f26,plain,
truth != implies(implies(implies(a,b),implies(b,a)),implies(b,a)),
inference(reorient_equations,[],[f25]) ).
fof(f27,definition,
sF0 = implies(a,b),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f28,plain,
implies(a,b) = sF0,
inference(reorient_equations,[],[f27]) ).
fof(f29,definition,
sF1 = implies(b,a),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f30,plain,
implies(b,a) = sF1,
inference(reorient_equations,[],[f29]) ).
fof(f31,definition,
sF2 = implies(sF0,sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f32,plain,
implies(sF0,sF1) = sF2,
inference(reorient_equations,[],[f31]) ).
fof(f33,definition,
sF3 = implies(sF2,sF1),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f34,plain,
implies(sF2,sF1) = sF3,
inference(reorient_equations,[],[f33]) ).
fof(f35,plain,
truth != sF3,
inference(definition_folding,[],[f26,f34,f30,f32,f30,f28]) ).
fof(f38,plain,
! [X0,X1] : implies(implies(X0,X1),X1) = implies(not(X0),not(implies(X1,X0))),
inference(forward_demodulation,[],[f5,f24]) ).
fof(f39,plain,
sF1 = implies(not(a),not(b)),
inference(forward_demodulation,[],[f30,f24]) ).
fof(f41,plain,
! [X0,X1] : implies(not(X0),not(implies(X1,X0))) = implies(not(X1),not(implies(X0,X1))),
inference(forward_demodulation,[],[f38,f24]) ).
fof(f46,plain,
truth = implies(b,sF0),
inference(superposition,[],[f14,f28]) ).
fof(f51,plain,
truth = implies(not(sF0),not(b)),
inference(forward_demodulation,[],[f46,f24]) ).
fof(f66,plain,
! [X0,X1] : implies(not(X0),X1) = implies(not(X1),X0),
inference(superposition,[],[f24,f22]) ).
fof(f76,plain,
! [X0,X1] : truth = implies(not(X0),implies(X0,X1)),
inference(superposition,[],[f14,f24]) ).
fof(f77,plain,
! [X0,X1] : truth = implies(X0,implies(not(X0),X1)),
inference(forward_demodulation,[],[f76,f19]) ).
fof(f199,plain,
! [X2,X0,X1] : implies(not(X1),implies(X2,not(X0))) = implies(X2,implies(X0,X1)),
inference(superposition,[],[f19,f24]) ).
fof(f296,plain,
! [X0] : truth = implies(sF2,implies(implies(sF1,X0),implies(sF0,X0))),
inference(superposition,[],[f4,f32]) ).
fof(f410,plain,
! [X0] : truth = implies(not(implies(sF0,X0)),implies(sF2,not(implies(sF1,X0)))),
inference(forward_demodulation,[],[f296,f199]) ).
fof(f458,plain,
! [X0] : truth = implies(sF2,implies(not(implies(sF0,X0)),not(implies(sF1,X0)))),
inference(forward_demodulation,[],[f410,f19]) ).
fof(f863,plain,
! [X0,X1] : implies(not(X1),not(implies(not(X0),X1))) = implies(X0,not(implies(X1,not(X0)))),
inference(superposition,[],[f41,f22]) ).
fof(f876,plain,
! [X0,X1] : implies(not(not(X0)),not(implies(X0,X1))) = implies(not(not(X1)),not(implies(not(X0),not(X1)))),
inference(superposition,[],[f41,f24]) ).
fof(f880,plain,
implies(not(not(sF0)),not(implies(not(b),not(sF0)))) = implies(not(not(b)),not(truth)),
inference(superposition,[],[f41,f51]) ).
fof(f881,plain,
implies(not(b),not(sF0)) = implies(not(a),not(implies(b,a))),
inference(superposition,[],[f41,f28]) ).
fof(f946,plain,
implies(not(b),not(sF0)) = implies(not(a),not(implies(not(a),not(b)))),
inference(forward_demodulation,[],[f881,f24]) ).
fof(f947,plain,
implies(not(not(sF0)),not(implies(not(b),not(sF0)))) = implies(not(not(truth)),not(not(not(b)))),
inference(forward_demodulation,[],[f880,f24]) ).
fof(f951,plain,
! [X0,X1] : implies(not(not(X0)),not(implies(X0,X1))) = implies(X1,not(implies(not(X0),not(X1)))),
inference(forward_demodulation,[],[f876,f22]) ).
fof(f994,plain,
implies(not(b),not(sF0)) = implies(not(a),not(sF1)),
inference(forward_demodulation,[],[f946,f39]) ).
fof(f995,plain,
implies(not(not(truth)),not(b)) = implies(not(not(sF0)),not(implies(not(b),not(sF0)))),
inference(forward_demodulation,[],[f947,f22]) ).
fof(f999,plain,
! [X0,X1] : implies(X0,not(implies(X0,X1))) = implies(X1,not(implies(not(X0),not(X1)))),
inference(forward_demodulation,[],[f951,f22]) ).
fof(f1036,plain,
implies(not(b),not(sF0)) = implies(not(not(sF1)),not(not(a))),
inference(forward_demodulation,[],[f994,f24]) ).
fof(f1037,plain,
implies(not(not(truth)),not(b)) = implies(b,not(implies(not(sF0),not(b)))),
inference(forward_demodulation,[],[f995,f863]) ).
fof(f1068,plain,
implies(not(b),not(sF0)) = implies(not(not(sF1)),a),
inference(forward_demodulation,[],[f1036,f22]) ).
fof(f1069,plain,
implies(not(not(truth)),not(b)) = implies(sF0,not(implies(sF0,b))),
inference(forward_demodulation,[],[f1037,f999]) ).
fof(f1090,plain,
implies(not(b),not(sF0)) = implies(sF1,a),
inference(forward_demodulation,[],[f1068,f22]) ).
fof(f1091,plain,
implies(sF0,not(implies(sF0,b))) = implies(truth,not(b)),
inference(forward_demodulation,[],[f1069,f22]) ).
fof(f1110,plain,
implies(not(not(sF0)),not(not(b))) = implies(sF1,a),
inference(forward_demodulation,[],[f1090,f24]) ).
fof(f1111,plain,
not(b) = implies(sF0,not(implies(sF0,b))),
inference(forward_demodulation,[],[f1091,f2]) ).
fof(f1121,plain,
implies(not(not(sF0)),b) = implies(sF1,a),
inference(forward_demodulation,[],[f1110,f22]) ).
fof(f1129,plain,
implies(sF0,b) = implies(sF1,a),
inference(forward_demodulation,[],[f1121,f22]) ).
fof(f1184,plain,
truth = implies(a,sF1),
inference(superposition,[],[f77,f39]) ).
fof(f1220,plain,
truth = implies(not(sF1),not(a)),
inference(forward_demodulation,[],[f1184,f24]) ).
fof(f1532,plain,
! [X0,X1] : implies(not(X0),not(implies(not(X0),X1))) = implies(not(not(X1)),not(implies(X0,not(X1)))),
inference(superposition,[],[f41,f66]) ).
fof(f1548,plain,
! [X0,X1] : implies(X1,not(implies(X0,not(X1)))) = implies(not(X0),not(implies(not(X0),X1))),
inference(forward_demodulation,[],[f1532,f22]) ).
fof(f1746,plain,
implies(not(not(sF1)),not(implies(not(a),not(sF1)))) = implies(not(not(a)),not(truth)),
inference(superposition,[],[f41,f1220]) ).
fof(f1747,plain,
implies(not(not(sF1)),not(implies(not(a),not(sF1)))) = implies(not(not(truth)),not(not(not(a)))),
inference(forward_demodulation,[],[f1746,f24]) ).
fof(f1759,plain,
implies(not(not(sF1)),not(implies(not(a),not(sF1)))) = implies(not(not(truth)),not(a)),
inference(forward_demodulation,[],[f1747,f22]) ).
fof(f1768,plain,
implies(not(not(sF1)),not(implies(not(a),not(sF1)))) = implies(truth,not(a)),
inference(forward_demodulation,[],[f1759,f22]) ).
fof(f1776,plain,
not(a) = implies(not(not(sF1)),not(implies(not(a),not(sF1)))),
inference(forward_demodulation,[],[f1768,f2]) ).
fof(f1781,plain,
not(a) = implies(a,not(implies(not(sF1),not(a)))),
inference(forward_demodulation,[],[f1776,f863]) ).
fof(f1784,plain,
not(a) = implies(not(not(sF1)),not(implies(not(not(sF1)),a))),
inference(forward_demodulation,[],[f1781,f1548]) ).
fof(f1787,plain,
not(a) = implies(sF1,not(implies(sF1,a))),
inference(forward_demodulation,[],[f1784,f22]) ).
fof(f1789,plain,
not(a) = implies(sF1,not(implies(sF0,b))),
inference(forward_demodulation,[],[f1787,f1129]) ).
fof(f15315,plain,
truth = implies(sF2,implies(not(not(b)),not(implies(sF1,not(implies(sF0,b)))))),
inference(superposition,[],[f458,f1111]) ).
fof(f15394,plain,
truth = implies(sF2,implies(not(not(b)),not(not(a)))),
inference(forward_demodulation,[],[f15315,f1789]) ).
fof(f15421,plain,
truth = implies(not(not(not(a))),implies(sF2,not(not(not(b))))),
inference(forward_demodulation,[],[f15394,f199]) ).
fof(f15446,plain,
truth = implies(sF2,implies(not(not(not(a))),not(not(not(b))))),
inference(forward_demodulation,[],[f15421,f19]) ).
fof(f15466,plain,
truth = implies(sF2,implies(not(not(not(a))),not(b))),
inference(forward_demodulation,[],[f15446,f22]) ).
fof(f15478,plain,
truth = implies(sF2,implies(not(a),not(b))),
inference(forward_demodulation,[],[f15466,f22]) ).
fof(f15488,plain,
truth = implies(sF2,sF1),
inference(forward_demodulation,[],[f15478,f39]) ).
fof(f16749,plain,
truth = sF3,
inference(superposition,[],[f34,f15488]) ).
fof(f16841,plain,
$false,
inference(forward_subsumption_resolution,[],[f16749,f35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL109-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40 % Computer : n002.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8046.5625MB
% 0.12/0.40 % OS : Linux 6.8.0-71-generic
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Sun Sep 27 15:24:21 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43 Running first-order model finding
% 0.12/0.43 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.21/1.12 % (3664939)Will run a generic schedule for satisfiability detection.
% 4.21/1.12 % (3664953)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=320567074:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.21/1.12 % (3664949)% WARNING: option uhcvi not known.
% 4.21/1.12 % (3664949)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=80094747:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.21/1.12 % (3664954)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=190711403:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.21/1.12 % (3664951)dis+10_1_sil=32000:sp=arity:random_seed=3582677691:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.21/1.12 % (3664952)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3354478143:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.21/1.12 % (3664950)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1133442697:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.21/1.12 % (3664948)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2013751932_2999 on theBenchmark for (2999ds/0Mi)
% 4.21/1.12 % TRYING [1]
% 4.21/1.12 % TRYING [2]
% 4.21/1.12 % TRYING [3]
% 4.21/1.12 % TRYING [4]
% 4.21/1.12 % (3664953)Instruction limit reached!
% 4.21/1.12 % (3664953)------------------------------
% 4.21/1.12 % (3664953)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.12 % (3664953)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.12 % (3664953)CaDiCaL version: 2.1.3
% 4.21/1.12 % (3664953)Termination reason: Instruction limit
% 4.21/1.12 % (3664953)Termination phase: Saturation
% 4.21/1.12 % (3664953)Time elapsed: 0.039 s
% 4.21/1.12 % (3664953)Peak memory usage: 12 MB
% 4.21/1.12 % (3664953)Instructions burned: 136 (million)
% 4.21/1.12 % TRYING [5]
% 4.21/1.12 % (3664968)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4146379180:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 4.21/1.12 % TRYING [1]
% 4.21/1.12 % TRYING [2]
% 4.21/1.12 % TRYING [3]
% 4.21/1.12 % (3664951)Instruction limit reached!
% 4.21/1.12 % (3664951)------------------------------
% 4.21/1.12 % (3664951)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.12 % (3664951)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.13 % (3664951)CaDiCaL version: 2.1.3
% 4.21/1.13 % (3664951)Termination reason: Instruction limit
% 4.21/1.13 % (3664951)Termination phase: Saturation
% 4.21/1.13 % (3664951)Time elapsed: 0.057 s
% 4.21/1.13 % (3664951)Peak memory usage: 12 MB
% 4.21/1.13 % (3664951)Instructions burned: 105 (million)
% 4.21/1.13 % TRYING [4]
% 4.21/1.13 % (3664952)Instruction limit reached!
% 4.21/1.13 % (3664952)------------------------------
% 4.21/1.13 % (3664952)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.13 % (3664952)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.13 % (3664952)CaDiCaL version: 2.1.3
% 4.21/1.13 % (3664952)Termination reason: Instruction limit
% 4.21/1.13 % (3664952)Termination phase: Saturation
% 4.21/1.13 % (3664952)Time elapsed: 0.067 s
% 4.21/1.13 % (3664952)Peak memory usage: 12 MB
% 4.21/1.13 % (3664952)Instructions burned: 116 (million)
% 4.21/1.13 % (3664970)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3772167368:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 4.21/1.13 % (3664971)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=1839723833:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 4.21/1.13 % TRYING [5]
% 4.21/1.13 % (3664954)Instruction limit reached!
% 4.21/1.13 % (3664954)------------------------------
% 4.21/1.13 % (3664954)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.13 % (3664954)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.13 % (3664954)CaDiCaL version: 2.1.3
% 4.21/1.13 % (3664954)Termination reason: Instruction limit
% 4.21/1.13 % (3664954)Termination phase: Saturation
% 4.21/1.13 % (3664954)Time elapsed: 0.092 s
% 4.21/1.13 % (3664954)Peak memory usage: 12 MB
% 4.21/1.13 % (3664954)Instructions burned: 160 (million)
% 4.21/1.13 % (3664974)ott-21_1_sil=16000:fs=off:random_seed=3779261601:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 4.21/1.13 % TRYING [6]
% 4.21/1.13 % TRYING [6]
% 4.21/1.13 % (3664970)Instruction limit reached!
% 4.21/1.13 % (3664970)------------------------------
% 4.21/1.13 % (3664970)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.13 % (3664970)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.13 % (3664970)CaDiCaL version: 2.1.3
% 4.21/1.13 % (3664970)Termination reason: Instruction limit
% 4.21/1.13 % (3664970)Termination phase: Saturation
% 4.21/1.13 % (3664970)Time elapsed: 0.080 s
% 4.21/1.13 % (3664970)Peak memory usage: 12 MB
% 4.21/1.13 % (3664970)Instructions burned: 131 (million)
% 4.21/1.13 % (3664976)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3774706608:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 4.21/1.13 % (3664974)Instruction limit reached!
% 4.21/1.13 % (3664974)------------------------------
% 4.21/1.13 % (3664974)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.13 % (3664974)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.13 % (3664974)CaDiCaL version: 2.1.3
% 4.21/1.13 % (3664974)Termination reason: Instruction limit
% 4.21/1.13 % (3664974)Termination phase: Saturation
% 4.21/1.13 % (3664974)Time elapsed: 0.078 s
% 4.21/1.13 % (3664974)Peak memory usage: 11 MB
% 4.21/1.13 % (3664974)Instructions burned: 182 (million)
% 4.21/1.13 % (3664978)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2586012417:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 4.21/1.13 % TRYING [1]
% 4.21/1.13 % TRYING [2]
% 4.21/1.13 % TRYING [3]
% 4.21/1.13 % TRYING [4]
% 4.21/1.13 % TRYING [5]
% 4.21/1.13 % (3664971)Instruction limit reached!
% 4.21/1.13 % (3664971)------------------------------
% 4.21/1.13 % (3664971)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.13 % (3664971)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.13 % (3664971)CaDiCaL version: 2.1.3
% 4.21/1.13 % (3664971)Termination reason: Instruction limit
% 4.21/1.13 % (3664971)Termination phase: Saturation
% 4.21/1.13 % (3664971)Time elapsed: 0.192 s
% 4.21/1.13 % (3664971)Peak memory usage: 19 MB
% 4.21/1.13 % (3664971)Instructions burned: 685 (million)
% 4.21/1.13 % (3664986)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2314978482:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 4.21/1.13 % TRYING [7]
% 4.21/1.13 % (3664968)Instruction limit reached!
% 4.21/1.13 % (3664968)------------------------------
% 4.21/1.13 % (3664968)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.13 % (3664968)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.13 % (3664968)CaDiCaL version: 2.1.3
% 4.21/1.13 % (3664968)Termination reason: Instruction limit
% 4.21/1.13 % (3664968)Termination phase: Finite model building constraint generation
% 4.21/1.13 % (3664968)Time elapsed: 0.314 s
% 4.21/1.13 % (3664968)Peak memory usage: 34 MB
% 4.21/1.13 % (3664968)Instructions burned: 714 (million)
% 4.21/1.13 % TRYING [6]
% 4.21/1.13 % (3664995)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=956206095:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 4.21/1.13 % (3664976)Instruction limit reached!
% 4.21/1.13 % (3664976)------------------------------
% 4.21/1.13 % (3664976)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.13 % (3664976)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.13 % (3664976)CaDiCaL version: 2.1.3
% 4.21/1.13 % (3664976)Termination reason: Instruction limit
% 4.21/1.13 % (3664976)Termination phase: Saturation
% 4.21/1.13 % (3664976)Time elapsed: 0.256 s
% 4.21/1.13 % (3664976)Peak memory usage: 15 MB
% 4.21/1.13 % (3664976)Instructions burned: 477 (million)
% 4.21/1.13 % (3664997)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=1905054332:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2995 on theBenchmark for (2995ds/692Mi)
% 4.21/1.13 % (3664978)Instruction limit reached!
% 4.21/1.13 % (3664978)------------------------------
% 4.21/1.13 % (3664978)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.13 % (3664978)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.13 % (3664978)CaDiCaL version: 2.1.3
% 4.21/1.13 % (3664978)Termination reason: Instruction limit
% 4.21/1.13 % (3664978)Termination phase: Finite model building SAT solving
% 4.21/1.13 % (3664978)Time elapsed: 0.343 s
% 4.21/1.13 % (3664978)Peak memory usage: 27 MB
% 4.21/1.13 % (3664978)Instructions burned: 865 (million)
% 4.21/1.13 % (3664999)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=523348037:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 4.21/1.13 % TRYING [7]
% 4.21/1.13 % (3664986) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3664939-3664986"...
% 4.21/1.13 % (3664986)...printing done.
% 4.21/1.13 % (3664986)Refutation found. Thanks to Tanya!
% 4.21/1.13 % SZS status Unsatisfiable for theBenchmark
% 4.21/1.13 % SZS output start Proof for theBenchmark
% See solution above
% 4.21/1.13 % (3664986)------------------------------
% 4.21/1.13 % (3664986)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.13 % (3664986)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.13 % (3664986)CaDiCaL version: 2.1.3
% 4.21/1.13 % (3664986)Termination reason: Refutation
% 4.21/1.13 % (3664986)Time elapsed: 0.366 s
% 4.21/1.13 % (3664986)Peak memory usage: 20 MB
% 4.21/1.13 % (3664986)Instructions burned: 837 (million)
% 4.21/1.13 % (3664939)Success in time 0.688 s
% 4.21/1.13 % Vampire exiting
%------------------------------------------------------------------------------