%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL457+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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:44 AM UTC 2026
% Result : Theorem 6.14s 1.39s
% Output : Refutation 6.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 20
% Syntax : Number of formulae : 100 ( 47 unt; 2 def)
% Number of atoms : 166 ( 14 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 120 ( 54 ~; 45 |; 2 &)
% ( 8 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 14 ( 12 usr; 12 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 136 ( 0 sgn 133 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(f4,axiom,
( implies_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_1) ).
fof(f6,axiom,
( implies_3
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_3) ).
fof(f10,axiom,
( or_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',or_1) ).
fof(f12,axiom,
( or_3
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X2),implies(implies(X1,X2),implies(or(X0,X1),X2)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',or_3) ).
fof(f25,axiom,
( r4
<=> ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r4) ).
fof(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(f30,axiom,
( op_implies_or
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_or) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_implies_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
fof(f37,axiom,
implies_1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_implies_1) ).
fof(f39,axiom,
implies_3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_implies_3) ).
fof(f43,axiom,
or_1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_or_1) ).
fof(f45,axiom,
or_3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_or_3) ).
fof(f50,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f53,conjecture,
r4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r4) ).
fof(f54,negated_conjecture,
~ r4,
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f55,plain,
~ r4,
inference(flattening,[],[f54]) ).
fof(f56,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
=> r4 ),
inference(unused_predicate_definition_removal,[],[f25]) ).
fof(f60,plain,
( or_3
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X2),implies(implies(X1,X2),implies(or(X0,X1),X2)))) ),
inference(unused_predicate_definition_removal,[],[f12]) ).
fof(f62,plain,
( or_1
=> ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f10]) ).
fof(f66,plain,
( implies_3
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f6]) ).
fof(f68,plain,
( implies_1
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f71,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f72,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f71]) ).
fof(f73,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f72]) ).
fof(f76,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0)))
| ~ implies_1 ),
inference(ennf_transformation,[],[f68]) ).
fof(f78,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ implies_3 ),
inference(ennf_transformation,[],[f66]) ).
fof(f82,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ),
inference(ennf_transformation,[],[f62]) ).
fof(f84,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X2),implies(implies(X1,X2),implies(or(X0,X1),X2))))
| ~ or_3 ),
inference(ennf_transformation,[],[f60]) ).
fof(f88,plain,
( r4
| ? [X0,X1,X2] : ~ is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
inference(ennf_transformation,[],[f56]) ).
fof(f89,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f91,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f92,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f94,plain,
( r4
| ~ is_a_theorem(implies(or(sK0,or(sK1,sK2)),or(sK1,or(sK0,sK2)))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f88]) ).
fof(f95,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f73]) ).
fof(f98,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,X0)))
| ~ implies_1 ),
inference(cnf_transformation,[],[f76]) ).
fof(f100,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ implies_3 ),
inference(cnf_transformation,[],[f78]) ).
fof(f104,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ),
inference(cnf_transformation,[],[f82]) ).
fof(f106,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X2),implies(implies(X1,X2),implies(or(X0,X1),X2))))
| ~ or_3 ),
inference(cnf_transformation,[],[f84]) ).
fof(f110,plain,
( r4
| ~ is_a_theorem(implies(or(sK0,or(sK1,sK2)),or(sK1,or(sK0,sK2)))) ),
inference(cnf_transformation,[],[f94]) ).
fof(f111,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f89]) ).
fof(f113,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f91]) ).
fof(f114,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f92]) ).
fof(f116,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f117,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f119,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f121,plain,
implies_1,
inference(cnf_transformation,[],[f37]) ).
fof(f123,plain,
implies_3,
inference(cnf_transformation,[],[f39]) ).
fof(f127,plain,
or_1,
inference(cnf_transformation,[],[f43]) ).
fof(f129,plain,
or_3,
inference(cnf_transformation,[],[f45]) ).
fof(f134,plain,
op_implies_or,
inference(cnf_transformation,[],[f50]) ).
fof(f137,plain,
~ r4,
inference(cnf_transformation,[],[f55]) ).
fof(f139,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(forward_subsumption_resolution,[],[f114,f134]) ).
fof(f140,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[],[f113,f117]) ).
fof(f142,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f111,f116]) ).
fof(f143,plain,
~ is_a_theorem(implies(or(sK0,or(sK1,sK2)),or(sK1,or(sK0,sK2)))),
inference(forward_subsumption_resolution,[],[f110,f137]) ).
fof(f147,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X2),implies(implies(X1,X2),implies(or(X0,X1),X2)))),
inference(forward_subsumption_resolution,[],[f106,f129]) ).
fof(f149,plain,
! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))),
inference(forward_subsumption_resolution,[],[f104,f127]) ).
fof(f153,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(forward_subsumption_resolution,[],[f100,f123]) ).
fof(f155,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(forward_subsumption_resolution,[],[f98,f121]) ).
fof(f158,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f95,f119]) ).
fof(f160,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_demodulation,[],[f142,f140]) ).
fof(f161,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(superposition,[],[f149,f139]) ).
fof(f182,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(superposition,[],[f149,f160]) ).
fof(f184,plain,
! [X0,X1] : implies(X0,X1) = implies(not(not(X0)),X1),
inference(superposition,[],[f139,f160]) ).
fof(f188,plain,
~ is_a_theorem(implies(or(sK0,or(sK1,sK2)),implies(not(sK1),or(sK0,sK2)))),
inference(superposition,[],[f143,f160]) ).
fof(f189,plain,
~ is_a_theorem(implies(or(sK0,or(sK1,sK2)),implies(not(sK1),implies(not(sK0),sK2)))),
inference(forward_demodulation,[],[f188,f160]) ).
fof(f193,plain,
~ is_a_theorem(implies(implies(not(sK0),or(sK1,sK2)),implies(not(sK1),implies(not(sK0),sK2)))),
inference(forward_demodulation,[],[f189,f160]) ).
fof(f197,plain,
~ is_a_theorem(implies(implies(not(sK0),implies(not(sK1),sK2)),implies(not(sK1),implies(not(sK0),sK2)))),
inference(forward_demodulation,[],[f193,f160]) ).
fof(f243,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(implies(X1,X2),implies(X0,X2))) ),
inference(resolution,[],[f153,f158]) ).
fof(f246,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(implies(X2,X1),implies(or(X0,X2),X1))) ),
inference(resolution,[],[f147,f158]) ).
fof(f249,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X2,X1),implies(implies(not(X0),X2),X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(forward_demodulation,[],[f246,f160]) ).
fof(f495,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(not(X0),X2))),
inference(resolution,[],[f243,f161]) ).
fof(f498,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))),
inference(resolution,[],[f243,f155]) ).
fof(f786,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(not(X0),X2),X1))
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f249,f158]) ).
fof(f1363,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f498,f158]) ).
fof(f1455,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(not(X0),X2)) ),
inference(resolution,[],[f495,f158]) ).
fof(f3948,plain,
( ~ is_a_theorem(implies(implies(not(sK1),sK2),implies(not(sK1),implies(not(sK0),sK2))))
| ~ is_a_theorem(implies(sK0,implies(not(sK1),implies(not(sK0),sK2)))) ),
inference(resolution,[],[f786,f197]) ).
fof(f3977,definition,
( spl3_5
<=> is_a_theorem(implies(sK0,implies(not(sK1),implies(not(sK0),sK2)))) ),
introduced(definition,[new_symbols(definition,[spl3_5])],[avatar_definition]) ).
fof(f3979,plain,
( ~ is_a_theorem(implies(sK0,implies(not(sK1),implies(not(sK0),sK2))))
| spl3_5 ),
inference(avatar_component_clause,[],[f3977]) ).
fof(f3981,definition,
( spl3_6
<=> is_a_theorem(implies(implies(not(sK1),sK2),implies(not(sK1),implies(not(sK0),sK2)))) ),
introduced(definition,[new_symbols(definition,[spl3_6])],[avatar_definition]) ).
fof(f3983,plain,
( ~ is_a_theorem(implies(implies(not(sK1),sK2),implies(not(sK1),implies(not(sK0),sK2))))
| spl3_6 ),
inference(avatar_component_clause,[],[f3981]) ).
fof(f3984,plain,
( ~ spl3_5
| ~ spl3_6 ),
inference(avatar_split_clause,[],[f3948,f3981,f3977]) ).
fof(f4612,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X0)))),
inference(resolution,[],[f1363,f155]) ).
fof(f6685,plain,
! [X2,X0,X1] : is_a_theorem(implies(not(X0),implies(X1,implies(X0,X2)))),
inference(resolution,[],[f1455,f155]) ).
fof(f6823,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(not(X0),X2)))),
inference(superposition,[],[f6685,f184]) ).
fof(f23226,plain,
( $false
| spl3_5 ),
inference(resolution,[],[f6823,f3979]) ).
fof(f23273,plain,
spl3_5,
inference(avatar_contradiction_clause,[],[f23226]) ).
fof(f23306,plain,
( ~ is_a_theorem(implies(sK2,implies(not(sK1),implies(not(sK0),sK2))))
| ~ is_a_theorem(implies(sK1,implies(not(sK1),implies(not(sK0),sK2))))
| spl3_6 ),
inference(resolution,[],[f3983,f786]) ).
fof(f23317,plain,
( ~ is_a_theorem(implies(sK1,implies(not(sK1),implies(not(sK0),sK2))))
| spl3_6 ),
inference(forward_subsumption_resolution,[],[f23306,f4612]) ).
fof(f23319,plain,
( $false
| spl3_6 ),
inference(forward_subsumption_resolution,[],[f23317,f182]) ).
fof(f23320,plain,
spl3_6,
inference(avatar_contradiction_clause,[],[f23319]) ).
cnf(s7,plain,
( ~ spl3_5
| ~ spl3_6 ),
inference(sat_conversion,[],[f3984]) ).
cnf(s8,plain,
spl3_5,
inference(sat_conversion,[],[f23273]) ).
cnf(s12,plain,
spl3_6,
inference(sat_conversion,[],[f23320]) ).
cnf(s13,plain,
$false,
inference(rat,[],[s7,s12,s8]) ).
fof(f23321,plain,
$false,
inference(avatar_sat_refutation,[],[s13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL457+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 15:47:53 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39 Running first-order model finding
% 0.10/0.39 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
% 6.14/1.39 % (2538934)Will run a generic schedule for satisfiability detection.
% 6.14/1.39 % (2538941)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=861441413:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 6.14/1.39 % (2538940)% WARNING: option uhcvi not known.
% 6.14/1.39 % (2538939)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3808327359_2999 on theBenchmark for (2999ds/0Mi)
% 6.14/1.39 % (2538942)dis+10_1_sil=32000:sp=arity:random_seed=3011413850:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 6.14/1.39 % (2538943)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2052394701:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 6.14/1.39 % (2538944)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1082534409:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 6.14/1.39 % (2538945)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=784967362:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 6.14/1.39 % (2538940)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2293653388:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 6.14/1.39 % TRYING [1]
% 6.14/1.39 % TRYING [2]
% 6.14/1.39 % TRYING [3]
% 6.14/1.39 % TRYING [4]
% 6.14/1.39 % (2538942)Instruction limit reached!
% 6.14/1.39 % (2538942)------------------------------
% 6.14/1.39 % (2538942)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.14/1.39 % (2538942)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.14/1.39 % (2538942)CaDiCaL version: 2.1.3
% 6.14/1.39 % (2538942)Termination reason: Instruction limit
% 6.14/1.39 % (2538942)Termination phase: Saturation
% 6.14/1.39 % (2538942)Time elapsed: 0.069 s
% 6.14/1.39 % (2538942)Peak memory usage: 13 MB
% 6.14/1.39 % (2538942)Instructions burned: 103 (million)
% 6.14/1.39 % (2538943)Instruction limit reached!
% 6.14/1.39 % (2538943)------------------------------
% 6.14/1.39 % (2538943)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.14/1.39 % (2538943)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.14/1.39 % (2538943)CaDiCaL version: 2.1.3
% 6.14/1.39 % (2538943)Termination reason: Instruction limit
% 6.14/1.39 % (2538943)Termination phase: Saturation
% 6.14/1.39 % (2538943)Time elapsed: 0.078 s
% 6.14/1.39 % (2538943)Peak memory usage: 13 MB
% 6.14/1.39 % (2538943)Instructions burned: 117 (million)
% 6.14/1.39 % (2538944)Instruction limit reached!
% 6.14/1.39 % (2538944)------------------------------
% 6.14/1.39 % (2538944)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.14/1.39 % (2538944)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.14/1.39 % (2538944)CaDiCaL version: 2.1.3
% 6.14/1.39 % (2538944)Termination reason: Instruction limit
% 6.14/1.39 % (2538944)Termination phase: Saturation
% 6.14/1.39 % (2538944)Time elapsed: 0.087 s
% 6.14/1.39 % (2538944)Peak memory usage: 14 MB
% 6.14/1.39 % (2538944)Instructions burned: 132 (million)
% 6.14/1.39 % (2538953)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4073627273:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 6.14/1.39 % TRYING [1]
% 6.14/1.39 % TRYING [2]
% 6.14/1.39 % TRYING [3]
% 6.14/1.39 % (2538954)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1649339710:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 6.14/1.39 % TRYING [4]
% 6.14/1.39 % (2538955)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=4160223638:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 6.14/1.39 % TRYING [5]
% 6.14/1.39 % (2538945)Instruction limit reached!
% 6.14/1.39 % (2538945)------------------------------
% 6.14/1.39 % (2538945)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.14/1.39 % (2538945)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.14/1.39 % (2538945)CaDiCaL version: 2.1.3
% 6.14/1.39 % (2538945)Termination reason: Instruction limit
% 6.14/1.39 % (2538945)Termination phase: Saturation
% 6.14/1.39 % (2538945)Time elapsed: 0.110 s
% 6.14/1.39 % (2538945)Peak memory usage: 14 MB
% 6.14/1.39 % (2538945)Instructions burned: 159 (million)
% 6.14/1.39 % (2538959)ott-21_1_sil=16000:fs=off:random_seed=1334794282:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 6.14/1.39 % (2538954)Instruction limit reached!
% 6.14/1.39 % (2538954)------------------------------
% 6.14/1.39 % (2538954)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.14/1.39 % (2538954)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.14/1.39 % (2538954)CaDiCaL version: 2.1.3
% 6.14/1.39 % (2538954)Termination reason: Instruction limit
% 6.14/1.39 % (2538954)Termination phase: Saturation
% 6.14/1.39 % (2538954)Time elapsed: 0.088 s
% 6.14/1.39 % (2538954)Peak memory usage: 14 MB
% 6.14/1.39 % (2538954)Instructions burned: 131 (million)
% 6.14/1.39 % (2538961)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1282251921:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 6.14/1.39 % TRYING [5]
% 6.14/1.39 % (2538959)Instruction limit reached!
% 6.14/1.39 % (2538959)------------------------------
% 6.14/1.39 % (2538959)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.14/1.39 % (2538959)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.14/1.39 % (2538959)CaDiCaL version: 2.1.3
% 6.14/1.39 % (2538959)Termination reason: Instruction limit
% 6.14/1.39 % (2538959)Termination phase: Saturation
% 6.14/1.39 % (2538959)Time elapsed: 0.105 s
% 6.14/1.39 % (2538959)Peak memory usage: 13 MB
% 6.14/1.39 % (2538959)Instructions burned: 181 (million)
% 6.14/1.39 % (2538963)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1101121135:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 6.14/1.39 % TRYING [1]
% 6.14/1.39 % TRYING [2]
% 6.14/1.39 % TRYING [3]
% 6.14/1.39 % TRYING [4]
% 6.14/1.39 % (2538953)Instruction limit reached!
% 6.14/1.39 % (2538953)------------------------------
% 6.14/1.39 % (2538953)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.14/1.39 % (2538953)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.14/1.39 % (2538953)CaDiCaL version: 2.1.3
% 6.14/1.39 % (2538953)Termination reason: Instruction limit
% 6.14/1.39 % (2538953)Termination phase: Finite model building SAT solving
% 6.14/1.39 % (2538953)Time elapsed: 0.387 s
% 6.14/1.39 % (2538953)Peak memory usage: 23 MB
% 6.14/1.39 % (2538953)Instructions burned: 714 (million)
% 6.14/1.39 % (2538965)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=4041012810:i=1179_2994 on theBenchmark for (2994ds/1179Mi)
% 6.14/1.39 % (2538961)Instruction limit reached!
% 6.14/1.39 % (2538961)------------------------------
% 6.14/1.39 % (2538961)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.14/1.39 % (2538961)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.14/1.39 % (2538961)CaDiCaL version: 2.1.3
% 6.14/1.39 % (2538961)Termination reason: Instruction limit
% 6.14/1.39 % (2538961)Termination phase: Saturation
% 6.14/1.39 % (2538961)Time elapsed: 0.310 s
% 6.14/1.39 % (2538961)Peak memory usage: 14 MB
% 6.14/1.39 % (2538961)Instructions burned: 478 (million)
% 6.14/1.39 % (2538955)Instruction limit reached!
% 6.14/1.39 % (2538955)------------------------------
% 6.14/1.39 % (2538955)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.14/1.39 % (2538955)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.14/1.39 % (2538955)CaDiCaL version: 2.1.3
% 6.14/1.39 % (2538955)Termination reason: Instruction limit
% 6.14/1.39 % (2538955)Termination phase: Saturation
% 6.14/1.39 % (2538955)Time elapsed: 0.423 s
% 6.14/1.39 % (2538955)Peak memory usage: 20 MB
% 6.14/1.39 % (2538955)Instructions burned: 685 (million)
% 6.14/1.39 % (2538967)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2503990723:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 6.14/1.39 % (2538968)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=4223856460:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 6.14/1.39 % TRYING [5]
% 6.14/1.39 % (2538963)Instruction limit reached!
% 6.14/1.39 % (2538963)------------------------------
% 6.14/1.39 % (2538963)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.14/1.39 % (2538963)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.14/1.39 % (2538963)CaDiCaL version: 2.1.3
% 6.14/1.39 % (2538963)Termination reason: Instruction limit
% 6.14/1.39 % (2538963)Termination phase: Finite model building constraint generation
% 6.14/1.39 % (2538963)Time elapsed: 0.367 s
% 6.14/1.39 % (2538963)Peak memory usage: 22 MB
% 6.14/1.39 % (2538963)Instructions burned: 865 (million)
% 6.14/1.39 % TRYING [14]
% 6.14/1.39 % (2538971)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1061738389:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 6.14/1.39 % TRYING [6]
% 6.14/1.39 % (2538967)Instruction limit reached!
% 6.14/1.39 % (2538967)------------------------------
% 6.14/1.39 % (2538967)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.14/1.39 % (2538967)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.14/1.39 % (2538967)CaDiCaL version: 2.1.3
% 6.14/1.39 % (2538967)Termination reason: Instruction limit
% 6.14/1.39 % (2538967)Termination phase: Finite model building constraint generation
% 6.14/1.39 % (2538967)Time elapsed: 0.319 s
% 6.14/1.39 % (2538967)Peak memory usage: 69 MB
% 6.14/1.39 % (2538967)Instructions burned: 890 (million)
% 6.14/1.39 % (2538973)fmb+10_1_sil=64000:random_seed=2794609630:i=22061:nm=2:gsp=on_2991 on theBenchmark for (2991ds/22061Mi)
% 6.14/1.39 % TRYING [1]
% 6.14/1.39 % TRYING [2]
% 6.14/1.39 % TRYING [3]
% 6.14/1.39 % TRYING [4]
% 6.14/1.39 % (2538965) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2538934-2538965"...
% 6.14/1.39 % (2538965)...printing done.
% 6.14/1.39 % (2538965)Refutation found. Thanks to Tanya!
% 6.14/1.39 % SZS status Theorem for theBenchmark
% 6.14/1.39 % SZS output start Proof for theBenchmark
% See solution above
% 6.14/1.39 % (2538965)------------------------------
% 6.14/1.39 % (2538965)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.14/1.39 % (2538965)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.14/1.39 % (2538965)CaDiCaL version: 2.1.3
% 6.14/1.39 % (2538965)Termination reason: Refutation
% 6.14/1.39 % (2538965)Time elapsed: 0.450 s
% 6.14/1.39 % (2538965)Peak memory usage: 18 MB
% 6.14/1.39 % (2538965)Instructions burned: 726 (million)
% 6.14/1.39 % (2538934)Success in time 0.987 s
% 6.14/1.39 % Vampire exiting
%------------------------------------------------------------------------------