%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL042-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 : n026.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:29 AM UTC 2026
% Result : Unsatisfiable 4.98s 1.19s
% Output : Refutation 4.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 15
% Syntax : Number of formulae : 71 ( 71 unt; 7 def)
% Number of atoms : 71 ( 70 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 : 15 ( 15 usr; 11 con; 0-4 aty)
% Number of variables : 70 ( 70 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
fof(f2,axiom,
! [X0,X1] : ifeq(is_a_theorem(implies(X0,X1)),true,ifeq(is_a_theorem(X0),true,is_a_theorem(X1),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f3,plain,
! [X0,X1] : true = ifeq(is_a_theorem(implies(X0,X1)),true,ifeq(is_a_theorem(X0),true,is_a_theorem(X1),true),true),
inference(reorient_equations,[],[f2]) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).
fof(f5,plain,
! [X0,X1] : true = is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(reorient_equations,[],[f4]) ).
fof(f6,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_18) ).
fof(f7,plain,
! [X0,X1] : true = is_a_theorem(implies(X0,implies(X1,X0))),
inference(reorient_equations,[],[f6]) ).
fof(f8,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_21) ).
fof(f9,plain,
! [X2,X0,X1] : true = is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))),
inference(reorient_equations,[],[f8]) ).
fof(f10,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_22) ).
fof(f11,plain,
! [X2,X0,X1] : true = is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))),
inference(reorient_equations,[],[f10]) ).
fof(f12,axiom,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(not(X0),X1),X1))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_54) ).
fof(f13,plain,
! [X0,X1] : true = is_a_theorem(implies(implies(X0,X1),implies(implies(not(X0),X1),X1))),
inference(reorient_equations,[],[f12]) ).
fof(f14,negated_conjecture,
is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_35) ).
fof(f15,plain,
true != is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))),
inference(reorient_equations,[],[f14]) ).
fof(f16,definition,
sF0 = implies(b,c),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f17,plain,
implies(b,c) = sF0,
inference(reorient_equations,[],[f16]) ).
fof(f18,definition,
sF1 = implies(a,sF0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f19,plain,
implies(a,sF0) = sF1,
inference(reorient_equations,[],[f18]) ).
fof(f20,definition,
sF2 = implies(a,b),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f21,plain,
implies(a,b) = sF2,
inference(reorient_equations,[],[f20]) ).
fof(f22,definition,
sF3 = implies(a,c),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f23,plain,
implies(a,c) = sF3,
inference(reorient_equations,[],[f22]) ).
fof(f24,definition,
sF4 = implies(sF2,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f25,plain,
implies(sF2,sF3) = sF4,
inference(reorient_equations,[],[f24]) ).
fof(f26,definition,
sF5 = implies(sF1,sF4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f27,plain,
implies(sF1,sF4) = sF5,
inference(reorient_equations,[],[f26]) ).
fof(f28,definition,
sF6 = is_a_theorem(sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f29,plain,
is_a_theorem(sF5) = sF6,
inference(reorient_equations,[],[f28]) ).
fof(f30,plain,
true != sF6,
inference(definition_folding,[],[f15,f29,f27,f25,f23,f21,f19,f17]) ).
fof(f51,plain,
! [X0] : true = is_a_theorem(implies(implies(a,implies(X0,c)),implies(X0,sF3))),
inference(superposition,[],[f9,f23]) ).
fof(f58,plain,
! [X0] : true = is_a_theorem(implies(sF0,implies(implies(X0,b),implies(X0,c)))),
inference(superposition,[],[f11,f17]) ).
fof(f79,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(is_a_theorem(X0),true,is_a_theorem(implies(X1,X0)),true),true),
inference(superposition,[],[f3,f7]) ).
fof(f81,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(is_a_theorem(implies(X0,X1)),true,is_a_theorem(implies(implies(not(X0),X1),X1)),true),true),
inference(superposition,[],[f3,f13]) ).
fof(f82,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(is_a_theorem(implies(X0,X1)),true,is_a_theorem(implies(implies(X2,X0),implies(X2,X1))),true),true),
inference(superposition,[],[f3,f11]) ).
fof(f83,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(is_a_theorem(implies(X0,implies(X1,X2))),true,is_a_theorem(implies(X1,implies(X0,X2))),true),true),
inference(superposition,[],[f3,f9]) ).
fof(f91,plain,
! [X2,X0,X1] : true = ifeq(is_a_theorem(implies(implies(X0,implies(not(X0),X1)),X2)),true,ifeq(true,true,is_a_theorem(X2),true),true),
inference(superposition,[],[f3,f5]) ).
fof(f100,plain,
! [X0] : true = ifeq(is_a_theorem(implies(X0,sF5)),true,ifeq(is_a_theorem(X0),true,sF6,true),true),
inference(superposition,[],[f3,f29]) ).
fof(f119,plain,
! [X2,X0,X1] : true = ifeq(is_a_theorem(implies(implies(X0,implies(not(X0),X1)),X2)),true,is_a_theorem(X2),true),
inference(forward_demodulation,[],[f91,f1]) ).
fof(f126,plain,
! [X2,X0,X1] : true = ifeq(is_a_theorem(implies(X0,implies(X1,X2))),true,is_a_theorem(implies(X1,implies(X0,X2))),true),
inference(forward_demodulation,[],[f83,f1]) ).
fof(f127,plain,
! [X2,X0,X1] : true = ifeq(is_a_theorem(implies(X0,X1)),true,is_a_theorem(implies(implies(X2,X0),implies(X2,X1))),true),
inference(forward_demodulation,[],[f82,f1]) ).
fof(f128,plain,
! [X0,X1] : true = ifeq(is_a_theorem(implies(X0,X1)),true,is_a_theorem(implies(implies(not(X0),X1),X1)),true),
inference(forward_demodulation,[],[f81,f1]) ).
fof(f130,plain,
! [X0,X1] : true = ifeq(is_a_theorem(X0),true,is_a_theorem(implies(X1,X0)),true),
inference(forward_demodulation,[],[f79,f1]) ).
fof(f522,plain,
true = is_a_theorem(implies(sF0,implies(implies(a,b),sF3))),
inference(superposition,[],[f58,f23]) ).
fof(f534,plain,
true = is_a_theorem(implies(sF0,implies(sF2,sF3))),
inference(forward_demodulation,[],[f522,f21]) ).
fof(f536,plain,
true = is_a_theorem(implies(sF0,sF4)),
inference(forward_demodulation,[],[f534,f25]) ).
fof(f1732,plain,
true = ifeq(true,true,is_a_theorem(implies(not(a),sF3)),true),
inference(superposition,[],[f119,f51]) ).
fof(f1853,plain,
true = is_a_theorem(implies(not(a),sF3)),
inference(forward_demodulation,[],[f1732,f1]) ).
fof(f2403,plain,
! [X0] : true = ifeq(true,true,is_a_theorem(implies(implies(X0,sF0),implies(X0,sF4))),true),
inference(superposition,[],[f127,f536]) ).
fof(f2479,plain,
! [X0] : true = is_a_theorem(implies(implies(X0,sF0),implies(X0,sF4))),
inference(forward_demodulation,[],[f2403,f1]) ).
fof(f2800,plain,
! [X0] : true = ifeq(true,true,is_a_theorem(implies(X0,implies(not(a),sF3))),true),
inference(superposition,[],[f130,f1853]) ).
fof(f2802,plain,
! [X0] : true = is_a_theorem(implies(X0,implies(not(a),sF3))),
inference(forward_demodulation,[],[f2800,f1]) ).
fof(f7064,plain,
! [X0] : true = ifeq(true,true,is_a_theorem(implies(not(a),implies(X0,sF3))),true),
inference(superposition,[],[f126,f2802]) ).
fof(f7118,plain,
! [X0] : true = is_a_theorem(implies(not(a),implies(X0,sF3))),
inference(forward_demodulation,[],[f7064,f1]) ).
fof(f8424,plain,
true = is_a_theorem(implies(not(a),sF4)),
inference(superposition,[],[f7118,f25]) ).
fof(f8491,plain,
! [X0] : true = ifeq(true,true,is_a_theorem(implies(X0,implies(not(a),sF4))),true),
inference(superposition,[],[f130,f8424]) ).
fof(f8494,plain,
! [X0] : true = is_a_theorem(implies(X0,implies(not(a),sF4))),
inference(forward_demodulation,[],[f8491,f1]) ).
fof(f9827,plain,
! [X0] : true = ifeq(true,true,is_a_theorem(implies(not(a),implies(X0,sF4))),true),
inference(superposition,[],[f126,f8494]) ).
fof(f9882,plain,
! [X0] : true = is_a_theorem(implies(not(a),implies(X0,sF4))),
inference(forward_demodulation,[],[f9827,f1]) ).
fof(f10135,plain,
true = is_a_theorem(implies(not(a),sF5)),
inference(superposition,[],[f9882,f27]) ).
fof(f17441,plain,
true = is_a_theorem(implies(sF1,implies(a,sF4))),
inference(superposition,[],[f2479,f19]) ).
fof(f17576,plain,
true = ifeq(true,true,is_a_theorem(implies(a,implies(sF1,sF4))),true),
inference(superposition,[],[f126,f17441]) ).
fof(f17620,plain,
true = is_a_theorem(implies(a,implies(sF1,sF4))),
inference(forward_demodulation,[],[f17576,f1]) ).
fof(f17621,plain,
true = is_a_theorem(implies(a,sF5)),
inference(forward_demodulation,[],[f17620,f27]) ).
fof(f17706,plain,
true = ifeq(true,true,is_a_theorem(implies(implies(not(a),sF5),sF5)),true),
inference(superposition,[],[f128,f17621]) ).
fof(f17746,plain,
true = is_a_theorem(implies(implies(not(a),sF5),sF5)),
inference(forward_demodulation,[],[f17706,f1]) ).
fof(f18411,plain,
true = ifeq(true,true,ifeq(is_a_theorem(implies(not(a),sF5)),true,sF6,true),true),
inference(superposition,[],[f100,f17746]) ).
fof(f18456,plain,
true = ifeq(is_a_theorem(implies(not(a),sF5)),true,sF6,true),
inference(forward_demodulation,[],[f18411,f1]) ).
fof(f18458,plain,
true = ifeq(true,true,sF6,true),
inference(forward_demodulation,[],[f18456,f10135]) ).
fof(f18460,plain,
true = sF6,
inference(forward_demodulation,[],[f18458,f1]) ).
fof(f18462,plain,
$false,
inference(forward_subsumption_resolution,[],[f18460,f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL042-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.14/0.39 % Computer : n026.cluster.edu
% 0.14/0.39 % Model : x86_64 x86_64
% 0.14/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39 % Memory : 8046.5625MB
% 0.14/0.39 % OS : Linux 6.8.0-71-generic
% 0.14/0.39 % CPULimit : 300
% 0.14/0.39 % WCLimit : 300
% 0.14/0.39 % DateTime : Sun Sep 27 15:21:26 UTC 2026
% 0.14/0.39 % CPUTime :
% 0.14/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.43 Running first-order model finding
% 0.14/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.98/1.19 % (2982405)Will run a generic schedule for satisfiability detection.
% 4.98/1.19 % (2982414)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1737231729:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.98/1.19 % (2982411)% WARNING: option uhcvi not known.
% 4.98/1.19 % (2982410)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=406897175_2999 on theBenchmark for (2999ds/0Mi)
% 4.98/1.19 % (2982411)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1103927354:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.98/1.19 % TRYING [1]
% 4.98/1.19 % TRYING [2]
% 4.98/1.19 % TRYING [3]
% 4.98/1.19 % (2982412)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=407063776:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.98/1.19 % (2982416)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3107352448:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.98/1.19 % (2982413)dis+10_1_sil=32000:sp=arity:random_seed=3637287266:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.98/1.19 % (2982415)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1799446125:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.98/1.19 % TRYING [4]
% 4.98/1.19 % (2982414)Instruction limit reached!
% 4.98/1.19 % (2982414)------------------------------
% 4.98/1.19 % (2982414)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.98/1.19 % (2982414)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.19 % (2982414)CaDiCaL version: 2.1.3
% 4.98/1.19 % (2982414)Termination reason: Instruction limit
% 4.98/1.19 % (2982414)Termination phase: Saturation
% 4.98/1.19 % (2982414)Time elapsed: 0.037 s
% 4.98/1.19 % (2982414)Peak memory usage: 12 MB
% 4.98/1.19 % (2982414)Instructions burned: 116 (million)
% 4.98/1.19 % (2982424)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=166410527:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 4.98/1.19 % TRYING [1]
% 4.98/1.19 % TRYING [2]
% 4.98/1.19 % TRYING [3]
% 4.98/1.19 % TRYING [4]
% 4.98/1.19 % (2982413)Instruction limit reached!
% 4.98/1.19 % (2982413)------------------------------
% 4.98/1.19 % (2982413)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.98/1.19 % (2982413)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.19 % (2982413)CaDiCaL version: 2.1.3
% 4.98/1.19 % (2982413)Termination reason: Instruction limit
% 4.98/1.19 % (2982413)Termination phase: Saturation
% 4.98/1.19 % (2982413)Time elapsed: 0.098 s
% 4.98/1.19 % (2982413)Peak memory usage: 12 MB
% 4.98/1.19 % (2982413)Instructions burned: 103 (million)
% 4.98/1.19 % (2982426)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1430234132:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 4.98/1.19 % (2982415)Instruction limit reached!
% 4.98/1.19 % (2982415)------------------------------
% 4.98/1.19 % (2982415)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.98/1.19 % (2982415)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.19 % (2982415)CaDiCaL version: 2.1.3
% 4.98/1.19 % (2982415)Termination reason: Instruction limit
% 4.98/1.19 % (2982415)Termination phase: Saturation
% 4.98/1.19 % (2982415)Time elapsed: 0.124 s
% 4.98/1.19 % (2982415)Peak memory usage: 12 MB
% 4.98/1.19 % (2982415)Instructions burned: 131 (million)
% 4.98/1.19 % TRYING [5]
% 4.98/1.19 % (2982416)Instruction limit reached!
% 4.98/1.19 % (2982416)------------------------------
% 4.98/1.19 % (2982416)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.98/1.19 % (2982416)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.19 % (2982416)CaDiCaL version: 2.1.3
% 4.98/1.19 % (2982416)Termination reason: Instruction limit
% 4.98/1.19 % (2982416)Termination phase: Saturation
% 4.98/1.19 % (2982416)Time elapsed: 0.142 s
% 4.98/1.19 % (2982416)Peak memory usage: 12 MB
% 4.98/1.19 % (2982416)Instructions burned: 159 (million)
% 4.98/1.19 % (2982428)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=3562124211:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 4.98/1.19 % (2982429)ott-21_1_sil=16000:fs=off:random_seed=720841753:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 4.98/1.19 % (2982426)Instruction limit reached!
% 4.98/1.19 % (2982426)------------------------------
% 4.98/1.19 % (2982426)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.98/1.19 % (2982426)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.19 % (2982426)CaDiCaL version: 2.1.3
% 4.98/1.19 % (2982426)Termination reason: Instruction limit
% 4.98/1.19 % (2982426)Termination phase: Saturation
% 4.98/1.19 % (2982426)Time elapsed: 0.084 s
% 4.98/1.19 % (2982426)Peak memory usage: 13 MB
% 4.98/1.19 % (2982426)Instructions burned: 132 (million)
% 4.98/1.19 % (2982432)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=446347136:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 4.98/1.19 % (2982424)Instruction limit reached!
% 4.98/1.19 % (2982424)------------------------------
% 4.98/1.19 % (2982424)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.98/1.19 % (2982424)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.19 % (2982424)CaDiCaL version: 2.1.3
% 4.98/1.19 % (2982424)Termination reason: Instruction limit
% 4.98/1.19 % (2982424)Termination phase: Finite model building SAT solving
% 4.98/1.19 % (2982424)Time elapsed: 0.221 s
% 4.98/1.19 % (2982424)Peak memory usage: 15 MB
% 4.98/1.19 % (2982424)Instructions burned: 715 (million)
% 4.98/1.19 % (2982429)Instruction limit reached!
% 4.98/1.19 % (2982429)------------------------------
% 4.98/1.19 % (2982429)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.98/1.19 % (2982429)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.19 % (2982429)CaDiCaL version: 2.1.3
% 4.98/1.19 % (2982429)Termination reason: Instruction limit
% 4.98/1.19 % (2982429)Termination phase: Saturation
% 4.98/1.19 % (2982429)Time elapsed: 0.096 s
% 4.98/1.19 % (2982429)Peak memory usage: 11 MB
% 4.98/1.19 % (2982429)Instructions burned: 182 (million)
% 4.98/1.19 % (2982434)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=23041322:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 4.98/1.19 % TRYING [1]
% 4.98/1.19 % TRYING [2]
% 4.98/1.19 % TRYING [3]
% 4.98/1.19 % TRYING [4]
% 4.98/1.19 % (2982436)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3107902022:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 4.98/1.19 % TRYING [5]
% 4.98/1.19 % (2982434)Instruction limit reached!
% 4.98/1.19 % (2982434)------------------------------
% 4.98/1.19 % (2982434)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.98/1.19 % (2982434)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.19 % (2982434)CaDiCaL version: 2.1.3
% 4.98/1.19 % (2982434)Termination reason: Instruction limit
% 4.98/1.19 % (2982434)Termination phase: Finite model building SAT solving
% 4.98/1.19 % (2982434)Time elapsed: 0.246 s
% 4.98/1.19 % (2982434)Peak memory usage: 16 MB
% 4.98/1.19 % (2982434)Instructions burned: 866 (million)
% 4.98/1.19 % (2982438)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3238275993:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 4.98/1.19 % (2982432)Instruction limit reached!
% 4.98/1.19 % (2982432)------------------------------
% 4.98/1.19 % (2982432)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.98/1.19 % (2982432)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.19 % (2982432)CaDiCaL version: 2.1.3
% 4.98/1.19 % (2982432)Termination reason: Instruction limit
% 4.98/1.19 % (2982432)Termination phase: Saturation
% 4.98/1.19 % (2982432)Time elapsed: 0.399 s
% 4.98/1.19 % (2982432)Peak memory usage: 16 MB
% 4.98/1.19 % (2982432)Instructions burned: 478 (million)
% 4.98/1.19 % (2982440)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=3892031504:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2993 on theBenchmark for (2993ds/692Mi)
% 4.98/1.19 % (2982436) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2982405-2982436"...
% 4.98/1.19 % (2982436)...printing done.
% 4.98/1.19 % (2982436)Refutation found. Thanks to Tanya!
% 4.98/1.19 % SZS status Unsatisfiable for theBenchmark
% 4.98/1.19 % SZS output start Proof for theBenchmark
% See solution above
% 4.98/1.19 % (2982436)------------------------------
% 4.98/1.19 % (2982436)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.98/1.19 % (2982436)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.19 % (2982436)CaDiCaL version: 2.1.3
% 4.98/1.19 % (2982436)Termination reason: Refutation
% 4.98/1.19 % (2982436)Time elapsed: 0.414 s
% 4.98/1.19 % (2982436)Peak memory usage: 22 MB
% 4.98/1.19 % (2982436)Instructions burned: 727 (million)
% 4.98/1.19 % (2982405)Success in time 0.755 s
% 4.98/1.19 % Vampire exiting
%------------------------------------------------------------------------------