%------------------------------------------------------------------------------
% File : iProver-SAT---3.9.4
% Problem : MGT037+2 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:13:13 PM UTC 2026
% Result : CounterSatisfiable 2.88s 1.29s
% Output : Saturation 2.88s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ( cardinality_at_time(efficient_producers,X1) = zero
& greater_or_equal(X1,appear(efficient_producers,X0))
& environment(X0) )
=> ? [X2] :
( greater(zero,growth_rate(efficient_producers,X2))
& greater(X1,X2)
& in_environment(X0,X2)
& greater(X2,appear(efficient_producers,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_previous_negative_growth) ).
fof(f2,axiom,
! [X0,X1] :
( ( greater(appear(an_organisation,X0),X1)
& in_environment(X0,X1)
& environment(X0) )
=> number_of_organizations(X0,X1) = zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_start_of_organizations) ).
fof(f3,axiom,
! [X0,X1] :
( ( ~ decreases(number_of_organizations(X0,X1))
& in_environment(X0,X1)
& environment(X0) )
=> ? [X2] :
( ~ greater(zero,growth_rate(X2,X1))
& greater(cardinality_at_time(X2,X1),zero)
& subpopulation(X2,X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_non_decreasing) ).
fof(f4,axiom,
! [X0,X1,X2] :
( ( subpopulation(X2,X0,X1)
& number_of_organizations(X0,X1) = zero
& in_environment(X0,X1)
& environment(X0) )
=> cardinality_at_time(X2,X1) = zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_no_members) ).
fof(f5,axiom,
! [X0,X1] :
( ( in_environment(X0,X1)
& environment(X0) )
=> ( subpopulation(efficient_producers,X0,X1)
& subpopulation(first_movers,X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_subpopulations) ).
fof(f6,axiom,
! [X0,X1] :
( cardinality_at_time(X0,X1) = zero
=> ~ greater(zero,growth_rate(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_empty_not_decreasing) ).
fof(f7,axiom,
! [X0,X1] :
( ( in_environment(X0,X1)
& environment(X0) )
=> ( greater(cardinality_at_time(efficient_producers,X1),zero)
| cardinality_at_time(efficient_producers,X1) = zero ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_efficient_producers_exist) ).
fof(f8,axiom,
! [X0] :
( constant(X0)
=> ~ decreases(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_constant_not_decrease) ).
fof(f9,axiom,
! [X0,X1] :
( ( in_environment(X0,X1)
& environment(X0) )
=> ( greater(appear(an_organisation,X0),X1)
| ~ greater_or_equal(X1,appear(an_organisation,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_environment_inequality) ).
fof(f10,axiom,
! [X0,X1] :
( ( greater_or_equal(X1,appear(an_organisation,X0))
& in_environment(X0,X1)
& environment(X0) )
=> greater(number_of_organizations(X0,X1),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a1) ).
fof(f11,axiom,
greater(resilience(efficient_producers),resilience(first_movers)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a2) ).
fof(f12,axiom,
! [X0,X1] :
( ( greater(number_of_organizations(X0,X1),zero)
& in_environment(X0,X1)
& environment(X0) )
=> ( ( ~ greater(equilibrium(X0),X1)
=> constant(resources(X0,X1)) )
& ( greater(equilibrium(X0),X1)
=> decreases(resources(X0,X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a4) ).
fof(f13,axiom,
! [X0,X1] :
( ( in_environment(X0,X1)
& environment(X0) )
=> ( ( constant(resources(X0,X1))
=> constant(number_of_organizations(X0,X1)) )
& ( decreases(resources(X0,X1))
=> ~ decreases(number_of_organizations(X0,X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a7) ).
fof(f14,axiom,
! [X0,X1,X2] :
( ( greater(cardinality_at_time(X1,X2),zero)
& subpopulation(X1,X0,X2)
& environment(X0) )
=> ( X1 = first_movers
| X1 = efficient_producers ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a11) ).
fof(f15,axiom,
! [X0,X1,X2,X3] :
( ( greater(resilience(X2),resilience(X1))
& ~ greater(zero,growth_rate(X1,X3))
& in_environment(X0,X3)
& environment(X0) )
=> ~ greater(zero,growth_rate(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a13) ).
fof(f16,conjecture,
! [X0,X1] :
( ( greater_or_equal(X1,appear(efficient_producers,X0))
& in_environment(X0,X1)
& environment(X0) )
=> greater(cardinality_at_time(efficient_producers,X1),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t6) ).
fof(f17,negated_conjecture,
~ ! [X0,X1] :
( ( greater_or_equal(X1,appear(efficient_producers,X0))
& in_environment(X0,X1)
& environment(X0) )
=> greater(cardinality_at_time(efficient_producers,X1),zero) ),
inference(negated_conjecture,[status(cth)],[f16]) ).
fof(f18,plain,
! [X0,X1] :
( cardinality_at_time(efficient_producers,X1) != zero
| ~ greater_or_equal(X1,appear(efficient_producers,X0))
| ~ environment(X0)
| ? [X2] :
( greater(zero,growth_rate(efficient_producers,X2))
& greater(X1,X2)
& in_environment(X0,X2)
& greater(X2,appear(efficient_producers,X0)) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f19,plain,
! [X0,X1] :
( cardinality_at_time(efficient_producers,X1) != zero
| ~ greater_or_equal(X1,appear(efficient_producers,X0))
| ~ environment(X0)
| ? [X2] :
( greater(zero,growth_rate(efficient_producers,X2))
& greater(X1,X2)
& in_environment(X0,X2)
& greater(X2,appear(efficient_producers,X0)) ) ),
inference(flattening,[],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( ~ greater(appear(an_organisation,X0),X1)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| number_of_organizations(X0,X1) = zero ),
inference(ennf_transformation,[],[f2]) ).
fof(f21,plain,
! [X0,X1] :
( ~ greater(appear(an_organisation,X0),X1)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| number_of_organizations(X0,X1) = zero ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( decreases(number_of_organizations(X0,X1))
| ~ in_environment(X0,X1)
| ~ environment(X0)
| ? [X2] :
( ~ greater(zero,growth_rate(X2,X1))
& greater(cardinality_at_time(X2,X1),zero)
& subpopulation(X2,X0,X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f23,plain,
! [X0,X1] :
( decreases(number_of_organizations(X0,X1))
| ~ in_environment(X0,X1)
| ~ environment(X0)
| ? [X2] :
( ~ greater(zero,growth_rate(X2,X1))
& greater(cardinality_at_time(X2,X1),zero)
& subpopulation(X2,X0,X1) ) ),
inference(flattening,[],[f22]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ~ subpopulation(X2,X0,X1)
| zero != number_of_organizations(X0,X1)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| cardinality_at_time(X2,X1) = zero ),
inference(ennf_transformation,[],[f4]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ~ subpopulation(X2,X0,X1)
| zero != number_of_organizations(X0,X1)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| cardinality_at_time(X2,X1) = zero ),
inference(flattening,[],[f24]) ).
fof(f26,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| ~ environment(X0)
| ( subpopulation(efficient_producers,X0,X1)
& subpopulation(first_movers,X0,X1) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f27,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| ~ environment(X0)
| ( subpopulation(efficient_producers,X0,X1)
& subpopulation(first_movers,X0,X1) ) ),
inference(flattening,[],[f26]) ).
fof(f28,plain,
! [X0,X1] :
( zero != cardinality_at_time(X0,X1)
| ~ greater(zero,growth_rate(X0,X1)) ),
inference(ennf_transformation,[],[f6]) ).
fof(f29,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| ~ environment(X0)
| greater(cardinality_at_time(efficient_producers,X1),zero)
| cardinality_at_time(efficient_producers,X1) = zero ),
inference(ennf_transformation,[],[f7]) ).
fof(f30,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| ~ environment(X0)
| greater(cardinality_at_time(efficient_producers,X1),zero)
| cardinality_at_time(efficient_producers,X1) = zero ),
inference(flattening,[],[f29]) ).
fof(f31,plain,
! [X0] :
( ~ constant(X0)
| ~ decreases(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f32,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| ~ environment(X0)
| greater(appear(an_organisation,X0),X1)
| ~ greater_or_equal(X1,appear(an_organisation,X0)) ),
inference(ennf_transformation,[],[f9]) ).
fof(f33,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| ~ environment(X0)
| greater(appear(an_organisation,X0),X1)
| ~ greater_or_equal(X1,appear(an_organisation,X0)) ),
inference(flattening,[],[f32]) ).
fof(f34,plain,
! [X0,X1] :
( ~ greater_or_equal(X1,appear(an_organisation,X0))
| ~ in_environment(X0,X1)
| ~ environment(X0)
| greater(number_of_organizations(X0,X1),zero) ),
inference(ennf_transformation,[],[f10]) ).
fof(f35,plain,
! [X0,X1] :
( ~ greater_or_equal(X1,appear(an_organisation,X0))
| ~ in_environment(X0,X1)
| ~ environment(X0)
| greater(number_of_organizations(X0,X1),zero) ),
inference(flattening,[],[f34]) ).
fof(f36,plain,
! [X0,X1] :
( ~ greater(number_of_organizations(X0,X1),zero)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| ( ( greater(equilibrium(X0),X1)
| constant(resources(X0,X1)) )
& ( ~ greater(equilibrium(X0),X1)
| decreases(resources(X0,X1)) ) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f37,plain,
! [X0,X1] :
( ~ greater(number_of_organizations(X0,X1),zero)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| ( ( greater(equilibrium(X0),X1)
| constant(resources(X0,X1)) )
& ( ~ greater(equilibrium(X0),X1)
| decreases(resources(X0,X1)) ) ) ),
inference(flattening,[],[f36]) ).
fof(f38,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| ~ environment(X0)
| ( ( ~ constant(resources(X0,X1))
| constant(number_of_organizations(X0,X1)) )
& ( ~ decreases(resources(X0,X1))
| ~ decreases(number_of_organizations(X0,X1)) ) ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f39,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| ~ environment(X0)
| ( ( ~ constant(resources(X0,X1))
| constant(number_of_organizations(X0,X1)) )
& ( ~ decreases(resources(X0,X1))
| ~ decreases(number_of_organizations(X0,X1)) ) ) ),
inference(flattening,[],[f38]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ~ greater(cardinality_at_time(X1,X2),zero)
| ~ subpopulation(X1,X0,X2)
| ~ environment(X0)
| X1 = first_movers
| X1 = efficient_producers ),
inference(ennf_transformation,[],[f14]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ~ greater(cardinality_at_time(X1,X2),zero)
| ~ subpopulation(X1,X0,X2)
| ~ environment(X0)
| X1 = first_movers
| X1 = efficient_producers ),
inference(flattening,[],[f40]) ).
fof(f42,plain,
! [X0,X1,X2,X3] :
( ~ greater(resilience(X2),resilience(X1))
| greater(zero,growth_rate(X1,X3))
| ~ in_environment(X0,X3)
| ~ environment(X0)
| ~ greater(zero,growth_rate(X2,X3)) ),
inference(ennf_transformation,[],[f15]) ).
fof(f43,plain,
! [X0,X1,X2,X3] :
( ~ 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,[],[f42]) ).
fof(f44,plain,
? [X0,X1] :
( greater_or_equal(X1,appear(efficient_producers,X0))
& in_environment(X0,X1)
& environment(X0)
& ~ greater(cardinality_at_time(efficient_producers,X1),zero) ),
inference(ennf_transformation,[],[f17]) ).
fof(f45,plain,
? [X0,X1] :
( greater_or_equal(X1,appear(efficient_producers,X0))
& in_environment(X0,X1)
& environment(X0)
& ~ greater(cardinality_at_time(efficient_producers,X1),zero) ),
inference(flattening,[],[f44]) ).
fof(f46,plain,
! [X0,X1] :
( cardinality_at_time(efficient_producers,X1) != zero
| ~ greater_or_equal(X1,appear(efficient_producers,X0))
| ~ environment(X0)
| ( greater(zero,growth_rate(efficient_producers,sK0(X0,X1)))
& greater(X1,sK0(X0,X1))
& in_environment(X0,sK0(X0,X1))
& greater(sK0(X0,X1),appear(efficient_producers,X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f19]) ).
fof(f47,plain,
! [X0,X1] :
( decreases(number_of_organizations(X0,X1))
| ~ in_environment(X0,X1)
| ~ environment(X0)
| ( ~ greater(zero,growth_rate(sK1(X0,X1),X1))
& greater(cardinality_at_time(sK1(X0,X1),X1),zero)
& subpopulation(sK1(X0,X1),X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f23]) ).
fof(f48,plain,
( greater_or_equal(sK3,appear(efficient_producers,sK2))
& in_environment(sK2,sK3)
& environment(sK2)
& ~ greater(cardinality_at_time(efficient_producers,sK3),zero) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f45]) ).
fof(f49,plain,
! [X0,X1] :
( cardinality_at_time(efficient_producers,X1) != zero
| ~ greater_or_equal(X1,appear(efficient_producers,X0))
| ~ environment(X0)
| greater(zero,growth_rate(efficient_producers,sK0(X0,X1))) ),
inference(cnf_transformation,[],[f46]) ).
fof(f50,plain,
! [X0,X1] :
( cardinality_at_time(efficient_producers,X1) != zero
| ~ greater_or_equal(X1,appear(efficient_producers,X0))
| ~ environment(X0)
| greater(X1,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f46]) ).
fof(f51,plain,
! [X0,X1] :
( cardinality_at_time(efficient_producers,X1) != zero
| ~ greater_or_equal(X1,appear(efficient_producers,X0))
| ~ environment(X0)
| in_environment(X0,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f46]) ).
fof(f52,plain,
! [X0,X1] :
( cardinality_at_time(efficient_producers,X1) != zero
| ~ greater_or_equal(X1,appear(efficient_producers,X0))
| ~ environment(X0)
| greater(sK0(X0,X1),appear(efficient_producers,X0)) ),
inference(cnf_transformation,[],[f46]) ).
fof(f53,plain,
! [X0,X1] :
( ~ greater(appear(an_organisation,X0),X1)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| zero = number_of_organizations(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f54,plain,
! [X0,X1] :
( decreases(number_of_organizations(X0,X1))
| ~ in_environment(X0,X1)
| ~ environment(X0)
| ~ greater(zero,growth_rate(sK1(X0,X1),X1)) ),
inference(cnf_transformation,[],[f47]) ).
fof(f55,plain,
! [X0,X1] :
( decreases(number_of_organizations(X0,X1))
| ~ in_environment(X0,X1)
| ~ environment(X0)
| greater(cardinality_at_time(sK1(X0,X1),X1),zero) ),
inference(cnf_transformation,[],[f47]) ).
fof(f56,plain,
! [X0,X1] :
( decreases(number_of_organizations(X0,X1))
| ~ in_environment(X0,X1)
| ~ environment(X0)
| subpopulation(sK1(X0,X1),X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f57,plain,
! [X2,X0,X1] :
( ~ subpopulation(X2,X0,X1)
| zero != number_of_organizations(X0,X1)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| zero = cardinality_at_time(X2,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f58,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| ~ environment(X0)
| subpopulation(efficient_producers,X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f59,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| ~ environment(X0)
| subpopulation(first_movers,X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f60,plain,
! [X0,X1] :
( zero != cardinality_at_time(X0,X1)
| ~ greater(zero,growth_rate(X0,X1)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f61,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| ~ environment(X0)
| greater(cardinality_at_time(efficient_producers,X1),zero)
| cardinality_at_time(efficient_producers,X1) = zero ),
inference(cnf_transformation,[],[f30]) ).
fof(f62,plain,
! [X0] :
( ~ constant(X0)
| ~ decreases(X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f63,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| ~ environment(X0)
| greater(appear(an_organisation,X0),X1)
| ~ greater_or_equal(X1,appear(an_organisation,X0)) ),
inference(cnf_transformation,[],[f33]) ).
fof(f64,plain,
! [X0,X1] :
( ~ greater_or_equal(X1,appear(an_organisation,X0))
| ~ in_environment(X0,X1)
| ~ environment(X0)
| greater(number_of_organizations(X0,X1),zero) ),
inference(cnf_transformation,[],[f35]) ).
fof(f65,plain,
greater(resilience(efficient_producers),resilience(first_movers)),
inference(cnf_transformation,[],[f11]) ).
fof(f66,plain,
! [X0,X1] :
( ~ greater(number_of_organizations(X0,X1),zero)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| greater(equilibrium(X0),X1)
| constant(resources(X0,X1)) ),
inference(cnf_transformation,[],[f37]) ).
fof(f67,plain,
! [X0,X1] :
( ~ greater(number_of_organizations(X0,X1),zero)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| ~ greater(equilibrium(X0),X1)
| decreases(resources(X0,X1)) ),
inference(cnf_transformation,[],[f37]) ).
fof(f68,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| ~ environment(X0)
| ~ constant(resources(X0,X1))
| constant(number_of_organizations(X0,X1)) ),
inference(cnf_transformation,[],[f39]) ).
fof(f69,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| ~ environment(X0)
| ~ decreases(resources(X0,X1))
| ~ decreases(number_of_organizations(X0,X1)) ),
inference(cnf_transformation,[],[f39]) ).
fof(f70,plain,
! [X2,X0,X1] :
( ~ greater(cardinality_at_time(X1,X2),zero)
| ~ subpopulation(X1,X0,X2)
| ~ environment(X0)
| first_movers = X1
| efficient_producers = X1 ),
inference(cnf_transformation,[],[f41]) ).
fof(f71,plain,
! [X2,X3,X0,X1] :
( ~ greater(resilience(X2),resilience(X1))
| greater(zero,growth_rate(X1,X3))
| ~ in_environment(X0,X3)
| ~ environment(X0)
| ~ greater(zero,growth_rate(X2,X3)) ),
inference(cnf_transformation,[],[f43]) ).
fof(f72,plain,
greater_or_equal(sK3,appear(efficient_producers,sK2)),
inference(cnf_transformation,[],[f48]) ).
fof(f73,plain,
in_environment(sK2,sK3),
inference(cnf_transformation,[],[f48]) ).
fof(f74,plain,
environment(sK2),
inference(cnf_transformation,[],[f48]) ).
fof(f75,plain,
~ greater(cardinality_at_time(efficient_producers,sK3),zero),
inference(cnf_transformation,[],[f48]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( greater(sK0(X1,X0),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ greater_or_equal(X0,appear(efficient_producers,X1))
| ( cardinality_at_time(efficient_producers,X0) != zero ) ),
inference(cnf_transformation,[],[f52]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] :
( in_environment(X1,sK0(X1,X0))
| ~ environment(X1)
| ~ greater_or_equal(X0,appear(efficient_producers,X1))
| ( cardinality_at_time(efficient_producers,X0) != zero ) ),
inference(cnf_transformation,[],[f51]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( greater(X0,sK0(X1,X0))
| ~ environment(X1)
| ~ greater_or_equal(X0,appear(efficient_producers,X1))
| ( cardinality_at_time(efficient_producers,X0) != zero ) ),
inference(cnf_transformation,[],[f50]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( greater(zero,growth_rate(efficient_producers,sK0(X1,X0)))
| ~ environment(X1)
| ~ greater_or_equal(X0,appear(efficient_producers,X1))
| ( cardinality_at_time(efficient_producers,X0) != zero ) ),
inference(cnf_transformation,[],[f49]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( ( number_of_organizations(X0,X1) = zero )
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater(appear(an_organisation,X0),X1) ),
inference(cnf_transformation,[],[f53]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( decreases(number_of_organizations(X0,X1))
| subpopulation(sK1(X0,X1),X0,X1)
| ~ environment(X0)
| ~ in_environment(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( decreases(number_of_organizations(X0,X1))
| greater(cardinality_at_time(sK1(X0,X1),X1),zero)
| ~ environment(X0)
| ~ in_environment(X0,X1) ),
inference(cnf_transformation,[],[f55]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( decreases(number_of_organizations(X0,X1))
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater(zero,growth_rate(sK1(X0,X1),X1)) ),
inference(cnf_transformation,[],[f54]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( cardinality_at_time(X2,X1) = zero )
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ subpopulation(X2,X0,X1)
| ( number_of_organizations(X0,X1) != zero ) ),
inference(cnf_transformation,[],[f57]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( subpopulation(first_movers,X0,X1)
| ~ environment(X0)
| ~ in_environment(X0,X1) ),
inference(cnf_transformation,[],[f59]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( subpopulation(efficient_producers,X0,X1)
| ~ environment(X0)
| ~ in_environment(X0,X1) ),
inference(cnf_transformation,[],[f58]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( ~ greater(zero,growth_rate(X0,X1))
| ( cardinality_at_time(X0,X1) != zero ) ),
inference(cnf_transformation,[],[f60]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( greater(cardinality_at_time(efficient_producers,X1),zero)
| ( cardinality_at_time(efficient_producers,X1) = zero )
| ~ environment(X0)
| ~ in_environment(X0,X1) ),
inference(cnf_transformation,[],[f61]) ).
tcf(c_62,plain,
! [X0: $i] :
( ~ constant(X0)
| ~ decreases(X0) ),
inference(cnf_transformation,[],[f62]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( greater(appear(an_organisation,X1),X0)
| ~ environment(X1)
| ~ in_environment(X1,X0)
| ~ greater_or_equal(X0,appear(an_organisation,X1)) ),
inference(cnf_transformation,[],[f63]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( greater(number_of_organizations(X1,X0),zero)
| ~ environment(X1)
| ~ in_environment(X1,X0)
| ~ greater_or_equal(X0,appear(an_organisation,X1)) ),
inference(cnf_transformation,[],[f64]) ).
tcf(c_65,plain,
greater(resilience(efficient_producers),resilience(first_movers)),
inference(cnf_transformation,[],[f65]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] :
( decreases(resources(X0,X1))
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater(equilibrium(X0),X1)
| ~ greater(number_of_organizations(X0,X1),zero) ),
inference(cnf_transformation,[],[f67]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] :
( constant(resources(X0,X1))
| greater(equilibrium(X0),X1)
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater(number_of_organizations(X0,X1),zero) ),
inference(cnf_transformation,[],[f66]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] :
( ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ decreases(resources(X0,X1))
| ~ decreases(number_of_organizations(X0,X1)) ),
inference(cnf_transformation,[],[f69]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i] :
( constant(number_of_organizations(X0,X1))
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ constant(resources(X0,X1)) ),
inference(cnf_transformation,[],[f68]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = first_movers )
| ( X0 = efficient_producers )
| ~ environment(X2)
| ~ subpopulation(X0,X2,X1)
| ~ greater(cardinality_at_time(X0,X1),zero) ),
inference(cnf_transformation,[],[f70]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( greater(zero,growth_rate(X1,X2))
| ~ environment(X3)
| ~ in_environment(X3,X2)
| ~ greater(zero,growth_rate(X0,X2))
| ~ greater(resilience(X0),resilience(X1)) ),
inference(cnf_transformation,[],[f71]) ).
tcf(c_72,negated_conjecture,
~ greater(cardinality_at_time(efficient_producers,sK3),zero),
inference(cnf_transformation,[],[f75]) ).
tcf(c_73,negated_conjecture,
environment(sK2),
inference(cnf_transformation,[],[f74]) ).
tcf(c_74,negated_conjecture,
in_environment(sK2,sK3),
inference(cnf_transformation,[],[f73]) ).
tcf(c_75,negated_conjecture,
greater_or_equal(sK3,appear(efficient_producers,sK2)),
inference(cnf_transformation,[],[f72]) ).
tcf(c_175,plain,
( greater(cardinality_at_time(efficient_producers,sK3),zero)
| ( cardinality_at_time(efficient_producers,sK3) = zero )
| ~ environment(sK2) ),
inference(superposition,[status(thm)],[c_74,c_61]) ).
tcf(c_176,plain,
cardinality_at_time(efficient_producers,sK3) = zero,
inference(forward_subsumption_resolution,[status(thm)],[c_175,c_72,c_73]) ).
tcf(c_177,plain,
~ greater(zero,zero),
inference(demodulation,[status(thm)],[c_72,c_176]) ).
tcf(c_178,plain,
~ greater(zero,growth_rate(efficient_producers,sK3)),
inference(superposition,[status(thm)],[c_176,c_60]) ).
tcf(c_219,plain,
! [X0: $i] :
( in_environment(X0,sK0(X0,sK3))
| ~ environment(X0)
| ~ greater_or_equal(sK3,appear(efficient_producers,X0)) ),
inference(superposition,[status(thm)],[c_176,c_50]) ).
tcf(c_230,plain,
( in_environment(sK2,sK0(sK2,sK3))
| ~ environment(sK2) ),
inference(superposition,[status(thm)],[c_75,c_219]) ).
tcf(c_231,plain,
in_environment(sK2,sK0(sK2,sK3)),
inference(forward_subsumption_resolution,[status(thm)],[c_230,c_73]) ).
tcf(c_232,plain,
( greater(cardinality_at_time(efficient_producers,sK0(sK2,sK3)),zero)
| ( cardinality_at_time(efficient_producers,sK0(sK2,sK3)) = zero )
| ~ environment(sK2) ),
inference(superposition,[status(thm)],[c_231,c_61]) ).
tcf(c_233,plain,
( greater(cardinality_at_time(efficient_producers,sK0(sK2,sK3)),zero)
| ( cardinality_at_time(efficient_producers,sK0(sK2,sK3)) = zero ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_232,c_73]) ).
tcf(c_258,plain,
! [X0: $i] :
( greater(sK3,sK0(X0,sK3))
| ~ environment(X0)
| ~ greater_or_equal(sK3,appear(efficient_producers,X0)) ),
inference(superposition,[status(thm)],[c_176,c_51]) ).
tcf(c_293,plain,
! [X0: $i,X1: $i,X2: $i] :
( decreases(number_of_organizations(X0,X1))
| ( sK1(X0,X1) = first_movers )
| ( sK1(X0,X1) = efficient_producers )
| ~ environment(X2)
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ subpopulation(sK1(X0,X1),X2,X1) ),
inference(superposition,[status(thm)],[c_55,c_70]) ).
tcf(c_310,plain,
( greater(sK3,sK0(sK2,sK3))
| ~ environment(sK2) ),
inference(superposition,[status(thm)],[c_75,c_258]) ).
tcf(c_311,plain,
greater(sK3,sK0(sK2,sK3)),
inference(forward_subsumption_resolution,[status(thm)],[c_310,c_73]) ).
tcf(c_320,plain,
! [X0: $i] :
( greater(sK0(X0,sK3),appear(efficient_producers,X0))
| ~ environment(X0)
| ~ greater_or_equal(sK3,appear(efficient_producers,X0)) ),
inference(superposition,[status(thm)],[c_176,c_49]) ).
tcf(c_339,plain,
! [X0: $i] :
( greater(zero,growth_rate(efficient_producers,sK0(X0,sK3)))
| ~ environment(X0)
| ~ greater_or_equal(sK3,appear(efficient_producers,X0)) ),
inference(superposition,[status(thm)],[c_176,c_52]) ).
tcf(c_360,plain,
! [X0: $i,X1: $i] :
( greater(zero,growth_rate(first_movers,X0))
| ~ environment(X1)
| ~ in_environment(X1,X0)
| ~ greater(zero,growth_rate(efficient_producers,X0)) ),
inference(superposition,[status(thm)],[c_65,c_71]) ).
tcf(c_374,plain,
! [X0: $i,X1: $i] :
( greater(zero,growth_rate(first_movers,sK0(X1,sK3)))
| ~ environment(X1)
| ~ environment(X0)
| ~ greater_or_equal(sK3,appear(efficient_producers,X1))
| ~ in_environment(X0,sK0(X1,sK3)) ),
inference(superposition,[status(thm)],[c_339,c_360]) ).
tcf(c_391,plain,
( greater(zero,growth_rate(first_movers,sK0(sK2,sK3)))
| ~ environment(sK2)
| ~ greater_or_equal(sK3,appear(efficient_producers,sK2)) ),
inference(superposition,[status(thm)],[c_231,c_374]) ).
tcf(c_392,plain,
greater(zero,growth_rate(first_movers,sK0(sK2,sK3))),
inference(forward_subsumption_resolution,[status(thm)],[c_391,c_73,c_75]) ).
tcf(c_407,plain,
! [X0: $i,X1: $i] :
( decreases(number_of_organizations(X0,X1))
| ( sK1(X0,X1) = first_movers )
| ( sK1(X0,X1) = efficient_producers )
| ~ environment(X0)
| ~ in_environment(X0,X1) ),
inference(superposition,[status(thm)],[c_54,c_293]) ).
tcf(c_429,plain,
! [X0: $i,X1: $i] :
( ( sK1(X0,X1) = first_movers )
| ( sK1(X0,X1) = efficient_producers )
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ decreases(resources(X0,X1)) ),
inference(superposition,[status(thm)],[c_407,c_68]) ).
tcf(c_430,plain,
! [X0: $i,X1: $i] :
( ( sK1(X0,X1) = first_movers )
| ( sK1(X0,X1) = efficient_producers )
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ constant(number_of_organizations(X0,X1)) ),
inference(superposition,[status(thm)],[c_407,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT037+2 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% 0.11/0.37 % Computer : n018.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 01:11:02 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% 0.11/0.41 Running model finding
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fnt_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 2.88/1.29 % SZS status Started for theBenchmark.p
% 2.88/1.29 % SZS status CounterSatisfiable for theBenchmark.p
% 2.88/1.29
% 2.88/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.88/1.29
% 2.88/1.29 ------ iProver source info
% 2.88/1.29
% 2.88/1.29 git: date: 2026-07-19 20:42:38 +0200
% 2.88/1.29 git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.88/1.29 git: non_committed_changes: false
% 2.88/1.29
% 2.88/1.29 ------ Parsing...
% 2.88/1.29 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.88/1.29 ------ Proving...
% 2.88/1.29 ------ Problem Properties
% 2.88/1.29
% 2.88/1.29
% 2.88/1.29 clauses 27
% 2.88/1.29 conjectures 4
% 2.88/1.29 EPR 5
% 2.88/1.29 Horn 22
% 2.88/1.29 unary 5
% 2.88/1.29 binary 2
% 2.88/1.29 lits 92
% 2.88/1.29 lits eq 11
% 2.88/1.29 fd_pure 0
% 2.88/1.29 fd_pseudo 0
% 2.88/1.29 fd_cond 1
% 2.88/1.29 fd_pseudo_cond 0
% 2.88/1.29 AC symbols 0
% 2.88/1.29
% 2.88/1.29 ------ Schedule dynamic 5 is on
% 2.88/1.29
% 2.88/1.29 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.88/1.29
% 2.88/1.29
% 2.88/1.29 ------
% 2.88/1.29 Current options:
% 2.88/1.29 ------
% 2.88/1.29
% 2.88/1.29 ------ Input Options
% 2.88/1.29
% 2.88/1.29 --out_options all
% 2.88/1.29 --tptp_safe_out true
% 2.88/1.29 --problem_path ""
% 2.88/1.29 --include_path ""
% 2.88/1.29 --clausifier res/vclausify_rel
% 2.88/1.29 --clausifier_options --mode clausify -t 101.67 -updr off
% 2.88/1.29 --stdin false
% 2.88/1.29 --proof_out true
% 2.88/1.29 --proof_dot_file ""
% 2.88/1.29 --proof_reduce_dot []
% 2.88/1.29 --suppress_sat_res false
% 2.88/1.29 --suppress_unsat_res true
% 2.88/1.29 --stats_out none
% 2.88/1.29 --stats_mem false
% 2.88/1.29 --theory_stats_out false
% 2.88/1.29
% 2.88/1.29 ------ General Options
% 2.88/1.29
% 2.88/1.29 --fof false
% 2.88/1.29 --time_out_real 305.
% 2.88/1.29 --time_out_virtual -1.
% 2.88/1.29 --rnd_seed 13
% 2.88/1.29 --symbol_type_check false
% 2.88/1.29 --clausify_out false
% 2.88/1.29 --sig_cnt_out false
% 2.88/1.29 --trig_cnt_out false
% 2.88/1.29 --trig_cnt_out_tolerance 1.
% 2.88/1.29 --trig_cnt_out_sk_spl false
% 2.88/1.29 --abstr_cl_out false
% 2.88/1.29
% 2.88/1.29 ------ Interactive Mode
% 2.88/1.29
% 2.88/1.29 --interactive_mode false
% 2.88/1.29 --external_ip_address ""
% 2.88/1.29 --external_port 0
% 2.88/1.29
% 2.88/1.29 ------ Global Options
% 2.88/1.29
% 2.88/1.29 --schedule default
% 2.88/1.29 --add_important_lit false
% 2.88/1.29 --prop_solver_per_cl 500
% 2.88/1.29 --subs_bck_mult 8
% 2.88/1.29 --min_unsat_core false
% 2.88/1.29 --soft_assumptions false
% 2.88/1.29 --soft_lemma_size 3
% 2.88/1.29 --prop_impl_unit_size 0
% 2.88/1.29 --prop_impl_unit []
% 2.88/1.29 --share_sel_clauses true
% 2.88/1.29 --reset_solvers false
% 2.88/1.29 --bc_imp_inh [conj_cone]
% 2.88/1.29 --conj_cone_tolerance 3.
% 2.88/1.29 --extra_neg_conj none
% 2.88/1.29 --large_theory_mode true
% 2.88/1.29 --prolific_symb_bound 200
% 2.88/1.29 --lt_threshold 2000
% 2.88/1.29 --clause_weak_htbl true
% 2.88/1.29 --gc_record_bc_elim false
% 2.88/1.29
% 2.88/1.29 ------ Preprocessing Options
% 2.88/1.29
% 2.88/1.29 --preprocessing_flag false
% 2.88/1.29 --time_out_prep_mult 0.1
% 2.88/1.29 --splitting_mode input
% 2.88/1.29 --splitting_grd true
% 2.88/1.29 --splitting_cvd false
% 2.88/1.29 --splitting_cvd_svl false
% 2.88/1.29 --splitting_nvd 32
% 2.88/1.29 --sub_typing false
% 2.88/1.29 --prep_eq_flat_conj false
% 2.88/1.29 --prep_ineq_split false
% 2.88/1.29 --prep_eq_flat_all_gr false
% 2.88/1.29 --prep_gs_sim true
% 2.88/1.29 --prep_unflatten true
% 2.88/1.29 --prep_res_sim true
% 2.88/1.29 --prep_sup_sim_all true
% 2.88/1.29 --prep_sup_sim_sup false
% 2.88/1.29 --prep_upred true
% 2.88/1.29 --prep_well_definedness true
% 2.88/1.29 --prep_sem_filter exhaustive
% 2.88/1.29 --prep_sem_filter_out false
% 2.88/1.29 --pred_elim true
% 2.88/1.29 --res_sim_input true
% 2.88/1.29 --eq_ax_congr_red true
% 2.88/1.29 --pure_diseq_elim true
% 2.88/1.29 --brand_transform false
% 2.88/1.29 --non_eq_to_eq false
% 2.88/1.29 --prep_eq_proxy false
% 2.88/1.29 --prep_def_merge true
% 2.88/1.29 --prep_def_merge_prop_impl false
% 2.88/1.29 --prep_def_merge_mbd true
% 2.88/1.29 --prep_def_merge_tr_red false
% 2.88/1.29 --prep_def_merge_tr_cl false
% 2.88/1.29 --smt_preprocessing false
% 2.88/1.29 --smt_ac_axioms fast
% 2.88/1.29 --preprocessed_out false
% 2.88/1.29 --preprocessed_stats false
% 2.88/1.29
% 2.88/1.29 ------ Abstraction refinement Options
% 2.88/1.29
% 2.88/1.29 --abstr_ref []
% 2.88/1.29 --abstr_ref_prep false
% 2.88/1.29 --abstr_ref_until_sat false
% 2.88/1.29 --abstr_ref_sig_restrict funpre
% 2.88/1.29 --abstr_ref_af_restrict_to_split_sk false
% 2.88/1.29 --abstr_ref_under []
% 2.88/1.29
% 2.88/1.29 ------ SAT Options
% 2.88/1.29
% 2.88/1.29 --sat_mode false
% 2.88/1.29 --sat_fm_restart_options ""
% 2.88/1.29 --sat_gr_def false
% 2.88/1.29 --sat_epr_types true
% 2.88/1.29 --sat_non_cyclic_types false
% 2.88/1.29 --sat_finite_models false
% 2.88/1.29 --sat_fm_lemmas false
% 2.88/1.29 --sat_fm_prep false
% 2.88/1.29 --sat_fm_uc_incr true
% 2.88/1.29 --sat_out_model pos
% 2.88/1.29 --sat_out_clauses false
% 2.88/1.29
% 2.88/1.29 ------ QBF Options
% 2.88/1.29
% 2.88/1.29 --qbf_mode false
% 2.88/1.29 --qbf_elim_univ false
% 2.88/1.29 --qbf_dom_inst none
% 2.88/1.29 --qbf_dom_pre_inst false
% 2.88/1.29 --qbf_sk_in false
% 2.88/1.29 --qbf_pred_elim true
% 2.88/1.29 --qbf_split 512
% 2.88/1.29
% 2.88/1.29 ------ BMC1 Options
% 2.88/1.29
% 2.88/1.29 --bmc1_incremental false
% 2.88/1.29 --bmc1_axioms reachable_all
% 2.88/1.29 --bmc1_min_bound 0
% 2.88/1.29 --bmc1_max_bound -1
% 2.88/1.29 --bmc1_max_bound_default -1
% 2.88/1.29 --bmc1_symbol_reachability true
% 2.88/1.29 --bmc1_property_lemmas false
% 2.88/1.29 --bmc1_k_induction false
% 2.88/1.29 --bmc1_non_equiv_states false
% 2.88/1.29 --bmc1_deadlock false
% 2.88/1.29 --bmc1_ucm false
% 2.88/1.29 --bmc1_add_unsat_core none
% 2.88/1.29 --bmc1_unsat_core_children false
% 2.88/1.29 --bmc1_unsat_core_extrapolate_axioms false
% 2.88/1.29 --bmc1_out_stat full
% 2.88/1.29 --bmc1_ground_init false
% 2.88/1.29 --bmc1_pre_inst_next_state false
% 2.88/1.29 --bmc1_pre_inst_state false
% 2.88/1.29 --bmc1_pre_inst_reach_state false
% 2.88/1.29 --bmc1_out_unsat_core false
% 2.88/1.29 --bmc1_aig_witness_out false
% 2.88/1.29 --bmc1_verbose false
% 2.88/1.29 --bmc1_dump_clauses_tptp false
% 2.88/1.29 --bmc1_dump_unsat_core_tptp false
% 2.88/1.29 --bmc1_dump_file -
% 2.88/1.29 --bmc1_ucm_expand_uc_limit 128
% 2.88/1.29 --bmc1_ucm_n_expand_iterations 6
% 2.88/1.29 --bmc1_ucm_extend_mode 1
% 2.88/1.29 --bmc1_ucm_init_mode 2
% 2.88/1.29 --bmc1_ucm_cone_mode none
% 2.88/1.29 --bmc1_ucm_reduced_relation_type 0
% 2.88/1.29 --bmc1_ucm_relax_model 4
% 2.88/1.29 --bmc1_ucm_full_tr_after_sat true
% 2.88/1.29 --bmc1_ucm_expand_neg_assumptions false
% 2.88/1.29 --bmc1_ucm_layered_model none
% 2.88/1.29 --bmc1_ucm_max_lemma_size 10
% 2.88/1.29
% 2.88/1.29 ------ AIG Options
% 2.88/1.29
% 2.88/1.29 --aig_mode false
% 2.88/1.29
% 2.88/1.29 ------ Instantiation Options
% 2.88/1.29
% 2.88/1.29 --instantiation_flag true
% 2.88/1.29 --inst_sos_flag false
% 2.88/1.29 --inst_sos_phase true
% 2.88/1.29 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 2.88/1.29 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.88/1.29 --inst_lit_sel_side none
% 2.88/1.29 --inst_solver_per_active 1400
% 2.88/1.29 --inst_solver_calls_frac 1.
% 2.88/1.29 --inst_to_smt_solver true
% 2.88/1.29 --inst_passive_queue_type priority_queues
% 2.88/1.29 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.88/1.29 --inst_passive_queues_freq [25;2]
% 2.88/1.29 --inst_dismatching true
% 2.88/1.29 --inst_eager_unprocessed_to_passive true
% 2.88/1.29 --inst_unprocessed_bound 1000
% 2.88/1.29 --inst_prop_sim_given true
% 2.88/1.29 --inst_prop_sim_new false
% 2.88/1.29 --inst_subs_new false
% 2.88/1.29 --inst_eq_res_simp false
% 2.88/1.29 --inst_subs_given false
% 2.88/1.29 --inst_orphan_elimination true
% 2.88/1.29 --inst_learning_loop_flag true
% 2.88/1.29 --inst_learning_start 3000
% 2.88/1.29 --inst_learning_factor 2
% 2.88/1.29 --inst_start_prop_sim_after_learn 3
% 2.88/1.29 --inst_sel_renew solver
% 2.88/1.29 --inst_lit_activity_flag true
% 2.88/1.29 --inst_restr_to_given false
% 2.88/1.29 --inst_activity_threshold 500
% 2.88/1.29
% 2.88/1.29 ------ Resolution Options
% 2.88/1.29
% 2.88/1.29 --resolution_flag false
% 2.88/1.29 --res_lit_sel adaptive
% 2.88/1.29 --res_lit_sel_side none
% 2.88/1.29 --res_ordering kbo
% 2.88/1.29 --res_to_prop_solver active
% 2.88/1.29 --res_prop_simpl_new false
% 2.88/1.29 --res_prop_simpl_given true
% 2.88/1.29 --res_to_smt_solver true
% 2.88/1.29 --res_passive_queue_type priority_queues
% 2.88/1.29 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.88/1.29 --res_passive_queues_freq [15;5]
% 2.88/1.29 --res_forward_subs full
% 2.88/1.29 --res_backward_subs full
% 2.88/1.29 --res_forward_subs_resolution true
% 2.88/1.29 --res_backward_subs_resolution true
% 2.88/1.29 --res_orphan_elimination true
% 2.88/1.29 --res_time_limit 300.
% 2.88/1.29
% 2.88/1.29 ------ Superposition Options
% 2.88/1.29
% 2.88/1.29 --superposition_flag true
% 2.88/1.29 --sup_passive_queue_type priority_queues
% 2.88/1.29 --sup_passive_queues [[-conj_dist;-num_symb];[+score;+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb];[+score;-num_symb]]
% 2.88/1.29 --sup_passive_queues_freq [8;1;4;4]
% 2.88/1.29 --twee_lhs_weight 4
% 2.88/1.29 --sup_set_join false
% 2.88/1.29 --sup_set_join_goals true
% 2.88/1.29 --sup_set_join_limit 1000
% 2.88/1.29 --demod_completeness_check fast
% 2.88/1.29 --demod_use_ground true
% 2.88/1.29 --sup_unprocessed_bound 0
% 2.88/1.29 --sup_to_prop_solver passive
% 2.88/1.29 --sup_prop_simpl_new true
% 2.88/1.29 --sup_prop_simpl_given true
% 2.88/1.29 --sup_fun_splitting false
% 2.88/1.29 --sup_iter_deepening 2
% 2.88/1.29 --sup_restarts_mult 12
% 2.88/1.29 --sup_score sim_d_gen
% 2.88/1.29 --sup_share_score_frac 0.2
% 2.88/1.29 --sup_share_max_num_cl 500
% 2.88/1.29 --sup_ordering kbo
% 2.88/1.29 --sup_symb_ordering invfreq
% 2.88/1.29 --sup_term_weight default
% 2.88/1.29
% 2.88/1.29 ------ Superposition Simplification Setup
% 2.88/1.29
% 2.88/1.29 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 2.88/1.29 --sup_full_triv [SMTSimplify;PropSubs]
% 2.88/1.29 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 2.88/1.29 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.88/1.29 --sup_immed_triv []
% 2.88/1.29 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 2.88/1.29 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 2.88/1.29 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 2.88/1.29 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.88/1.29 --sup_input_triv [Unflattening;SMTSimplify]
% 2.88/1.29 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 2.88/1.29 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.88/1.29 --sup_full_fixpoint true
% 2.88/1.29 --sup_main_fixpoint true
% 2.88/1.29 --sup_immed_fixpoint false
% 2.88/1.29 --sup_input_fixpoint true
% 2.88/1.29 --sup_cache_sim none
% 2.88/1.29 --sup_smt_interval 500
% 2.88/1.29 --sup_bw_gjoin_interval 0
% 2.88/1.29
% 2.88/1.29 ------ Combination Options
% 2.88/1.29
% 2.88/1.29 --comb_mode clause_based
% 2.88/1.29 --comb_inst_mult 5
% 2.88/1.29 --comb_res_mult 1
% 2.88/1.29 --comb_sup_mult 8
% 2.88/1.29 --comb_sup_deep_mult 2
% 2.88/1.29
% 2.88/1.29 ------ Debug Options
% 2.88/1.29
% 2.88/1.29 --dbg_backtrace false
% 2.88/1.29 --dbg_dump_prop_clauses false
% 2.88/1.29 --dbg_dump_prop_clauses_file -
% 2.88/1.29 --dbg_out_stat false
% 2.88/1.29 --dbg_just_parse false
% 2.88/1.29
% 2.88/1.29
% 2.88/1.29
% 2.88/1.29
% 2.88/1.29 ------ Proving...
% 2.88/1.29
% 2.88/1.29
% 2.88/1.29 % SZS status CounterSatisfiable for theBenchmark.p
% 2.88/1.29
% 2.88/1.29 % SZS output start Saturation for theBenchmark.p
% See solution above
% 2.88/1.29
% 2.88/1.29
%------------------------------------------------------------------------------