%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL400-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 : 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:33 AM UTC 2026
% Result : Unsatisfiable 4.70s 1.20s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 7
% Syntax : Number of formulae : 80 ( 23 unt; 2 def)
% Number of atoms : 147 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 137 ( 70 ~; 65 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 180 ( 0 sgn 180 !; 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(implies(not(implies(x,y)),x)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_66) ).
fof(f6,plain,
! [X0] :
( ~ is_a_theorem(implies(not(X0),X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f1,f3]) ).
fof(f27,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(f28,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f27,f1]) ).
fof(f29,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f28,f3]) ).
fof(f30,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(X0,implies(implies(X2,X3),implies(X1,X3))))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f28,f2]) ).
fof(f31,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,[],[f28,f27]) ).
fof(f32,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(not(X1),X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f28,f4]) ).
fof(f34,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(implies(not(X1),X0)) ),
inference(resolution,[],[f29,f27]) ).
fof(f35,plain,
! [X0] : is_a_theorem(implies(implies(not(implies(not(X0),X0)),implies(not(X0),X0)),X0)),
inference(resolution,[],[f29,f3]) ).
fof(f41,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(implies(not(X0),X1)),X0))
| is_a_theorem(implies(not(X0),X1)) ),
inference(resolution,[],[f32,f6]) ).
fof(f43,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,[],[f32,f28]) ).
fof(f44,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(not(X1),X2)) ),
inference(resolution,[],[f32,f1]) ).
fof(f56,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(not(implies(not(X0),X1)),X2))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f44,f4]) ).
fof(f201,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(not(implies(implies(X0,X1),implies(X2,X1))),implies(X2,X0)))
| is_a_theorem(implies(implies(X0,X1),implies(X2,X1))) ),
inference(resolution,[],[f30,f6]) ).
fof(f210,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(not(X0),X0),implies(not(X1),X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f43,f3]) ).
fof(f226,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X0),X0),X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f210,f29]) ).
fof(f239,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(resolution,[],[f226,f1]) ).
fof(f245,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(X2)
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f239,f56]) ).
fof(f252,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(not(X2),X1)))
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f245,f2]) ).
fof(f265,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X1,X0),X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f252,f29]) ).
fof(f278,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,implies(X2,X0)))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f265,f28]) ).
fof(f293,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f278,f4]) ).
fof(f305,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X0))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f293,f29]) ).
fof(f332,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(X1)
| is_a_theorem(implies(X0,implies(not(X1),X2))) ),
inference(resolution,[],[f305,f56]) ).
fof(f374,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(not(implies(X1,implies(not(X1),X2))),X3))),
inference(resolution,[],[f332,f4]) ).
fof(f378,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(X0,implies(not(implies(X1,X2)),X3)))
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f332,f293]) ).
fof(f407,definition,
( spl0_8
<=> ! [X2] : ~ is_a_theorem(X2) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f408,plain,
( ! [X2] : ~ is_a_theorem(X2)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f407]) ).
fof(f422,plain,
( $false
| ~ spl0_8 ),
inference(resolution,[],[f408,f3]) ).
fof(f433,plain,
~ spl0_8,
inference(avatar_contradiction_clause,[],[f422]) ).
fof(f637,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X1,implies(X2,X0)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f378,f29]) ).
fof(f667,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X1,X0),X2))
| ~ is_a_theorem(X0)
| is_a_theorem(X2) ),
inference(resolution,[],[f637,f239]) ).
fof(f697,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X2,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f667,f2]) ).
fof(f714,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f697,f29]) ).
fof(f1112,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f28,f714]) ).
fof(f1335,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(not(X1),X2)))),
inference(resolution,[],[f374,f29]) ).
fof(f1381,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(not(X0),X1)),X2))
| is_a_theorem(X2) ),
inference(resolution,[],[f1335,f239]) ).
fof(f1424,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(not(X0),X1),X2),implies(X0,X2))),
inference(resolution,[],[f1381,f2]) ).
fof(f1468,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f1424,f1]) ).
fof(f1506,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X1),not(X0)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f1468,f34]) ).
fof(f1513,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,not(X0)))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f1468,f27]) ).
fof(f2165,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,[],[f31,f4]) ).
fof(f3627,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,not(X1)),implies(X1,implies(X0,X2)))),
inference(resolution,[],[f2165,f2]) ).
fof(f3677,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X1),X3),X2))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f2165,f293]) ).
fof(f3737,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,not(not(implies(X0,X1)))),implies(X0,X1))),
inference(resolution,[],[f3627,f29]) ).
fof(f3874,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,not(not(implies(X0,X1)))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f3737,f1112]) ).
fof(f5663,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,implies(not(X1),X3))))),
inference(resolution,[],[f3677,f3627]) ).
fof(f5745,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(X1,implies(not(X0),X2))),X3))
| is_a_theorem(X3) ),
inference(resolution,[],[f5663,f239]) ).
fof(f6028,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,implies(not(X1),X2)),X3),implies(X1,X3))),
inference(resolution,[],[f5745,f2]) ).
fof(f6588,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(not(X1),X2)),X3))
| is_a_theorem(implies(X1,X3)) ),
inference(resolution,[],[f6028,f1]) ).
fof(f7066,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(not(X0),X1),X2),implies(X3,X2)))),
inference(resolution,[],[f6588,f2]) ).
fof(f7724,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X3),X2))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f7066,f1112]) ).
fof(f11680,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),X0),implies(X1,X0))),
inference(resolution,[],[f7724,f35]) ).
fof(f11841,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1)))),
inference(resolution,[],[f11680,f3677]) ).
fof(f12003,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))),
inference(resolution,[],[f11841,f201]) ).
fof(f12495,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f12003,f1]) ).
fof(f13107,plain,
! [X0,X1] :
( is_a_theorem(implies(not(not(implies(X0,X1))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f12495,f3874]) ).
fof(f13370,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,not(implies(X0,not(X1)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f13107,f1506]) ).
fof(f13810,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,not(not(X1))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f13370,f1506]) ).
fof(f14060,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(not(not(X1)),X1)) ),
inference(resolution,[],[f13810,f12495]) ).
fof(f14119,definition,
( spl0_336
<=> ! [X1] : is_a_theorem(implies(not(not(X1)),X1)) ),
introduced(definition,[new_symbols(definition,[spl0_336])],[avatar_definition]) ).
fof(f14120,plain,
( ! [X1] : is_a_theorem(implies(not(not(X1)),X1))
| ~ spl0_336 ),
inference(avatar_component_clause,[],[f14119]) ).
fof(f14121,plain,
( spl0_336
| spl0_8 ),
inference(avatar_split_clause,[],[f14060,f407,f14119]) ).
fof(f14132,plain,
( ! [X0] : is_a_theorem(implies(X0,not(not(X0))))
| ~ spl0_336 ),
inference(resolution,[],[f14120,f1506]) ).
fof(f14220,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,not(not(implies(X1,X0)))))
| ~ spl0_336 ),
inference(resolution,[],[f14132,f12495]) ).
fof(f14821,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(not(implies(X0,X1)),implies(X1,X2)))
| ~ spl0_336 ),
inference(resolution,[],[f14220,f1513]) ).
fof(f16127,plain,
( ! [X0,X1] : is_a_theorem(implies(not(implies(X0,X1)),X0))
| ~ spl0_336 ),
inference(resolution,[],[f14821,f41]) ).
fof(f16181,plain,
( $false
| ~ spl0_336 ),
inference(resolution,[],[f16127,f5]) ).
fof(f16221,plain,
~ spl0_336,
inference(avatar_contradiction_clause,[],[f16181]) ).
cnf(s20,plain,
~ spl0_8,
inference(sat_conversion,[],[f433]) ).
cnf(s589,plain,
( spl0_8
| spl0_336 ),
inference(sat_conversion,[],[f14121]) ).
cnf(s652,plain,
~ spl0_336,
inference(sat_conversion,[],[f16221]) ).
cnf(s653,plain,
spl0_8,
inference(rat,[],[s589,s652]) ).
cnf(s654,plain,
$false,
inference(rat,[],[s20,s653]) ).
fof(f16222,plain,
$false,
inference(avatar_sat_refutation,[],[s654]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL400-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.16/0.43 % Computer : n011.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Sun Sep 27 15:40:15 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.22/0.48 Running first-order model finding
% 0.22/0.49 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.70/1.20 % (2577186)Will run a generic schedule for satisfiability detection.
% 4.70/1.20 % (2577192)% WARNING: option uhcvi not known.
% 4.70/1.20 % (2577191)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2326299820_3000 on theBenchmark for (3000ds/0Mi)
% 4.70/1.20 % TRYING [1]
% 4.70/1.20 % TRYING [2]
% 4.70/1.20 % TRYING [3]
% 4.70/1.20 % (2577192)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2626324354:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 4.70/1.20 % TRYING [4]
% 4.70/1.20 % (2577195)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=792451041:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 4.70/1.20 % (2577193)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=636586016:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 4.70/1.20 % (2577194)dis+10_1_sil=32000:sp=arity:random_seed=2674732889:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 4.70/1.20 % (2577196)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=616046567:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 4.70/1.20 % (2577197)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=802619260:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 4.70/1.20 % TRYING [5]
% 4.70/1.20 % (2577194)Instruction limit reached!
% 4.70/1.20 % (2577194)------------------------------
% 4.70/1.20 % (2577194)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.70/1.20 % (2577194)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.70/1.20 % (2577194)CaDiCaL version: 2.1.3
% 4.70/1.20 % (2577194)Termination reason: Instruction limit
% 4.70/1.20 % (2577194)Termination phase: Saturation
% 4.70/1.20 % (2577194)Time elapsed: 0.091 s
% 4.70/1.20 % (2577194)Peak memory usage: 11 MB
% 4.70/1.20 % (2577194)Instructions burned: 104 (million)
% 4.70/1.20 % (2577195)Instruction limit reached!
% 4.70/1.20 % (2577195)------------------------------
% 4.70/1.20 % (2577195)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.70/1.20 % (2577195)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.70/1.20 % (2577195)CaDiCaL version: 2.1.3
% 4.70/1.20 % (2577195)Termination reason: Instruction limit
% 4.70/1.20 % (2577195)Termination phase: Saturation
% 4.70/1.20 % (2577195)Time elapsed: 0.108 s
% 4.70/1.20 % (2577195)Peak memory usage: 11 MB
% 4.70/1.20 % (2577195)Instructions burned: 116 (million)
% 4.70/1.20 % (2577205)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1674547444:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 4.70/1.20 % TRYING [1]
% 4.70/1.20 % TRYING [2]
% 4.70/1.20 % TRYING [3]
% 4.70/1.20 % TRYING [4]
% 4.70/1.20 % (2577196)Instruction limit reached!
% 4.70/1.20 % (2577196)------------------------------
% 4.70/1.20 % (2577196)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.70/1.20 % (2577196)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.70/1.20 % (2577196)CaDiCaL version: 2.1.3
% 4.70/1.20 % (2577196)Termination reason: Instruction limit
% 4.70/1.20 % (2577196)Termination phase: Saturation
% 4.70/1.20 % (2577196)Time elapsed: 0.137 s
% 4.70/1.20 % (2577196)Peak memory usage: 13 MB
% 4.70/1.20 % (2577196)Instructions burned: 131 (million)
% 4.70/1.20 % (2577206)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1746276881:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 4.70/1.20 % (2577197)Instruction limit reached!
% 4.70/1.20 % (2577197)------------------------------
% 4.70/1.20 % (2577197)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.70/1.20 % (2577197)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.70/1.20 % (2577197)CaDiCaL version: 2.1.3
% 4.70/1.20 % (2577197)Termination reason: Instruction limit
% 4.70/1.20 % (2577197)Termination phase: Saturation
% 4.70/1.20 % (2577197)Time elapsed: 0.167 s
% 4.70/1.20 % (2577197)Peak memory usage: 12 MB
% 4.70/1.20 % (2577197)Instructions burned: 159 (million)
% 4.70/1.20 % (2577208)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=3993746179:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 4.70/1.20 % TRYING [5]
% 4.70/1.20 % (2577210)ott-21_1_sil=16000:fs=off:random_seed=2157654012:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 4.70/1.20 % (2577206)Instruction limit reached!
% 4.70/1.20 % (2577206)------------------------------
% 4.70/1.20 % (2577206)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.70/1.20 % (2577206)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.70/1.20 % (2577206)CaDiCaL version: 2.1.3
% 4.70/1.20 % (2577206)Termination reason: Instruction limit
% 4.70/1.20 % (2577206)Termination phase: Saturation
% 4.70/1.20 % (2577206)Time elapsed: 0.124 s
% 4.70/1.20 % (2577206)Peak memory usage: 12 MB
% 4.70/1.20 % (2577206)Instructions burned: 133 (million)
% 4.70/1.20 % (2577213)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2970049022:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 4.70/1.20 % (2577210)Instruction limit reached!
% 4.70/1.20 % (2577210)------------------------------
% 4.70/1.20 % (2577210)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.70/1.20 % (2577210)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.70/1.20 % (2577210)CaDiCaL version: 2.1.3
% 4.70/1.20 % (2577210)Termination reason: Instruction limit
% 4.70/1.20 % (2577210)Termination phase: Saturation
% 4.70/1.20 % (2577210)Time elapsed: 0.162 s
% 4.70/1.20 % (2577210)Peak memory usage: 12 MB
% 4.70/1.20 % (2577210)Instructions burned: 180 (million)
% 4.70/1.20 % (2577215)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=69204141:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 4.70/1.20 % TRYING [1]
% 4.70/1.20 % TRYING [2]
% 4.70/1.20 % TRYING [3]
% 4.70/1.20 % TRYING [4]
% 4.70/1.20 % TRYING [5]
% 4.70/1.20 % TRYING [6]
% 4.70/1.20 % (2577208) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2577186-2577208"...
% 4.70/1.20 % (2577208)...printing done.
% 4.70/1.20 % (2577208)Refutation found. Thanks to Tanya!
% 4.70/1.20 % SZS status Unsatisfiable for theBenchmark
% 4.70/1.20 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/1.20 % (2577208)------------------------------
% 0.23/1.20 % (2577208)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/1.20 % (2577208)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/1.20 % (2577208)CaDiCaL version: 2.1.3
% 0.23/1.20 % (2577208)Termination reason: Refutation
% 0.23/1.20 % (2577208)Time elapsed: 0.475 s
% 0.23/1.20 % (2577208)Peak memory usage: 16 MB
% 0.23/1.20 % (2577208)Instructions burned: 466 (million)
% 0.23/1.20 % (2577186)Success in time 0.705 s
% 0.23/1.20 % Vampire exiting
%------------------------------------------------------------------------------