%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL014-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:25 AM UTC 2026
% Result : Unsatisfiable 4.19s 1.09s
% Output : Refutation 4.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 9
% Syntax : Number of formulae : 66 ( 39 unt; 6 def)
% Number of atoms : 99 ( 10 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 86 ( 53 ~; 32 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 81 ( 0 sgn 81 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,equivalent(X0,X1)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wn) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(equivalent(b,equivalent(a,c)),equivalent(c,b)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_xgf) ).
fof(f4,definition,
sF0 = equivalent(a,c),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f5,plain,
equivalent(a,c) = sF0,
inference(reorient_equations,[],[f4]) ).
fof(f6,definition,
sF1 = equivalent(b,sF0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f7,plain,
equivalent(b,sF0) = sF1,
inference(reorient_equations,[],[f6]) ).
fof(f8,definition,
sF2 = equivalent(c,b),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f9,plain,
equivalent(c,b) = sF2,
inference(reorient_equations,[],[f8]) ).
fof(f10,definition,
sF3 = equivalent(sF1,sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f11,plain,
equivalent(sF1,sF2) = sF3,
inference(reorient_equations,[],[f10]) ).
fof(f12,definition,
sF4 = equivalent(a,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f13,plain,
equivalent(a,sF3) = sF4,
inference(reorient_equations,[],[f12]) ).
fof(f14,plain,
~ is_a_theorem(sF4),
inference(definition_folding,[],[f3,f13,f11,f9,f7,f5]) ).
fof(f52,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(X2,equivalent(X0,X1))) ),
inference(resolution,[],[f2,f1]) ).
fof(f54,plain,
! [X0] : is_a_theorem(equivalent(equivalent(X0,sF4),equivalent(sF3,equivalent(X0,a)))),
inference(superposition,[],[f2,f13]) ).
fof(f56,plain,
! [X0] : is_a_theorem(equivalent(equivalent(X0,sF2),equivalent(b,equivalent(X0,c)))),
inference(superposition,[],[f2,f9]) ).
fof(f58,plain,
! [X0] : is_a_theorem(equivalent(equivalent(a,equivalent(c,X0)),equivalent(X0,sF0))),
inference(superposition,[],[f2,f5]) ).
fof(f59,plain,
! [X0] : is_a_theorem(equivalent(equivalent(a,equivalent(sF3,X0)),equivalent(X0,sF4))),
inference(superposition,[],[f2,f13]) ).
fof(f62,plain,
! [X0] : is_a_theorem(equivalent(equivalent(sF1,equivalent(sF2,X0)),equivalent(X0,sF3))),
inference(superposition,[],[f2,f11]) ).
fof(f66,plain,
! [X0] :
( ~ is_a_theorem(equivalent(X0,sF4))
| is_a_theorem(equivalent(sF3,equivalent(X0,a))) ),
inference(resolution,[],[f54,f1]) ).
fof(f71,plain,
is_a_theorem(equivalent(equivalent(a,sF2),equivalent(b,sF0))),
inference(superposition,[],[f56,f5]) ).
fof(f72,plain,
is_a_theorem(equivalent(equivalent(a,sF2),sF1)),
inference(forward_demodulation,[],[f71,f7]) ).
fof(f108,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,equivalent(X1,X2)),X2))),
inference(resolution,[],[f52,f2]) ).
fof(f113,plain,
! [X0] : is_a_theorem(equivalent(equivalent(X0,a),equivalent(equivalent(X0,sF4),sF3))),
inference(resolution,[],[f52,f54]) ).
fof(f117,plain,
! [X0] : is_a_theorem(equivalent(sF0,equivalent(equivalent(a,equivalent(c,X0)),X0))),
inference(resolution,[],[f52,f58]) ).
fof(f121,plain,
! [X0] : is_a_theorem(equivalent(sF3,equivalent(equivalent(sF1,equivalent(sF2,X0)),X0))),
inference(resolution,[],[f52,f62]) ).
fof(f214,plain,
! [X0] :
( is_a_theorem(equivalent(equivalent(X0,sF4),sF3))
| ~ is_a_theorem(equivalent(X0,a)) ),
inference(resolution,[],[f113,f1]) ).
fof(f233,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,equivalent(X2,X0))))),
inference(resolution,[],[f108,f52]) ).
fof(f234,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),X2))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f108,f1]) ).
fof(f310,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,equivalent(X2,X0))))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f233,f1]) ).
fof(f325,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(X2) ),
inference(resolution,[],[f234,f1]) ).
fof(f326,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(equivalent(X2,equivalent(equivalent(X0,equivalent(X1,equivalent(X3,X2))),X3)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f234,f52]) ).
fof(f336,plain,
! [X0,X1] :
( is_a_theorem(equivalent(sF3,equivalent(equivalent(X0,equivalent(X1,sF4)),a)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f234,f66]) ).
fof(f362,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X1,X0),equivalent(equivalent(X2,X1),X2)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f310,f52]) ).
fof(f363,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(X1,equivalent(X2,X0)))
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f310,f1]) ).
fof(f391,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(X1,equivalent(X2,X0))) ),
inference(resolution,[],[f325,f233]) ).
fof(f403,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),X0))
| is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f325,f310]) ).
fof(f442,plain,
! [X0] :
( ~ is_a_theorem(equivalent(equivalent(a,equivalent(sF3,X0)),X0))
| is_a_theorem(sF4) ),
inference(resolution,[],[f325,f59]) ).
fof(f451,plain,
! [X0] : ~ is_a_theorem(equivalent(equivalent(a,equivalent(sF3,X0)),X0)),
inference(forward_subsumption_resolution,[],[f442,f14]) ).
fof(f833,plain,
! [X0] : ~ is_a_theorem(equivalent(sF3,equivalent(equivalent(X0,a),X0))),
inference(resolution,[],[f362,f451]) ).
fof(f903,plain,
! [X0] :
( ~ is_a_theorem(equivalent(sF3,equivalent(X0,a)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f363,f833]) ).
fof(f920,plain,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,sF4)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f903,f336]) ).
fof(f950,plain,
! [X0,X1] : ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,equivalent(X1,sF4)))),
inference(resolution,[],[f920,f108]) ).
fof(f963,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X2,X0))
| is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f391,f363]) ).
fof(f1058,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,X1),X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X0)) ),
inference(resolution,[],[f403,f234]) ).
fof(f1094,definition,
( spl5_34
<=> ! [X0] : ~ is_a_theorem(X0) ),
introduced(definition,[new_symbols(definition,[spl5_34])],[avatar_definition]) ).
fof(f1095,plain,
( ! [X0] : ~ is_a_theorem(X0)
| ~ spl5_34 ),
inference(avatar_component_clause,[],[f1094]) ).
fof(f1134,plain,
! [X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),X0))
| ~ is_a_theorem(equivalent(X1,sF4)) ),
inference(resolution,[],[f950,f363]) ).
fof(f1163,plain,
! [X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),sF4))
| ~ is_a_theorem(equivalent(X1,X0)) ),
inference(resolution,[],[f1134,f234]) ).
fof(f1241,plain,
! [X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,sF4),X1))
| ~ is_a_theorem(equivalent(X1,X0)) ),
inference(resolution,[],[f1163,f234]) ).
fof(f1440,plain,
! [X0] :
( ~ is_a_theorem(equivalent(sF3,X0))
| ~ is_a_theorem(equivalent(X0,a)) ),
inference(resolution,[],[f1241,f214]) ).
fof(f1492,plain,
! [X0] : ~ is_a_theorem(equivalent(equivalent(equivalent(sF1,equivalent(sF2,X0)),X0),a)),
inference(resolution,[],[f1440,f121]) ).
fof(f1582,plain,
! [X0] : ~ is_a_theorem(equivalent(equivalent(sF1,equivalent(sF2,equivalent(X0,a))),X0)),
inference(resolution,[],[f1492,f234]) ).
fof(f1726,plain,
! [X0] : ~ is_a_theorem(equivalent(sF2,equivalent(equivalent(equivalent(X0,sF1),X0),a))),
inference(resolution,[],[f1582,f362]) ).
fof(f1812,plain,
! [X0] : ~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(a,sF2)),sF1),X0)),
inference(resolution,[],[f1726,f326]) ).
fof(f2088,plain,
( $false
| ~ spl5_34 ),
inference(resolution,[],[f1095,f117]) ).
fof(f2242,plain,
~ spl5_34,
inference(avatar_contradiction_clause,[],[f2088]) ).
fof(f2886,plain,
! [X0] :
( is_a_theorem(equivalent(sF1,equivalent(X0,equivalent(a,sF2))))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f963,f72]) ).
fof(f2981,plain,
! [X0] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(sF1,equivalent(X0,equivalent(a,sF2)))) ),
inference(resolution,[],[f1058,f1812]) ).
fof(f3156,plain,
! [X0] : ~ is_a_theorem(X0),
inference(forward_subsumption_resolution,[],[f2981,f2886]) ).
fof(f3157,plain,
spl5_34,
inference(avatar_split_clause,[],[f3156,f1094]) ).
cnf(s93,plain,
~ spl5_34,
inference(sat_conversion,[],[f2242]) ).
cnf(s96,plain,
spl5_34,
inference(sat_conversion,[],[f3157]) ).
cnf(s97,plain,
$false,
inference(rat,[],[s93,s96]) ).
fof(f3158,plain,
$false,
inference(avatar_sat_refutation,[],[s97]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL014-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n008.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 15:17:55 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.19/1.09 % (1361601)Will run a generic schedule for satisfiability detection.
% 4.19/1.09 % (1361612)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3165049489:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.19/1.09 % (1361607)% WARNING: option uhcvi not known.
% 4.19/1.09 % (1361607)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4216518255:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.19/1.09 % (1361609)dis+10_1_sil=32000:sp=arity:random_seed=1571591442:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.19/1.09 % (1361610)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2623525720:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.19/1.09 % (1361611)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1737739287:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.19/1.09 % (1361608)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3897229582:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.19/1.09 % (1361606)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4141993279_2999 on theBenchmark for (2999ds/0Mi)
% 4.19/1.09 % TRYING [1]
% 4.19/1.09 % TRYING [2]
% 4.19/1.09 % TRYING [3]
% 4.19/1.09 % TRYING [4]
% 4.19/1.09 % (1361612)Instruction limit reached!
% 4.19/1.09 % (1361612)------------------------------
% 4.19/1.09 % (1361612)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.19/1.09 % (1361612)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.09 % (1361612)CaDiCaL version: 2.1.3
% 4.19/1.09 % (1361612)Termination reason: Instruction limit
% 4.19/1.09 % (1361612)Termination phase: Saturation
% 4.19/1.09 % (1361612)Time elapsed: 0.089 s
% 4.19/1.09 % (1361612)Peak memory usage: 12 MB
% 4.19/1.09 % (1361612)Instructions burned: 159 (million)
% 4.19/1.09 % (1361620)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2161659758:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 4.19/1.09 % TRYING [1]
% 4.19/1.09 % TRYING [2]
% 4.19/1.09 % TRYING [3]
% 4.19/1.09 % (1361609)Instruction limit reached!
% 4.19/1.09 % (1361609)------------------------------
% 4.19/1.09 % (1361609)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.19/1.09 % (1361609)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.09 % (1361609)CaDiCaL version: 2.1.3
% 4.19/1.09 % (1361609)Termination reason: Instruction limit
% 4.19/1.09 % (1361609)Termination phase: Saturation
% 4.19/1.09 % (1361609)Time elapsed: 0.097 s
% 4.19/1.09 % (1361609)Peak memory usage: 11 MB
% 4.19/1.09 % (1361609)Instructions burned: 104 (million)
% 4.19/1.09 % TRYING [4]
% 4.19/1.09 % (1361610)Instruction limit reached!
% 4.19/1.09 % (1361610)------------------------------
% 4.19/1.09 % (1361610)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.19/1.09 % (1361610)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.09 % (1361610)CaDiCaL version: 2.1.3
% 4.19/1.09 % (1361610)Termination reason: Instruction limit
% 4.19/1.09 % (1361610)Termination phase: Saturation
% 4.19/1.09 % (1361610)Time elapsed: 0.107 s
% 4.19/1.09 % (1361610)Peak memory usage: 11 MB
% 4.19/1.09 % (1361610)Instructions burned: 116 (million)
% 4.19/1.09 % (1361611)Instruction limit reached!
% 4.19/1.09 % (1361611)------------------------------
% 4.19/1.09 % (1361611)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.19/1.09 % (1361611)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.09 % (1361611)CaDiCaL version: 2.1.3
% 4.19/1.09 % (1361611)Termination reason: Instruction limit
% 4.19/1.09 % (1361611)Termination phase: Saturation
% 4.19/1.09 % (1361611)Time elapsed: 0.123 s
% 4.19/1.09 % (1361611)Peak memory usage: 12 MB
% 4.19/1.09 % (1361611)Instructions burned: 131 (million)
% 4.19/1.09 % (1361622)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2661653473:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 4.19/1.09 % (1361623)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=3759899894:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 4.19/1.09 % (1361624)ott-21_1_sil=16000:fs=off:random_seed=2082277868:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 4.19/1.09 % (1361624)Instruction limit reached!
% 4.19/1.09 % (1361624)------------------------------
% 4.19/1.09 % (1361624)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.19/1.09 % (1361624)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.09 % (1361624)CaDiCaL version: 2.1.3
% 4.19/1.09 % (1361624)Termination reason: Instruction limit
% 4.19/1.09 % (1361624)Termination phase: Saturation
% 4.19/1.09 % (1361624)Time elapsed: 0.051 s
% 4.19/1.09 % (1361624)Peak memory usage: 13 MB
% 4.19/1.09 % (1361624)Instructions burned: 184 (million)
% 4.19/1.09 % (1361630)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=4281408976:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 4.19/1.09 % (1361622)Instruction limit reached!
% 4.19/1.09 % (1361622)------------------------------
% 4.19/1.09 % (1361622)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.19/1.09 % (1361622)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.09 % (1361622)CaDiCaL version: 2.1.3
% 4.19/1.09 % (1361622)Termination reason: Instruction limit
% 4.19/1.09 % (1361622)Termination phase: Saturation
% 4.19/1.09 % (1361622)Time elapsed: 0.094 s
% 4.19/1.09 % (1361622)Peak memory usage: 12 MB
% 4.19/1.09 % (1361622)Instructions burned: 132 (million)
% 4.19/1.09 % (1361632)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2155912743:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 4.19/1.09 % TRYING [1]
% 4.19/1.09 % TRYING [2]
% 4.19/1.09 % TRYING [3]
% 4.19/1.09 % TRYING [4]
% 4.19/1.09 % TRYING [5]
% 4.19/1.09 % TRYING [5]
% 4.19/1.09 % TRYING [5]
% 4.19/1.09 % (1361620)Instruction limit reached!
% 4.19/1.09 % (1361620)------------------------------
% 4.19/1.09 % (1361620)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.19/1.09 % (1361620)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.09 % (1361620)CaDiCaL version: 2.1.3
% 4.19/1.09 % (1361620)Termination reason: Instruction limit
% 4.19/1.09 % (1361620)Termination phase: Finite model building SAT solving
% 4.19/1.09 % (1361620)Time elapsed: 0.399 s
% 4.19/1.09 % (1361620)Peak memory usage: 13 MB
% 4.19/1.09 % (1361620)Instructions burned: 715 (million)
% 4.19/1.09 % (1361630)Instruction limit reached!
% 4.19/1.09 % (1361630)------------------------------
% 4.19/1.09 % (1361630)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.19/1.09 % (1361630)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.09 % (1361630)CaDiCaL version: 2.1.3
% 4.19/1.09 % (1361630)Termination reason: Instruction limit
% 4.19/1.09 % (1361630)Termination phase: Saturation
% 4.19/1.09 % (1361630)Time elapsed: 0.283 s
% 4.19/1.09 % (1361630)Peak memory usage: 13 MB
% 4.19/1.09 % (1361630)Instructions burned: 478 (million)
% 4.19/1.09 % (1361636)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3541568690:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 4.19/1.09 % (1361635)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3991164645:i=1179_2994 on theBenchmark for (2994ds/1179Mi)
% 4.19/1.09 % (1361632)Instruction limit reached!
% 4.19/1.09 % (1361632)------------------------------
% 4.19/1.09 % (1361632)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.19/1.09 % (1361623)Instruction limit reached!
% 4.19/1.09 % (1361623)------------------------------
% 4.19/1.09 % (1361623)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.19/1.09 % (1361632)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.09 % (1361623)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.09 % (1361632)CaDiCaL version: 2.1.3
% 4.19/1.09 % (1361623)CaDiCaL version: 2.1.3
% 4.19/1.09 % (1361632)Termination reason: Instruction limit
% 4.19/1.09 % (1361632)Termination phase: Finite model building SAT solving
% 4.19/1.09 % (1361623)Termination reason: Instruction limit
% 4.19/1.09 % (1361623)Termination phase: Saturation
% 4.19/1.09 % (1361632)Time elapsed: 0.282 s
% 4.19/1.09 % (1361623)Time elapsed: 0.383 s
% 4.19/1.09 % (1361623)Peak memory usage: 15 MB
% 4.19/1.09 % (1361632)Peak memory usage: 12 MB
% 4.19/1.09 % (1361623)Instructions burned: 685 (million)
% 4.19/1.09 % (1361632)Instructions burned: 866 (million)
% 4.19/1.09 % (1361639)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=1804937820:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 4.19/1.09 % TRYING [14]
% 4.19/1.09 % (1361640)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2822914543:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 4.19/1.09 % (1361635) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1361601-1361635"...
% 4.19/1.09 % (1361635)...printing done.
% 4.19/1.09 % (1361635)Refutation found. Thanks to Tanya!
% 4.19/1.09 % SZS status Unsatisfiable for theBenchmark
% 4.19/1.09 % SZS output start Proof for theBenchmark
% See solution above
% 4.19/1.09 % (1361635)------------------------------
% 4.19/1.09 % (1361635)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.19/1.09 % (1361635)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.09 % (1361635)CaDiCaL version: 2.1.3
% 4.19/1.09 % (1361635)Termination reason: Refutation
% 4.19/1.09 % (1361635)Time elapsed: 0.085 s
% 4.19/1.09 % (1361635)Peak memory usage: 13 MB
% 4.19/1.09 % (1361635)Instructions burned: 132 (million)
% 4.19/1.09 % (1361601)Success in time 0.641 s
% 4.19/1.09 % Vampire exiting
%------------------------------------------------------------------------------