TSTP Solution File: SWW581_2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWW581_2 : TPTP v8.1.2. Released v6.1.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n023.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 : Sun May 5 11:19:10 EDT 2024
% Result : Theorem 0.61s 0.78s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 40
% Syntax : Number of formulae : 92 ( 32 unt; 25 typ; 0 def)
% Number of atoms : 249 ( 79 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 277 ( 95 ~; 44 |; 104 &)
% ( 3 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 448 ( 148 atm; 96 fun; 126 num; 78 var)
% Number of types : 6 ( 4 usr; 1 ari)
% Number of type conns : 13 ( 7 >; 6 *; 0 +; 0 <<)
% Number of predicates : 8 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 27 ( 20 usr; 17 con; 0-4 aty)
% Number of variables : 78 ( 42 !; 36 ?; 78 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
uni: $tType ).
tff(type_def_6,type,
ty: $tType ).
tff(type_def_7,type,
bool: $tType ).
tff(type_def_8,type,
tuple0: $tType ).
tff(func_def_0,type,
witness: ty > uni ).
tff(func_def_1,type,
int: ty ).
tff(func_def_2,type,
real: ty ).
tff(func_def_3,type,
bool1: ty ).
tff(func_def_4,type,
true: bool ).
tff(func_def_5,type,
false: bool ).
tff(func_def_6,type,
match_bool: ( ty * bool * uni * uni ) > uni ).
tff(func_def_7,type,
tuple01: ty ).
tff(func_def_8,type,
tuple02: tuple0 ).
tff(func_def_9,type,
qtmark: ty ).
tff(func_def_12,type,
fact: $int > $int ).
tff(func_def_15,type,
ref: ty > ty ).
tff(func_def_16,type,
mk_ref: ( ty * uni ) > uni ).
tff(func_def_17,type,
contents: ( ty * uni ) > uni ).
tff(func_def_20,type,
sK0: $int ).
tff(func_def_21,type,
sK1: $int ).
tff(func_def_22,type,
sK2: $int ).
tff(func_def_23,type,
sK3: $int ).
tff(func_def_24,type,
sK4: $int ).
tff(func_def_25,type,
sK5: $int ).
tff(pred_def_1,type,
sort: ( ty * uni ) > $o ).
tff(f317,plain,
$false,
inference(avatar_sat_refutation,[],[f79,f293,f312,f316]) ).
tff(f316,plain,
~ spl6_1,
inference(avatar_contradiction_clause,[],[f315]) ).
tff(f315,plain,
( $false
| ~ spl6_1 ),
inference(subsumption_resolution,[],[f314,f151]) ).
tff(f151,plain,
~ $less($sum(1,sK2),0),
inference(unit_resulting_resolution,[],[f25,f95,f26]) ).
tff(f26,plain,
! [X2: $int,X0: $int,X1: $int] :
( ~ $less(X0,X1)
| ~ $less(X1,X2)
| $less(X0,X2) ),
introduced(theory_axiom_143,[]) ).
tff(f95,plain,
$less(0,$sum(1,sK2)),
inference(forward_demodulation,[],[f86,f20]) ).
tff(f20,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_135,[]) ).
tff(f86,plain,
$less(0,$sum(sK2,1)),
inference(unit_resulting_resolution,[],[f52,f29]) ).
tff(f29,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
| $less(X0,X1) ),
introduced(theory_axiom_147,[]) ).
tff(f52,plain,
~ $less(sK2,0),
inference(cnf_transformation,[],[f50]) ).
tff(f50,plain,
( ( ( sK4 != fact(sK5) )
| $less(sK0,sK5)
| $less(sK5,0) )
& ( $sum(sK2,1) = sK5 )
& $less(sK2,sK3)
& ( sK4 = $product(sK3,fact(sK2)) )
& ~ $less($sum(sK2,1),sK3)
& ~ $less(sK3,1)
& $less(sK2,sK0)
& ( sK1 = fact(sK2) )
& ~ $less(sK0,sK2)
& ~ $less(sK2,0)
& ~ $less(sK0,0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f42,f49,f48,f47,f46]) ).
tff(f46,plain,
( ? [X0: $int] :
( ? [X1: $int,X2: $int] :
( ? [X3: $int,X4: $int] :
( ? [X5: $int] :
( ( ( fact(X5) != X4 )
| $less(X0,X5)
| $less(X5,0) )
& ( $sum(X2,1) = X5 ) )
& $less(X2,X3)
& ( $product(X3,fact(X2)) = X4 )
& ~ $less($sum(X2,1),X3)
& ~ $less(X3,1) )
& $less(X2,X0)
& ( fact(X2) = X1 )
& ~ $less(X0,X2)
& ~ $less(X2,0) )
& ~ $less(X0,0) )
=> ( ? [X2: $int,X1: $int] :
( ? [X4: $int,X3: $int] :
( ? [X5: $int] :
( ( ( fact(X5) != X4 )
| $less(sK0,X5)
| $less(X5,0) )
& ( $sum(X2,1) = X5 ) )
& $less(X2,X3)
& ( $product(X3,fact(X2)) = X4 )
& ~ $less($sum(X2,1),X3)
& ~ $less(X3,1) )
& $less(X2,sK0)
& ( fact(X2) = X1 )
& ~ $less(sK0,X2)
& ~ $less(X2,0) )
& ~ $less(sK0,0) ) ),
introduced(choice_axiom,[]) ).
tff(f47,plain,
( ? [X2: $int,X1: $int] :
( ? [X4: $int,X3: $int] :
( ? [X5: $int] :
( ( ( fact(X5) != X4 )
| $less(sK0,X5)
| $less(X5,0) )
& ( $sum(X2,1) = X5 ) )
& $less(X2,X3)
& ( $product(X3,fact(X2)) = X4 )
& ~ $less($sum(X2,1),X3)
& ~ $less(X3,1) )
& $less(X2,sK0)
& ( fact(X2) = X1 )
& ~ $less(sK0,X2)
& ~ $less(X2,0) )
=> ( ? [X4: $int,X3: $int] :
( ? [X5: $int] :
( ( ( fact(X5) != X4 )
| $less(sK0,X5)
| $less(X5,0) )
& ( $sum(sK2,1) = X5 ) )
& $less(sK2,X3)
& ( $product(X3,fact(sK2)) = X4 )
& ~ $less($sum(sK2,1),X3)
& ~ $less(X3,1) )
& $less(sK2,sK0)
& ( sK1 = fact(sK2) )
& ~ $less(sK0,sK2)
& ~ $less(sK2,0) ) ),
introduced(choice_axiom,[]) ).
tff(f48,plain,
( ? [X4: $int,X3: $int] :
( ? [X5: $int] :
( ( ( fact(X5) != X4 )
| $less(sK0,X5)
| $less(X5,0) )
& ( $sum(sK2,1) = X5 ) )
& $less(sK2,X3)
& ( $product(X3,fact(sK2)) = X4 )
& ~ $less($sum(sK2,1),X3)
& ~ $less(X3,1) )
=> ( ? [X5: $int] :
( ( ( fact(X5) != sK4 )
| $less(sK0,X5)
| $less(X5,0) )
& ( $sum(sK2,1) = X5 ) )
& $less(sK2,sK3)
& ( sK4 = $product(sK3,fact(sK2)) )
& ~ $less($sum(sK2,1),sK3)
& ~ $less(sK3,1) ) ),
introduced(choice_axiom,[]) ).
tff(f49,plain,
( ? [X5: $int] :
( ( ( fact(X5) != sK4 )
| $less(sK0,X5)
| $less(X5,0) )
& ( $sum(sK2,1) = X5 ) )
=> ( ( ( sK4 != fact(sK5) )
| $less(sK0,sK5)
| $less(sK5,0) )
& ( $sum(sK2,1) = sK5 ) ) ),
introduced(choice_axiom,[]) ).
tff(f42,plain,
? [X0: $int] :
( ? [X1: $int,X2: $int] :
( ? [X3: $int,X4: $int] :
( ? [X5: $int] :
( ( ( fact(X5) != X4 )
| $less(X0,X5)
| $less(X5,0) )
& ( $sum(X2,1) = X5 ) )
& $less(X2,X3)
& ( $product(X3,fact(X2)) = X4 )
& ~ $less($sum(X2,1),X3)
& ~ $less(X3,1) )
& $less(X2,X0)
& ( fact(X2) = X1 )
& ~ $less(X0,X2)
& ~ $less(X2,0) )
& ~ $less(X0,0) ),
inference(flattening,[],[f41]) ).
tff(f41,plain,
? [X0: $int] :
( ? [X1: $int,X2: $int] :
( ? [X3: $int,X4: $int] :
( ? [X5: $int] :
( ( ( fact(X5) != X4 )
| $less(X0,X5)
| $less(X5,0) )
& ( $sum(X2,1) = X5 ) )
& $less(X2,X3)
& ( $product(X3,fact(X2)) = X4 )
& ~ $less($sum(X2,1),X3)
& ~ $less(X3,1) )
& $less(X2,X0)
& ( fact(X2) = X1 )
& ~ $less(X0,X2)
& ~ $less(X2,0) )
& ~ $less(X0,0) ),
inference(ennf_transformation,[],[f38]) ).
tff(f38,plain,
~ ! [X0: $int] :
( ~ $less(X0,0)
=> ! [X1: $int,X2: $int] :
( ( ( fact(X2) = X1 )
& ~ $less(X0,X2)
& ~ $less(X2,0) )
=> ( $less(X2,X0)
=> ! [X3: $int,X4: $int] :
( ( ( $product(X3,fact(X2)) = X4 )
& ~ $less($sum(X2,1),X3)
& ~ $less(X3,1) )
=> ( $less(X2,X3)
=> ! [X5: $int] :
( ( $sum(X2,1) = X5 )
=> ( ( fact(X5) = X4 )
& ~ $less(X0,X5)
& ~ $less(X5,0) ) ) ) ) ) ) ),
inference(rectify,[],[f19]) ).
tff(f19,plain,
~ ! [X8: $int] :
( ~ $less(X8,0)
=> ! [X6: $int,X9: $int] :
( ( ( fact(X9) = X6 )
& ~ $less(X8,X9)
& ~ $less(X9,0) )
=> ( $less(X9,X8)
=> ! [X10: $int,X11: $int] :
( ( ( $product(X10,fact(X9)) = X11 )
& ~ $less($sum(X9,1),X10)
& ~ $less(X10,1) )
=> ( $less(X9,X10)
=> ! [X12: $int] :
( ( $sum(X9,1) = X12 )
=> ( ( fact(X12) = X11 )
& ~ $less(X8,X12)
& ~ $less(X12,0) ) ) ) ) ) ) ),
inference(theory_normalization,[],[f16]) ).
tff(f16,negated_conjecture,
~ ! [X8: $int] :
( $lesseq(0,X8)
=> ! [X6: $int,X9: $int] :
( ( ( fact(X9) = X6 )
& $lesseq(X9,X8)
& $lesseq(0,X9) )
=> ( $less(X9,X8)
=> ! [X10: $int,X11: $int] :
( ( ( $product(X10,fact(X9)) = X11 )
& $lesseq(X10,$sum(X9,1))
& $lesseq(1,X10) )
=> ( ~ $lesseq(X10,X9)
=> ! [X12: $int] :
( ( $sum(X9,1) = X12 )
=> ( ( fact(X12) = X11 )
& $lesseq(X12,X8)
& $lesseq(0,X12) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f15]) ).
tff(f15,conjecture,
! [X8: $int] :
( $lesseq(0,X8)
=> ! [X6: $int,X9: $int] :
( ( ( fact(X9) = X6 )
& $lesseq(X9,X8)
& $lesseq(0,X9) )
=> ( $less(X9,X8)
=> ! [X10: $int,X11: $int] :
( ( ( $product(X10,fact(X9)) = X11 )
& $lesseq(X10,$sum(X9,1))
& $lesseq(1,X10) )
=> ( ~ $lesseq(X10,X9)
=> ! [X12: $int] :
( ( $sum(X9,1) = X12 )
=> ( ( fact(X12) = X11 )
& $lesseq(X12,X8)
& $lesseq(0,X12) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.AnvqPnlJV9/Vampire---4.8_31378',wP_parameter_routine) ).
tff(f25,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_142,[]) ).
tff(f314,plain,
( $less($sum(1,sK2),0)
| ~ spl6_1 ),
inference(forward_demodulation,[],[f70,f82]) ).
tff(f82,plain,
sK5 = $sum(1,sK2),
inference(backward_demodulation,[],[f60,f20]) ).
tff(f60,plain,
$sum(sK2,1) = sK5,
inference(cnf_transformation,[],[f50]) ).
tff(f70,plain,
( $less(sK5,0)
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f68]) ).
tff(f68,plain,
( spl6_1
<=> $less(sK5,0) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
tff(f312,plain,
~ spl6_2,
inference(avatar_contradiction_clause,[],[f311]) ).
tff(f311,plain,
( $false
| ~ spl6_2 ),
inference(subsumption_resolution,[],[f310,f101]) ).
tff(f101,plain,
~ $less(sK0,$sum(1,sK2)),
inference(forward_demodulation,[],[f97,f20]) ).
tff(f97,plain,
~ $less(sK0,$sum(sK2,1)),
inference(unit_resulting_resolution,[],[f55,f37]) ).
tff(f37,plain,
! [X0: $int,X1: $int] :
( ~ $less(X1,$sum(X0,1))
| ~ $less(X0,X1) ),
introduced(theory_axiom_161,[]) ).
tff(f55,plain,
$less(sK2,sK0),
inference(cnf_transformation,[],[f50]) ).
tff(f310,plain,
( $less(sK0,$sum(1,sK2))
| ~ spl6_2 ),
inference(forward_demodulation,[],[f74,f82]) ).
tff(f74,plain,
( $less(sK0,sK5)
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f72]) ).
tff(f72,plain,
( spl6_2
<=> $less(sK0,sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
tff(f293,plain,
spl6_3,
inference(avatar_contradiction_clause,[],[f292]) ).
tff(f292,plain,
( $false
| spl6_3 ),
inference(subsumption_resolution,[],[f291,f83]) ).
tff(f83,plain,
( ( sK4 != fact($sum(1,sK2)) )
| spl6_3 ),
inference(forward_demodulation,[],[f78,f82]) ).
tff(f78,plain,
( ( sK4 != fact(sK5) )
| spl6_3 ),
inference(avatar_component_clause,[],[f76]) ).
tff(f76,plain,
( spl6_3
<=> ( sK4 = fact(sK5) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
tff(f291,plain,
sK4 = fact($sum(1,sK2)),
inference(forward_demodulation,[],[f290,f242]) ).
tff(f242,plain,
sK4 = $product($sum(1,sK2),sK1),
inference(backward_demodulation,[],[f80,f235]) ).
tff(f235,plain,
sK3 = $sum(1,sK2),
inference(unit_resulting_resolution,[],[f81,f100,f27]) ).
tff(f27,plain,
! [X0: $int,X1: $int] :
( ( X0 = X1 )
| $less(X1,X0)
| $less(X0,X1) ),
introduced(theory_axiom_144,[]) ).
tff(f100,plain,
~ $less(sK3,$sum(1,sK2)),
inference(forward_demodulation,[],[f98,f20]) ).
tff(f98,plain,
~ $less(sK3,$sum(sK2,1)),
inference(unit_resulting_resolution,[],[f59,f37]) ).
tff(f59,plain,
$less(sK2,sK3),
inference(cnf_transformation,[],[f50]) ).
tff(f81,plain,
~ $less($sum(1,sK2),sK3),
inference(backward_demodulation,[],[f57,f20]) ).
tff(f57,plain,
~ $less($sum(sK2,1),sK3),
inference(cnf_transformation,[],[f50]) ).
tff(f80,plain,
sK4 = $product(sK3,sK1),
inference(backward_demodulation,[],[f58,f54]) ).
tff(f54,plain,
sK1 = fact(sK2),
inference(cnf_transformation,[],[f50]) ).
tff(f58,plain,
sK4 = $product(sK3,fact(sK2)),
inference(cnf_transformation,[],[f50]) ).
tff(f290,plain,
fact($sum(1,sK2)) = $product($sum(1,sK2),sK1),
inference(forward_demodulation,[],[f279,f54]) ).
tff(f279,plain,
fact($sum(1,sK2)) = $product($sum(1,sK2),fact(sK2)),
inference(evaluation,[],[f261]) ).
tff(f261,plain,
fact($sum(1,sK2)) = $product($sum(1,sK2),fact($sum(-1,$sum(1,sK2)))),
inference(backward_demodulation,[],[f161,f235]) ).
tff(f161,plain,
fact(sK3) = $product(sK3,fact($sum(-1,sK3))),
inference(forward_demodulation,[],[f157,f20]) ).
tff(f157,plain,
fact(sK3) = $product(sK3,fact($sum(sK3,-1))),
inference(unit_resulting_resolution,[],[f56,f66]) ).
tff(f66,plain,
! [X0: $int] :
( ( fact(X0) = $product(X0,fact($sum(X0,-1))) )
| $less(X0,1) ),
inference(evaluation,[],[f63]) ).
tff(f63,plain,
! [X0: $int] :
( ( fact(X0) = $product(X0,fact($sum(X0,$uminus(1)))) )
| $less(X0,1) ),
inference(cnf_transformation,[],[f45]) ).
tff(f45,plain,
! [X0: $int] :
( ( fact(X0) = $product(X0,fact($sum(X0,$uminus(1)))) )
| $less(X0,1) ),
inference(ennf_transformation,[],[f40]) ).
tff(f40,plain,
! [X0: $int] :
( ~ $less(X0,1)
=> ( fact(X0) = $product(X0,fact($sum(X0,$uminus(1)))) ) ),
inference(rectify,[],[f18]) ).
tff(f18,plain,
! [X8: $int] :
( ~ $less(X8,1)
=> ( fact(X8) = $product(X8,fact($sum(X8,$uminus(1)))) ) ),
inference(theory_normalization,[],[f10]) ).
tff(f10,axiom,
! [X8: $int] :
( $lesseq(1,X8)
=> ( fact(X8) = $product(X8,fact($difference(X8,1))) ) ),
file('/export/starexec/sandbox2/tmp/tmp.AnvqPnlJV9/Vampire---4.8_31378',factn) ).
tff(f56,plain,
~ $less(sK3,1),
inference(cnf_transformation,[],[f50]) ).
tff(f79,plain,
( spl6_1
| spl6_2
| ~ spl6_3 ),
inference(avatar_split_clause,[],[f61,f76,f72,f68]) ).
tff(f61,plain,
( ( sK4 != fact(sK5) )
| $less(sK0,sK5)
| $less(sK5,0) ),
inference(cnf_transformation,[],[f50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWW581_2 : TPTP v8.1.2. Released v6.1.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 19:23:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TF0_THM_EQU_ARI problem
% 0.15/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.AnvqPnlJV9/Vampire---4.8_31378
% 0.61/0.76 % (31566)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.61/0.76 % (31564)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.61/0.76 % (31561)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.61/0.76 % (31562)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.61/0.76 % (31563)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 Vampire---4 for (2996ds/34Mi)
% 0.61/0.76 % (31560)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 Vampire---4 for (2996ds/51Mi)
% 0.61/0.76 % (31565)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 Vampire---4 for (2996ds/83Mi)
% 0.61/0.76 % (31559)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 Vampire---4 for (2996ds/34Mi)
% 0.61/0.77 % (31562)First to succeed.
% 0.61/0.78 % (31562)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-31545"
% 0.61/0.78 % (31562)Refutation found. Thanks to Tanya!
% 0.61/0.78 % SZS status Theorem for Vampire---4
% 0.61/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.78 % (31562)------------------------------
% 0.61/0.78 % (31562)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.78 % (31562)Termination reason: Refutation
% 0.61/0.78
% 0.61/0.78 % (31562)Memory used [KB]: 1112
% 0.61/0.78 % (31562)Time elapsed: 0.020 s
% 0.61/0.78 % (31562)Instructions burned: 17 (million)
% 0.61/0.78 % (31545)Success in time 0.409 s
% 0.61/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------