%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : COM237_1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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 09:39:51 AM UTC 2026
% Result : Theorem 2.93s 1.13s
% Output : Refutation 3.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 62 ( 20 unt; 0 typ; 8 def)
% Number of atoms : 187 ( 74 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 205 ( 80 ~; 91 |; 26 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 23 ( 21 usr; 5 prp; 0-3 aty)
% Number of functors : 42 ( 42 usr; 10 con; 0-3 aty)
% Number of variables : 29 ( 0 sgn 23 !; 6 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
vTerm: $tType ).
tff(type_def_6,type,
vOptTerm: $tType ).
tff(type_def_7,type,
vTy: $tType ).
tff(func_def_0,type,
vNat: vTy ).
tff(func_def_1,type,
vSucc: vTerm > vTerm ).
tff(func_def_2,type,
vPred: vTerm > vTerm ).
tff(func_def_3,type,
vsomeTerm: vTerm > vOptTerm ).
tff(func_def_4,type,
vZero: vTerm ).
tff(func_def_5,type,
vIszero: vTerm > vTerm ).
tff(func_def_6,type,
vTrue: vTerm ).
tff(func_def_7,type,
vFalse: vTerm ).
tff(func_def_8,type,
vnoTerm: vOptTerm ).
tff(func_def_9,type,
vPlus: ( vTerm * vTerm ) > vTerm ).
tff(func_def_10,type,
vB: vTy ).
tff(func_def_11,type,
vIfelse: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_12,type,
vt1: vTerm ).
tff(func_def_13,type,
vreduce: vTerm > vOptTerm ).
tff(func_def_14,type,
vplusop: ( vTerm * vTerm ) > vTerm ).
tff(func_def_15,type,
vgetTerm: vOptTerm > vTerm ).
tff(func_def_16,type,
sK1: vTy ).
tff(func_def_17,type,
sK2: vTerm > vTerm ).
tff(func_def_18,type,
sK3: vTerm > vTerm ).
tff(func_def_19,type,
sK4: vTerm > vTerm ).
tff(func_def_20,type,
sK5: vTerm > vTerm ).
tff(func_def_21,type,
sK6: vTerm > vTerm ).
tff(func_def_22,type,
sK7: vTerm > vTerm ).
tff(func_def_23,type,
sK8: vTerm > vTerm ).
tff(func_def_24,type,
sK9: vTerm > vTerm ).
tff(func_def_25,type,
sK10: vTerm > vTerm ).
tff(func_def_26,type,
sK11: vTerm > vTerm ).
tff(func_def_27,type,
sK12: vTerm > vTerm ).
tff(func_def_28,type,
sK13: vTerm > vTerm ).
tff(func_def_29,type,
sK14: vTerm > vTerm ).
tff(func_def_30,type,
sK15: vTerm > vTerm ).
tff(func_def_31,type,
sK16: vTerm > vTerm ).
tff(func_def_32,type,
sK17: vTerm > vTerm ).
tff(func_def_33,type,
sK18: vTerm > vTerm ).
tff(func_def_34,type,
sK19: vTerm > vTerm ).
tff(func_def_35,type,
sK20: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_36,type,
sK21: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_37,type,
sK22: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_38,type,
sK23: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_39,type,
sK24: vOptTerm > vTerm ).
tff(func_def_40,type,
sK25: vTerm ).
tff(func_def_41,type,
sK26: vTerm ).
tff(pred_def_1,type,
visValue: vTerm > $o ).
tff(pred_def_2,type,
visNV: vTerm > $o ).
tff(pred_def_3,type,
visSomeTerm: vOptTerm > $o ).
tff(pred_def_4,type,
vptchecksimple: ( vTerm * vTy ) > $o ).
tff(pred_def_5,type,
sP0: ( vTerm * vTerm * vTerm ) > $o ).
tff(pred_def_6,type,
sP27: vTerm > $o ).
tff(pred_def_7,type,
sP28: vTerm > $o ).
tff(pred_def_8,type,
sP29: vTerm > $o ).
tff(pred_def_9,type,
sP30: vTerm > $o ).
tff(pred_def_10,type,
sP31: vTerm > $o ).
tff(pred_def_11,type,
sP32: vTerm > $o ).
tff(pred_def_12,type,
sP33: vTerm > $o ).
tff(pred_def_13,type,
sP34: vTerm > $o ).
tff(pred_def_14,type,
sP35: vOptTerm > $o ).
tff(pred_def_15,type,
sP36: vOptTerm > $o ).
tff(pred_def_16,type,
sP37: vOptTerm > $o ).
tff(pred_def_17,type,
sP38: vOptTerm > $o ).
tff(f106,axiom,
! [X0: vTy] :
( ( visSomeTerm(vreduce(vt1))
& ( vt1 != vZero )
& ! [X1: vTerm] : ( vt1 != vSucc(X1) )
& vptchecksimple(vPred(vt1),X0)
& ~ visValue(vPred(vt1)) )
=> ( vreduce(vPred(vt1)) != vnoTerm ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Progress-Pred-t1-isSomeTerm-True') ).
tff(f107,axiom,
! [X0: vTy] :
( ( ~ visSomeTerm(vreduce(vt1))
& ( vt1 != vZero )
& ! [X1: vTerm] : ( vt1 != vSucc(X1) )
& vptchecksimple(vPred(vt1),X0)
& ~ visValue(vPred(vt1)) )
=> ( vreduce(vPred(vt1)) != vnoTerm ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Progress-Pred-t1-isSomeTerm-False') ).
tff(f108,conjecture,
! [X0: vTy] :
( ( ( vt1 != vZero )
& ! [X1: vTerm] : ( vt1 != vSucc(X1) )
& vptchecksimple(vPred(vt1),X0)
& ~ visValue(vPred(vt1)) )
=> ( vreduce(vPred(vt1)) != vnoTerm ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Progress-Pred-t1') ).
tff(f109,negated_conjecture,
~ ! [X0: vTy] :
( ( ( vt1 != vZero )
& ! [X1: vTerm] : ( vt1 != vSucc(X1) )
& vptchecksimple(vPred(vt1),X0)
& ~ visValue(vPred(vt1)) )
=> ( vreduce(vPred(vt1)) != vnoTerm ) ),
inference(negated_conjecture,[status(cth)],[f108]) ).
tff(f111,plain,
? [X0: vTy] :
( ( vnoTerm = vreduce(vPred(vt1)) )
& ( vt1 != vZero )
& ! [X1: vTerm] : ( vt1 != vSucc(X1) )
& vptchecksimple(vPred(vt1),X0)
& ~ visValue(vPred(vt1)) ),
inference(ennf_transformation,[],[f109]) ).
tff(f112,plain,
? [X0: vTy] :
( ( vnoTerm = vreduce(vPred(vt1)) )
& ( vt1 != vZero )
& ! [X1: vTerm] : ( vt1 != vSucc(X1) )
& vptchecksimple(vPred(vt1),X0)
& ~ visValue(vPred(vt1)) ),
inference(flattening,[],[f111]) ).
tff(f138,plain,
! [X0: vTy] :
( ( vreduce(vPred(vt1)) != vnoTerm )
| visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ? [X1: vTerm] : ( vSucc(X1) = vt1 )
| ~ vptchecksimple(vPred(vt1),X0)
| visValue(vPred(vt1)) ),
inference(ennf_transformation,[],[f107]) ).
tff(f139,plain,
! [X0: vTy] :
( ( vreduce(vPred(vt1)) != vnoTerm )
| visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ? [X1: vTerm] : ( vSucc(X1) = vt1 )
| ~ vptchecksimple(vPred(vt1),X0)
| visValue(vPred(vt1)) ),
inference(flattening,[],[f138]) ).
tff(f140,plain,
! [X0: vTy] :
( ( vreduce(vPred(vt1)) != vnoTerm )
| ~ visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ? [X1: vTerm] : ( vSucc(X1) = vt1 )
| ~ vptchecksimple(vPred(vt1),X0)
| visValue(vPred(vt1)) ),
inference(ennf_transformation,[],[f106]) ).
tff(f141,plain,
! [X0: vTy] :
( ( vreduce(vPred(vt1)) != vnoTerm )
| ~ visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ? [X1: vTerm] : ( vSucc(X1) = vt1 )
| ~ vptchecksimple(vPred(vt1),X0)
| visValue(vPred(vt1)) ),
inference(flattening,[],[f140]) ).
tff(f146,plain,
( ( vnoTerm = vreduce(vPred(vt1)) )
& ( vt1 != vZero )
& ! [X1: vTerm] : ( vt1 != vSucc(X1) )
& vptchecksimple(vPred(vt1),sK1)
& ~ visValue(vPred(vt1)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f112]) ).
tff(f158,plain,
! [X0: vTy] :
( ( vreduce(vPred(vt1)) != vnoTerm )
| visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK25) )
| ~ vptchecksimple(vPred(vt1),X0)
| visValue(vPred(vt1)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK25]),skolemize(X1,sK25)],[f139]) ).
tff(f159,plain,
! [X0: vTy] :
( ( vreduce(vPred(vt1)) != vnoTerm )
| ~ visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK26) )
| ~ vptchecksimple(vPred(vt1),X0)
| visValue(vPred(vt1)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK26]),skolemize(X1,sK26)],[f141]) ).
tff(f160,plain,
~ visValue(vPred(vt1)),
inference(cnf_transformation,[],[f146]) ).
tff(f161,plain,
vptchecksimple(vPred(vt1),sK1),
inference(cnf_transformation,[],[f146]) ).
tff(f162,plain,
! [X1: vTerm] : ( vSucc(X1) != vt1 ),
inference(cnf_transformation,[],[f146]) ).
tff(f163,plain,
vZero != vt1,
inference(cnf_transformation,[],[f146]) ).
tff(f164,plain,
vnoTerm = vreduce(vPred(vt1)),
inference(cnf_transformation,[],[f146]) ).
tff(f200,plain,
! [X0: vTy] :
( ( vnoTerm != vreduce(vPred(vt1)) )
| visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK25) )
| ~ vptchecksimple(vPred(vt1),X0)
| visValue(vPred(vt1)) ),
inference(cnf_transformation,[],[f158]) ).
tff(f201,plain,
! [X0: vTy] :
( ( vnoTerm != vreduce(vPred(vt1)) )
| ~ visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK26) )
| ~ vptchecksimple(vPred(vt1),X0)
| visValue(vPred(vt1)) ),
inference(cnf_transformation,[],[f159]) ).
tff(f203,definition,
~ sP27(vZero),
introduced(definition,[new_symbols(definition,[sP27])],[inequality_splitting_name_introduction]) ).
tff(f204,plain,
sP27(vt1),
inference(inequality_splitting,[],[f163,f203]) ).
tff(f205,definition,
~ sP28(vt1),
introduced(definition,[new_symbols(definition,[sP28])],[inequality_splitting_name_introduction]) ).
tff(f206,plain,
! [X1: vTerm] : sP28(vSucc(X1)),
inference(inequality_splitting,[],[f162,f205]) ).
tff(f221,definition,
~ sP36(vnoTerm),
introduced(definition,[new_symbols(definition,[sP36])],[inequality_splitting_name_introduction]) ).
tff(f222,plain,
! [X0: vTy] :
( ~ vptchecksimple(vPred(vt1),X0)
| visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK25) )
| sP36(vreduce(vPred(vt1)))
| visValue(vPred(vt1)) ),
inference(inequality_splitting,[],[f200,f221]) ).
tff(f223,definition,
~ sP37(vnoTerm),
introduced(definition,[new_symbols(definition,[sP37])],[inequality_splitting_name_introduction]) ).
tff(f224,plain,
! [X0: vTy] :
( ~ vptchecksimple(vPred(vt1),X0)
| ~ visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK26) )
| sP37(vreduce(vPred(vt1)))
| visValue(vPred(vt1)) ),
inference(inequality_splitting,[],[f201,f223]) ).
tff(f227,plain,
( ~ visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK26) )
| sP37(vreduce(vPred(vt1)))
| visValue(vPred(vt1)) ),
inference(resolution,[],[f161,f224]) ).
tff(f228,plain,
( visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK25) )
| sP36(vreduce(vPred(vt1)))
| visValue(vPred(vt1)) ),
inference(resolution,[],[f161,f222]) ).
tff(f229,plain,
( visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK25) )
| sP36(vreduce(vPred(vt1))) ),
inference(forward_subsumption_resolution,[],[f228,f160]) ).
tff(f230,plain,
( ~ visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK26) )
| sP37(vreduce(vPred(vt1))) ),
inference(forward_subsumption_resolution,[],[f227,f160]) ).
tff(f231,plain,
( sP36(vnoTerm)
| visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK25) ) ),
inference(forward_demodulation,[],[f229,f164]) ).
tff(f232,plain,
( sP37(vnoTerm)
| ~ visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK26) ) ),
inference(forward_demodulation,[],[f230,f164]) ).
tff(f233,plain,
( visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK25) ) ),
inference(forward_subsumption_resolution,[],[f231,f221]) ).
tff(f234,plain,
( ~ visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK26) ) ),
inference(forward_subsumption_resolution,[],[f232,f223]) ).
tff(f236,definition,
( spl39_1
<=> ( vt1 = vSucc(sK25) ) ),
introduced(definition,[new_symbols(definition,[spl39_1])],[avatar_definition]) ).
tff(f238,plain,
( ( vt1 = vSucc(sK25) )
| ~ spl39_1 ),
inference(avatar_component_clause,[],[f236]) ).
tff(f240,definition,
( spl39_2
<=> ( vZero = vt1 ) ),
introduced(definition,[new_symbols(definition,[spl39_2])],[avatar_definition]) ).
tff(f242,plain,
( ( vZero = vt1 )
| ~ spl39_2 ),
inference(avatar_component_clause,[],[f240]) ).
tff(f244,definition,
( spl39_3
<=> visSomeTerm(vreduce(vt1)) ),
introduced(definition,[new_symbols(definition,[spl39_3])],[avatar_definition]) ).
tff(f247,plain,
( spl39_1
| spl39_2
| spl39_3 ),
inference(avatar_split_clause,[],[f233,f244,f240,f236]) ).
tff(f249,definition,
( spl39_4
<=> ( vt1 = vSucc(sK26) ) ),
introduced(definition,[new_symbols(definition,[spl39_4])],[avatar_definition]) ).
tff(f251,plain,
( ( vt1 = vSucc(sK26) )
| ~ spl39_4 ),
inference(avatar_component_clause,[],[f249]) ).
tff(f252,plain,
( spl39_4
| spl39_2
| ~ spl39_3 ),
inference(avatar_split_clause,[],[f234,f244,f240,f249]) ).
tff(f253,plain,
( ~ sP27(vt1)
| ~ spl39_2 ),
inference(superposition,[],[f203,f242]) ).
tff(f256,plain,
( $false
| ~ spl39_2 ),
inference(forward_subsumption_resolution,[],[f253,f204]) ).
tff(f257,plain,
~ spl39_2,
inference(avatar_contradiction_clause,[],[f256]) ).
tff(f264,plain,
( sP28(vt1)
| ~ spl39_4 ),
inference(superposition,[],[f206,f251]) ).
tff(f266,plain,
( $false
| ~ spl39_4 ),
inference(forward_subsumption_resolution,[],[f264,f205]) ).
tff(f267,plain,
~ spl39_4,
inference(avatar_contradiction_clause,[],[f266]) ).
tff(f283,plain,
( sP28(vt1)
| ~ spl39_1 ),
inference(superposition,[],[f206,f238]) ).
tff(f285,plain,
( $false
| ~ spl39_1 ),
inference(forward_subsumption_resolution,[],[f283,f205]) ).
tff(f286,plain,
~ spl39_1,
inference(avatar_contradiction_clause,[],[f285]) ).
cnf(s1,plain,
( spl39_1
| spl39_2
| spl39_3 ),
inference(sat_conversion,[],[f247]) ).
cnf(s2,plain,
( spl39_2
| ~ spl39_3
| spl39_4 ),
inference(sat_conversion,[],[f252]) ).
cnf(s3,plain,
~ spl39_2,
inference(sat_conversion,[],[f257]) ).
cnf(s4,plain,
~ spl39_4,
inference(sat_conversion,[],[f267]) ).
cnf(s6,plain,
~ spl39_1,
inference(sat_conversion,[],[f286]) ).
cnf(s9,plain,
~ spl39_3,
inference(rat,[],[s2,s4,s3]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s1,s9,s3,s6]) ).
tff(f302,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM237_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.20 % Computer : n004.cluster.edu
% 0.11/0.20 % Model : x86_64 x86_64
% 0.11/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.20 % Memory : 8046.5625MB
% 0.11/0.20 % OS : Linux 6.8.0-71-generic
% 0.11/0.20 % CPULimit : 300
% 0.11/0.20 % WCLimit : 300
% 0.11/0.20 % DateTime : Mon Sep 28 22:02:37 UTC 2026
% 0.11/0.20 % CPUTime :
% 0.11/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.24 Running first-order theorem proving
% 0.11/0.24 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
% 2.93/1.13 % (834775)Detected formulas, will run a generic FOF schedule.
% 2.93/1.13 % (834782)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=1222986118:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.93/1.13 % (834785)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4028830230:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.93/1.13 % (834781)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=134196297:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.93/1.13 % (834783)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=3299281611:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.93/1.13 % (834784)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1587042274:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.93/1.13 % (834787)dis-21_1_sil=8000:lcm=predicate:random_seed=3799648778: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.93/1.13 % (834786)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=493725468:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.93/1.13 % (834784)First to succeed.
% 2.93/1.13 % (834784)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-834775"
% 2.93/1.13 % (834786)Also succeeded, but the first one will report.
% 2.93/1.13 % (834787)Also succeeded, but the first one will report.
% 2.93/1.13 % (834785)Also succeeded, but the first one will report.
% 2.93/1.13 % (834784)Refutation found. Thanks to Tanya!
% 2.93/1.13 % SZS status Theorem for theBenchmark
% 2.93/1.13 % SZS output start Proof for theBenchmark
% See solution above
% 3.73/1.22 % (834784)------------------------------
% 3.73/1.22 % (834784)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.73/1.22 % (834784)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.73/1.22 % (834784)CaDiCaL version: 2.1.3
% 3.73/1.22 % (834784)Termination reason: Refutation
% 3.73/1.22 % (834784)Time elapsed: 0.006 s
% 3.73/1.22 % (834784)Peak memory usage: 89 MB
% 3.73/1.22 % (834784)Instructions burned: 6 (million)
% 3.73/1.22 % (834784)------------------------------
% 3.73/1.22 % (834784)------------------------------
% 3.73/1.22 % (834775)Success in time 0.451 s
% 3.73/1.22 % Vampire exiting
%------------------------------------------------------------------------------