%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL070-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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:33 AM UTC 2026
% Result : Unsatisfiable 2.03s 0.87s
% Output : Refutation 2.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 12
% Syntax : Number of formulae : 78 ( 42 unt; 7 def)
% Number of atoms : 128 ( 10 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 111 ( 61 ~; 48 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 79 ( 0 sgn 79 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_19) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(not(X0),X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_37) ).
fof(f4,axiom,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(X0,implies(not(X1),X2)),implies(X0,implies(implies(X3,X2),implies(implies(X1,X3),X2))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_60) ).
fof(f5,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_1) ).
fof(f6,definition,
sF0 = implies(a,b),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f7,plain,
implies(a,b) = sF0,
inference(reorient_equations,[],[f6]) ).
fof(f8,definition,
sF1 = implies(b,c),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f9,plain,
implies(b,c) = sF1,
inference(reorient_equations,[],[f8]) ).
fof(f10,definition,
sF2 = implies(a,c),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f11,plain,
implies(a,c) = sF2,
inference(reorient_equations,[],[f10]) ).
fof(f12,definition,
sF3 = implies(sF1,sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f13,plain,
implies(sF1,sF2) = sF3,
inference(reorient_equations,[],[f12]) ).
fof(f14,definition,
sF4 = implies(sF0,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f15,plain,
implies(sF0,sF3) = sF4,
inference(reorient_equations,[],[f14]) ).
fof(f16,plain,
~ is_a_theorem(sF4),
inference(definition_folding,[],[f5,f15,f13,f11,f9,f7]) ).
fof(f54,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f2,f1]) ).
fof(f56,plain,
! [X0] : is_a_theorem(implies(implies(sF2,X0),implies(c,X0))),
inference(superposition,[],[f2,f11]) ).
fof(f59,plain,
! [X0] : is_a_theorem(implies(implies(sF3,X0),implies(sF2,X0))),
inference(superposition,[],[f2,f13]) ).
fof(f63,plain,
! [X0] : is_a_theorem(implies(implies(implies(X0,sF0),sF3),sF4)),
inference(superposition,[],[f2,f15]) ).
fof(f65,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(not(X0),X2)) ),
inference(resolution,[],[f3,f1]) ).
fof(f67,plain,
! [X0] : is_a_theorem(implies(implies(sF2,X0),implies(not(a),X0))),
inference(superposition,[],[f3,f11]) ).
fof(f70,plain,
! [X0] : is_a_theorem(implies(implies(sF3,X0),implies(not(sF1),X0))),
inference(superposition,[],[f3,f13]) ).
fof(f71,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(X0,implies(implies(X3,X2),implies(implies(X1,X3),X2))))
| ~ is_a_theorem(implies(X0,implies(not(X1),X2))) ),
inference(resolution,[],[f4,f1]) ).
fof(f75,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,implies(not(X1),sF3)),implies(X0,implies(sF4,implies(implies(X1,sF0),sF3))))),
inference(superposition,[],[f4,f15]) ).
fof(f77,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,implies(not(a),X1)),implies(X0,implies(implies(b,X1),implies(sF0,X1))))),
inference(superposition,[],[f4,f7]) ).
fof(f85,plain,
! [X0] :
( ~ is_a_theorem(implies(sF2,X0))
| is_a_theorem(implies(c,X0)) ),
inference(resolution,[],[f56,f1]) ).
fof(f92,plain,
! [X0] :
( ~ is_a_theorem(implies(sF3,X0))
| is_a_theorem(implies(sF2,X0)) ),
inference(resolution,[],[f59,f1]) ).
fof(f128,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(resolution,[],[f54,f2]) ).
fof(f145,plain,
is_a_theorem(implies(sF3,sF4)),
inference(resolution,[],[f54,f63]) ).
fof(f201,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),sF3),implies(X1,implies(sF4,implies(implies(X0,sF0),sF3))))),
inference(resolution,[],[f75,f54]) ).
fof(f207,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(a),X0),implies(X1,implies(implies(b,X0),implies(sF0,X0))))),
inference(resolution,[],[f77,f54]) ).
fof(f211,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f128,f1]) ).
fof(f212,plain,
! [X2,X0,X1] : is_a_theorem(implies(not(X0),implies(X1,implies(X0,X2)))),
inference(resolution,[],[f128,f65]) ).
fof(f255,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),X2)))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(implies(X3,X2),implies(implies(X1,X3),X2))) ),
inference(resolution,[],[f71,f1]) ).
fof(f406,plain,
is_a_theorem(implies(sF2,sF4)),
inference(resolution,[],[f92,f145]) ).
fof(f407,plain,
is_a_theorem(implies(c,sF4)),
inference(resolution,[],[f406,f85]) ).
fof(f545,plain,
! [X0,X1] : is_a_theorem(implies(sF3,implies(X0,implies(sF4,implies(implies(X1,sF0),sF3))))),
inference(resolution,[],[f201,f54]) ).
fof(f558,plain,
! [X0] : is_a_theorem(implies(implies(not(a),sF3),implies(X0,implies(implies(b,sF3),sF4)))),
inference(superposition,[],[f207,f15]) ).
fof(f758,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(implies(X3,X2),implies(implies(X0,X3),X2))) ),
inference(resolution,[],[f255,f3]) ).
fof(f773,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X1,X0),implies(implies(a,X1),X0)))
| ~ is_a_theorem(implies(sF2,X0)) ),
inference(resolution,[],[f255,f67]) ).
fof(f774,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X1,X0),implies(implies(sF1,X1),X0)))
| ~ is_a_theorem(implies(sF3,X0)) ),
inference(resolution,[],[f255,f70]) ).
fof(f836,definition,
( spl5_24
<=> ! [X0] : ~ is_a_theorem(X0) ),
introduced(definition,[new_symbols(definition,[spl5_24])],[avatar_definition]) ).
fof(f837,plain,
( ! [X0] : ~ is_a_theorem(X0)
| ~ spl5_24 ),
inference(avatar_component_clause,[],[f836]) ).
fof(f944,plain,
! [X0] : is_a_theorem(implies(not(a),implies(X0,sF2))),
inference(superposition,[],[f212,f11]) ).
fof(f957,plain,
is_a_theorem(implies(not(a),sF3)),
inference(superposition,[],[f944,f13]) ).
fof(f1016,plain,
! [X0,X1] : is_a_theorem(implies(sF2,implies(X0,implies(sF4,implies(implies(X1,sF0),sF3))))),
inference(resolution,[],[f545,f92]) ).
fof(f1019,plain,
( $false
| ~ spl5_24 ),
inference(forward_subsumption_resolution,[],[f1016,f837]) ).
fof(f1020,plain,
~ spl5_24,
inference(avatar_contradiction_clause,[],[f1019]) ).
fof(f1314,plain,
! [X0] :
( ~ is_a_theorem(implies(not(a),sF3))
| is_a_theorem(implies(X0,implies(implies(b,sF3),sF4))) ),
inference(resolution,[],[f558,f1]) ).
fof(f1315,plain,
! [X0] : is_a_theorem(implies(X0,implies(implies(b,sF3),sF4))),
inference(forward_subsumption_resolution,[],[f1314,f957]) ).
fof(f1366,plain,
! [X0] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(implies(b,sF3),sF4)) ),
inference(resolution,[],[f1315,f1]) ).
fof(f1376,definition,
( spl5_36
<=> is_a_theorem(implies(implies(b,sF3),sF4)) ),
introduced(definition,[new_symbols(definition,[spl5_36])],[avatar_definition]) ).
fof(f1378,plain,
( is_a_theorem(implies(implies(b,sF3),sF4))
| ~ spl5_36 ),
inference(avatar_component_clause,[],[f1376]) ).
fof(f1379,plain,
( spl5_36
| spl5_24 ),
inference(avatar_split_clause,[],[f1366,f836,f1376]) ).
fof(f1582,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(a,X1),X0))
| ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(sF2,X0)) ),
inference(resolution,[],[f773,f1]) ).
fof(f1605,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(sF1,X1),X0))
| ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(sF3,X0)) ),
inference(resolution,[],[f774,f1]) ).
fof(f2144,plain,
( ! [X0] : is_a_theorem(implies(implies(X0,sF4),implies(implies(b,X0),sF4)))
| ~ spl5_36 ),
inference(resolution,[],[f758,f1378]) ).
fof(f5176,plain,
( ! [X0] :
( is_a_theorem(implies(implies(b,X0),sF4))
| ~ is_a_theorem(implies(X0,sF4)) )
| ~ spl5_36 ),
inference(resolution,[],[f2144,f1]) ).
fof(f5177,plain,
( is_a_theorem(implies(implies(c,sF4),implies(sF1,sF4)))
| ~ spl5_36 ),
inference(superposition,[],[f2144,f9]) ).
fof(f5190,plain,
( ~ is_a_theorem(implies(c,sF4))
| is_a_theorem(implies(sF1,sF4))
| ~ spl5_36 ),
inference(resolution,[],[f5177,f1]) ).
fof(f5191,plain,
( is_a_theorem(implies(sF1,sF4))
| ~ spl5_36 ),
inference(forward_subsumption_resolution,[],[f5190,f407]) ).
fof(f5630,plain,
( ! [X0] :
( ~ is_a_theorem(implies(X0,sF4))
| ~ is_a_theorem(implies(b,X0))
| is_a_theorem(sF4) )
| ~ spl5_36 ),
inference(resolution,[],[f5176,f1]) ).
fof(f5632,plain,
( ! [X0] :
( ~ is_a_theorem(implies(b,X0))
| ~ is_a_theorem(implies(X0,sF4)) )
| ~ spl5_36 ),
inference(forward_subsumption_resolution,[],[f5630,f16]) ).
fof(f5645,plain,
( ! [X0] :
( ~ is_a_theorem(implies(X0,sF4))
| ~ is_a_theorem(X0) )
| ~ spl5_36 ),
inference(resolution,[],[f5632,f211]) ).
fof(f7959,plain,
( ! [X0] :
( ~ is_a_theorem(implies(X0,sF4))
| ~ is_a_theorem(implies(sF3,sF4))
| ~ is_a_theorem(implies(sF1,X0)) )
| ~ spl5_36 ),
inference(resolution,[],[f1605,f5645]) ).
fof(f7961,plain,
( ! [X0] :
( ~ is_a_theorem(implies(sF1,X0))
| ~ is_a_theorem(implies(X0,sF4)) )
| ~ spl5_36 ),
inference(forward_subsumption_resolution,[],[f7959,f145]) ).
fof(f8135,plain,
( ! [X0] : ~ is_a_theorem(implies(implies(X0,sF1),sF4))
| ~ spl5_36 ),
inference(resolution,[],[f7961,f128]) ).
fof(f8225,plain,
( ~ is_a_theorem(implies(sF1,sF4))
| ~ is_a_theorem(implies(sF2,sF4))
| ~ spl5_36 ),
inference(resolution,[],[f8135,f1582]) ).
fof(f8236,plain,
( ~ is_a_theorem(implies(sF2,sF4))
| ~ spl5_36 ),
inference(forward_subsumption_resolution,[],[f8225,f5191]) ).
fof(f8241,plain,
( $false
| ~ spl5_36 ),
inference(forward_subsumption_resolution,[],[f8236,f406]) ).
fof(f8242,plain,
~ spl5_36,
inference(avatar_contradiction_clause,[],[f8241]) ).
cnf(s21,plain,
~ spl5_24,
inference(sat_conversion,[],[f1020]) ).
cnf(s28,plain,
( spl5_24
| spl5_36 ),
inference(sat_conversion,[],[f1379]) ).
cnf(s111,plain,
~ spl5_36,
inference(sat_conversion,[],[f8242]) ).
cnf(s112,plain,
spl5_24,
inference(rat,[],[s28,s111]) ).
cnf(s113,plain,
$false,
inference(rat,[],[s21,s112]) ).
fof(f8243,plain,
$false,
inference(avatar_sat_refutation,[],[s113]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL070-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n009.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 15:20:45 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/0.41 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.03/0.87 % (2159679)Will run a generic schedule for satisfiability detection.
% 2.03/0.87 % (2159694)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2692437572:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.03/0.87 % (2159689)% WARNING: option uhcvi not known.
% 2.03/0.87 % (2159691)dis+10_1_sil=32000:sp=arity:random_seed=78808997:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.03/0.87 % (2159690)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2726309214:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.03/0.87 % (2159692)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1530768341:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.03/0.87 % (2159693)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1917935156:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.03/0.87 % (2159689)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2547911499:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.03/0.87 % (2159688)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3123139976_2999 on theBenchmark for (2999ds/0Mi)
% 2.03/0.87 % TRYING [1]
% 2.03/0.87 % TRYING [2]
% 2.03/0.87 % TRYING [3]
% 2.03/0.87 % TRYING [4]
% 2.03/0.87 % (2159694)Instruction limit reached!
% 2.03/0.87 % (2159694)------------------------------
% 2.03/0.87 % (2159694)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.03/0.87 % (2159694)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.03/0.87 % (2159694)CaDiCaL version: 2.1.3
% 2.03/0.87 % (2159694)Termination reason: Instruction limit
% 2.03/0.87 % (2159694)Termination phase: Saturation
% 2.03/0.87 % (2159694)Time elapsed: 0.054 s
% 2.03/0.87 % (2159694)Peak memory usage: 12 MB
% 2.03/0.87 % (2159694)Instructions burned: 159 (million)
% 2.03/0.87 % (2159720)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=388642513:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.03/0.87 % TRYING [1]
% 2.03/0.87 % TRYING [2]
% 2.03/0.87 % TRYING [3]
% 2.03/0.87 % (2159691)Instruction limit reached!
% 2.03/0.87 % (2159691)------------------------------
% 2.03/0.87 % (2159691)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.03/0.87 % (2159691)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.03/0.87 % (2159691)CaDiCaL version: 2.1.3
% 2.03/0.87 % (2159691)Termination reason: Instruction limit
% 2.03/0.87 % (2159691)Termination phase: Saturation
% 2.03/0.87 % (2159691)Time elapsed: 0.065 s
% 2.03/0.87 % (2159691)Peak memory usage: 11 MB
% 2.03/0.87 % (2159691)Instructions burned: 104 (million)
% 2.03/0.87 % TRYING [4]
% 2.03/0.87 % (2159692)Instruction limit reached!
% 2.03/0.87 % (2159692)------------------------------
% 2.03/0.87 % (2159692)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.03/0.87 % (2159692)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.03/0.87 % (2159692)CaDiCaL version: 2.1.3
% 2.03/0.87 % (2159692)Termination reason: Instruction limit
% 2.03/0.87 % (2159692)Termination phase: Saturation
% 2.03/0.87 % (2159692)Time elapsed: 0.071 s
% 2.03/0.87 % (2159692)Peak memory usage: 11 MB
% 2.03/0.87 % (2159692)Instructions burned: 116 (million)
% 2.03/0.87 % (2159693)Instruction limit reached!
% 2.03/0.87 % (2159693)------------------------------
% 2.03/0.87 % (2159693)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.03/0.87 % (2159693)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.03/0.87 % (2159693)CaDiCaL version: 2.1.3
% 2.03/0.87 % (2159693)Termination reason: Instruction limit
% 2.03/0.87 % (2159693)Termination phase: Saturation
% 2.03/0.87 % (2159693)Time elapsed: 0.082 s
% 2.03/0.87 % (2159693)Peak memory usage: 13 MB
% 2.03/0.87 % (2159693)Instructions burned: 132 (million)
% 2.03/0.87 % (2159730)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=629400625:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.03/0.87 % (2159735)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=4214176398:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.03/0.87 % (2159739)ott-21_1_sil=16000:fs=off:random_seed=3905635473:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.03/0.87 % TRYING [5]
% 2.03/0.87 % TRYING [5]
% 2.03/0.87 % (2159730)Instruction limit reached!
% 2.03/0.87 % (2159730)------------------------------
% 2.03/0.87 % (2159730)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.03/0.87 % (2159730)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.03/0.87 % (2159730)CaDiCaL version: 2.1.3
% 2.03/0.87 % (2159730)Termination reason: Instruction limit
% 2.03/0.87 % (2159730)Termination phase: Saturation
% 2.03/0.87 % (2159730)Time elapsed: 0.081 s
% 2.03/0.87 % (2159730)Peak memory usage: 12 MB
% 2.03/0.87 % (2159730)Instructions burned: 132 (million)
% 2.03/0.87 % (2159772)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=176166506:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.03/0.87 % (2159739)Instruction limit reached!
% 2.03/0.87 % (2159739)------------------------------
% 2.03/0.87 % (2159739)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.03/0.87 % (2159739)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.03/0.87 % (2159739)CaDiCaL version: 2.1.3
% 2.03/0.87 % (2159739)Termination reason: Instruction limit
% 2.03/0.87 % (2159739)Termination phase: Saturation
% 2.03/0.87 % (2159739)Time elapsed: 0.099 s
% 2.03/0.87 % (2159739)Peak memory usage: 12 MB
% 2.03/0.87 % (2159739)Instructions burned: 180 (million)
% 2.03/0.87 % (2159782)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=4201062339:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.03/0.87 % TRYING [1]
% 2.03/0.87 % TRYING [2]
% 2.03/0.87 % TRYING [3]
% 2.03/0.87 % TRYING [4]
% 2.03/0.87 % (2159720)Instruction limit reached!
% 2.03/0.87 % (2159720)------------------------------
% 2.03/0.87 % (2159720)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.03/0.87 % (2159720)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.03/0.87 % (2159720)CaDiCaL version: 2.1.3
% 2.03/0.87 % (2159720)Termination reason: Instruction limit
% 2.03/0.87 % (2159720)Termination phase: Finite model building SAT solving
% 2.03/0.87 % (2159720)Time elapsed: 0.229 s
% 2.03/0.87 % (2159720)Peak memory usage: 16 MB
% 2.03/0.87 % (2159720)Instructions burned: 715 (million)
% 2.03/0.87 % (2159800)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3799225933:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 2.03/0.87 % TRYING [5]
% 2.03/0.87 % (2159800) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2159679-2159800"...
% 2.03/0.87 % (2159800)...printing done.
% 2.03/0.87 % (2159800)Refutation found. Thanks to Tanya!
% 2.03/0.87 % SZS status Unsatisfiable for theBenchmark
% 2.03/0.87 % SZS output start Proof for theBenchmark
% See solution above
% 2.03/0.87 % (2159800)------------------------------
% 2.03/0.87 % (2159800)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.03/0.87 % (2159800)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.03/0.87 % (2159800)CaDiCaL version: 2.1.3
% 2.03/0.87 % (2159800)Termination reason: Refutation
% 2.03/0.87 % (2159800)Time elapsed: 0.107 s
% 2.03/0.87 % (2159800)Peak memory usage: 15 MB
% 2.03/0.87 % (2159800)Instructions burned: 324 (million)
% 2.03/0.87 % (2159679)Success in time 0.452 s
% 2.03/0.87 % Vampire exiting
%------------------------------------------------------------------------------