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