TSTP Solution File: MGT028-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : MGT028-1 : TPTP v8.2.0. Released v2.4.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 : 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 : Tue May 21 00:42:11 EDT 2024
% Result : Unsatisfiable 0.45s 0.69s
% Output : Refutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 17
% Syntax : Number of formulae : 67 ( 4 unt; 0 def)
% Number of atoms : 300 ( 0 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 452 ( 219 ~; 229 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 5 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 76 ( 76 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f104,plain,
$false,
inference(avatar_sat_refutation,[],[f25,f74,f87,f96,f100,f103]) ).
fof(f103,plain,
( spl0_2
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f102]) ).
fof(f102,plain,
( $false
| spl0_2
| ~ spl0_3 ),
inference(subsumption_resolution,[],[f101,f23]) ).
fof(f23,plain,
( ~ greater_or_equal(sk5(sk2(sk4)),sk2(sk4))
| spl0_2 ),
inference(avatar_component_clause,[],[f22]) ).
fof(f22,plain,
( spl0_2
<=> greater_or_equal(sk5(sk2(sk4)),sk2(sk4)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f101,plain,
( greater_or_equal(sk5(sk2(sk4)),sk2(sk4))
| ~ spl0_3 ),
inference(resolution,[],[f91,f13]) ).
fof(f13,axiom,
! [X0] :
( ~ greater(X0,appear(efficient_producers,sk4))
| greater_or_equal(sk5(X0),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_13) ).
fof(f91,plain,
( greater(sk2(sk4),appear(efficient_producers,sk4))
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f89]) ).
fof(f89,plain,
( spl0_3
<=> greater(sk2(sk4),appear(efficient_producers,sk4)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
fof(f100,plain,
spl0_4,
inference(avatar_contradiction_clause,[],[f99]) ).
fof(f99,plain,
( $false
| spl0_4 ),
inference(subsumption_resolution,[],[f98,f10]) ).
fof(f10,axiom,
environment(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_10) ).
fof(f98,plain,
( ~ environment(sk4)
| spl0_4 ),
inference(subsumption_resolution,[],[f97,f11]) ).
fof(f11,axiom,
stable(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_11) ).
fof(f97,plain,
( ~ stable(sk4)
| ~ environment(sk4)
| spl0_4 ),
inference(resolution,[],[f95,f7]) ).
fof(f7,axiom,
! [X0] :
( in_environment(X0,sk3(X0))
| ~ stable(X0)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l11_7) ).
fof(f95,plain,
( ~ in_environment(sk4,sk3(sk4))
| spl0_4 ),
inference(avatar_component_clause,[],[f93]) ).
fof(f93,plain,
( spl0_4
<=> in_environment(sk4,sk3(sk4)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
fof(f96,plain,
( spl0_3
| ~ spl0_4
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f82,f19,f93,f89]) ).
fof(f19,plain,
( spl0_1
<=> ! [X0] :
( greater_or_equal(sk1(X0,sk4),X0)
| ~ in_environment(sk4,X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f82,plain,
( ~ in_environment(sk4,sk3(sk4))
| greater(sk2(sk4),appear(efficient_producers,sk4))
| ~ spl0_1 ),
inference(subsumption_resolution,[],[f81,f10]) ).
fof(f81,plain,
( ~ in_environment(sk4,sk3(sk4))
| ~ environment(sk4)
| greater(sk2(sk4),appear(efficient_producers,sk4))
| ~ spl0_1 ),
inference(subsumption_resolution,[],[f78,f11]) ).
fof(f78,plain,
( ~ in_environment(sk4,sk3(sk4))
| ~ stable(sk4)
| ~ environment(sk4)
| greater(sk2(sk4),appear(efficient_producers,sk4))
| ~ spl0_1 ),
inference(duplicate_literal_removal,[],[f77]) ).
fof(f77,plain,
( ~ in_environment(sk4,sk3(sk4))
| ~ stable(sk4)
| ~ environment(sk4)
| greater(sk2(sk4),appear(efficient_producers,sk4))
| ~ in_environment(sk4,sk3(sk4))
| ~ spl0_1 ),
inference(resolution,[],[f20,f35]) ).
fof(f35,plain,
! [X0,X1] :
( ~ greater_or_equal(sk1(X0,X1),sk3(X1))
| ~ stable(X1)
| ~ environment(X1)
| greater(sk2(X1),appear(efficient_producers,X1))
| ~ in_environment(X1,X0) ),
inference(duplicate_literal_removal,[],[f34]) ).
fof(f34,plain,
! [X0,X1] :
( ~ greater_or_equal(sk1(X0,X1),sk3(X1))
| ~ stable(X1)
| ~ environment(X1)
| greater(sk2(X1),appear(efficient_producers,X1))
| ~ in_environment(X1,X0)
| ~ stable(X1)
| ~ environment(X1)
| greater(sk2(X1),appear(efficient_producers,X1))
| ~ in_environment(X1,X0)
| ~ stable(X1)
| ~ environment(X1) ),
inference(resolution,[],[f27,f1]) ).
fof(f1,axiom,
! [X0,X1] :
( subpopulations(first_movers,efficient_producers,X0,sk1(X1,X0))
| greater(sk2(X0),appear(efficient_producers,X0))
| ~ in_environment(X0,X1)
| ~ stable(X0)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_1) ).
fof(f27,plain,
! [X2,X0,X1] :
( ~ subpopulations(first_movers,efficient_producers,X2,sk1(X0,X1))
| ~ greater_or_equal(sk1(X0,X1),sk3(X2))
| ~ stable(X2)
| ~ environment(X2)
| greater(sk2(X1),appear(efficient_producers,X1))
| ~ in_environment(X1,X0)
| ~ stable(X1)
| ~ environment(X1) ),
inference(resolution,[],[f9,f5]) ).
fof(f5,axiom,
! [X0,X1] :
( ~ greater(zero,growth_rate(first_movers,sk1(X1,X0)))
| greater(sk2(X0),appear(efficient_producers,X0))
| ~ in_environment(X0,X1)
| ~ stable(X0)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_5) ).
fof(f9,axiom,
! [X0,X1] :
( greater(zero,growth_rate(first_movers,X1))
| ~ greater_or_equal(X1,sk3(X0))
| ~ subpopulations(first_movers,efficient_producers,X0,X1)
| ~ stable(X0)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l11_9) ).
fof(f20,plain,
( ! [X0] :
( greater_or_equal(sk1(X0,sk4),X0)
| ~ in_environment(sk4,X0) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f19]) ).
fof(f87,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_contradiction_clause,[],[f86]) ).
fof(f86,plain,
( $false
| ~ spl0_1
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f85,f10]) ).
fof(f85,plain,
( ~ environment(sk4)
| ~ spl0_1
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f84,f11]) ).
fof(f84,plain,
( ~ stable(sk4)
| ~ environment(sk4)
| ~ spl0_1
| ~ spl0_2 ),
inference(resolution,[],[f83,f7]) ).
fof(f83,plain,
( ~ in_environment(sk4,sk3(sk4))
| ~ spl0_1
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f82,f69]) ).
fof(f69,plain,
( ~ greater(sk2(sk4),appear(efficient_producers,sk4))
| ~ spl0_2 ),
inference(resolution,[],[f68,f24]) ).
fof(f24,plain,
( greater_or_equal(sk5(sk2(sk4)),sk2(sk4))
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f22]) ).
fof(f68,plain,
! [X0] :
( ~ greater_or_equal(sk5(X0),sk2(sk4))
| ~ greater(X0,appear(efficient_producers,sk4)) ),
inference(subsumption_resolution,[],[f67,f11]) ).
fof(f67,plain,
! [X0] :
( ~ greater_or_equal(sk5(X0),sk2(sk4))
| ~ stable(sk4)
| ~ greater(X0,appear(efficient_producers,sk4)) ),
inference(subsumption_resolution,[],[f66,f10]) ).
fof(f66,plain,
! [X0] :
( ~ greater_or_equal(sk5(X0),sk2(sk4))
| ~ environment(sk4)
| ~ stable(sk4)
| ~ greater(X0,appear(efficient_producers,sk4)) ),
inference(duplicate_literal_removal,[],[f65]) ).
fof(f65,plain,
! [X0] :
( ~ greater_or_equal(sk5(X0),sk2(sk4))
| ~ environment(sk4)
| ~ stable(sk4)
| ~ greater(X0,appear(efficient_producers,sk4))
| ~ greater(X0,appear(efficient_producers,sk4)) ),
inference(resolution,[],[f64,f12]) ).
fof(f12,axiom,
! [X0] :
( subpopulations(first_movers,efficient_producers,sk4,sk5(X0))
| ~ greater(X0,appear(efficient_producers,sk4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_12) ).
fof(f64,plain,
! [X0,X1] :
( ~ subpopulations(first_movers,efficient_producers,X0,sk5(X1))
| ~ greater_or_equal(sk5(X1),sk2(X0))
| ~ environment(X0)
| ~ stable(X0)
| ~ greater(X1,appear(efficient_producers,sk4)) ),
inference(resolution,[],[f61,f14]) ).
fof(f14,axiom,
! [X0] :
( ~ greater(zero,growth_rate(first_movers,sk5(X0)))
| ~ greater(X0,appear(efficient_producers,sk4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_14) ).
fof(f61,plain,
! [X0,X1] :
( greater(zero,growth_rate(first_movers,X0))
| ~ environment(X1)
| ~ greater_or_equal(X0,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X0)
| ~ stable(X1) ),
inference(duplicate_literal_removal,[],[f60]) ).
fof(f60,plain,
! [X0,X1] :
( greater(zero,growth_rate(first_movers,X0))
| ~ environment(X1)
| ~ greater_or_equal(X0,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X0)
| ~ greater_or_equal(X0,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X0)
| ~ stable(X1) ),
inference(factoring,[],[f56]) ).
fof(f56,plain,
! [X2,X0,X1] :
( greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ greater_or_equal(X0,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X0)
| ~ greater_or_equal(X2,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| greater(zero,growth_rate(first_movers,X0))
| ~ stable(X1) ),
inference(duplicate_literal_removal,[],[f53]) ).
fof(f53,plain,
! [X2,X0,X1] :
( greater(zero,growth_rate(first_movers,X0))
| ~ environment(X1)
| ~ greater_or_equal(X0,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X0)
| ~ greater_or_equal(X2,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| greater(zero,growth_rate(first_movers,X2))
| ~ greater_or_equal(X0,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X0)
| ~ stable(X1) ),
inference(factoring,[],[f49]) ).
fof(f49,plain,
! [X2,X3,X0,X1] :
( greater(zero,growth_rate(first_movers,X3))
| ~ environment(X0)
| ~ greater_or_equal(X1,sk2(X0))
| ~ subpopulations(first_movers,efficient_producers,X0,X1)
| greater(zero,growth_rate(first_movers,X1))
| ~ greater_or_equal(X2,sk2(X0))
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| greater(zero,growth_rate(first_movers,X2))
| ~ greater_or_equal(X3,sk2(X0))
| ~ subpopulations(first_movers,efficient_producers,X0,X3)
| ~ stable(X0) ),
inference(subsumption_resolution,[],[f48,f7]) ).
fof(f48,plain,
! [X2,X3,X0,X1] :
( ~ stable(X0)
| ~ environment(X0)
| ~ greater_or_equal(X1,sk2(X0))
| ~ subpopulations(first_movers,efficient_producers,X0,X1)
| greater(zero,growth_rate(first_movers,X1))
| ~ in_environment(X0,sk3(X0))
| ~ greater_or_equal(X2,sk2(X0))
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| greater(zero,growth_rate(first_movers,X2))
| ~ greater_or_equal(X3,sk2(X0))
| ~ subpopulations(first_movers,efficient_producers,X0,X3)
| greater(zero,growth_rate(first_movers,X3)) ),
inference(duplicate_literal_removal,[],[f47]) ).
fof(f47,plain,
! [X2,X3,X0,X1] :
( ~ stable(X0)
| ~ environment(X0)
| ~ greater_or_equal(X1,sk2(X0))
| ~ subpopulations(first_movers,efficient_producers,X0,X1)
| greater(zero,growth_rate(first_movers,X1))
| ~ in_environment(X0,sk3(X0))
| ~ greater_or_equal(X2,sk2(X0))
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| greater(zero,growth_rate(first_movers,X2))
| ~ greater_or_equal(X3,sk2(X0))
| ~ subpopulations(first_movers,efficient_producers,X0,X3)
| greater(zero,growth_rate(first_movers,X3))
| ~ in_environment(X0,sk3(X0))
| ~ stable(X0)
| ~ environment(X0) ),
inference(resolution,[],[f46,f4]) ).
fof(f4,axiom,
! [X2,X0,X1] :
( greater_or_equal(sk1(X1,X0),X1)
| ~ greater_or_equal(X2,sk2(X0))
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| greater(zero,growth_rate(first_movers,X2))
| ~ in_environment(X0,X1)
| ~ stable(X0)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_4) ).
fof(f46,plain,
! [X2,X3,X0,X1] :
( ~ greater_or_equal(sk1(X0,X1),sk3(X1))
| ~ stable(X1)
| ~ environment(X1)
| ~ greater_or_equal(X2,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| greater(zero,growth_rate(first_movers,X2))
| ~ in_environment(X1,X0)
| ~ greater_or_equal(X3,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| greater(zero,growth_rate(first_movers,X3)) ),
inference(duplicate_literal_removal,[],[f43]) ).
fof(f43,plain,
! [X2,X3,X0,X1] :
( ~ greater_or_equal(sk1(X0,X1),sk3(X1))
| ~ stable(X1)
| ~ environment(X1)
| ~ greater_or_equal(X2,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| greater(zero,growth_rate(first_movers,X2))
| ~ in_environment(X1,X0)
| ~ stable(X1)
| ~ environment(X1)
| ~ greater_or_equal(X3,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| greater(zero,growth_rate(first_movers,X3))
| ~ in_environment(X1,X0)
| ~ stable(X1)
| ~ environment(X1) ),
inference(resolution,[],[f26,f3]) ).
fof(f3,axiom,
! [X2,X0,X1] :
( subpopulations(first_movers,efficient_producers,X0,sk1(X1,X0))
| ~ greater_or_equal(X2,sk2(X0))
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| greater(zero,growth_rate(first_movers,X2))
| ~ in_environment(X0,X1)
| ~ stable(X0)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_3) ).
fof(f26,plain,
! [X2,X3,X0,X1] :
( ~ subpopulations(first_movers,efficient_producers,X2,sk1(X0,X1))
| ~ greater_or_equal(sk1(X0,X1),sk3(X2))
| ~ stable(X2)
| ~ environment(X2)
| ~ greater_or_equal(X3,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| greater(zero,growth_rate(first_movers,X3))
| ~ in_environment(X1,X0)
| ~ stable(X1)
| ~ environment(X1) ),
inference(resolution,[],[f9,f6]) ).
fof(f6,axiom,
! [X2,X0,X1] :
( ~ greater(zero,growth_rate(first_movers,sk1(X1,X0)))
| ~ greater_or_equal(X2,sk2(X0))
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| greater(zero,growth_rate(first_movers,X2))
| ~ in_environment(X0,X1)
| ~ stable(X0)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_6) ).
fof(f74,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f73,f22,f19]) ).
fof(f73,plain,
( ! [X0] :
( greater_or_equal(sk1(X0,sk4),X0)
| ~ in_environment(sk4,X0) )
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f72,f10]) ).
fof(f72,plain,
( ! [X0] :
( greater_or_equal(sk1(X0,sk4),X0)
| ~ in_environment(sk4,X0)
| ~ environment(sk4) )
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f71,f11]) ).
fof(f71,plain,
( ! [X0] :
( greater_or_equal(sk1(X0,sk4),X0)
| ~ in_environment(sk4,X0)
| ~ stable(sk4)
| ~ environment(sk4) )
| ~ spl0_2 ),
inference(resolution,[],[f69,f2]) ).
fof(f2,axiom,
! [X0,X1] :
( greater(sk2(X0),appear(efficient_producers,X0))
| greater_or_equal(sk1(X1,X0),X1)
| ~ in_environment(X0,X1)
| ~ stable(X0)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_2) ).
fof(f25,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f17,f22,f19]) ).
fof(f17,plain,
! [X0] :
( greater_or_equal(sk5(sk2(sk4)),sk2(sk4))
| greater_or_equal(sk1(X0,sk4),X0)
| ~ in_environment(sk4,X0) ),
inference(subsumption_resolution,[],[f16,f10]) ).
fof(f16,plain,
! [X0] :
( greater_or_equal(sk5(sk2(sk4)),sk2(sk4))
| greater_or_equal(sk1(X0,sk4),X0)
| ~ in_environment(sk4,X0)
| ~ environment(sk4) ),
inference(subsumption_resolution,[],[f15,f11]) ).
fof(f15,plain,
! [X0] :
( greater_or_equal(sk5(sk2(sk4)),sk2(sk4))
| greater_or_equal(sk1(X0,sk4),X0)
| ~ in_environment(sk4,X0)
| ~ stable(sk4)
| ~ environment(sk4) ),
inference(resolution,[],[f13,f2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : MGT028-1 : TPTP v8.2.0. Released v2.4.0.
% 0.02/0.10 % 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.09/0.29 % Computer : n014.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Sun May 19 00:07:08 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.30 This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.09/0.30 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/benchmark/theBenchmark.p
% 0.45/0.68 % (11555)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 (2996ds/51Mi)
% 0.45/0.68 % (11554)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 (2996ds/34Mi)
% 0.45/0.68 % (11559)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.45/0.68 % (11561)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 (2996ds/56Mi)
% 0.45/0.68 % (11560)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 (2996ds/83Mi)
% 0.45/0.68 % (11559)First to succeed.
% 0.45/0.68 % (11556)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.45/0.68 % (11554)Also succeeded, but the first one will report.
% 0.45/0.68 % (11561)Also succeeded, but the first one will report.
% 0.45/0.69 % (11559)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11553"
% 0.45/0.69 % (11559)Refutation found. Thanks to Tanya!
% 0.45/0.69 % SZS status Unsatisfiable for theBenchmark
% 0.45/0.69 % SZS output start Proof for theBenchmark
% See solution above
% 0.45/0.69 % (11559)------------------------------
% 0.45/0.69 % (11559)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.45/0.69 % (11559)Termination reason: Refutation
% 0.45/0.69
% 0.45/0.69 % (11559)Memory used [KB]: 1022
% 0.45/0.69 % (11559)Time elapsed: 0.003 s
% 0.45/0.69 % (11559)Instructions burned: 8 (million)
% 0.45/0.69 % (11553)Success in time 0.375 s
% 0.45/0.69 % Vampire---4.8 exiting
%------------------------------------------------------------------------------