TSTP Solution File: DAT033_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT033_1 : TPTP v8.2.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 19:49:23 EDT 2024
% Result : Theorem 0.62s 0.82s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 31
% Syntax : Number of formulae : 90 ( 14 unt; 15 typ; 0 def)
% Number of atoms : 154 ( 71 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 138 ( 59 ~; 60 |; 7 &)
% ( 9 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number arithmetic : 108 ( 0 atm; 22 fun; 68 num; 18 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 20 ( 13 usr; 14 con; 0-2 aty)
% Number of variables : 38 ( 36 !; 2 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
collection: $tType ).
tff(func_def_0,type,
empty: collection ).
tff(func_def_1,type,
add: ( $int * collection ) > collection ).
tff(func_def_2,type,
remove: ( $int * collection ) > collection ).
tff(func_def_3,type,
count: collection > $int ).
tff(func_def_11,type,
sK0: collection ).
tff(func_def_12,type,
sF1: collection ).
tff(func_def_13,type,
sF2: $int ).
tff(func_def_14,type,
sF3: collection ).
tff(func_def_15,type,
sF4: $int ).
tff(func_def_16,type,
sF5: collection ).
tff(func_def_17,type,
sF6: $int ).
tff(func_def_18,type,
sF7: collection ).
tff(func_def_19,type,
sF8: $int ).
tff(pred_def_1,type,
in: ( $int * collection ) > $o ).
tff(f324,plain,
$false,
inference(avatar_sat_refutation,[],[f170,f197,f280,f321]) ).
tff(f321,plain,
( spl9_3
| ~ spl9_1 ),
inference(avatar_split_clause,[],[f320,f107,f116]) ).
tff(f116,plain,
( spl9_3
<=> in(3,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_3])]) ).
tff(f107,plain,
( spl9_1
<=> in(5,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).
tff(f320,plain,
( in(3,sK0)
| ~ spl9_1 ),
inference(subsumption_resolution,[],[f319,f82]) ).
tff(f82,plain,
sF6 = sF8,
inference(definition_folding,[],[f51,f81,f80,f79,f78]) ).
tff(f78,plain,
add(5,sK0) = sF5,
introduced(function_definition,[new_symbols(definition,[sF5])]) ).
tff(f79,plain,
count(sF5) = sF6,
introduced(function_definition,[new_symbols(definition,[sF6])]) ).
tff(f80,plain,
add(3,sK0) = sF7,
introduced(function_definition,[new_symbols(definition,[sF7])]) ).
tff(f81,plain,
count(sF7) = sF8,
introduced(function_definition,[new_symbols(definition,[sF8])]) ).
tff(f51,plain,
count(add(5,sK0)) = count(add(3,sK0)),
inference(cnf_transformation,[],[f42]) ).
tff(f42,plain,
( ( count(remove(5,sK0)) != count(remove(3,sK0)) )
& ( count(add(5,sK0)) = count(add(3,sK0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f39,f41]) ).
tff(f41,plain,
( ? [X0: collection] :
( ( count(remove(5,X0)) != count(remove(3,X0)) )
& ( count(add(5,X0)) = count(add(3,X0)) ) )
=> ( ( count(remove(5,sK0)) != count(remove(3,sK0)) )
& ( count(add(5,sK0)) = count(add(3,sK0)) ) ) ),
introduced(choice_axiom,[]) ).
tff(f39,plain,
? [X0: collection] :
( ( count(remove(5,X0)) != count(remove(3,X0)) )
& ( count(add(5,X0)) = count(add(3,X0)) ) ),
inference(ennf_transformation,[],[f14]) ).
tff(f14,negated_conjecture,
~ ! [X0: collection] :
( ( count(add(5,X0)) = count(add(3,X0)) )
=> ( count(remove(5,X0)) = count(remove(3,X0)) ) ),
inference(negated_conjecture,[],[f13]) ).
tff(f13,conjecture,
! [X0: collection] :
( ( count(add(5,X0)) = count(add(3,X0)) )
=> ( count(remove(5,X0)) = count(remove(3,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f319,plain,
( ( sF6 != sF8 )
| in(3,sK0)
| ~ spl9_1 ),
inference(forward_demodulation,[],[f318,f81]) ).
tff(f318,plain,
( ( sF6 != count(sF7) )
| in(3,sK0)
| ~ spl9_1 ),
inference(forward_demodulation,[],[f129,f304]) ).
tff(f304,plain,
( ( sF6 = count(sK0) )
| ~ spl9_1 ),
inference(forward_demodulation,[],[f303,f79]) ).
tff(f303,plain,
( ( count(sF5) = count(sK0) )
| ~ spl9_1 ),
inference(subsumption_resolution,[],[f124,f108]) ).
tff(f108,plain,
( in(5,sK0)
| ~ spl9_1 ),
inference(avatar_component_clause,[],[f107]) ).
tff(f124,plain,
( ( count(sF5) = count(sK0) )
| ~ in(5,sK0) ),
inference(superposition,[],[f54,f78]) ).
tff(f54,plain,
! [X0: $int,X1: collection] :
( ( count(add(X0,X1)) = count(X1) )
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
tff(f43,plain,
! [X0: $int,X1: collection] :
( ( in(X0,X1)
| ( count(add(X0,X1)) != count(X1) ) )
& ( ( count(add(X0,X1)) = count(X1) )
| ~ in(X0,X1) ) ),
inference(nnf_transformation,[],[f30]) ).
tff(f30,plain,
! [X0: $int,X1: collection] :
( in(X0,X1)
<=> ( count(add(X0,X1)) = count(X1) ) ),
inference(rectify,[],[f9]) ).
tff(f9,axiom,
! [X15: $int,X16: collection] :
( in(X15,X16)
<=> ( count(add(X15,X16)) = count(X16) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
tff(f129,plain,
( ( count(sF7) != count(sK0) )
| in(3,sK0) ),
inference(superposition,[],[f55,f80]) ).
tff(f55,plain,
! [X0: $int,X1: collection] :
( ( count(add(X0,X1)) != count(X1) )
| in(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
tff(f280,plain,
( ~ spl9_1
| ~ spl9_3 ),
inference(avatar_contradiction_clause,[],[f279]) ).
tff(f279,plain,
( $false
| ~ spl9_1
| ~ spl9_3 ),
inference(subsumption_resolution,[],[f275,f77]) ).
tff(f77,plain,
sF2 != sF4,
inference(definition_folding,[],[f52,f76,f75,f74,f73]) ).
tff(f73,plain,
remove(5,sK0) = sF1,
introduced(function_definition,[new_symbols(definition,[sF1])]) ).
tff(f74,plain,
count(sF1) = sF2,
introduced(function_definition,[new_symbols(definition,[sF2])]) ).
tff(f75,plain,
remove(3,sK0) = sF3,
introduced(function_definition,[new_symbols(definition,[sF3])]) ).
tff(f76,plain,
count(sF3) = sF4,
introduced(function_definition,[new_symbols(definition,[sF4])]) ).
tff(f52,plain,
count(remove(5,sK0)) != count(remove(3,sK0)),
inference(cnf_transformation,[],[f42]) ).
tff(f275,plain,
( ( sF2 = sF4 )
| ~ spl9_1
| ~ spl9_3 ),
inference(superposition,[],[f76,f272]) ).
tff(f272,plain,
( ( sF2 = count(sF3) )
| ~ spl9_1
| ~ spl9_3 ),
inference(forward_demodulation,[],[f271,f269]) ).
tff(f269,plain,
( ( sF2 = $sum(-1,sF6) )
| ~ spl9_1
| ~ spl9_3 ),
inference(forward_demodulation,[],[f268,f74]) ).
tff(f268,plain,
( ( count(sF1) = $sum(-1,sF6) )
| ~ spl9_1
| ~ spl9_3 ),
inference(forward_demodulation,[],[f267,f181]) ).
tff(f181,plain,
( ( sF6 = count(sK0) )
| ~ spl9_3 ),
inference(forward_demodulation,[],[f180,f82]) ).
tff(f180,plain,
( ( sF8 = count(sK0) )
| ~ spl9_3 ),
inference(forward_demodulation,[],[f179,f81]) ).
tff(f179,plain,
( ( count(sF7) = count(sK0) )
| ~ spl9_3 ),
inference(subsumption_resolution,[],[f125,f117]) ).
tff(f117,plain,
( in(3,sK0)
| ~ spl9_3 ),
inference(avatar_component_clause,[],[f116]) ).
tff(f125,plain,
( ( count(sF7) = count(sK0) )
| ~ in(3,sK0) ),
inference(superposition,[],[f54,f80]) ).
tff(f267,plain,
( ( count(sF1) = $sum(-1,count(sK0)) )
| ~ spl9_1 ),
inference(subsumption_resolution,[],[f259,f108]) ).
tff(f259,plain,
( ( count(sF1) = $sum(-1,count(sK0)) )
| ~ in(5,sK0) ),
inference(superposition,[],[f88,f73]) ).
tff(f88,plain,
! [X0: $int,X1: collection] :
( ( count(remove(X0,X1)) = $sum(-1,count(X1)) )
| ~ in(X0,X1) ),
inference(forward_demodulation,[],[f83,f17]) ).
tff(f17,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_135,[]) ).
tff(f83,plain,
! [X0: $int,X1: collection] :
( ( count(remove(X0,X1)) = $sum(count(X1),-1) )
| ~ in(X0,X1) ),
inference(evaluation,[],[f64]) ).
tff(f64,plain,
! [X0: $int,X1: collection] :
( ( count(remove(X0,X1)) = $sum(count(X1),$uminus(1)) )
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
tff(f48,plain,
! [X0: $int,X1: collection] :
( ( in(X0,X1)
| ( count(remove(X0,X1)) != $sum(count(X1),$uminus(1)) ) )
& ( ( count(remove(X0,X1)) = $sum(count(X1),$uminus(1)) )
| ~ in(X0,X1) ) ),
inference(nnf_transformation,[],[f35]) ).
tff(f35,plain,
! [X0: $int,X1: collection] :
( in(X0,X1)
<=> ( count(remove(X0,X1)) = $sum(count(X1),$uminus(1)) ) ),
inference(rectify,[],[f16]) ).
tff(f16,plain,
! [X17: $int,X18: collection] :
( in(X17,X18)
<=> ( count(remove(X17,X18)) = $sum(count(X18),$uminus(1)) ) ),
inference(theory_normalization,[],[f10]) ).
tff(f10,axiom,
! [X17: $int,X18: collection] :
( in(X17,X18)
<=> ( count(remove(X17,X18)) = $difference(count(X18),1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
tff(f271,plain,
( ( count(sF3) = $sum(-1,sF6) )
| ~ spl9_3 ),
inference(forward_demodulation,[],[f270,f181]) ).
tff(f270,plain,
( ( count(sF3) = $sum(-1,count(sK0)) )
| ~ spl9_3 ),
inference(subsumption_resolution,[],[f260,f117]) ).
tff(f260,plain,
( ( count(sF3) = $sum(-1,count(sK0)) )
| ~ in(3,sK0) ),
inference(superposition,[],[f88,f75]) ).
tff(f197,plain,
( spl9_1
| ~ spl9_3 ),
inference(avatar_split_clause,[],[f196,f116,f107]) ).
tff(f196,plain,
( in(5,sK0)
| ~ spl9_3 ),
inference(subsumption_resolution,[],[f195,f79]) ).
tff(f195,plain,
( ( count(sF5) != sF6 )
| in(5,sK0)
| ~ spl9_3 ),
inference(forward_demodulation,[],[f128,f181]) ).
tff(f128,plain,
( ( count(sF5) != count(sK0) )
| in(5,sK0) ),
inference(superposition,[],[f55,f78]) ).
tff(f170,plain,
( spl9_3
| spl9_1 ),
inference(avatar_split_clause,[],[f169,f107,f116]) ).
tff(f169,plain,
( in(3,sK0)
| spl9_1 ),
inference(subsumption_resolution,[],[f168,f77]) ).
tff(f168,plain,
( ( sF2 = sF4 )
| in(3,sK0)
| spl9_1 ),
inference(forward_demodulation,[],[f167,f76]) ).
tff(f167,plain,
( ( sF2 = count(sF3) )
| in(3,sK0)
| spl9_1 ),
inference(forward_demodulation,[],[f138,f141]) ).
tff(f141,plain,
( ( sF2 = count(sK0) )
| spl9_1 ),
inference(forward_demodulation,[],[f140,f74]) ).
tff(f140,plain,
( ( count(sF1) = count(sK0) )
| spl9_1 ),
inference(subsumption_resolution,[],[f137,f109]) ).
tff(f109,plain,
( ~ in(5,sK0)
| spl9_1 ),
inference(avatar_component_clause,[],[f107]) ).
tff(f137,plain,
( ( count(sF1) = count(sK0) )
| in(5,sK0) ),
inference(superposition,[],[f62,f73]) ).
tff(f62,plain,
! [X0: $int,X1: collection] :
( ( count(X1) = count(remove(X0,X1)) )
| in(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
tff(f47,plain,
! [X0: $int,X1: collection] :
( ( ~ in(X0,X1)
| ( count(X1) != count(remove(X0,X1)) ) )
& ( ( count(X1) = count(remove(X0,X1)) )
| in(X0,X1) ) ),
inference(nnf_transformation,[],[f34]) ).
tff(f34,plain,
! [X0: $int,X1: collection] :
( ~ in(X0,X1)
<=> ( count(X1) = count(remove(X0,X1)) ) ),
inference(rectify,[],[f11]) ).
tff(f11,axiom,
! [X19: $int,X20: collection] :
( ~ in(X19,X20)
<=> ( count(remove(X19,X20)) = count(X20) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).
tff(f138,plain,
( ( count(sF3) = count(sK0) )
| in(3,sK0) ),
inference(superposition,[],[f62,f75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : DAT033_1 : TPTP v8.2.0. Released v5.0.0.
% 0.15/0.17 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.17/0.39 % Computer : n014.cluster.edu
% 0.17/0.39 % Model : x86_64 x86_64
% 0.17/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.39 % Memory : 8042.1875MB
% 0.17/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.39 % CPULimit : 300
% 0.17/0.39 % WCLimit : 300
% 0.17/0.39 % DateTime : Sun May 19 23:30:38 EDT 2024
% 0.17/0.39 % CPUTime :
% 0.17/0.39 This is a TF0_THM_EQU_ARI problem
% 0.17/0.39 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.62/0.80 % (21660)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.62/0.80 % (21661)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2995ds/83Mi)
% 0.62/0.80 % (21662)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.62/0.80 % (21655)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2995ds/34Mi)
% 0.62/0.80 % (21656)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2995ds/51Mi)
% 0.62/0.80 % (21660)Refutation not found, incomplete strategy% (21660)------------------------------
% 0.62/0.80 % (21660)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.80 % (21660)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.80
% 0.62/0.80 % (21660)Memory used [KB]: 1086
% 0.62/0.80 % (21662)Refutation not found, incomplete strategy% (21662)------------------------------
% 0.62/0.80 % (21662)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.80 % (21662)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.80
% 0.62/0.80 % (21662)Memory used [KB]: 1073
% 0.62/0.80 % (21662)Time elapsed: 0.003 s
% 0.62/0.80 % (21662)Instructions burned: 3 (million)
% 0.62/0.80 % (21660)Time elapsed: 0.003 s
% 0.62/0.80 % (21660)Instructions burned: 4 (million)
% 0.62/0.80 % (21660)------------------------------
% 0.62/0.80 % (21660)------------------------------
% 0.62/0.80 % (21662)------------------------------
% 0.62/0.80 % (21662)------------------------------
% 0.62/0.81 % (21655)Refutation not found, incomplete strategy% (21655)------------------------------
% 0.62/0.81 % (21655)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.81 % (21655)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.81
% 0.62/0.81 % (21655)Memory used [KB]: 1095
% 0.62/0.81 % (21655)Time elapsed: 0.005 s
% 0.62/0.81 % (21655)Instructions burned: 5 (million)
% 0.62/0.81 % (21655)------------------------------
% 0.62/0.81 % (21655)------------------------------
% 0.62/0.81 % (21658)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.62/0.81 % (21659)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2995ds/34Mi)
% 0.62/0.81 % (21663)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2995ds/55Mi)
% 0.62/0.81 % (21664)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2995ds/50Mi)
% 0.62/0.81 % (21664)Refutation not found, incomplete strategy% (21664)------------------------------
% 0.62/0.81 % (21664)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.81 % (21664)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.81
% 0.62/0.81 % (21664)Memory used [KB]: 1068
% 0.62/0.81 % (21664)Time elapsed: 0.004 s
% 0.62/0.81 % (21664)Instructions burned: 4 (million)
% 0.62/0.81 % (21664)------------------------------
% 0.62/0.81 % (21664)------------------------------
% 0.62/0.81 % (21665)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2995ds/208Mi)
% 0.62/0.81 % (21657)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.62/0.81 % (21666)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on theBenchmark for (2995ds/52Mi)
% 0.62/0.82 % (21658)Instruction limit reached!
% 0.62/0.82 % (21658)------------------------------
% 0.62/0.82 % (21658)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.82 % (21658)Termination reason: Unknown
% 0.62/0.82 % (21658)Termination phase: Saturation
% 0.62/0.82
% 0.62/0.82 % (21658)Memory used [KB]: 1549
% 0.62/0.82 % (21658)Time elapsed: 0.013 s
% 0.62/0.82 % (21658)Instructions burned: 33 (million)
% 0.62/0.82 % (21658)------------------------------
% 0.62/0.82 % (21658)------------------------------
% 0.62/0.82 % (21665)First to succeed.
% 0.62/0.82 % (21665)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-21654"
% 0.62/0.82 % (21667)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on theBenchmark for (2995ds/518Mi)
% 0.62/0.82 % (21665)Refutation found. Thanks to Tanya!
% 0.62/0.82 % SZS status Theorem for theBenchmark
% 0.62/0.82 % SZS output start Proof for theBenchmark
% See solution above
% 0.62/0.82 % (21665)------------------------------
% 0.62/0.82 % (21665)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.82 % (21665)Termination reason: Refutation
% 0.62/0.82
% 0.62/0.82 % (21665)Memory used [KB]: 1133
% 0.62/0.82 % (21665)Time elapsed: 0.011 s
% 0.62/0.82 % (21665)Instructions burned: 15 (million)
% 0.62/0.82 % (21654)Success in time 0.423 s
% 0.62/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------