TSTP Solution File: SET799+4 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET799+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n004.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 : Wed Aug 31 18:25:41 EDT 2022
% Result : Theorem 0.20s 0.56s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 44 ( 9 unt; 0 def)
% Number of atoms : 199 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 209 ( 54 ~; 37 |; 90 &)
% ( 7 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-3 aty)
% Number of variables : 151 ( 109 !; 42 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f243,plain,
$false,
inference(subsumption_resolution,[],[f239,f116]) ).
fof(f116,plain,
~ apply(sK3,sK7,sK8),
inference(cnf_transformation,[],[f80]) ).
fof(f80,plain,
( order(sK3,sK4)
& least_upper_bound(sK7,sK6,sK3,sK4)
& least_upper_bound(sK8,sK5,sK3,sK4)
& ~ apply(sK3,sK7,sK8)
& subset(sK6,sK4)
& subset(sK6,sK5)
& subset(sK5,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7,sK8])],[f76,f79,f78,f77]) ).
fof(f77,plain,
( ? [X0,X1] :
( order(X0,X1)
& ? [X2,X3] :
( ? [X4,X5] :
( least_upper_bound(X4,X3,X0,X1)
& least_upper_bound(X5,X2,X0,X1)
& ~ apply(X0,X4,X5) )
& subset(X3,X1)
& subset(X3,X2)
& subset(X2,X1) ) )
=> ( order(sK3,sK4)
& ? [X3,X2] :
( ? [X5,X4] :
( least_upper_bound(X4,X3,sK3,sK4)
& least_upper_bound(X5,X2,sK3,sK4)
& ~ apply(sK3,X4,X5) )
& subset(X3,sK4)
& subset(X3,X2)
& subset(X2,sK4) ) ) ),
introduced(choice_axiom,[]) ).
fof(f78,plain,
( ? [X3,X2] :
( ? [X5,X4] :
( least_upper_bound(X4,X3,sK3,sK4)
& least_upper_bound(X5,X2,sK3,sK4)
& ~ apply(sK3,X4,X5) )
& subset(X3,sK4)
& subset(X3,X2)
& subset(X2,sK4) )
=> ( ? [X5,X4] :
( least_upper_bound(X4,sK6,sK3,sK4)
& least_upper_bound(X5,sK5,sK3,sK4)
& ~ apply(sK3,X4,X5) )
& subset(sK6,sK4)
& subset(sK6,sK5)
& subset(sK5,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f79,plain,
( ? [X5,X4] :
( least_upper_bound(X4,sK6,sK3,sK4)
& least_upper_bound(X5,sK5,sK3,sK4)
& ~ apply(sK3,X4,X5) )
=> ( least_upper_bound(sK7,sK6,sK3,sK4)
& least_upper_bound(sK8,sK5,sK3,sK4)
& ~ apply(sK3,sK7,sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f76,plain,
? [X0,X1] :
( order(X0,X1)
& ? [X2,X3] :
( ? [X4,X5] :
( least_upper_bound(X4,X3,X0,X1)
& least_upper_bound(X5,X2,X0,X1)
& ~ apply(X0,X4,X5) )
& subset(X3,X1)
& subset(X3,X2)
& subset(X2,X1) ) ),
inference(rectify,[],[f49]) ).
fof(f49,plain,
? [X1,X0] :
( order(X1,X0)
& ? [X3,X2] :
( ? [X4,X5] :
( least_upper_bound(X4,X2,X1,X0)
& least_upper_bound(X5,X3,X1,X0)
& ~ apply(X1,X4,X5) )
& subset(X2,X0)
& subset(X2,X3)
& subset(X3,X0) ) ),
inference(flattening,[],[f48]) ).
fof(f48,plain,
? [X1,X0] :
( ? [X3,X2] :
( ? [X5,X4] :
( ~ apply(X1,X4,X5)
& least_upper_bound(X4,X2,X1,X0)
& least_upper_bound(X5,X3,X1,X0) )
& subset(X2,X0)
& subset(X2,X3)
& subset(X3,X0) )
& order(X1,X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,plain,
~ ! [X1,X0] :
( order(X1,X0)
=> ! [X3,X2] :
( ( subset(X2,X0)
& subset(X2,X3)
& subset(X3,X0) )
=> ! [X5,X4] :
( ( least_upper_bound(X4,X2,X1,X0)
& least_upper_bound(X5,X3,X1,X0) )
=> apply(X1,X4,X5) ) ) ),
inference(rectify,[],[f23]) ).
fof(f23,negated_conjecture,
~ ! [X3,X5] :
( order(X5,X3)
=> ! [X8,X9] :
( ( subset(X8,X3)
& subset(X8,X9)
& subset(X9,X3) )
=> ! [X10,X11] :
( ( least_upper_bound(X11,X9,X5,X3)
& least_upper_bound(X10,X8,X5,X3) )
=> apply(X5,X10,X11) ) ) ),
inference(negated_conjecture,[],[f22]) ).
fof(f22,conjecture,
! [X3,X5] :
( order(X5,X3)
=> ! [X8,X9] :
( ( subset(X8,X3)
& subset(X8,X9)
& subset(X9,X3) )
=> ! [X10,X11] :
( ( least_upper_bound(X11,X9,X5,X3)
& least_upper_bound(X10,X8,X5,X3) )
=> apply(X5,X10,X11) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thIV11) ).
fof(f239,plain,
apply(sK3,sK7,sK8),
inference(resolution,[],[f235,f165]) ).
fof(f165,plain,
member(sK7,sK5),
inference(resolution,[],[f158,f151]) ).
fof(f151,plain,
member(sK7,sK6),
inference(resolution,[],[f123,f118]) ).
fof(f118,plain,
least_upper_bound(sK7,sK6,sK3,sK4),
inference(cnf_transformation,[],[f80]) ).
fof(f123,plain,
! [X2,X3,X0,X1] :
( ~ least_upper_bound(X3,X0,X1,X2)
| member(X3,X0) ),
inference(cnf_transformation,[],[f85]) ).
fof(f85,plain,
! [X0,X1,X2,X3] :
( ~ least_upper_bound(X3,X0,X1,X2)
| ( upper_bound(X3,X1,X0)
& ! [X4] :
( ~ member(X4,X2)
| ~ upper_bound(X4,X1,X0)
| apply(X1,X3,X4) )
& member(X3,X0) ) ),
inference(rectify,[],[f46]) ).
fof(f46,plain,
! [X2,X1,X3,X0] :
( ~ least_upper_bound(X0,X2,X1,X3)
| ( upper_bound(X0,X1,X2)
& ! [X4] :
( ~ member(X4,X3)
| ~ upper_bound(X4,X1,X2)
| apply(X1,X0,X4) )
& member(X0,X2) ) ),
inference(flattening,[],[f45]) ).
fof(f45,plain,
! [X1,X3,X2,X0] :
( ( upper_bound(X0,X1,X2)
& member(X0,X2)
& ! [X4] :
( apply(X1,X0,X4)
| ~ member(X4,X3)
| ~ upper_bound(X4,X1,X2) ) )
| ~ least_upper_bound(X0,X2,X1,X3) ),
inference(ennf_transformation,[],[f43]) ).
fof(f43,plain,
! [X1,X3,X2,X0] :
( least_upper_bound(X0,X2,X1,X3)
=> ( upper_bound(X0,X1,X2)
& member(X0,X2)
& ! [X4] :
( ( member(X4,X3)
& upper_bound(X4,X1,X2) )
=> apply(X1,X0,X4) ) ) ),
inference(unused_predicate_definition_removal,[],[f38]) ).
fof(f38,plain,
! [X1,X3,X2,X0] :
( ( upper_bound(X0,X1,X2)
& member(X0,X2)
& ! [X4] :
( ( member(X4,X3)
& upper_bound(X4,X1,X2) )
=> apply(X1,X0,X4) ) )
<=> least_upper_bound(X0,X2,X1,X3) ),
inference(rectify,[],[f20]) ).
fof(f20,axiom,
! [X0,X5,X2,X3] :
( least_upper_bound(X0,X2,X5,X3)
<=> ( member(X0,X2)
& upper_bound(X0,X5,X2)
& ! [X7] :
( ( upper_bound(X7,X5,X2)
& member(X7,X3) )
=> apply(X5,X0,X7) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',least_upper_bound) ).
fof(f158,plain,
! [X5] :
( ~ member(X5,sK6)
| member(X5,sK5) ),
inference(resolution,[],[f122,f114]) ).
fof(f114,plain,
subset(sK6,sK5),
inference(cnf_transformation,[],[f80]) ).
fof(f122,plain,
! [X2,X0,X1] :
( ~ subset(X1,X0)
| member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f84]) ).
fof(f84,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ member(X2,X1)
| member(X2,X0) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ( member(sK9(X0,X1),X1)
& ~ member(sK9(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f82,f83]) ).
fof(f83,plain,
! [X0,X1] :
( ? [X3] :
( member(X3,X1)
& ~ member(X3,X0) )
=> ( member(sK9(X0,X1),X1)
& ~ member(sK9(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f82,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ member(X2,X1)
| member(X2,X0) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X3] :
( member(X3,X1)
& ~ member(X3,X0) ) ) ),
inference(rectify,[],[f81]) ).
fof(f81,plain,
! [X1,X0] :
( ( ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) ) ) ),
inference(nnf_transformation,[],[f50]) ).
fof(f50,plain,
! [X1,X0] :
( ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) )
<=> subset(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f235,plain,
! [X0] :
( ~ member(X0,sK5)
| apply(sK3,X0,sK8) ),
inference(resolution,[],[f100,f162]) ).
fof(f162,plain,
upper_bound(sK8,sK3,sK5),
inference(resolution,[],[f125,f117]) ).
fof(f117,plain,
least_upper_bound(sK8,sK5,sK3,sK4),
inference(cnf_transformation,[],[f80]) ).
fof(f125,plain,
! [X2,X3,X0,X1] :
( ~ least_upper_bound(X3,X0,X1,X2)
| upper_bound(X3,X1,X0) ),
inference(cnf_transformation,[],[f85]) ).
fof(f100,plain,
! [X2,X3,X0,X1] :
( ~ upper_bound(X2,X1,X0)
| ~ member(X3,X0)
| apply(X1,X3,X2) ),
inference(cnf_transformation,[],[f64]) ).
fof(f64,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ~ member(X3,X0)
| apply(X1,X3,X2) )
| ~ upper_bound(X2,X1,X0) )
& ( upper_bound(X2,X1,X0)
| ( member(sK0(X0,X1,X2),X0)
& ~ apply(X1,sK0(X0,X1,X2),X2) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f62,f63]) ).
fof(f63,plain,
! [X0,X1,X2] :
( ? [X4] :
( member(X4,X0)
& ~ apply(X1,X4,X2) )
=> ( member(sK0(X0,X1,X2),X0)
& ~ apply(X1,sK0(X0,X1,X2),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f62,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ~ member(X3,X0)
| apply(X1,X3,X2) )
| ~ upper_bound(X2,X1,X0) )
& ( upper_bound(X2,X1,X0)
| ? [X4] :
( member(X4,X0)
& ~ apply(X1,X4,X2) ) ) ),
inference(rectify,[],[f61]) ).
fof(f61,plain,
! [X0,X2,X1] :
( ( ! [X3] :
( ~ member(X3,X0)
| apply(X2,X3,X1) )
| ~ upper_bound(X1,X2,X0) )
& ( upper_bound(X1,X2,X0)
| ? [X3] :
( member(X3,X0)
& ~ apply(X2,X3,X1) ) ) ),
inference(nnf_transformation,[],[f53]) ).
fof(f53,plain,
! [X0,X2,X1] :
( ! [X3] :
( ~ member(X3,X0)
| apply(X2,X3,X1) )
<=> upper_bound(X1,X2,X0) ),
inference(ennf_transformation,[],[f27]) ).
fof(f27,plain,
! [X2,X0,X1] :
( upper_bound(X1,X2,X0)
<=> ! [X3] :
( member(X3,X0)
=> apply(X2,X3,X1) ) ),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X3,X7,X5] :
( upper_bound(X7,X5,X3)
<=> ! [X2] :
( member(X2,X3)
=> apply(X5,X2,X7) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',upper_bound) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET799+4 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 14:17:20 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.52 % (14934)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.52 % (14917)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.53 % (14917)Instruction limit reached!
% 0.20/0.53 % (14917)------------------------------
% 0.20/0.53 % (14917)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (14928)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.53 % (14924)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.53 % (14917)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (14917)Termination reason: Unknown
% 0.20/0.53 % (14917)Termination phase: Saturation
% 0.20/0.53
% 0.20/0.53 % (14917)Memory used [KB]: 5628
% 0.20/0.53 % (14917)Time elapsed: 0.122 s
% 0.20/0.53 % (14917)Instructions burned: 8 (million)
% 0.20/0.53 % (14917)------------------------------
% 0.20/0.53 % (14917)------------------------------
% 0.20/0.53 % (14911)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.53 % (14931)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.53 % (14919)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.54 % (14915)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.54 % (14912)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.54 % (14938)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.20/0.54 % (14933)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.54 % (14911)Refutation not found, incomplete strategy% (14911)------------------------------
% 0.20/0.54 % (14911)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (14911)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (14911)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.54
% 0.20/0.54 % (14911)Memory used [KB]: 5500
% 0.20/0.54 % (14911)Time elapsed: 0.133 s
% 0.20/0.54 % (14911)Instructions burned: 4 (million)
% 0.20/0.54 % (14911)------------------------------
% 0.20/0.54 % (14911)------------------------------
% 0.20/0.54 % (14913)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.54 % (14914)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.54 % (14932)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.54 % (14916)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.54 % (14935)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.54 % (14914)First to succeed.
% 0.20/0.54 TRYING [1]
% 0.20/0.54 TRYING [2]
% 0.20/0.55 TRYING [3]
% 0.20/0.55 % (14920)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.55 % (14921)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.55 % (14918)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.55 % (14918)Instruction limit reached!
% 0.20/0.55 % (14918)------------------------------
% 0.20/0.55 % (14918)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (14918)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (14918)Termination reason: Unknown
% 0.20/0.55 % (14918)Termination phase: Preprocessing 2
% 0.20/0.55
% 0.20/0.55 % (14918)Memory used [KB]: 895
% 0.20/0.55 % (14918)Time elapsed: 0.002 s
% 0.20/0.55 % (14918)Instructions burned: 2 (million)
% 0.20/0.55 % (14918)------------------------------
% 0.20/0.55 % (14918)------------------------------
% 0.20/0.55 % (14936)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.55 % (14910)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.55 % (14930)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.20/0.55 % (14929)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.55 TRYING [1]
% 0.20/0.55 % (14912)Also succeeded, but the first one will report.
% 0.20/0.55 TRYING [2]
% 0.20/0.55 TRYING [3]
% 0.20/0.55 % (14927)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.56 % (14914)Refutation found. Thanks to Tanya!
% 0.20/0.56 % SZS status Theorem for theBenchmark
% 0.20/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.56 % (14914)------------------------------
% 0.20/0.56 % (14914)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (14914)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56 % (14914)Termination reason: Refutation
% 0.20/0.56
% 0.20/0.56 % (14914)Memory used [KB]: 5628
% 0.20/0.56 % (14914)Time elapsed: 0.134 s
% 0.20/0.56 % (14914)Instructions burned: 8 (million)
% 0.20/0.56 % (14914)------------------------------
% 0.20/0.56 % (14914)------------------------------
% 0.20/0.56 % (14909)Success in time 0.197 s
%------------------------------------------------------------------------------