%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL266-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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:58:14 AM UTC 2026
% Result : Unsatisfiable 5.25s 1.35s
% Output : Refutation 5.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 72 ( 40 unt; 2 def)
% Number of atoms : 110 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 77 ( 39 ~; 36 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 12 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 102 ( 0 sgn 102 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(equivalent(and(p,implies(q,r)),and(p,implies(not(r),not(q))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f12,plain,
! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
inference(definition_unfolding,[],[f10,f9,f6,f6]) ).
fof(f13,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f14,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f15,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f16,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f17,plain,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f5,f6,f6,f6]) ).
fof(f18,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f19,plain,
~ theorem(not(or(not(or(not(not(or(not(p),not(or(not(q),r))))),not(or(not(p),not(or(not(not(r)),not(q))))))),not(or(not(not(or(not(p),not(or(not(not(r)),not(q)))))),not(or(not(p),not(or(not(q),r))))))))),
inference(definition_unfolding,[],[f11,f12,f9,f6,f9,f6]) ).
fof(f20,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f13,f7]) ).
fof(f21,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f22,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f23,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f18,f20]) ).
fof(f27,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f22,f18]) ).
fof(f66,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f16,f7]) ).
fof(f67,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f66,f18]) ).
fof(f71,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f67,f21]) ).
fof(f72,plain,
! [X0,X1] : theorem(or(X0,or(not(or(X1,X0)),X1))),
inference(resolution,[],[f67,f22]) ).
fof(f76,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f71,f23]) ).
fof(f111,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[],[f27,f76]) ).
fof(f136,plain,
! [X0,X1] :
( theorem(or(not(or(X0,not(X1))),X0))
| ~ theorem(X1) ),
inference(resolution,[],[f72,f18]) ).
fof(f144,plain,
! [X0,X1] :
( ~ theorem(or(X1,not(X0)))
| theorem(X1)
| ~ theorem(X0) ),
inference(resolution,[],[f136,f18]) ).
fof(f151,plain,
! [X0,X1] :
( theorem(not(or(not(X0),not(X1))))
| ~ theorem(X0)
| ~ theorem(X1) ),
inference(resolution,[],[f144,f136]) ).
fof(f260,plain,
( ~ theorem(or(not(not(or(not(p),not(or(not(q),r))))),not(or(not(p),not(or(not(not(r)),not(q)))))))
| ~ theorem(or(not(not(or(not(p),not(or(not(not(r)),not(q)))))),not(or(not(p),not(or(not(q),r)))))) ),
inference(resolution,[],[f151,f19]) ).
fof(f263,definition,
( spl0_5
<=> theorem(or(not(not(or(not(p),not(or(not(not(r)),not(q)))))),not(or(not(p),not(or(not(q),r)))))) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f265,plain,
( ~ theorem(or(not(not(or(not(p),not(or(not(not(r)),not(q)))))),not(or(not(p),not(or(not(q),r))))))
| spl0_5 ),
inference(avatar_component_clause,[],[f263]) ).
fof(f267,definition,
( spl0_6
<=> theorem(or(not(not(or(not(p),not(or(not(q),r))))),not(or(not(p),not(or(not(not(r)),not(q))))))) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f269,plain,
( ~ theorem(or(not(not(or(not(p),not(or(not(q),r))))),not(or(not(p),not(or(not(not(r)),not(q)))))))
| spl0_6 ),
inference(avatar_component_clause,[],[f267]) ).
fof(f270,plain,
( ~ spl0_5
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f260,f267,f263]) ).
fof(f385,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f17,f7]) ).
fof(f514,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f385,f18]) ).
fof(f515,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
inference(resolution,[],[f385,f67]) ).
fof(f516,plain,
! [X2,X0,X1] : theorem(or(or(not(or(X0,X1)),or(X0,X2)),not(or(not(X1),X2)))),
inference(resolution,[],[f385,f27]) ).
fof(f1026,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f514,f18]) ).
fof(f1629,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f1026,f22]) ).
fof(f1684,plain,
! [X0,X1] :
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f1026,f111]) ).
fof(f1777,plain,
! [X0,X1] :
( ~ theorem(not(X1))
| theorem(X0)
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f1684,f144]) ).
fof(f1780,plain,
! [X0] :
( ~ theorem(or(not(not(X0)),X0))
| theorem(not(not(X0))) ),
inference(resolution,[],[f1684,f23]) ).
fof(f1781,plain,
! [X0,X1] :
( theorem(or(not(not(X1)),X0))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f1684,f27]) ).
fof(f1861,plain,
( ~ theorem(or(not(or(not(p),not(or(not(q),r)))),or(not(p),not(or(not(not(r)),not(q))))))
| spl0_5 ),
inference(resolution,[],[f1781,f265]) ).
fof(f1880,plain,
( ~ theorem(or(not(not(or(not(q),r))),not(or(not(not(r)),not(q)))))
| spl0_5 ),
inference(resolution,[],[f1861,f514]) ).
fof(f1890,plain,
( ~ theorem(or(not(or(not(not(r)),not(q))),or(not(q),r)))
| spl0_5 ),
inference(resolution,[],[f1880,f1781]) ).
fof(f3973,plain,
! [X0,X1] : theorem(or(X0,or(X1,not(X1)))),
inference(resolution,[],[f1629,f71]) ).
fof(f4096,plain,
! [X2,X0,X1] : theorem(or(or(not(or(not(X0),X1)),or(X2,X1)),not(or(X2,X0)))),
inference(resolution,[],[f515,f27]) ).
fof(f4122,plain,
! [X0] : theorem(not(not(or(X0,not(X0))))),
inference(resolution,[],[f3973,f1780]) ).
fof(f4244,plain,
! [X0,X1] :
( ~ theorem(or(X0,not(or(X1,not(X1)))))
| theorem(X0) ),
inference(resolution,[],[f4122,f1777]) ).
fof(f5171,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X0,not(not(X1))))),
inference(resolution,[],[f4244,f516]) ).
fof(f8103,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(not(not(X1)),X0))),
inference(resolution,[],[f5171,f1629]) ).
fof(f9934,plain,
! [X0,X1] : theorem(or(not(or(not(not(X0)),X1)),or(X0,X1))),
inference(resolution,[],[f4096,f4244]) ).
fof(f10188,plain,
! [X0,X1] : theorem(or(not(or(not(not(X0)),X1)),or(X1,X0))),
inference(resolution,[],[f9934,f1629]) ).
fof(f22158,plain,
( $false
| spl0_5 ),
inference(resolution,[],[f10188,f1890]) ).
fof(f22179,plain,
spl0_5,
inference(avatar_contradiction_clause,[],[f22158]) ).
fof(f23077,plain,
( ~ theorem(or(not(or(not(p),not(or(not(not(r)),not(q))))),or(not(p),not(or(not(q),r)))))
| spl0_6 ),
inference(resolution,[],[f269,f1781]) ).
fof(f23090,plain,
( ~ theorem(or(not(not(or(not(not(r)),not(q)))),not(or(not(q),r))))
| spl0_6 ),
inference(resolution,[],[f23077,f514]) ).
fof(f23101,plain,
( ~ theorem(or(not(or(not(q),r)),or(not(not(r)),not(q))))
| spl0_6 ),
inference(resolution,[],[f23090,f1781]) ).
fof(f23107,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f23101,f8103]) ).
fof(f23108,plain,
spl0_6,
inference(avatar_contradiction_clause,[],[f23107]) ).
cnf(s12,plain,
( ~ spl0_5
| ~ spl0_6 ),
inference(sat_conversion,[],[f270]) ).
cnf(s296,plain,
spl0_5,
inference(sat_conversion,[],[f22179]) ).
cnf(s316,plain,
spl0_6,
inference(sat_conversion,[],[f23108]) ).
cnf(s317,plain,
$false,
inference(rat,[],[s12,s316,s296]) ).
fof(f23109,plain,
$false,
inference(avatar_sat_refutation,[],[s317]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL266-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.16/0.46 % Computer : n006.cluster.edu
% 0.16/0.46 % Model : x86_64 x86_64
% 0.16/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.46 % Memory : 8046.5625MB
% 0.16/0.46 % OS : Linux 6.8.0-71-generic
% 0.16/0.46 % CPULimit : 300
% 0.16/0.46 % WCLimit : 300
% 0.16/0.46 % DateTime : Sun Sep 27 15:31:55 UTC 2026
% 0.16/0.46 % CPUTime :
% 0.16/0.46 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.21/0.52 Running first-order model finding
% 0.21/0.52 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
% 5.25/1.35 % (3108090)Will run a generic schedule for satisfiability detection.
% 5.25/1.35 % (3108100)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1718792917:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 5.25/1.35 % (3108096)% WARNING: option uhcvi not known.
% 5.25/1.35 % (3108099)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1330421:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 5.25/1.35 % (3108096)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1369497413:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 5.25/1.35 % (3108097)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2613158434:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 5.25/1.35 % (3108095)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=475939699_2999 on theBenchmark for (2999ds/0Mi)
% 5.25/1.35 % (3108101)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1882879841:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 5.25/1.35 % TRYING [1]
% 5.25/1.35 % TRYING [2]
% 5.25/1.35 % TRYING [3]
% 5.25/1.35 % (3108098)dis+10_1_sil=32000:sp=arity:random_seed=2489235420:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 5.25/1.35 % TRYING [4]
% 5.25/1.35 % (3108100)Instruction limit reached!
% 5.25/1.35 % (3108100)------------------------------
% 5.25/1.35 % (3108100)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.25/1.35 % (3108100)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.25/1.35 % (3108100)CaDiCaL version: 2.1.3
% 5.25/1.35 % (3108100)Termination reason: Instruction limit
% 5.25/1.35 % (3108100)Termination phase: Saturation
% 5.25/1.35 % (3108100)Time elapsed: 0.070 s
% 5.25/1.35 % (3108100)Peak memory usage: 13 MB
% 5.25/1.35 % (3108100)Instructions burned: 133 (million)
% 5.25/1.35 % (3108099)Instruction limit reached!
% 5.25/1.35 % (3108099)------------------------------
% 5.25/1.35 % (3108099)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.25/1.35 % (3108099)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.25/1.35 % (3108099)CaDiCaL version: 2.1.3
% 5.25/1.35 % (3108099)Termination reason: Instruction limit
% 5.25/1.35 % (3108099)Termination phase: Saturation
% 5.25/1.35 % (3108099)Time elapsed: 0.090 s
% 5.25/1.35 % (3108099)Peak memory usage: 11 MB
% 5.25/1.35 % (3108099)Instructions burned: 116 (million)
% 5.25/1.35 % (3108109)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=241447701:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 5.25/1.35 % TRYING [1]
% 5.25/1.35 % TRYING [2]
% 5.25/1.35 % TRYING [3]
% 5.25/1.35 % (3108110)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1011984973:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 5.25/1.35 % (3108101)Instruction limit reached!
% 5.25/1.35 % (3108101)------------------------------
% 5.25/1.35 % (3108101)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.25/1.35 % (3108101)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.25/1.35 % (3108101)CaDiCaL version: 2.1.3
% 5.25/1.35 % (3108101)Termination reason: Instruction limit
% 5.25/1.35 % (3108101)Termination phase: Saturation
% 5.25/1.35 % (3108101)Time elapsed: 0.142 s
% 5.25/1.35 % (3108101)Peak memory usage: 12 MB
% 5.25/1.35 % (3108101)Instructions burned: 159 (million)
% 5.25/1.35 % (3108098)Instruction limit reached!
% 5.25/1.35 % (3108098)------------------------------
% 5.25/1.35 % (3108098)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.25/1.35 % (3108098)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.25/1.35 % (3108098)CaDiCaL version: 2.1.3
% 5.25/1.35 % (3108098)Termination reason: Instruction limit
% 5.25/1.35 % (3108098)Termination phase: Saturation
% 5.25/1.35 % (3108098)Time elapsed: 0.127 s
% 5.25/1.35 % (3108098)Peak memory usage: 12 MB
% 5.25/1.35 % (3108098)Instructions burned: 103 (million)
% 5.25/1.35 % TRYING [4]
% 5.25/1.35 % (3108113)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=2813555998:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 5.25/1.35 % (3108114)ott-21_1_sil=16000:fs=off:random_seed=719310500:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 5.25/1.35 % (3108110)Instruction limit reached!
% 5.25/1.35 % (3108110)------------------------------
% 5.25/1.35 % (3108110)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.25/1.35 % (3108110)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.25/1.35 % (3108110)CaDiCaL version: 2.1.3
% 5.25/1.35 % (3108110)Termination reason: Instruction limit
% 5.25/1.35 % (3108110)Termination phase: Saturation
% 5.25/1.35 % (3108110)Time elapsed: 0.128 s
% 5.25/1.35 % (3108110)Peak memory usage: 12 MB
% 5.25/1.35 % (3108110)Instructions burned: 132 (million)
% 5.25/1.35 % (3108117)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1959319954:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 5.25/1.35 % (3108114)Instruction limit reached!
% 5.25/1.35 % (3108114)------------------------------
% 5.25/1.35 % (3108114)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.25/1.35 % (3108114)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.25/1.35 % (3108114)CaDiCaL version: 2.1.3
% 5.25/1.35 % (3108114)Termination reason: Instruction limit
% 5.25/1.35 % (3108114)Termination phase: Saturation
% 5.25/1.35 % (3108114)Time elapsed: 0.153 s
% 5.25/1.35 % (3108114)Peak memory usage: 12 MB
% 5.25/1.35 % (3108114)Instructions burned: 180 (million)
% 5.25/1.35 % (3108119)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1291571599:fmbsr=1.3:i=865:ins=25_2996 on theBenchmark for (2996ds/865Mi)
% 5.25/1.35 % TRYING [1]
% 5.25/1.35 % TRYING [2]
% 5.25/1.35 % TRYING [3]
% 5.25/1.35 % TRYING [4]
% 5.25/1.35 % (3108109)Instruction limit reached!
% 5.25/1.35 % (3108109)------------------------------
% 5.25/1.35 % (3108109)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.25/1.35 % (3108109)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.25/1.35 % (3108109)CaDiCaL version: 2.1.3
% 5.25/1.35 % (3108109)Termination reason: Instruction limit
% 5.25/1.35 % (3108109)Termination phase: Finite model building SAT solving
% 5.25/1.35 % (3108109)Time elapsed: 0.371 s
% 5.25/1.35 % (3108109)Peak memory usage: 13 MB
% 5.25/1.35 % (3108109)Instructions burned: 716 (million)
% 5.25/1.35 % (3108121)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2319815993:i=1179_2994 on theBenchmark for (2994ds/1179Mi)
% 5.25/1.35 % TRYING [5]
% 5.25/1.35 % (3108113) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3108090-3108113"...
% 5.25/1.35 % (3108113)...printing done.
% 5.25/1.35 % (3108113)Refutation found. Thanks to Tanya!
% 5.25/1.35 % SZS status Unsatisfiable for theBenchmark
% 5.25/1.35 % SZS output start Proof for theBenchmark
% See solution above
% 5.25/1.36 % (3108113)------------------------------
% 5.25/1.36 % (3108113)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.25/1.36 % (3108113)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.25/1.36 % (3108113)CaDiCaL version: 2.1.3
% 5.25/1.36 % (3108113)Termination reason: Refutation
% 5.25/1.36 % (3108113)Time elapsed: 0.582 s
% 5.25/1.36 % (3108113)Peak memory usage: 16 MB
% 5.25/1.36 % (3108113)Instructions burned: 601 (million)
% 5.25/1.36 % (3108090)Success in time 0.822 s
% 5.25/1.36 % Vampire exiting
%------------------------------------------------------------------------------