%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV403+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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 01:09:07 PM UTC 2026
% Result : Theorem 2.72s 0.91s
% Output : Refutation 3.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 60 ( 8 unt; 0 def)
% Number of atoms : 175 ( 36 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 197 ( 82 ~; 77 |; 28 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 159 ( 141 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',totality) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( less_than(X0,X1)
& ~ less_than(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',stricly_smaller_definition) ).
fof(f11,axiom,
! [X0,X1,X2,X3,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
<=> ( pair_in_list(X0,X2,X4)
| ( X1 = X2
& X3 = X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax23) ).
fof(f17,axiom,
! [X0,X1,X2,X3] :
( strictly_less_than(X3,X2)
=> update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax29) ).
fof(f18,axiom,
! [X0,X1,X2,X3] :
( less_than(X2,X3)
=> update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax30) ).
fof(f19,conjecture,
! [X0] :
( ! [X1,X2,X3] :
( ( pair_in_list(X0,X1,X2)
& strictly_less_than(X2,X3) )
=> pair_in_list(update_slb(X0,X3),X1,X3) )
=> ! [X4,X5,X6,X7,X8] :
( ( pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5)
& strictly_less_than(X5,X6) )
=> pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X6) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l39_co) ).
fof(f20,negated_conjecture,
~ ! [X0] :
( ! [X1,X2,X3] :
( ( pair_in_list(X0,X1,X2)
& strictly_less_than(X2,X3) )
=> pair_in_list(update_slb(X0,X3),X1,X3) )
=> ! [X4,X5,X6,X7,X8] :
( ( pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5)
& strictly_less_than(X5,X6) )
=> pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X6) ) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
? [X0] :
( ? [X4,X5,X6,X7,X8] :
( ~ pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X6)
& pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5)
& strictly_less_than(X5,X6) )
& ! [X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X3)
| ~ pair_in_list(X0,X1,X2)
| ~ strictly_less_than(X2,X3) ) ),
inference(ennf_transformation,[],[f20]) ).
fof(f22,plain,
? [X0] :
( ? [X4,X5,X6,X7,X8] :
( ~ pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X6)
& pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5)
& strictly_less_than(X5,X6) )
& ! [X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X3)
| ~ pair_in_list(X0,X1,X2)
| ~ strictly_less_than(X2,X3) ) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
! [X0,X1,X2,X3] :
( update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2))
| ~ strictly_less_than(X3,X2) ),
inference(ennf_transformation,[],[f17]) ).
fof(f24,plain,
! [X0,X1,X2,X3] :
( update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X3))
| ~ less_than(X2,X3) ),
inference(ennf_transformation,[],[f18]) ).
fof(f27,plain,
? [X0] :
( ? [X1,X2,X3,X4,X5] :
( ~ pair_in_list(update_slb(insert_slb(X0,pair(X4,X5)),X3),X1,X3)
& pair_in_list(insert_slb(X0,pair(X4,X5)),X1,X2)
& strictly_less_than(X2,X3) )
& ! [X6,X7,X8] :
( pair_in_list(update_slb(X0,X8),X6,X8)
| ~ pair_in_list(X0,X6,X7)
| ~ strictly_less_than(X7,X8) ) ),
inference(rectify,[],[f22]) ).
fof(f28,plain,
( ~ pair_in_list(update_slb(insert_slb(sK0,pair(sK4,sK5)),sK3),sK1,sK3)
& pair_in_list(insert_slb(sK0,pair(sK4,sK5)),sK1,sK2)
& strictly_less_than(sK2,sK3)
& ! [X6,X7,X8] :
( pair_in_list(update_slb(sK0,X8),X6,X8)
| ~ pair_in_list(sK0,X6,X7)
| ~ strictly_less_than(X7,X8) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5)],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) )
& ( ( less_than(X0,X1)
& ~ less_than(X1,X0) )
| ~ strictly_less_than(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f30,plain,
! [X0,X1] :
( ( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) )
& ( ( less_than(X0,X1)
& ~ less_than(X1,X0) )
| ~ strictly_less_than(X0,X1) ) ),
inference(flattening,[],[f29]) ).
fof(f31,plain,
! [X0,X1,X2,X3,X4] :
( ( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ( ~ pair_in_list(X0,X2,X4)
& ( X1 != X2
| X3 != X4 ) ) )
& ( pair_in_list(X0,X2,X4)
| ( X1 = X2
& X3 = X4 )
| ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f32,plain,
! [X0,X1,X2,X3,X4] :
( ( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ( ~ pair_in_list(X0,X2,X4)
& ( X1 != X2
| X3 != X4 ) ) )
& ( pair_in_list(X0,X2,X4)
| ( X1 = X2
& X3 = X4 )
| ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4) ) ),
inference(flattening,[],[f31]) ).
fof(f35,plain,
! [X8,X6,X7] :
( pair_in_list(update_slb(sK0,X8),X6,X8)
| ~ pair_in_list(sK0,X6,X7)
| ~ strictly_less_than(X7,X8) ),
inference(cnf_transformation,[],[f28]) ).
fof(f36,plain,
strictly_less_than(sK2,sK3),
inference(cnf_transformation,[],[f28]) ).
fof(f37,plain,
pair_in_list(insert_slb(sK0,pair(sK4,sK5)),sK1,sK2),
inference(cnf_transformation,[],[f28]) ).
fof(f38,plain,
~ pair_in_list(update_slb(insert_slb(sK0,pair(sK4,sK5)),sK3),sK1,sK3),
inference(cnf_transformation,[],[f28]) ).
fof(f39,plain,
! [X2,X3,X0,X1] :
( update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2))
| ~ strictly_less_than(X3,X2) ),
inference(cnf_transformation,[],[f23]) ).
fof(f42,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f43,plain,
! [X2,X3,X0,X1,X4] :
( ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| X3 = X4
| pair_in_list(X0,X2,X4) ),
inference(cnf_transformation,[],[f32]) ).
fof(f44,plain,
! [X2,X3,X0,X1,X4] :
( ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| X1 = X2
| pair_in_list(X0,X2,X4) ),
inference(cnf_transformation,[],[f32]) ).
fof(f45,plain,
! [X2,X3,X0,X1,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| X1 != X2
| X3 != X4 ),
inference(cnf_transformation,[],[f32]) ).
fof(f46,plain,
! [X2,X3,X0,X1,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ~ pair_in_list(X0,X2,X4) ),
inference(cnf_transformation,[],[f32]) ).
fof(f48,plain,
! [X2,X3,X0,X1] :
( update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X3))
| ~ less_than(X2,X3) ),
inference(cnf_transformation,[],[f24]) ).
fof(f51,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f57,plain,
! [X2,X3,X0,X4] :
( pair_in_list(insert_slb(X0,pair(X2,X3)),X2,X4)
| X3 != X4 ),
inference(equality_resolution,[],[f45]) ).
fof(f58,plain,
! [X2,X0,X4] : pair_in_list(insert_slb(X0,pair(X2,X4)),X2,X4),
inference(equality_resolution,[],[f57]) ).
fof(f63,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(forward_subsumption_resolution,[],[f42,f51]) ).
fof(f86,plain,
( pair_in_list(sK0,sK1,sK2)
| sK2 = sK5 ),
inference(resolution,[],[f43,f37]) ).
fof(f98,plain,
( pair_in_list(sK0,sK1,sK2)
| sK1 = sK4 ),
inference(resolution,[],[f44,f37]) ).
fof(f104,plain,
! [X2,X3,X0,X1,X4] :
( update_slb(insert_slb(X0,pair(X1,X2)),X3) = update_slb(insert_slb(X0,pair(X1,X4)),X3)
| ~ strictly_less_than(X4,X3)
| ~ strictly_less_than(X2,X3) ),
inference(superposition,[],[f39,f39]) ).
fof(f107,plain,
! [X2,X3,X0,X1,X4,X5] :
( pair_in_list(update_slb(insert_slb(X0,pair(X1,X2)),X3),X4,X5)
| ~ pair_in_list(update_slb(X0,X3),X4,X5)
| ~ strictly_less_than(X2,X3) ),
inference(superposition,[],[f46,f39]) ).
fof(f110,plain,
! [X2,X3,X0,X1] :
( pair_in_list(update_slb(insert_slb(X0,pair(X1,X2)),X3),X1,X3)
| ~ strictly_less_than(X2,X3) ),
inference(superposition,[],[f58,f39]) ).
fof(f123,plain,
! [X2,X3,X0,X1,X4,X5] :
( pair_in_list(update_slb(insert_slb(X0,pair(X1,X2)),X3),X4,X5)
| ~ pair_in_list(update_slb(X0,X3),X4,X5)
| ~ less_than(X3,X2) ),
inference(superposition,[],[f46,f48]) ).
fof(f353,plain,
( ~ pair_in_list(update_slb(sK0,sK3),sK1,sK3)
| ~ strictly_less_than(sK5,sK3) ),
inference(resolution,[],[f107,f38]) ).
fof(f365,plain,
! [X0] :
( ~ pair_in_list(sK0,sK1,X0)
| ~ strictly_less_than(sK5,sK3)
| ~ strictly_less_than(X0,sK3) ),
inference(resolution,[],[f353,f35]) ).
fof(f366,plain,
( ~ strictly_less_than(sK5,sK3)
| ~ strictly_less_than(sK2,sK3)
| sK1 = sK4 ),
inference(resolution,[],[f365,f98]) ).
fof(f367,plain,
( ~ strictly_less_than(sK5,sK3)
| ~ strictly_less_than(sK2,sK3)
| sK2 = sK5 ),
inference(resolution,[],[f365,f86]) ).
fof(f368,plain,
( ~ strictly_less_than(sK5,sK3)
| sK2 = sK5 ),
inference(forward_subsumption_resolution,[],[f367,f36]) ).
fof(f369,plain,
( ~ strictly_less_than(sK5,sK3)
| sK1 = sK4 ),
inference(forward_subsumption_resolution,[],[f366,f36]) ).
fof(f370,plain,
( ~ pair_in_list(update_slb(sK0,sK3),sK1,sK3)
| ~ less_than(sK3,sK5) ),
inference(resolution,[],[f123,f38]) ).
fof(f380,plain,
( less_than(sK3,sK5)
| sK2 = sK5 ),
inference(resolution,[],[f368,f63]) ).
fof(f398,plain,
( less_than(sK3,sK5)
| sK1 = sK4 ),
inference(resolution,[],[f369,f63]) ).
fof(f450,plain,
! [X0] :
( ~ pair_in_list(update_slb(insert_slb(sK0,pair(sK4,X0)),sK3),sK1,sK3)
| ~ strictly_less_than(X0,sK3)
| ~ strictly_less_than(sK5,sK3) ),
inference(superposition,[],[f38,f104]) ).
fof(f596,plain,
! [X0] :
( ~ pair_in_list(sK0,sK1,X0)
| ~ less_than(sK3,sK5)
| ~ strictly_less_than(X0,sK3) ),
inference(resolution,[],[f370,f35]) ).
fof(f993,plain,
( ~ less_than(sK3,sK5)
| ~ strictly_less_than(sK2,sK3)
| sK1 = sK4 ),
inference(resolution,[],[f596,f98]) ).
fof(f994,plain,
( ~ less_than(sK3,sK5)
| ~ strictly_less_than(sK2,sK3)
| sK2 = sK5 ),
inference(resolution,[],[f596,f86]) ).
fof(f995,plain,
( ~ strictly_less_than(sK2,sK3)
| sK2 = sK5 ),
inference(forward_subsumption_resolution,[],[f994,f380]) ).
fof(f996,plain,
( ~ strictly_less_than(sK2,sK3)
| sK1 = sK4 ),
inference(forward_subsumption_resolution,[],[f993,f398]) ).
fof(f997,plain,
sK2 = sK5,
inference(forward_subsumption_resolution,[],[f995,f36]) ).
fof(f998,plain,
sK1 = sK4,
inference(forward_subsumption_resolution,[],[f996,f36]) ).
fof(f1027,plain,
! [X0] :
( ~ pair_in_list(update_slb(insert_slb(sK0,pair(sK1,X0)),sK3),sK1,sK3)
| ~ strictly_less_than(X0,sK3)
| ~ strictly_less_than(sK5,sK3) ),
inference(superposition,[],[f450,f998]) ).
fof(f1032,plain,
! [X0] :
( ~ strictly_less_than(X0,sK3)
| ~ strictly_less_than(sK5,sK3) ),
inference(forward_subsumption_resolution,[],[f1027,f110]) ).
fof(f1033,plain,
! [X0] :
( ~ strictly_less_than(sK2,sK3)
| ~ strictly_less_than(X0,sK3) ),
inference(forward_demodulation,[],[f1032,f997]) ).
fof(f1034,plain,
! [X0] : ~ strictly_less_than(X0,sK3),
inference(forward_subsumption_resolution,[],[f1033,f36]) ).
fof(f1052,plain,
$false,
inference(resolution,[],[f1034,f36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV403+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n011.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 10:50:30 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running first-order theorem proving
% 0.08/0.22 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.72/0.91 % (3314967)Detected formulas, will run a generic FOF schedule.
% 2.72/0.91 % (3315015)dis-21_1_sil=8000:lcm=predicate:random_seed=2429091416: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)
% 2.72/0.91 % (3315015)Instruction limit reached!
% 2.72/0.91 % (3315015)------------------------------
% 2.72/0.91 % (3315015)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.72/0.91 % (3315015)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.72/0.91 % (3315015)CaDiCaL version: 2.1.3
% 2.72/0.91 % (3315015)Termination reason: Instruction limit
% 2.72/0.91 % (3315015)Termination phase: Saturation
% 2.72/0.91 % (3315015)Time elapsed: 0.030 s
% 2.72/0.91 % (3315015)Peak memory usage: 88 MB
% 2.72/0.91 % (3315015)Instructions burned: 129 (million)
% 2.72/0.91 % (3315012)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2833713783:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.72/0.91 % (3315011)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1487726898:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.72/0.91 % (3315008)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=2538812723:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.72/0.91 % (3315010)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=3243587276:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.72/0.91 % (3315007)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=4238893831:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.72/0.91 % (3315013)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1213274514:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.72/0.91 % (3315011)Refutation not found, incomplete strategy
% 2.72/0.91 % (3315011)------------------------------
% 2.72/0.91 % (3315011)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.72/0.91 % (3315011)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.72/0.91 % (3315011)CaDiCaL version: 2.1.3
% 2.72/0.91 % (3315011)Termination reason: Refutation not found, incomplete strategy
% 2.72/0.91 % (3315011)Time elapsed: 0.003 s
% 2.72/0.91 % (3315011)Peak memory usage: 88 MB
% 2.72/0.91 % (3315011)Instructions burned: 2 (million)
% 2.72/0.91 % (3315012)First to succeed.
% 2.72/0.91 % (3315012)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3314967"
% 2.72/0.91 % (3315013)Also succeeded, but the first one will report.
% 2.72/0.91 % (3315069)lrs+10_1_sil=8000:sp=occurrence:random_seed=1926760445:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.72/0.91 % (3315069)Also succeeded, but the first one will report.
% 2.72/0.91 % (3315011)------------------------------
% 2.72/0.91 % (3315011)------------------------------
% 2.72/0.91 % (3315012)Refutation found. Thanks to Tanya!
% 2.72/0.91 % SZS status Theorem for theBenchmark
% 2.72/0.91 % SZS output start Proof for theBenchmark
% See solution above
% 3.73/1.11 % (3315012)------------------------------
% 3.73/1.11 % (3315012)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.73/1.11 % (3315012)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.73/1.11 % (3315012)CaDiCaL version: 2.1.3
% 3.73/1.11 % (3315012)Termination reason: Refutation
% 3.73/1.11 % (3315012)Time elapsed: 0.037 s
% 3.73/1.11 % (3315012)Peak memory usage: 88 MB
% 3.73/1.11 % (3315012)Instructions burned: 67 (million)
% 3.73/1.11 % (3315012)------------------------------
% 3.73/1.11 % (3315012)------------------------------
% 3.73/1.11 % (3314967)Success in time 0.48 s
% 3.73/1.11 % Vampire exiting
%------------------------------------------------------------------------------