%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL208-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:00 AM UTC 2026
% Result : Unsatisfiable 4.38s 1.12s
% Output : Refutation 4.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of formulae : 84 ( 56 unt; 6 def)
% Number of atoms : 116 ( 13 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 77 ( 45 ~; 32 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 95 ( 95 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
fof(f9,negated_conjecture,
~ theorem(implies(or(p,q),implies(not(p),q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f10,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f11,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f12,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f13,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f14,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(f15,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f16,plain,
~ theorem(or(not(or(p,q)),or(not(not(p)),q))),
inference(definition_unfolding,[],[f9,f6,f6]) ).
fof(f17,definition,
sF0 = or(p,q),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f18,plain,
or(p,q) = sF0,
inference(reorient_equations,[],[f17]) ).
fof(f19,definition,
sF1 = not(sF0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f20,plain,
not(sF0) = sF1,
inference(reorient_equations,[],[f19]) ).
fof(f21,definition,
sF2 = not(p),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f22,plain,
not(p) = sF2,
inference(reorient_equations,[],[f21]) ).
fof(f23,definition,
sF3 = not(sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f24,plain,
not(sF2) = sF3,
inference(reorient_equations,[],[f23]) ).
fof(f25,definition,
sF4 = or(sF3,q),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f26,plain,
or(sF3,q) = sF4,
inference(reorient_equations,[],[f25]) ).
fof(f27,definition,
sF5 = or(sF1,sF4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f28,plain,
or(sF1,sF4) = sF5,
inference(reorient_equations,[],[f27]) ).
fof(f29,plain,
~ theorem(sF5),
inference(definition_folding,[],[f16,f28,f26,f24,f22,f20,f18]) ).
fof(f30,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f10,f7]) ).
fof(f31,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f11,f7]) ).
fof(f34,plain,
! [X0] : axiom(or(sF3,or(X0,sF2))),
inference(superposition,[],[f11,f24]) ).
fof(f36,plain,
axiom(or(not(q),sF4)),
inference(superposition,[],[f11,f26]) ).
fof(f39,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f12,f7]) ).
fof(f42,plain,
axiom(or(not(sF5),or(sF4,sF1))),
inference(superposition,[],[f12,f28]) ).
fof(f45,plain,
axiom(or(not(or(sF4,sF1)),sF5)),
inference(superposition,[],[f12,f28]) ).
fof(f47,plain,
theorem(or(not(q),sF4)),
inference(resolution,[],[f36,f7]) ).
fof(f75,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f13,f7]) ).
fof(f80,plain,
! [X0] : axiom(or(not(or(sF3,or(X0,q))),or(X0,sF4))),
inference(superposition,[],[f13,f26]) ).
fof(f81,plain,
! [X0] : axiom(or(not(or(sF1,or(X0,sF4))),or(X0,sF5))),
inference(superposition,[],[f13,f28]) ).
fof(f82,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f14,f7]) ).
fof(f86,plain,
! [X0] : axiom(or(not(or(not(q),X0)),or(not(sF0),or(p,X0)))),
inference(superposition,[],[f14,f18]) ).
fof(f92,plain,
! [X0] : axiom(or(not(or(not(q),X0)),or(sF1,or(p,X0)))),
inference(forward_demodulation,[],[f86,f20]) ).
fof(f99,plain,
! [X0] : theorem(or(sF3,or(X0,sF2))),
inference(resolution,[],[f34,f7]) ).
fof(f104,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ),
inference(resolution,[],[f31,f15]) ).
fof(f112,plain,
theorem(or(not(sF5),or(sF4,sF1))),
inference(resolution,[],[f42,f7]) ).
fof(f120,plain,
theorem(or(not(or(sF4,sF1)),sF5)),
inference(resolution,[],[f45,f7]) ).
fof(f122,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f39,f15]) ).
fof(f149,plain,
! [X0] : theorem(or(not(or(sF3,or(X0,q))),or(X0,sF4))),
inference(resolution,[],[f80,f7]) ).
fof(f153,plain,
! [X0] : theorem(or(not(or(sF1,or(X0,sF4))),or(X0,sF5))),
inference(resolution,[],[f81,f7]) ).
fof(f155,plain,
( theorem(sF5)
| ~ theorem(or(sF4,sF1)) ),
inference(resolution,[],[f120,f15]) ).
fof(f156,plain,
~ theorem(or(sF4,sF1)),
inference(forward_subsumption_resolution,[],[f155,f29]) ).
fof(f157,plain,
! [X0] : theorem(or(not(or(not(q),X0)),or(sF1,or(p,X0)))),
inference(resolution,[],[f92,f7]) ).
fof(f160,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f75,f15]) ).
fof(f273,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f82,f15]) ).
fof(f357,plain,
! [X0] :
( ~ theorem(or(sF1,or(X0,sF4)))
| theorem(or(X0,sF5)) ),
inference(resolution,[],[f153,f15]) ).
fof(f370,plain,
! [X0] :
( ~ theorem(or(not(q),X0))
| theorem(or(sF1,or(p,X0))) ),
inference(resolution,[],[f157,f15]) ).
fof(f376,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f160,f104]) ).
fof(f383,plain,
! [X0,X1] : theorem(or(X0,or(not(or(or(X0,X1),or(X0,X1))),X1))),
inference(resolution,[],[f160,f30]) ).
fof(f389,plain,
! [X0] : theorem(or(X0,or(not(or(sF1,or(X0,sF4))),sF5))),
inference(resolution,[],[f160,f153]) ).
fof(f392,plain,
! [X0] : theorem(or(X0,or(not(or(sF3,or(X0,q))),sF4))),
inference(resolution,[],[f160,f149]) ).
fof(f542,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f273,f15]) ).
fof(f543,plain,
! [X2,X0,X1] :
( theorem(or(X2,or(not(or(X2,X0)),X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f273,f160]) ).
fof(f716,plain,
theorem(or(sF1,or(p,sF4))),
inference(resolution,[],[f370,f47]) ).
fof(f743,plain,
theorem(or(p,sF5)),
inference(resolution,[],[f716,f357]) ).
fof(f751,plain,
theorem(or(sF5,p)),
inference(resolution,[],[f743,f122]) ).
fof(f767,plain,
! [X0] :
( theorem(or(not(or(sF1,or(not(X0),sF4))),sF5))
| ~ theorem(X0) ),
inference(resolution,[],[f389,f15]) ).
fof(f970,plain,
! [X0,X1] :
( theorem(or(not(or(or(not(X0),X1),or(not(X0),X1))),X1))
| ~ theorem(X0) ),
inference(resolution,[],[f383,f15]) ).
fof(f1087,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f542,f39]) ).
fof(f1144,plain,
! [X0] :
( theorem(or(X0,or(sF4,sF1)))
| ~ theorem(or(X0,sF5)) ),
inference(resolution,[],[f542,f112]) ).
fof(f1156,plain,
! [X0,X1] :
( theorem(or(X0,or(not(or(sF3,or(not(X1),q))),sF4)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f542,f392]) ).
fof(f1250,plain,
! [X2,X0,X1] :
( theorem(or(or(not(or(X2,X0)),X1),X2))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f543,f122]) ).
fof(f2083,plain,
! [X0] :
( ~ theorem(or(not(X0),sF5))
| theorem(or(sF4,sF1))
| ~ theorem(X0) ),
inference(resolution,[],[f1144,f15]) ).
fof(f2100,plain,
! [X0] :
( ~ theorem(or(not(X0),sF5))
| ~ theorem(X0) ),
inference(forward_subsumption_resolution,[],[f2083,f156]) ).
fof(f4171,plain,
! [X0] : theorem(or(sF3,or(sF2,X0))),
inference(resolution,[],[f1087,f99]) ).
fof(f6041,plain,
! [X0] :
( ~ theorem(or(or(not(X0),sF5),or(not(X0),sF5)))
| ~ theorem(X0) ),
inference(resolution,[],[f970,f2100]) ).
fof(f7803,plain,
! [X0] :
( ~ theorem(or(or(not(X0),sF5),sF5))
| ~ theorem(X0) ),
inference(resolution,[],[f6041,f376]) ).
fof(f7848,plain,
! [X0] :
( ~ theorem(or(not(X0),sF5))
| ~ theorem(or(sF5,X0)) ),
inference(resolution,[],[f7803,f1250]) ).
fof(f8011,plain,
! [X0] :
( ~ theorem(or(sF5,or(sF1,or(not(X0),sF4))))
| ~ theorem(X0) ),
inference(resolution,[],[f7848,f767]) ).
fof(f9170,plain,
! [X0] :
( ~ theorem(or(sF5,or(not(X0),sF4)))
| ~ theorem(X0) ),
inference(resolution,[],[f8011,f376]) ).
fof(f9191,plain,
! [X0] :
( ~ theorem(or(sF3,or(not(X0),q)))
| ~ theorem(or(sF5,X0)) ),
inference(resolution,[],[f9170,f1156]) ).
fof(f9823,plain,
( ~ theorem(or(sF3,or(sF2,q)))
| ~ theorem(or(sF5,p)) ),
inference(superposition,[],[f9191,f22]) ).
fof(f9825,plain,
~ theorem(or(sF5,p)),
inference(forward_subsumption_resolution,[],[f9823,f4171]) ).
fof(f9829,plain,
$false,
inference(forward_subsumption_resolution,[],[f9825,f751]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL208-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.37 % Computer : n011.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 27 15:27:00 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.40 Running first-order model finding
% 0.12/0.40 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
% 4.38/1.12 % (2555207)Will run a generic schedule for satisfiability detection.
% 4.38/1.12 % (2555220)% WARNING: option uhcvi not known.
% 4.38/1.12 % (2555219)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3224102743_2999 on theBenchmark for (2999ds/0Mi)
% 4.38/1.12 % (2555221)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3407507459:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.38/1.12 % (2555223)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3213838177:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.38/1.12 % (2555224)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4131490911:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.38/1.12 % (2555220)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4248171564:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.38/1.12 % (2555222)dis+10_1_sil=32000:sp=arity:random_seed=3530884721:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.38/1.12 % (2555225)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3257668689:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.38/1.12 % TRYING [1]
% 4.38/1.12 % TRYING [2]
% 4.38/1.12 % TRYING [3]
% 4.38/1.12 % TRYING [4]
% 4.38/1.12 % (2555223)Instruction limit reached!
% 4.38/1.12 % (2555223)------------------------------
% 4.38/1.12 % (2555223)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.38/1.12 % (2555223)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/1.12 % (2555223)CaDiCaL version: 2.1.3
% 4.38/1.12 % (2555223)Termination reason: Instruction limit
% 4.38/1.12 % (2555223)Termination phase: Saturation
% 4.38/1.12 % (2555223)Time elapsed: 0.062 s
% 4.38/1.12 % (2555223)Peak memory usage: 11 MB
% 4.38/1.12 % (2555223)Instructions burned: 116 (million)
% 4.38/1.12 % (2555222)Instruction limit reached!
% 4.38/1.12 % (2555222)------------------------------
% 4.38/1.12 % (2555222)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.38/1.12 % (2555222)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/1.12 % (2555222)CaDiCaL version: 2.1.3
% 4.38/1.12 % (2555222)Termination reason: Instruction limit
% 4.38/1.12 % (2555222)Termination phase: Saturation
% 4.38/1.12 % (2555222)Time elapsed: 0.064 s
% 4.38/1.12 % (2555222)Peak memory usage: 12 MB
% 4.38/1.12 % (2555222)Instructions burned: 103 (million)
% 4.38/1.12 % (2555224)Instruction limit reached!
% 4.38/1.12 % (2555224)------------------------------
% 4.38/1.12 % (2555224)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.38/1.12 % (2555224)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/1.12 % (2555224)CaDiCaL version: 2.1.3
% 4.38/1.12 % (2555224)Termination reason: Instruction limit
% 4.38/1.12 % (2555224)Termination phase: Saturation
% 4.38/1.12 % (2555224)Time elapsed: 0.082 s
% 4.38/1.12 % (2555224)Peak memory usage: 13 MB
% 4.38/1.12 % (2555224)Instructions burned: 131 (million)
% 4.38/1.12 % (2555233)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=757416594:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 4.38/1.12 % (2555234)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2381791661:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 4.38/1.12 % TRYING [1]
% 4.38/1.12 % TRYING [2]
% 4.38/1.12 % TRYING [3]
% 4.38/1.12 % (2555225)Instruction limit reached!
% 4.38/1.12 % (2555225)------------------------------
% 4.38/1.12 % (2555225)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.38/1.12 % (2555225)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/1.12 % (2555225)CaDiCaL version: 2.1.3
% 4.38/1.12 % (2555225)Termination reason: Instruction limit
% 4.38/1.12 % (2555225)Termination phase: Saturation
% 4.38/1.12 % (2555225)Time elapsed: 0.088 s
% 4.38/1.12 % (2555225)Peak memory usage: 12 MB
% 4.38/1.12 % (2555225)Instructions burned: 160 (million)
% 4.38/1.12 % (2555237)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=2838099134:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 4.38/1.12 % TRYING [4]
% 4.38/1.12 % (2555238)ott-21_1_sil=16000:fs=off:random_seed=971714539:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 4.38/1.12 % TRYING [5]
% 4.38/1.12 % (2555234)Instruction limit reached!
% 4.38/1.12 % (2555234)------------------------------
% 4.38/1.12 % (2555234)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.38/1.12 % (2555234)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/1.12 % (2555234)CaDiCaL version: 2.1.3
% 4.38/1.12 % (2555234)Termination reason: Instruction limit
% 4.38/1.12 % (2555234)Termination phase: Saturation
% 4.38/1.12 % (2555234)Time elapsed: 0.079 s
% 4.38/1.12 % (2555234)Peak memory usage: 13 MB
% 4.38/1.12 % (2555234)Instructions burned: 131 (million)
% 4.38/1.12 % (2555241)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3583524732:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 4.38/1.12 % (2555238)Instruction limit reached!
% 4.38/1.12 % (2555238)------------------------------
% 4.38/1.12 % (2555238)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.38/1.12 % (2555238)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/1.12 % (2555238)CaDiCaL version: 2.1.3
% 4.38/1.12 % (2555238)Termination reason: Instruction limit
% 4.38/1.12 % (2555238)Termination phase: Saturation
% 4.38/1.12 % (2555238)Time elapsed: 0.091 s
% 4.38/1.12 % (2555238)Peak memory usage: 12 MB
% 4.38/1.12 % (2555238)Instructions burned: 181 (million)
% 4.38/1.12 % (2555243)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2338746017:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 4.38/1.12 % TRYING [1]
% 4.38/1.12 % TRYING [2]
% 4.38/1.12 % TRYING [3]
% 4.38/1.12 % TRYING [4]
% 4.38/1.12 % TRYING [5]
% 4.38/1.12 % TRYING [5]
% 4.38/1.12 % TRYING [6]
% 4.38/1.12 % (2555243)Instruction limit reached!
% 4.38/1.12 % (2555243)------------------------------
% 4.38/1.12 % (2555243)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.38/1.12 % (2555243)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/1.12 % (2555243)CaDiCaL version: 2.1.3
% 4.38/1.12 % (2555243)Termination reason: Instruction limit
% 4.38/1.12 % (2555243)Termination phase: Finite model building SAT solving
% 4.38/1.12 % (2555243)Time elapsed: 0.250 s
% 4.38/1.12 % (2555243)Peak memory usage: 16 MB
% 4.38/1.12 % (2555243)Instructions burned: 866 (million)
% 4.38/1.12 % (2555254)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1174457217:i=1179_2994 on theBenchmark for (2994ds/1179Mi)
% 4.38/1.12 % (2555241)Instruction limit reached!
% 4.38/1.12 % (2555241)------------------------------
% 4.38/1.12 % (2555241)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.38/1.12 % (2555241)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/1.12 % (2555241)CaDiCaL version: 2.1.3
% 4.38/1.12 % (2555241)Termination reason: Instruction limit
% 4.38/1.12 % (2555241)Termination phase: Saturation
% 4.38/1.12 % (2555241)Time elapsed: 0.372 s
% 4.38/1.12 % (2555241)Peak memory usage: 12 MB
% 4.38/1.12 % (2555241)Instructions burned: 477 (million)
% 4.38/1.12 % (2555237)Instruction limit reached!
% 4.38/1.12 % (2555237)------------------------------
% 4.38/1.12 % (2555237)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.38/1.12 % (2555237)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/1.12 % (2555237)CaDiCaL version: 2.1.3
% 4.38/1.12 % (2555237)Termination reason: Instruction limit
% 4.38/1.12 % (2555237)Termination phase: Saturation
% 4.38/1.12 % (2555237)Time elapsed: 0.472 s
% 4.38/1.12 % (2555237)Peak memory usage: 16 MB
% 4.38/1.12 % (2555237)Instructions burned: 684 (million)
% 4.38/1.12 % (2555261)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1859115192:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 4.38/1.12 % (2555263)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=4133301928: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.38/1.12 % (2555254) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2555207-2555254"...
% 4.38/1.12 % (2555254)...printing done.
% 4.38/1.12 % (2555254)Refutation found. Thanks to Tanya!
% 4.38/1.12 % SZS status Unsatisfiable for theBenchmark
% 4.38/1.12 % SZS output start Proof for theBenchmark
% See solution above
% 4.38/1.13 % (2555254)------------------------------
% 4.38/1.13 % (2555254)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.38/1.13 % (2555254)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/1.13 % (2555254)CaDiCaL version: 2.1.3
% 4.38/1.13 % (2555254)Termination reason: Refutation
% 4.38/1.13 % (2555254)Time elapsed: 0.182 s
% 4.38/1.13 % (2555254)Peak memory usage: 16 MB
% 4.38/1.13 % (2555254)Instructions burned: 440 (million)
% 4.38/1.13 % (2555207)Success in time 0.712 s
% 4.38/1.13 % Vampire exiting
%------------------------------------------------------------------------------