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