%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL405-1 : 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 : n005.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:34 AM UTC 2026
% Result : Unsatisfiable 2.80s 1.01s
% Output : Refutation 2.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 5
% Syntax : Number of formulae : 59 ( 15 unt; 0 def)
% Number of atoms : 118 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 121 ( 62 ~; 59 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 151 ( 151 !; 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(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_1) ).
fof(f3,axiom,
! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).
fof(f5,negated_conjecture,
~ is_a_theorem(not(implies(implies(x,x),not(implies(y,y))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_71) ).
fof(f7,plain,
! [X0,X1] :
( is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f1,f4]) ).
fof(f23,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f2,f1]) ).
fof(f24,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f23,f1]) ).
fof(f25,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f24,f3]) ).
fof(f27,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(implies(X0,implies(X3,X2)))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f24,f23]) ).
fof(f28,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(not(X1),X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f24,f4]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,not(X1)))
| is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f24,f7]) ).
fof(f30,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(implies(not(X1),X0)) ),
inference(resolution,[],[f25,f23]) ).
fof(f31,plain,
! [X0] : is_a_theorem(implies(implies(not(implies(not(X0),X0)),implies(not(X0),X0)),X0)),
inference(resolution,[],[f25,f3]) ).
fof(f32,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f25,f4]) ).
fof(f39,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X2,implies(not(X1),X3))) ),
inference(resolution,[],[f28,f24]) ).
fof(f40,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(not(X1),X2)) ),
inference(resolution,[],[f28,f1]) ).
fof(f41,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(not(X0)),not(X0)),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f29,f3]) ).
fof(f45,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(implies(X1,X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f30,f1]) ).
fof(f52,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(not(implies(not(X0),X1)),X2))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f40,f4]) ).
fof(f87,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(X2)
| ~ is_a_theorem(implies(not(X2),X0)) ),
inference(resolution,[],[f45,f28]) ).
fof(f175,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),not(X1)))
| is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f87,f41]) ).
fof(f192,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(not(X0),X0),implies(not(X1),X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f39,f3]) ).
fof(f207,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X0),X0),X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f192,f25]) ).
fof(f220,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(resolution,[],[f207,f1]) ).
fof(f226,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(X2)
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f220,f52]) ).
fof(f232,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(not(X2),X1)))
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f226,f2]) ).
fof(f244,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X1,X0),X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f232,f25]) ).
fof(f257,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,implies(X2,X0)))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f244,f24]) ).
fof(f272,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f257,f4]) ).
fof(f298,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X0))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f272,f25]) ).
fof(f334,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(X1)
| is_a_theorem(implies(X0,implies(not(X1),X2))) ),
inference(resolution,[],[f298,f52]) ).
fof(f367,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(implies(not(X1),X3),X2)))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f27,f4]) ).
fof(f390,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(X0,implies(not(implies(X1,X2)),X3)))
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f334,f272]) ).
fof(f646,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X1,implies(X2,X0)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f390,f25]) ).
fof(f663,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X1,X0),X2))
| ~ is_a_theorem(X0)
| is_a_theorem(X2) ),
inference(resolution,[],[f646,f220]) ).
fof(f698,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X2,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f663,f2]) ).
fof(f722,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f698,f25]) ).
fof(f908,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f24,f722]) ).
fof(f2247,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X0,X2)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f908,f2]) ).
fof(f5216,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,not(X1)),implies(X1,implies(X0,X2)))),
inference(resolution,[],[f367,f2]) ).
fof(f5274,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X1),X3),X2))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f367,f272]) ).
fof(f5352,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,not(not(implies(X0,X1)))),implies(X0,X1))),
inference(resolution,[],[f5216,f25]) ).
fof(f5528,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,not(not(implies(X0,X1)))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f5352,f908]) ).
fof(f5890,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,implies(not(X1),X3))))),
inference(resolution,[],[f5274,f5216]) ).
fof(f5933,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(X1,implies(not(X0),X2))),X3))
| is_a_theorem(X3) ),
inference(resolution,[],[f5890,f220]) ).
fof(f6167,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,implies(not(X1),X2)),X3),implies(X1,X3))),
inference(resolution,[],[f5933,f2]) ).
fof(f6499,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(not(X1),X2)),X3))
| is_a_theorem(implies(X1,X3)) ),
inference(resolution,[],[f6167,f1]) ).
fof(f6800,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(not(X0),X1),X2),implies(X3,X2)))),
inference(resolution,[],[f6499,f2]) ).
fof(f7240,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X3),X2))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f6800,f908]) ).
fof(f10400,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),X0),implies(X1,X0))),
inference(resolution,[],[f7240,f31]) ).
fof(f10548,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1)))),
inference(resolution,[],[f10400,f5274]) ).
fof(f10645,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(X1,X0)),X2))
| is_a_theorem(X2) ),
inference(resolution,[],[f10548,f220]) ).
fof(f10985,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X2,X0),X1))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f10645,f2247]) ).
fof(f11230,plain,
! [X0,X1] :
( is_a_theorem(implies(not(not(implies(X0,X1))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f10985,f5528]) ).
fof(f11568,plain,
! [X0,X1] :
( is_a_theorem(not(implies(X0,not(X1))))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f11230,f175]) ).
fof(f11984,plain,
( ~ is_a_theorem(implies(x,x))
| ~ is_a_theorem(implies(y,y)) ),
inference(resolution,[],[f11568,f5]) ).
fof(f12014,plain,
~ is_a_theorem(implies(x,x)),
inference(forward_subsumption_resolution,[],[f11984,f32]) ).
fof(f12015,plain,
$false,
inference(forward_subsumption_resolution,[],[f12014,f32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL405-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n005.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 15:40:17 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.15/0.43 Running first-order model finding
% 0.15/0.43 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.80/1.01 % (4157380)Will run a generic schedule for satisfiability detection.
% 2.80/1.01 % (4157390)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4105581458:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.80/1.01 % (4157385)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2517888563_2999 on theBenchmark for (2999ds/0Mi)
% 2.80/1.01 % (4157389)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4130663744:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.80/1.01 % (4157391)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3954490032:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.80/1.01 % (4157387)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=601138333:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.80/1.01 % (4157388)dis+10_1_sil=32000:sp=arity:random_seed=2102003911:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.80/1.01 % TRYING [1]
% 2.80/1.01 % TRYING [2]
% 2.80/1.01 % TRYING [3]
% 2.80/1.01 % TRYING [4]
% 2.80/1.01 % (4157386)% WARNING: option uhcvi not known.
% 2.80/1.01 % (4157386)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2335428041:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.80/1.01 % (4157390)Instruction limit reached!
% 2.80/1.01 % (4157390)------------------------------
% 2.80/1.01 % (4157390)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/1.01 % (4157390)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.01 % (4157390)CaDiCaL version: 2.1.3
% 2.80/1.01 % (4157390)Termination reason: Instruction limit
% 2.80/1.01 % (4157390)Termination phase: Saturation
% 2.80/1.01 % (4157390)Time elapsed: 0.070 s
% 2.80/1.01 % (4157390)Peak memory usage: 13 MB
% 2.80/1.01 % (4157390)Instructions burned: 131 (million)
% 2.80/1.01 % (4157399)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=972659656:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 2.80/1.01 % TRYING [1]
% 2.80/1.01 % TRYING [2]
% 2.80/1.01 % TRYING [3]
% 2.80/1.01 % TRYING [4]
% 2.80/1.01 % (4157388)Instruction limit reached!
% 2.80/1.01 % (4157388)------------------------------
% 2.80/1.01 % (4157388)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/1.01 % (4157388)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.01 % (4157388)CaDiCaL version: 2.1.3
% 2.80/1.01 % (4157388)Termination reason: Instruction limit
% 2.80/1.01 % (4157388)Termination phase: Saturation
% 2.80/1.01 % (4157388)Time elapsed: 0.103 s
% 2.80/1.01 % (4157388)Peak memory usage: 11 MB
% 2.80/1.01 % (4157388)Instructions burned: 104 (million)
% 2.80/1.01 % (4157389)Instruction limit reached!
% 2.80/1.01 % (4157389)------------------------------
% 2.80/1.01 % (4157389)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/1.01 % (4157389)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.01 % (4157389)CaDiCaL version: 2.1.3
% 2.80/1.01 % (4157389)Termination reason: Instruction limit
% 2.80/1.01 % (4157389)Termination phase: Saturation
% 2.80/1.01 % (4157389)Time elapsed: 0.110 s
% 2.80/1.01 % (4157389)Peak memory usage: 11 MB
% 2.80/1.01 % (4157389)Instructions burned: 116 (million)
% 2.80/1.01 % (4157401)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3804146758:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.80/1.01 % TRYING [5]
% 2.80/1.01 % (4157391)Instruction limit reached!
% 2.80/1.01 % (4157391)------------------------------
% 2.80/1.01 % (4157391)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/1.01 % (4157391)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.01 % (4157391)CaDiCaL version: 2.1.3
% 2.80/1.01 % (4157391)Termination reason: Instruction limit
% 2.80/1.01 % (4157391)Termination phase: Saturation
% 2.80/1.01 % (4157391)Time elapsed: 0.152 s
% 2.80/1.01 % (4157391)Peak memory usage: 12 MB
% 2.80/1.01 % (4157391)Instructions burned: 159 (million)
% 2.80/1.01 % (4157402)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=821980054:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.80/1.01 % TRYING [5]
% 2.80/1.01 % (4157404)ott-21_1_sil=16000:fs=off:random_seed=3727192054:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.80/1.01 % (4157401)Instruction limit reached!
% 2.80/1.01 % (4157401)------------------------------
% 2.80/1.01 % (4157401)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/1.01 % (4157401)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.01 % (4157401)CaDiCaL version: 2.1.3
% 2.80/1.01 % (4157401)Termination reason: Instruction limit
% 2.80/1.01 % (4157401)Termination phase: Saturation
% 2.80/1.01 % (4157401)Time elapsed: 0.133 s
% 2.80/1.01 % (4157401)Peak memory usage: 12 MB
% 2.80/1.01 % (4157401)Instructions burned: 131 (million)
% 2.80/1.01 % (4157407)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1075353285:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 2.80/1.01 % (4157404)Instruction limit reached!
% 2.80/1.01 % (4157404)------------------------------
% 2.80/1.01 % (4157404)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/1.01 % (4157404)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.01 % (4157404)CaDiCaL version: 2.1.3
% 2.80/1.01 % (4157404)Termination reason: Instruction limit
% 2.80/1.01 % (4157404)Termination phase: Saturation
% 2.80/1.01 % (4157404)Time elapsed: 0.159 s
% 2.80/1.01 % (4157404)Peak memory usage: 12 MB
% 2.80/1.01 % (4157404)Instructions burned: 181 (million)
% 2.80/1.01 % (4157399)Instruction limit reached!
% 2.80/1.01 % (4157399)------------------------------
% 2.80/1.01 % (4157399)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/1.01 % (4157399)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.01 % (4157399)CaDiCaL version: 2.1.3
% 2.80/1.01 % (4157399)Termination reason: Instruction limit
% 2.80/1.01 % (4157399)Termination phase: Finite model building SAT solving
% 2.80/1.01 % (4157399)Time elapsed: 0.323 s
% 2.80/1.01 % (4157399)Peak memory usage: 13 MB
% 2.80/1.01 % (4157399)Instructions burned: 714 (million)
% 2.80/1.01 % (4157409)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=432299940:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 2.80/1.01 % TRYING [1]
% 2.80/1.01 % TRYING [2]
% 2.80/1.01 % TRYING [3]
% 2.80/1.01 % TRYING [4]
% 2.80/1.01 % (4157410)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2223605242:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 2.80/1.01 % TRYING [5]
% 2.80/1.01 % (4157402) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4157380-4157402"...
% 2.80/1.01 % (4157402)...printing done.
% 2.80/1.01 % (4157402)Refutation found. Thanks to Tanya!
% 2.80/1.01 % SZS status Unsatisfiable for theBenchmark
% 2.80/1.01 % SZS output start Proof for theBenchmark
% See solution above
% 2.80/1.01 % (4157402)------------------------------
% 2.80/1.01 % (4157402)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/1.01 % (4157402)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.01 % (4157402)CaDiCaL version: 2.1.3
% 2.80/1.01 % (4157402)Termination reason: Refutation
% 2.80/1.01 % (4157402)Time elapsed: 0.346 s
% 2.80/1.01 % (4157402)Peak memory usage: 14 MB
% 2.80/1.01 % (4157402)Instructions burned: 337 (million)
% 2.80/1.01 % (4157380)Success in time 0.565 s
% 2.80/1.01 % Vampire exiting
%------------------------------------------------------------------------------