%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYN549+1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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 02:00:56 PM UTC 2026
% Result : Theorem 3.07s 1.07s
% Output : Refutation 3.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of formulae : 58 ( 5 unt; 2 def)
% Number of atoms : 262 ( 0 equ)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 330 ( 126 ~; 139 |; 55 &)
% ( 4 <=>; 4 =>; 0 <=; 2 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 127 ( 92 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : reachable(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_of_reachable) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( reachable(X0,X1)
& reachable(X1,X2) )
=> reachable(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_reachable) ).
fof(f3,conjecture,
? [X0] :
( reachable(initial_world,X0)
& ! [X1] :
( reachable(X0,X1)
=> ( ? [X2] :
( reachable(X1,X2)
& ( p(X2)
| ? [X3] :
( reachable(X2,X3)
& q(X3) ) ) )
<=> ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X4] :
( reachable(X1,X4)
& q(X4) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f4,negated_conjecture,
~ ? [X0] :
( reachable(initial_world,X0)
& ! [X1] :
( reachable(X0,X1)
=> ( ? [X2] :
( reachable(X1,X2)
& ( p(X2)
| ? [X3] :
( reachable(X2,X3)
& q(X3) ) ) )
<=> ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X4] :
( reachable(X1,X4)
& q(X4) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f5,plain,
~ ? [X0] :
( reachable(initial_world,X0)
& ! [X1] :
( reachable(X0,X1)
=> ( ? [X2] :
( reachable(X1,X2)
& ( p(X2)
| ? [X3] :
( reachable(X2,X3)
& q(X3) ) ) )
<=> ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X5] :
( reachable(X1,X5)
& q(X5) ) ) ) ) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
! [X0] :
( ~ reachable(initial_world,X0)
| ? [X1] :
( ( ? [X2] :
( reachable(X1,X2)
& ( p(X2)
| ? [X3] :
( reachable(X2,X3)
& q(X3) ) ) )
<~> ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X5] :
( reachable(X1,X5)
& q(X5) ) ) )
& reachable(X0,X1) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f7,plain,
! [X0,X1,X2] :
( reachable(X0,X2)
| ~ reachable(X0,X1)
| ~ reachable(X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f8,plain,
! [X0,X1,X2] :
( reachable(X0,X2)
| ~ reachable(X0,X1)
| ~ reachable(X1,X2) ),
inference(flattening,[],[f7]) ).
fof(f9,definition,
! [X1] :
( sP0(X1)
<=> ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X5] :
( reachable(X1,X5)
& q(X5) ) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f10,definition,
! [X1] :
( ( ? [X2] :
( reachable(X1,X2)
& ( p(X2)
| ? [X3] :
( reachable(X2,X3)
& q(X3) ) ) )
<~> sP0(X1) )
| ~ sP1(X1) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f11,plain,
! [X0] :
( ~ reachable(initial_world,X0)
| ? [X1] :
( sP1(X1)
& reachable(X0,X1) ) ),
inference(definition_folding,[],[f6,f10,f9]) ).
fof(f12,plain,
! [X1] :
( ( ( ~ sP0(X1)
| ! [X2] :
( ~ reachable(X1,X2)
| ( ~ p(X2)
& ! [X3] :
( ~ reachable(X2,X3)
| ~ q(X3) ) ) ) )
& ( sP0(X1)
| ? [X2] :
( reachable(X1,X2)
& ( p(X2)
| ? [X3] :
( reachable(X2,X3)
& q(X3) ) ) ) ) )
| ~ sP1(X1) ),
inference(nnf_transformation,[],[f10]) ).
fof(f13,plain,
! [X0] :
( ( ( ~ sP0(X0)
| ! [X1] :
( ~ reachable(X0,X1)
| ( ~ p(X1)
& ! [X2] :
( ~ reachable(X1,X2)
| ~ q(X2) ) ) ) )
& ( sP0(X0)
| ? [X3] :
( reachable(X0,X3)
& ( p(X3)
| ? [X4] :
( reachable(X3,X4)
& q(X4) ) ) ) ) )
| ~ sP1(X0) ),
inference(rectify,[],[f12]) ).
fof(f14,plain,
! [X0] :
( ( ( ~ sP0(X0)
| ! [X1] :
( ~ reachable(X0,X1)
| ( ~ p(X1)
& ! [X2] :
( ~ reachable(X1,X2)
| ~ q(X2) ) ) ) )
& ( sP0(X0)
| ( reachable(X0,sK2(X0))
& ( p(sK2(X0))
| ( reachable(sK2(X0),sK3(X0))
& q(sK3(X0)) ) ) ) ) )
| ~ sP1(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X3,sK2(X0)),skolemize(X4,sK3(X0))],[f13]) ).
fof(f15,plain,
! [X1] :
( ( sP0(X1)
| ( ! [X4] :
( ~ reachable(X1,X4)
| ~ p(X4) )
& ! [X5] :
( ~ reachable(X1,X5)
| ~ q(X5) ) ) )
& ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X5] :
( reachable(X1,X5)
& q(X5) )
| ~ sP0(X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f16,plain,
! [X1] :
( ( sP0(X1)
| ( ! [X4] :
( ~ reachable(X1,X4)
| ~ p(X4) )
& ! [X5] :
( ~ reachable(X1,X5)
| ~ q(X5) ) ) )
& ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X5] :
( reachable(X1,X5)
& q(X5) )
| ~ sP0(X1) ) ),
inference(flattening,[],[f15]) ).
fof(f17,plain,
! [X0] :
( ( sP0(X0)
| ( ! [X1] :
( ~ reachable(X0,X1)
| ~ p(X1) )
& ! [X2] :
( ~ reachable(X0,X2)
| ~ q(X2) ) ) )
& ( ? [X3] :
( reachable(X0,X3)
& p(X3) )
| ? [X4] :
( reachable(X0,X4)
& q(X4) )
| ~ sP0(X0) ) ),
inference(rectify,[],[f16]) ).
fof(f18,plain,
! [X0] :
( ( sP0(X0)
| ( ! [X1] :
( ~ reachable(X0,X1)
| ~ p(X1) )
& ! [X2] :
( ~ reachable(X0,X2)
| ~ q(X2) ) ) )
& ( ( reachable(X0,sK4(X0))
& p(sK4(X0)) )
| ( reachable(X0,sK5(X0))
& q(sK5(X0)) )
| ~ sP0(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X3,sK4(X0)),skolemize(X4,sK5(X0))],[f17]) ).
fof(f19,plain,
! [X0] :
( ~ reachable(initial_world,X0)
| ( sP1(sK6(X0))
& reachable(X0,sK6(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X1,sK6(X0))],[f11]) ).
fof(f20,plain,
! [X0] :
( sP0(X0)
| p(sK2(X0))
| q(sK3(X0))
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f21,plain,
! [X0] :
( sP0(X0)
| p(sK2(X0))
| reachable(sK2(X0),sK3(X0))
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f22,plain,
! [X0] :
( reachable(X0,sK2(X0))
| sP0(X0)
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f23,plain,
! [X2,X0,X1] :
( ~ reachable(X1,X2)
| ~ reachable(X0,X1)
| ~ sP0(X0)
| ~ q(X2)
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f24,plain,
! [X0,X1] :
( ~ sP0(X0)
| ~ reachable(X0,X1)
| ~ p(X1)
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f25,plain,
! [X0] :
( q(sK5(X0))
| p(sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f26,plain,
! [X0] :
( reachable(X0,sK5(X0))
| p(sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f27,plain,
! [X0] :
( reachable(X0,sK4(X0))
| q(sK5(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f28,plain,
! [X0] :
( reachable(X0,sK5(X0))
| reachable(X0,sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f29,plain,
! [X2,X0] :
( ~ reachable(X0,X2)
| sP0(X0)
| ~ q(X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f30,plain,
! [X0,X1] :
( ~ reachable(X0,X1)
| sP0(X0)
| ~ p(X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f32,plain,
! [X0] :
( sP1(sK6(X0))
| ~ reachable(initial_world,X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f33,plain,
! [X2,X0,X1] :
( reachable(X0,X2)
| ~ reachable(X0,X1)
| ~ reachable(X1,X2) ),
inference(cnf_transformation,[],[f8]) ).
fof(f34,plain,
! [X0] : reachable(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f39,plain,
! [X0] :
( sP0(X0)
| ~ sP1(X0)
| sP0(X0)
| ~ p(sK2(X0)) ),
inference(resolution,[],[f22,f30]) ).
fof(f42,plain,
! [X0] :
( ~ p(sK2(X0))
| ~ sP1(X0)
| sP0(X0) ),
inference(duplicate_literal_removal,[],[f39]) ).
fof(f43,plain,
! [X0,X1] :
( ~ reachable(X0,X1)
| ~ p(X1)
| ~ sP1(X0) ),
inference(forward_subsumption_resolution,[],[f24,f30]) ).
fof(f52,plain,
! [X0] :
( q(sK5(X0))
| ~ sP0(X0)
| ~ p(sK4(X0))
| ~ sP1(X0) ),
inference(resolution,[],[f27,f43]) ).
fof(f55,plain,
! [X0] :
( q(sK5(X0))
| ~ sP0(X0)
| ~ sP1(X0) ),
inference(forward_subsumption_resolution,[],[f52,f25]) ).
fof(f58,plain,
! [X2,X0,X1] :
( ~ reachable(X1,X2)
| ~ reachable(X0,X1)
| sP0(X0)
| ~ q(X2) ),
inference(resolution,[],[f33,f29]) ).
fof(f59,plain,
! [X0] :
( q(sK3(X0))
| sP0(X0)
| ~ sP1(X0) ),
inference(forward_subsumption_resolution,[],[f20,f42]) ).
fof(f63,plain,
! [X0] :
( reachable(sK2(X0),sK3(X0))
| sP0(X0)
| ~ sP1(X0) ),
inference(forward_subsumption_resolution,[],[f21,f42]) ).
fof(f68,plain,
! [X0,X1] :
( ~ reachable(X0,X1)
| ~ sP0(X0)
| ~ q(X1)
| ~ sP1(X0) ),
inference(resolution,[],[f23,f34]) ).
fof(f81,plain,
! [X0,X1] :
( ~ reachable(X0,X1)
| ~ q(X1)
| ~ sP1(X0) ),
inference(forward_subsumption_resolution,[],[f68,f29]) ).
fof(f88,plain,
! [X0] :
( ~ q(sK5(X0))
| ~ sP1(X0)
| reachable(X0,sK4(X0))
| ~ sP0(X0) ),
inference(resolution,[],[f81,f28]) ).
fof(f89,plain,
! [X0] :
( ~ q(sK5(X0))
| ~ sP1(X0)
| p(sK4(X0))
| ~ sP0(X0) ),
inference(resolution,[],[f81,f26]) ).
fof(f94,plain,
! [X0] :
( p(sK4(X0))
| ~ sP1(X0)
| ~ sP0(X0) ),
inference(forward_subsumption_resolution,[],[f89,f55]) ).
fof(f95,plain,
! [X0] :
( reachable(X0,sK4(X0))
| ~ sP1(X0)
| ~ sP0(X0) ),
inference(forward_subsumption_resolution,[],[f88,f55]) ).
fof(f109,plain,
! [X0] :
( ~ sP1(X0)
| ~ sP0(X0)
| ~ p(sK4(X0))
| ~ sP1(X0) ),
inference(resolution,[],[f95,f43]) ).
fof(f112,plain,
! [X0] :
( ~ sP1(X0)
| ~ sP0(X0)
| ~ p(sK4(X0)) ),
inference(duplicate_literal_removal,[],[f109]) ).
fof(f114,plain,
! [X0] :
( ~ sP1(X0)
| ~ sP0(X0) ),
inference(forward_subsumption_resolution,[],[f112,f94]) ).
fof(f139,plain,
! [X0,X1] :
( ~ reachable(X0,sK2(X1))
| sP0(X0)
| ~ q(sK3(X1))
| sP0(X1)
| ~ sP1(X1) ),
inference(resolution,[],[f58,f63]) ).
fof(f141,plain,
! [X0,X1] :
( ~ reachable(X0,sK2(X1))
| sP0(X0)
| sP0(X1)
| ~ sP1(X1) ),
inference(forward_subsumption_resolution,[],[f139,f59]) ).
fof(f144,plain,
! [X0,X1] :
( ~ reachable(X0,sK2(X1))
| sP0(X0)
| ~ sP1(X1) ),
inference(forward_subsumption_resolution,[],[f141,f114]) ).
fof(f145,plain,
! [X0] :
( sP0(X0)
| ~ sP1(X0)
| sP0(X0)
| ~ sP1(X0) ),
inference(resolution,[],[f144,f22]) ).
fof(f148,plain,
! [X0] :
( sP0(X0)
| ~ sP1(X0) ),
inference(duplicate_literal_removal,[],[f145]) ).
fof(f149,plain,
! [X0] : ~ sP1(X0),
inference(forward_subsumption_resolution,[],[f148,f114]) ).
fof(f150,plain,
! [X0] : ~ reachable(initial_world,X0),
inference(resolution,[],[f149,f32]) ).
fof(f151,plain,
$false,
inference(resolution,[],[f150,f34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN549+1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n002.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 16:31:07 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running first-order theorem proving
% 0.09/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.07/1.07 % (498921)Detected formulas, will run a generic FOF schedule.
% 3.07/1.07 % (499002)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2452623645:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.07/1.07 % (499002)Instruction limit reached!
% 3.07/1.07 % (499002)------------------------------
% 3.07/1.07 % (499002)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.07/1.07 % (499002)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.07/1.07 % (499002)CaDiCaL version: 2.1.3
% 3.07/1.07 % (499002)Termination reason: Instruction limit
% 3.07/1.07 % (499002)Termination phase: Saturation
% 3.07/1.07 % (499002)Time elapsed: 0.024 s
% 3.07/1.07 % (499002)Peak memory usage: 88 MB
% 3.07/1.07 % (499002)Instructions burned: 109 (million)
% 3.07/1.07 % (499005)dis-21_1_sil=8000:lcm=predicate:random_seed=2808720313:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.07/1.07 % (499003)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1103155680:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.07/1.07 % (498999)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=618616609:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.07/1.07 % (499001)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1918193783:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.07/1.07 % (499000)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=754536427:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.07/1.07 % (499004)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3836042883:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.07/1.07 % (499003)First to succeed.
% 3.07/1.07 % (499003)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-498921"
% 3.07/1.07 % (499004)Also succeeded, but the first one will report.
% 3.07/1.07 % (499005)Instruction limit reached!
% 3.07/1.07 % (499005)------------------------------
% 3.07/1.07 % (499005)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.07/1.07 % (499005)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.07/1.07 % (499005)CaDiCaL version: 2.1.3
% 3.07/1.07 % (499005)Termination reason: Instruction limit
% 3.07/1.07 % (499005)Termination phase: Saturation
% 3.07/1.07 % (499005)Time elapsed: 0.068 s
% 3.07/1.07 % (499005)Peak memory usage: 87 MB
% 3.07/1.07 % (499005)Instructions burned: 129 (million)
% 3.07/1.07 % (499007)lrs+10_1_sil=8000:sp=occurrence:random_seed=2407811693:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.07/1.07 % (499007)Instruction limit reached!
% 3.07/1.07 % (499007)------------------------------
% 3.07/1.07 % (499007)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.07/1.07 % (499007)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.07/1.07 % (499007)CaDiCaL version: 2.1.3
% 3.07/1.07 % (499007)Termination reason: Instruction limit
% 3.07/1.07 % (499007)Termination phase: Saturation
% 3.07/1.07 % (499007)Time elapsed: 0.090 s
% 3.07/1.07 % (499007)Peak memory usage: 90 MB
% 3.07/1.07 % (499007)Instructions burned: 288 (million)
% 3.07/1.07 % (499015)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2904776306:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.07/1.07 % (499016)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1935273256:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 3.07/1.07 % (499003)Refutation found. Thanks to Tanya!
% 3.07/1.07 % SZS status Theorem for theBenchmark
% 3.07/1.07 % SZS output start Proof for theBenchmark
% See solution above
% 3.51/1.26 % (499003)------------------------------
% 3.51/1.26 % (499003)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.26 % (499003)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.26 % (499003)CaDiCaL version: 2.1.3
% 3.51/1.26 % (499003)Termination reason: Refutation
% 3.51/1.26 % (499003)Time elapsed: 0.004 s
% 3.51/1.26 % (499003)Peak memory usage: 88 MB
% 3.51/1.26 % (499003)Instructions burned: 5 (million)
% 3.51/1.26 % (499003)------------------------------
% 3.51/1.26 % (499003)------------------------------
% 3.51/1.26 % (498921)Success in time 0.403 s
% 3.51/1.26 % Vampire exiting
%------------------------------------------------------------------------------