TSTP Solution File: MGT036+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : MGT036+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n029.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 17:51:03 EDT 2022
% Result : Theorem 0.21s 0.56s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 83 ( 12 unt; 0 def)
% Number of atoms : 268 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 319 ( 134 ~; 111 |; 48 &)
% ( 12 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 5 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 152 ( 144 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f120,plain,
$false,
inference(avatar_sat_refutation,[],[f57,f99,f113,f117,f119]) ).
fof(f119,plain,
~ spl2_5,
inference(avatar_contradiction_clause,[],[f118]) ).
fof(f118,plain,
( $false
| ~ spl2_5 ),
inference(resolution,[],[f94,f101]) ).
fof(f101,plain,
in_environment(sK0,sK1),
inference(subsumption_resolution,[],[f100,f37]) ).
fof(f37,plain,
environment(sK0),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
( subpopulations(first_movers,efficient_producers,sK0,sK1)
& outcompetes(first_movers,efficient_producers,sK1)
& environment(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f27,f28]) ).
fof(f28,plain,
( ? [X0,X1] :
( subpopulations(first_movers,efficient_producers,X0,X1)
& outcompetes(first_movers,efficient_producers,X1)
& environment(X0) )
=> ( subpopulations(first_movers,efficient_producers,sK0,sK1)
& outcompetes(first_movers,efficient_producers,sK1)
& environment(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
? [X0,X1] :
( subpopulations(first_movers,efficient_producers,X0,X1)
& outcompetes(first_movers,efficient_producers,X1)
& environment(X0) ),
inference(rectify,[],[f18]) ).
fof(f18,plain,
? [X1,X0] :
( subpopulations(first_movers,efficient_producers,X1,X0)
& outcompetes(first_movers,efficient_producers,X0)
& environment(X1) ),
inference(flattening,[],[f17]) ).
fof(f17,plain,
? [X1,X0] :
( outcompetes(first_movers,efficient_producers,X0)
& environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,plain,
~ ! [X1,X0] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X0) )
=> ~ outcompetes(first_movers,efficient_producers,X0) ),
inference(rectify,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X1,X0] :
( ( subpopulations(first_movers,efficient_producers,X0,X1)
& environment(X0) )
=> ~ outcompetes(first_movers,efficient_producers,X1) ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X1,X0] :
( ( subpopulations(first_movers,efficient_producers,X0,X1)
& environment(X0) )
=> ~ outcompetes(first_movers,efficient_producers,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t5) ).
fof(f100,plain,
( ~ environment(sK0)
| in_environment(sK0,sK1) ),
inference(resolution,[],[f40,f39]) ).
fof(f39,plain,
subpopulations(first_movers,efficient_producers,sK0,sK1),
inference(cnf_transformation,[],[f29]) ).
fof(f40,plain,
! [X0,X1] :
( ~ subpopulations(first_movers,efficient_producers,X1,X0)
| in_environment(X1,X0)
| ~ environment(X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X0)
| in_environment(X1,X0) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( in_environment(X1,X0)
| ~ subpopulations(first_movers,efficient_producers,X1,X0)
| ~ environment(X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1] :
( ( subpopulations(first_movers,efficient_producers,X1,X0)
& environment(X1) )
=> in_environment(X1,X0) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( ( environment(X0)
& subpopulations(first_movers,efficient_producers,X0,X1) )
=> in_environment(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_time_point_occur) ).
fof(f94,plain,
( ! [X0] : ~ in_environment(X0,sK1)
| ~ spl2_5 ),
inference(avatar_component_clause,[],[f93]) ).
fof(f93,plain,
( spl2_5
<=> ! [X0] : ~ in_environment(X0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_5])]) ).
fof(f117,plain,
~ spl2_6,
inference(avatar_contradiction_clause,[],[f116]) ).
fof(f116,plain,
( $false
| ~ spl2_6 ),
inference(subsumption_resolution,[],[f114,f107]) ).
fof(f107,plain,
greater_or_equal(growth_rate(first_movers,sK1),zero),
inference(subsumption_resolution,[],[f106,f38]) ).
fof(f38,plain,
outcompetes(first_movers,efficient_producers,sK1),
inference(cnf_transformation,[],[f29]) ).
fof(f106,plain,
( greater_or_equal(growth_rate(first_movers,sK1),zero)
| ~ outcompetes(first_movers,efficient_producers,sK1) ),
inference(subsumption_resolution,[],[f105,f37]) ).
fof(f105,plain,
( ~ environment(sK0)
| ~ outcompetes(first_movers,efficient_producers,sK1)
| greater_or_equal(growth_rate(first_movers,sK1),zero) ),
inference(resolution,[],[f46,f103]) ).
fof(f103,plain,
subpopulations(efficient_producers,first_movers,sK0,sK1),
inference(subsumption_resolution,[],[f102,f37]) ).
fof(f102,plain,
( subpopulations(efficient_producers,first_movers,sK0,sK1)
| ~ environment(sK0) ),
inference(resolution,[],[f50,f39]) ).
fof(f50,plain,
! [X0,X1] :
( ~ subpopulations(first_movers,efficient_producers,X1,X0)
| subpopulations(efficient_producers,first_movers,X1,X0)
| ~ environment(X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( subpopulations(efficient_producers,first_movers,X1,X0)
| ~ subpopulations(first_movers,efficient_producers,X1,X0)
| ~ environment(X1) ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
! [X1,X0] :
( subpopulations(efficient_producers,first_movers,X1,X0)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,plain,
! [X1,X0] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X0) )
=> subpopulations(efficient_producers,first_movers,X1,X0) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( ( subpopulations(first_movers,efficient_producers,X0,X1)
& environment(X0) )
=> subpopulations(efficient_producers,first_movers,X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_symmetry_of_FM_and_EP) ).
fof(f46,plain,
! [X2,X3,X0,X1] :
( ~ subpopulations(X3,X2,X1,X0)
| ~ environment(X1)
| greater_or_equal(growth_rate(X2,X0),zero)
| ~ outcompetes(X2,X3,X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1,X2,X3] :
( ( ( ( greater(zero,growth_rate(X3,X0))
& greater_or_equal(growth_rate(X2,X0),zero) )
| ~ outcompetes(X2,X3,X0) )
& ( outcompetes(X2,X3,X0)
| ~ greater(zero,growth_rate(X3,X0))
| ~ greater_or_equal(growth_rate(X2,X0),zero) ) )
| ~ environment(X1)
| ~ subpopulations(X3,X2,X1,X0) ),
inference(rectify,[],[f34]) ).
fof(f34,plain,
! [X0,X1,X3,X2] :
( ( ( ( greater(zero,growth_rate(X2,X0))
& greater_or_equal(growth_rate(X3,X0),zero) )
| ~ outcompetes(X3,X2,X0) )
& ( outcompetes(X3,X2,X0)
| ~ greater(zero,growth_rate(X2,X0))
| ~ greater_or_equal(growth_rate(X3,X0),zero) ) )
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X0) ),
inference(flattening,[],[f33]) ).
fof(f33,plain,
! [X0,X1,X3,X2] :
( ( ( ( greater(zero,growth_rate(X2,X0))
& greater_or_equal(growth_rate(X3,X0),zero) )
| ~ outcompetes(X3,X2,X0) )
& ( outcompetes(X3,X2,X0)
| ~ greater(zero,growth_rate(X2,X0))
| ~ greater_or_equal(growth_rate(X3,X0),zero) ) )
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X0) ),
inference(nnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X3,X2] :
( ( ( greater(zero,growth_rate(X2,X0))
& greater_or_equal(growth_rate(X3,X0),zero) )
<=> outcompetes(X3,X2,X0) )
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X0) ),
inference(flattening,[],[f23]) ).
fof(f23,plain,
! [X0,X2,X3,X1] :
( ( ( greater(zero,growth_rate(X2,X0))
& greater_or_equal(growth_rate(X3,X0),zero) )
<=> outcompetes(X3,X2,X0) )
| ~ subpopulations(X2,X3,X1,X0)
| ~ environment(X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X2,X3,X1] :
( ( subpopulations(X2,X3,X1,X0)
& environment(X1) )
=> ( ( greater(zero,growth_rate(X2,X0))
& greater_or_equal(growth_rate(X3,X0),zero) )
<=> outcompetes(X3,X2,X0) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X0,X2,X3] :
( ( environment(X0)
& subpopulations(X2,X3,X0,X1) )
=> ( outcompetes(X3,X2,X1)
<=> ( greater(zero,growth_rate(X2,X1))
& greater_or_equal(growth_rate(X3,X1),zero) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2) ).
fof(f114,plain,
( ~ greater_or_equal(growth_rate(first_movers,sK1),zero)
| ~ spl2_6 ),
inference(resolution,[],[f98,f44]) ).
fof(f44,plain,
! [X3,X0] :
( ~ greater(zero,growth_rate(X0,X3))
| ~ greater_or_equal(growth_rate(X0,X3),zero) ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1,X2,X3] :
( ( ~ greater(zero,growth_rate(X0,X3))
| ( ~ greater_or_equal(growth_rate(X0,X3),zero)
& subpopulations(X0,X2,X1,X3)
& environment(X1) ) )
& ( greater_or_equal(growth_rate(X0,X3),zero)
| ~ subpopulations(X0,X2,X1,X3)
| ~ environment(X1)
| greater(zero,growth_rate(X0,X3)) ) ),
inference(rectify,[],[f31]) ).
fof(f31,plain,
! [X2,X3,X1,X0] :
( ( ~ greater(zero,growth_rate(X2,X0))
| ( ~ greater_or_equal(growth_rate(X2,X0),zero)
& subpopulations(X2,X1,X3,X0)
& environment(X3) ) )
& ( greater_or_equal(growth_rate(X2,X0),zero)
| ~ subpopulations(X2,X1,X3,X0)
| ~ environment(X3)
| greater(zero,growth_rate(X2,X0)) ) ),
inference(flattening,[],[f30]) ).
fof(f30,plain,
! [X2,X3,X1,X0] :
( ( ~ greater(zero,growth_rate(X2,X0))
| ( ~ greater_or_equal(growth_rate(X2,X0),zero)
& subpopulations(X2,X1,X3,X0)
& environment(X3) ) )
& ( greater_or_equal(growth_rate(X2,X0),zero)
| ~ subpopulations(X2,X1,X3,X0)
| ~ environment(X3)
| greater(zero,growth_rate(X2,X0)) ) ),
inference(nnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X2,X3,X1,X0] :
( ~ greater(zero,growth_rate(X2,X0))
<=> ( greater_or_equal(growth_rate(X2,X0),zero)
| ~ subpopulations(X2,X1,X3,X0)
| ~ environment(X3) ) ),
inference(flattening,[],[f21]) ).
fof(f21,plain,
! [X0,X3,X1,X2] :
( ~ greater(zero,growth_rate(X2,X0))
<=> ( greater_or_equal(growth_rate(X2,X0),zero)
| ~ environment(X3)
| ~ subpopulations(X2,X1,X3,X0) ) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X3,X1,X2] :
( ~ greater(zero,growth_rate(X2,X0))
<=> ( ( environment(X3)
& subpopulations(X2,X1,X3,X0) )
=> greater_or_equal(growth_rate(X2,X0),zero) ) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X3,X2,X0] :
( ~ greater(zero,growth_rate(X2,X1))
<=> ( ( subpopulations(X2,X3,X0,X1)
& environment(X0) )
=> greater_or_equal(growth_rate(X2,X1),zero) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_growth_rate_relationships) ).
fof(f98,plain,
( greater(zero,growth_rate(first_movers,sK1))
| ~ spl2_6 ),
inference(avatar_component_clause,[],[f96]) ).
fof(f96,plain,
( spl2_6
<=> greater(zero,growth_rate(first_movers,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_6])]) ).
fof(f113,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f112]) ).
fof(f112,plain,
( $false
| ~ spl2_1 ),
inference(subsumption_resolution,[],[f111,f38]) ).
fof(f111,plain,
( ~ outcompetes(first_movers,efficient_producers,sK1)
| ~ spl2_1 ),
inference(subsumption_resolution,[],[f110,f37]) ).
fof(f110,plain,
( ~ environment(sK0)
| ~ outcompetes(first_movers,efficient_producers,sK1)
| ~ spl2_1 ),
inference(resolution,[],[f108,f103]) ).
fof(f108,plain,
( ! [X2,X3,X0,X1] :
( ~ subpopulations(X3,X2,X1,X0)
| ~ environment(X1)
| ~ outcompetes(X2,X3,X0) )
| ~ spl2_1 ),
inference(subsumption_resolution,[],[f47,f53]) ).
fof(f53,plain,
( ! [X3,X0] : ~ greater(zero,growth_rate(X0,X3))
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f52,plain,
( spl2_1
<=> ! [X0,X3] : ~ greater(zero,growth_rate(X0,X3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f47,plain,
! [X2,X3,X0,X1] :
( ~ outcompetes(X2,X3,X0)
| ~ environment(X1)
| greater(zero,growth_rate(X3,X0))
| ~ subpopulations(X3,X2,X1,X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f99,plain,
( spl2_5
| spl2_6
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f91,f55,f96,f93]) ).
fof(f55,plain,
( spl2_2
<=> ! [X1] : environment(X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f91,plain,
( ! [X0] :
( greater(zero,growth_rate(first_movers,sK1))
| ~ in_environment(X0,sK1) )
| ~ spl2_2 ),
inference(resolution,[],[f90,f78]) ).
fof(f78,plain,
( greater(zero,growth_rate(efficient_producers,sK1))
| ~ spl2_2 ),
inference(subsumption_resolution,[],[f77,f38]) ).
fof(f77,plain,
( greater(zero,growth_rate(efficient_producers,sK1))
| ~ outcompetes(first_movers,efficient_producers,sK1)
| ~ spl2_2 ),
inference(resolution,[],[f75,f61]) ).
fof(f61,plain,
( subpopulations(efficient_producers,first_movers,sK0,sK1)
| ~ spl2_2 ),
inference(resolution,[],[f60,f39]) ).
fof(f60,plain,
( ! [X0,X1] :
( ~ subpopulations(first_movers,efficient_producers,X1,X0)
| subpopulations(efficient_producers,first_movers,X1,X0) )
| ~ spl2_2 ),
inference(subsumption_resolution,[],[f50,f56]) ).
fof(f56,plain,
( ! [X1] : environment(X1)
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f55]) ).
fof(f75,plain,
( ! [X2,X3,X0,X1] :
( ~ subpopulations(X3,X2,X1,X0)
| ~ outcompetes(X2,X3,X0)
| greater(zero,growth_rate(X3,X0)) )
| ~ spl2_2 ),
inference(subsumption_resolution,[],[f47,f56]) ).
fof(f90,plain,
( ! [X0,X1] :
( ~ greater(zero,growth_rate(efficient_producers,X1))
| ~ in_environment(X0,X1)
| greater(zero,growth_rate(first_movers,X1)) )
| ~ spl2_2 ),
inference(resolution,[],[f89,f48]) ).
fof(f48,plain,
greater(resilience(efficient_producers),resilience(first_movers)),
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
greater(resilience(efficient_producers),resilience(first_movers)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a2) ).
fof(f89,plain,
( ! [X2,X3,X0,X1] :
( ~ greater(resilience(X1),resilience(X0))
| ~ in_environment(X3,X2)
| ~ greater(zero,growth_rate(X1,X2))
| greater(zero,growth_rate(X0,X2)) )
| ~ spl2_2 ),
inference(subsumption_resolution,[],[f49,f56]) ).
fof(f49,plain,
! [X2,X3,X0,X1] :
( ~ greater(resilience(X1),resilience(X0))
| ~ in_environment(X3,X2)
| ~ greater(zero,growth_rate(X1,X2))
| greater(zero,growth_rate(X0,X2))
| ~ environment(X3) ),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0,X1,X2,X3] :
( ~ greater(resilience(X1),resilience(X0))
| greater(zero,growth_rate(X0,X2))
| ~ in_environment(X3,X2)
| ~ environment(X3)
| ~ greater(zero,growth_rate(X1,X2)) ),
inference(rectify,[],[f16]) ).
fof(f16,plain,
! [X1,X2,X3,X0] :
( ~ greater(resilience(X2),resilience(X1))
| greater(zero,growth_rate(X1,X3))
| ~ in_environment(X0,X3)
| ~ environment(X0)
| ~ greater(zero,growth_rate(X2,X3)) ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
! [X2,X1,X0,X3] :
( ~ greater(zero,growth_rate(X2,X3))
| ~ environment(X0)
| greater(zero,growth_rate(X1,X3))
| ~ greater(resilience(X2),resilience(X1))
| ~ in_environment(X0,X3) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,plain,
! [X2,X1,X0,X3] :
( ( environment(X0)
& ~ greater(zero,growth_rate(X1,X3))
& greater(resilience(X2),resilience(X1))
& in_environment(X0,X3) )
=> ~ greater(zero,growth_rate(X2,X3)) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X0,X2,X3,X1] :
( ( ~ greater(zero,growth_rate(X2,X1))
& greater(resilience(X3),resilience(X2))
& in_environment(X0,X1)
& environment(X0) )
=> ~ greater(zero,growth_rate(X3,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a12) ).
fof(f57,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f42,f55,f52]) ).
fof(f42,plain,
! [X3,X0,X1] :
( environment(X1)
| ~ greater(zero,growth_rate(X0,X3)) ),
inference(cnf_transformation,[],[f32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT036+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35 % Computer : n029.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 03:27:41 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.54 % (11853)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.21/0.54 % (11867)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.21/0.55 % (11854)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.55 % (11852)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.55 % (11854)First to succeed.
% 0.21/0.56 % (11861)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.56 % (11854)Refutation found. Thanks to Tanya!
% 0.21/0.56 % SZS status Theorem for theBenchmark
% 0.21/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.56 % (11854)------------------------------
% 0.21/0.56 % (11854)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.56 % (11854)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.56 % (11854)Termination reason: Refutation
% 0.21/0.56
% 0.21/0.56 % (11854)Memory used [KB]: 5884
% 0.21/0.56 % (11854)Time elapsed: 0.131 s
% 0.21/0.56 % (11854)Instructions burned: 3 (million)
% 0.21/0.56 % (11854)------------------------------
% 0.21/0.56 % (11854)------------------------------
% 0.21/0.56 % (11847)Success in time 0.208 s
%------------------------------------------------------------------------------