%------------------------------------------------------------------------------
% File : iProver-SAT---3.9.4
% Problem : MGT033-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p SAT
% Computer : n014.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:12 PM UTC 2026
% Result : Satisfiable 0.26s 1.06s
% Output : Saturation 0.26s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X3,X0,X1] :
( selection_favors(X1,X3,X2)
| cardinality_at_time(X3,X2) != zero
| ~ greater(cardinality_at_time(X1,X2),zero)
| ~ subpopulation(X3,X0,X2)
| ~ subpopulation(X1,X0,X2)
| ~ environment(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp2_favour_members_24) ).
fof(f2,plain,
! [X2,X3,X0,X1] :
( selection_favors(X1,X3,X2)
| zero != cardinality_at_time(X3,X2)
| ~ greater(cardinality_at_time(X1,X2),zero)
| ~ subpopulation(X3,X0,X2)
| ~ subpopulation(X1,X0,X2)
| ~ environment(X0) ),
inference(reorient_equations,[],[f1]) ).
fof(f3,axiom,
! [X2,X0,X1] :
( cardinality_at_time(X2,X1) = zero
| ~ greater(appear(X2,X0),X1)
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_not_present_before_appearance_25) ).
fof(f4,plain,
! [X2,X0,X1] :
( zero = cardinality_at_time(X2,X1)
| ~ greater(appear(X2,X0),X1)
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
inference(reorient_equations,[],[f3]) ).
fof(f5,axiom,
! [X0,X1] :
( subpopulation(sk1(X1,X0),X0,X1)
| ~ greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_positive_sum_means_members_26) ).
fof(f6,axiom,
! [X0,X1] :
( greater(cardinality_at_time(sk1(X1,X0),X1),zero)
| ~ greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_positive_sum_means_members_27) ).
fof(f7,axiom,
! [X0,X1] :
( ~ greater(cardinality_at_time(X0,X1),zero)
| cardinality_at_time(X0,t) != zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_zero_is_not_positive_28) ).
fof(f8,plain,
! [X0,X1] :
( ~ greater(cardinality_at_time(X0,X1),zero)
| zero != cardinality_at_time(X0,t) ),
inference(reorient_equations,[],[f7]) ).
fof(f9,axiom,
! [X0,X1] :
( in_environment(X0,X1)
| ~ greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_positive_and_sustains_29) ).
fof(f10,axiom,
! [X2,X3,X0,X1] :
( in_environment(X0,X3)
| ~ greater_or_equal(X3,X1)
| ~ greater_or_equal(X2,X3)
| ~ in_environment(X0,X2)
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_durations_are_time_intervals_30) ).
fof(f11,axiom,
! [X0] :
( in_environment(X0,start_time(X0))
| ~ environment(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_opening_time_in_duration_31) ).
fof(f12,axiom,
! [X0] :
( greater_or_equal(appear(first_movers,X0),start_time(X0))
| ~ environment(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_no_FM_before_opening_32) ).
fof(f13,axiom,
! [X0,X1] :
( subpopulation(first_movers,X0,X1)
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_subpopulations_33) ).
fof(f14,axiom,
! [X0,X1] :
( subpopulation(efficient_producers,X0,X1)
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_subpopulations_34) ).
fof(f15,axiom,
! [X0] :
( in_environment(X0,appear(an_organisation,X0))
| ~ in_environment(X0,appear(first_movers,X0))
| ~ environment(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_FM_means_organisations_35) ).
fof(f16,axiom,
! [X0,X1] :
( greater(number_of_organizations(X0,X1),zero)
| ~ greater_or_equal(X1,appear(an_organisation,X0))
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a1_36) ).
fof(f17,axiom,
! [X2,X0,X1] :
( X1 = first_movers
| X1 = efficient_producers
| ~ greater(cardinality_at_time(X1,X2),zero)
| ~ subpopulation(X1,X0,X2)
| ~ environment(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a9_37) ).
fof(f18,plain,
! [X2,X0,X1] :
( first_movers = X1
| efficient_producers = X1
| ~ greater(cardinality_at_time(X1,X2),zero)
| ~ subpopulation(X1,X0,X2)
| ~ environment(X0) ),
inference(reorient_equations,[],[f17]) ).
fof(f19,axiom,
! [X0] :
( appear(an_organisation,X0) = appear(first_movers,X0)
| ~ in_environment(X0,appear(an_organisation,X0))
| ~ environment(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l13_38) ).
fof(f20,plain,
! [X0] :
( appear(first_movers,X0) = appear(an_organisation,X0)
| ~ in_environment(X0,appear(an_organisation,X0))
| ~ environment(X0) ),
inference(reorient_equations,[],[f19]) ).
fof(f21,negated_conjecture,
environment(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t2_39) ).
fof(f22,negated_conjecture,
in_environment(sk2,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t2_40) ).
fof(f23,negated_conjecture,
greater_or_equal(sk3,appear(first_movers,sk2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t2_41) ).
fof(f24,negated_conjecture,
greater(appear(efficient_producers,sk2),sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t2_42) ).
fof(f25,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t2_43) ).
tcf(c_69,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( selection_favors(X2,X0,X1)
| ~ environment(X3)
| ~ subpopulation(X2,X3,X1)
| ~ subpopulation(X0,X3,X1)
| ~ greater(cardinality_at_time(X2,X1),zero)
| ( cardinality_at_time(X0,X1) != zero ) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( cardinality_at_time(X0,X2) = zero )
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(appear(X0,X1),X2) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] :
( subpopulation(sk1(X1,X0),X0,X1)
| ~ environment(X0)
| ~ greater(number_of_organizations(X0,X1),zero) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i] :
( greater(cardinality_at_time(sk1(X1,X0),X1),zero)
| ~ environment(X0)
| ~ greater(number_of_organizations(X0,X1),zero) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i] :
( ~ greater(cardinality_at_time(X0,X1),zero)
| ( cardinality_at_time(X0,t) != zero ) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] :
( in_environment(X0,X1)
| ~ environment(X0)
| ~ greater(number_of_organizations(X0,X1),zero) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( in_environment(X0,X3)
| ~ environment(X0)
| ~ greater_or_equal(X3,X1)
| ~ greater_or_equal(X2,X3)
| ~ in_environment(X0,X2)
| ~ in_environment(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_76,plain,
! [X0: $i] :
( in_environment(X0,start_time(X0))
| ~ environment(X0) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_77,plain,
! [X0: $i] :
( greater_or_equal(appear(first_movers,X0),start_time(X0))
| ~ environment(X0) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_78,plain,
! [X0: $i,X1: $i] :
( subpopulation(first_movers,X0,X1)
| ~ environment(X0)
| ~ in_environment(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_79,plain,
! [X0: $i,X1: $i] :
( subpopulation(efficient_producers,X0,X1)
| ~ environment(X0)
| ~ in_environment(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_80,plain,
! [X0: $i] :
( in_environment(X0,appear(an_organisation,X0))
| ~ environment(X0)
| ~ in_environment(X0,appear(first_movers,X0)) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_81,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,[],[f16]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = efficient_producers )
| ( X0 = first_movers )
| ~ environment(X2)
| ~ subpopulation(X0,X2,X1)
| ~ greater(cardinality_at_time(X0,X1),zero) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_83,plain,
! [X0: $i] :
( ( appear(first_movers,X0) = appear(an_organisation,X0) )
| ~ environment(X0)
| ~ in_environment(X0,appear(an_organisation,X0)) ),
inference(cnf_transformation,[],[f20]) ).
tcf(c_84,negated_conjecture,
environment(sk2),
inference(cnf_transformation,[],[f21]) ).
tcf(c_85,negated_conjecture,
in_environment(sk2,sk3),
inference(cnf_transformation,[],[f22]) ).
tcf(c_86,negated_conjecture,
greater_or_equal(sk3,appear(first_movers,sk2)),
inference(cnf_transformation,[],[f23]) ).
tcf(c_87,negated_conjecture,
greater(appear(efficient_producers,sk2),sk3),
inference(cnf_transformation,[],[f24]) ).
tcf(c_88,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,sk3),
inference(cnf_transformation,[],[f25]) ).
tcf(c_142,plain,
! [X0: $i,X1: $i,X2: $i] :
( in_environment(X1,X0)
| ~ environment(X1)
| ~ greater_or_equal(X2,X0)
| ~ in_environment(X1,X2)
| ~ greater_or_equal(X0,start_time(X1)) ),
inference(superposition,[status(thm)],[c_76,c_75]) ).
tcf(c_143,plain,
! [X0: $i,X1: $i] :
( in_environment(sk2,X1)
| ~ environment(sk2)
| ~ greater_or_equal(X1,sk3)
| ~ in_environment(sk2,X0)
| ~ greater_or_equal(X0,X1) ),
inference(superposition,[status(thm)],[c_85,c_75]) ).
tcf(c_144,plain,
! [X0: $i,X1: $i] :
( in_environment(sk2,X1)
| ~ greater_or_equal(X1,sk3)
| ~ in_environment(sk2,X0)
| ~ greater_or_equal(X0,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_143,c_84]) ).
tcf(c_190,plain,
! [X0: $i] :
( in_environment(sk2,X0)
| ~ environment(sk2)
| ~ greater_or_equal(X0,sk3)
| ~ greater_or_equal(start_time(sk2),X0) ),
inference(superposition,[status(thm)],[c_76,c_144]) ).
tcf(c_191,plain,
! [X0: $i] :
( in_environment(sk2,X0)
| ~ greater_or_equal(sk3,X0)
| ~ greater_or_equal(X0,sk3) ),
inference(superposition,[status(thm)],[c_85,c_144]) ).
tcf(c_195,plain,
! [X0: $i] :
( in_environment(sk2,X0)
| ~ greater_or_equal(X0,sk3)
| ~ greater_or_equal(start_time(sk2),X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_190,c_84]) ).
tcf(c_241,plain,
( ( cardinality_at_time(efficient_producers,sk3) = zero )
| ~ environment(sk2)
| ~ in_environment(sk2,sk3) ),
inference(superposition,[status(thm)],[c_87,c_70]) ).
tcf(c_242,plain,
cardinality_at_time(efficient_producers,sk3) = zero,
inference(forward_subsumption_resolution,[status(thm)],[c_241,c_84,c_85]) ).
tcf(c_253,plain,
! [X0: $i,X1: $i] :
( in_environment(X1,appear(first_movers,X1))
| ~ environment(X1)
| ~ in_environment(X1,X0)
| ~ greater_or_equal(X0,appear(first_movers,X1)) ),
inference(superposition,[status(thm)],[c_77,c_142]) ).
tcf(c_267,plain,
( in_environment(sk2,appear(first_movers,sk2))
| ~ environment(sk2)
| ~ in_environment(sk2,sk3) ),
inference(superposition,[status(thm)],[c_86,c_253]) ).
tcf(c_268,plain,
in_environment(sk2,appear(first_movers,sk2)),
inference(forward_subsumption_resolution,[status(thm)],[c_267,c_84,c_85]) ).
tcf(c_269,plain,
! [X0: $i,X1: $i] :
( in_environment(sk2,X0)
| ~ environment(sk2)
| ~ in_environment(sk2,X1)
| ~ greater_or_equal(X1,X0)
| ~ greater_or_equal(X0,appear(first_movers,sk2)) ),
inference(superposition,[status(thm)],[c_268,c_75]) ).
tcf(c_270,plain,
( in_environment(sk2,appear(an_organisation,sk2))
| ~ environment(sk2) ),
inference(superposition,[status(thm)],[c_268,c_80]) ).
tcf(c_271,plain,
! [X0: $i] :
( in_environment(sk2,X0)
| ~ greater_or_equal(X0,sk3)
| ~ greater_or_equal(appear(first_movers,sk2),X0) ),
inference(superposition,[status(thm)],[c_268,c_144]) ).
tcf(c_272,plain,
in_environment(sk2,appear(an_organisation,sk2)),
inference(forward_subsumption_resolution,[status(thm)],[c_270,c_84]) ).
tcf(c_276,plain,
! [X0: $i,X1: $i] :
( in_environment(sk2,X0)
| ~ in_environment(sk2,X1)
| ~ greater_or_equal(X1,X0)
| ~ greater_or_equal(X0,appear(first_movers,sk2)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_269,c_84]) ).
tcf(c_288,plain,
( in_environment(sk2,start_time(sk2))
| ~ environment(sk2)
| ~ greater_or_equal(start_time(sk2),sk3) ),
inference(superposition,[status(thm)],[c_77,c_271]) ).
tcf(c_289,plain,
( in_environment(sk2,start_time(sk2))
| ~ greater_or_equal(start_time(sk2),sk3) ),
inference(forward_subsumption_resolution,[status(thm)],[c_288,c_84]) ).
tcf(c_302,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( sk1(X0,X1) = efficient_producers )
| ( sk1(X0,X1) = first_movers )
| ~ environment(X2)
| ~ environment(X1)
| ~ greater(number_of_organizations(X1,X0),zero)
| ~ subpopulation(sk1(X0,X1),X2,X0) ),
inference(superposition,[status(thm)],[c_72,c_82]) ).
tcf(c_323,plain,
! [X0: $i,X1: $i] :
( selection_favors(X0,efficient_producers,sk3)
| ~ environment(X1)
| ~ subpopulation(efficient_producers,X1,sk3)
| ~ subpopulation(X0,X1,sk3)
| ~ greater(cardinality_at_time(X0,sk3),zero) ),
inference(superposition,[status(thm)],[c_242,c_69]) ).
tcf(c_331,plain,
( ( appear(first_movers,sk2) = appear(an_organisation,sk2) )
| ~ environment(sk2) ),
inference(superposition,[status(thm)],[c_272,c_83]) ).
tcf(c_333,plain,
appear(first_movers,sk2) = appear(an_organisation,sk2),
inference(forward_subsumption_resolution,[status(thm)],[c_331,c_84]) ).
tcf(c_344,plain,
! [X0: $i] :
( ( cardinality_at_time(an_organisation,X0) = zero )
| ~ environment(sk2)
| ~ in_environment(sk2,X0)
| ~ greater(appear(first_movers,sk2),X0) ),
inference(superposition,[status(thm)],[c_333,c_70]) ).
tcf(c_346,plain,
! [X0: $i] :
( greater(number_of_organizations(sk2,X0),zero)
| ~ environment(sk2)
| ~ in_environment(sk2,X0)
| ~ greater_or_equal(X0,appear(first_movers,sk2)) ),
inference(superposition,[status(thm)],[c_333,c_81]) ).
tcf(c_347,plain,
! [X0: $i] :
( greater(number_of_organizations(sk2,X0),zero)
| ~ in_environment(sk2,X0)
| ~ greater_or_equal(X0,appear(first_movers,sk2)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_346,c_84]) ).
tcf(c_351,plain,
! [X0: $i] :
( ( cardinality_at_time(an_organisation,X0) = zero )
| ~ in_environment(sk2,X0)
| ~ greater(appear(first_movers,sk2),X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_344,c_84]) ).
tcf(c_368,plain,
( greater(number_of_organizations(sk2,sk3),zero)
| ~ in_environment(sk2,sk3) ),
inference(superposition,[status(thm)],[c_86,c_347]) ).
tcf(c_369,plain,
greater(number_of_organizations(sk2,sk3),zero),
inference(forward_subsumption_resolution,[status(thm)],[c_368,c_85]) ).
tcf(c_397,plain,
! [X0: $i,X1: $i] :
( selection_favors(sk1(sk3,X0),efficient_producers,sk3)
| ~ environment(X1)
| ~ environment(X0)
| ~ subpopulation(efficient_producers,X1,sk3)
| ~ greater(number_of_organizations(X0,sk3),zero)
| ~ subpopulation(sk1(sk3,X0),X1,sk3) ),
inference(superposition,[status(thm)],[c_72,c_323]) ).
tcf(c_398,plain,
! [X0: $i] :
( selection_favors(efficient_producers,efficient_producers,sk3)
| ~ environment(X0)
| ~ greater(zero,zero)
| ~ subpopulation(efficient_producers,X0,sk3) ),
inference(superposition,[status(thm)],[c_242,c_323]) ).
tcf(c_419,plain,
! [X0: $i] :
( selection_favors(efficient_producers,efficient_producers,sk3)
| ~ environment(X0)
| ~ greater(zero,zero)
| ~ in_environment(X0,sk3) ),
inference(superposition,[status(thm)],[c_79,c_398]) ).
tcf(c_433,plain,
( selection_favors(efficient_producers,efficient_producers,sk3)
| ~ environment(sk2)
| ~ greater(zero,zero) ),
inference(superposition,[status(thm)],[c_85,c_419]) ).
tcf(c_434,plain,
( selection_favors(efficient_producers,efficient_producers,sk3)
| ~ greater(zero,zero) ),
inference(forward_subsumption_resolution,[status(thm)],[c_433,c_84]) ).
tcf(c_455,plain,
! [X0: $i] :
( selection_favors(sk1(sk3,X0),efficient_producers,sk3)
| ~ environment(X0)
| ~ subpopulation(efficient_producers,X0,sk3)
| ~ greater(number_of_organizations(X0,sk3),zero) ),
inference(superposition,[status(thm)],[c_71,c_397]) ).
tcf(c_473,plain,
! [X0: $i,X1: $i] :
( ( sk1(X1,X0) = efficient_producers )
| ( sk1(X1,X0) = first_movers )
| ~ environment(X0)
| ~ greater(number_of_organizations(X0,X1),zero) ),
inference(superposition,[status(thm)],[c_71,c_302]) ).
tcf(c_499,plain,
( ( sk1(sk3,sk2) = efficient_producers )
| ( sk1(sk3,sk2) = first_movers )
| ~ environment(sk2) ),
inference(superposition,[status(thm)],[c_369,c_473]) ).
tcf(c_500,plain,
( ( sk1(sk3,sk2) = efficient_producers )
| ( sk1(sk3,sk2) = first_movers ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_499,c_84]) ).
tcf(c_507,plain,
( greater(cardinality_at_time(efficient_producers,sk3),zero)
| ( sk1(sk3,sk2) = first_movers )
| ~ environment(sk2)
| ~ greater(number_of_organizations(sk2,sk3),zero) ),
inference(superposition,[status(thm)],[c_500,c_72]) ).
tcf(c_508,plain,
( subpopulation(efficient_producers,sk2,sk3)
| ( sk1(sk3,sk2) = first_movers )
| ~ environment(sk2)
| ~ greater(number_of_organizations(sk2,sk3),zero) ),
inference(superposition,[status(thm)],[c_500,c_71]) ).
tcf(c_509,plain,
( selection_favors(efficient_producers,efficient_producers,sk3)
| ( sk1(sk3,sk2) = first_movers )
| ~ environment(sk2)
| ~ subpopulation(efficient_producers,sk2,sk3)
| ~ greater(number_of_organizations(sk2,sk3),zero) ),
inference(superposition,[status(thm)],[c_500,c_455]) ).
tcf(c_510,plain,
! [X0: $i] :
( selection_favors(sk1(sk3,sk2),efficient_producers,sk3)
| ( sk1(sk3,sk2) = first_movers )
| ~ environment(sk2)
| ~ environment(X0)
| ~ subpopulation(efficient_producers,X0,sk3)
| ~ greater(number_of_organizations(sk2,sk3),zero) ),
inference(superposition,[status(thm)],[c_500,c_397]) ).
tcf(c_511,plain,
( subpopulation(efficient_producers,sk2,sk3)
| ( sk1(sk3,sk2) = first_movers ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_508,c_84,c_369]) ).
tcf(c_514,plain,
( greater(zero,zero)
| ( sk1(sk3,sk2) = first_movers )
| ~ environment(sk2)
| ~ greater(number_of_organizations(sk2,sk3),zero) ),
inference(light_normalisation,[status(thm)],[c_507,c_242]) ).
tcf(c_515,plain,
( greater(zero,zero)
| ( sk1(sk3,sk2) = first_movers ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_514,c_84,c_369]) ).
tcf(c_518,plain,
( selection_favors(efficient_producers,efficient_producers,sk3)
| ( sk1(sk3,sk2) = first_movers )
| ~ subpopulation(efficient_producers,sk2,sk3) ),
inference(forward_subsumption_resolution,[status(thm)],[c_509,c_84,c_369]) ).
tcf(c_522,plain,
! [X0: $i] :
( selection_favors(sk1(sk3,sk2),efficient_producers,sk3)
| ( sk1(sk3,sk2) = first_movers )
| ~ environment(X0)
| ~ subpopulation(efficient_producers,X0,sk3) ),
inference(forward_subsumption_resolution,[status(thm)],[c_510,c_84,c_369]) ).
tcf(c_536,plain,
( selection_favors(efficient_producers,efficient_producers,sk3)
| ( sk1(sk3,sk2) = first_movers ) ),
inference(global_subsumption_just,[status(thm)],[c_518,c_511,c_518]) ).
tcf(c_551,plain,
( selection_favors(sk1(sk3,sk2),efficient_producers,sk3)
| ( sk1(sk3,sk2) = first_movers )
| ~ environment(sk2) ),
inference(superposition,[status(thm)],[c_511,c_522]) ).
tcf(c_552,plain,
( selection_favors(sk1(sk3,sk2),efficient_producers,sk3)
| ( sk1(sk3,sk2) = first_movers ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_551,c_84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT033-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p SAT
% 0.11/0.37 % Computer : n014.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:06:04 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p SAT
% 0.11/0.40 Running model finding
% 0.11/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.11/0.41
% 0.11/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.41
% 0.11/0.41 % Detected problem language: tptp
% 0.11/0.42 % Proving...
% 0.26/1.06 % SZS status Started for theBenchmark.p
% 0.26/1.06 % SZS status Satisfiable for theBenchmark.p
% 0.26/1.06
% 0.26/1.06 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.26/1.06
% 0.26/1.06 ------ iProver source info
% 0.26/1.06
% 0.26/1.06 git: date: 2026-07-19 20:42:38 +0200
% 0.26/1.06 git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.26/1.06 git: non_committed_changes: false
% 0.26/1.06
% 0.26/1.06 ------ Parsing...successful
% 0.26/1.06
% 0.26/1.06
% 0.26/1.06 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.26/1.06 ------ Proving...
% 0.26/1.06 ------ Problem Properties
% 0.26/1.06
% 0.26/1.06
% 0.26/1.06 clauses 20
% 0.26/1.06 conjectures 5
% 0.26/1.06 EPR 6
% 0.26/1.06 Horn 19
% 0.26/1.06 unary 5
% 0.26/1.06 binary 3
% 0.26/1.06 lits 57
% 0.26/1.06 lits eq 6
% 0.26/1.06 fd_pure 0
% 0.26/1.06 fd_pseudo 0
% 0.26/1.06 fd_cond 1
% 0.26/1.06 fd_pseudo_cond 0
% 0.26/1.06 AC symbols 0
% 0.26/1.06
% 0.26/1.06 ------ Schedule dynamic 5 is on
% 0.26/1.06
% 0.26/1.06 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.26/1.06
% 0.26/1.06
% 0.26/1.06 ------
% 0.26/1.06 Current options:
% 0.26/1.06 ------
% 0.26/1.06
% 0.26/1.06 ------ Input Options
% 0.26/1.06
% 0.26/1.06 --out_options all
% 0.26/1.06 --tptp_safe_out true
% 0.26/1.06 --problem_path ""
% 0.26/1.06 --include_path ""
% 0.26/1.06 --clausifier res/vclausify_rel
% 0.26/1.06 --clausifier_options --mode clausify -t 101.67 -updr off
% 0.26/1.06 --stdin false
% 0.26/1.06 --proof_out true
% 0.26/1.06 --proof_dot_file ""
% 0.26/1.06 --proof_reduce_dot []
% 0.26/1.06 --suppress_sat_res false
% 0.26/1.06 --suppress_unsat_res true
% 0.26/1.06 --stats_out none
% 0.26/1.06 --stats_mem false
% 0.26/1.06 --theory_stats_out false
% 0.26/1.06
% 0.26/1.06 ------ General Options
% 0.26/1.06
% 0.26/1.06 --fof false
% 0.26/1.06 --time_out_real 305.
% 0.26/1.06 --time_out_virtual -1.
% 0.26/1.06 --rnd_seed 13
% 0.26/1.06 --symbol_type_check false
% 0.26/1.06 --clausify_out false
% 0.26/1.06 --sig_cnt_out false
% 0.26/1.06 --trig_cnt_out false
% 0.26/1.06 --trig_cnt_out_tolerance 1.
% 0.26/1.06 --trig_cnt_out_sk_spl false
% 0.26/1.06 --abstr_cl_out false
% 0.26/1.06
% 0.26/1.06 ------ Interactive Mode
% 0.26/1.06
% 0.26/1.06 --interactive_mode false
% 0.26/1.06 --external_ip_address ""
% 0.26/1.06 --external_port 0
% 0.26/1.06
% 0.26/1.06 ------ Global Options
% 0.26/1.06
% 0.26/1.06 --schedule default
% 0.26/1.06 --add_important_lit false
% 0.26/1.06 --prop_solver_per_cl 500
% 0.26/1.06 --subs_bck_mult 8
% 0.26/1.06 --min_unsat_core false
% 0.26/1.06 --soft_assumptions false
% 0.26/1.06 --soft_lemma_size 3
% 0.26/1.06 --prop_impl_unit_size 0
% 0.26/1.06 --prop_impl_unit []
% 0.26/1.06 --share_sel_clauses true
% 0.26/1.06 --reset_solvers false
% 0.26/1.06 --bc_imp_inh [conj_cone]
% 0.26/1.06 --conj_cone_tolerance 3.
% 0.26/1.06 --extra_neg_conj none
% 0.26/1.06 --large_theory_mode true
% 0.26/1.06 --prolific_symb_bound 200
% 0.26/1.06 --lt_threshold 2000
% 0.26/1.06 --clause_weak_htbl true
% 0.26/1.06 --gc_record_bc_elim false
% 0.26/1.06
% 0.26/1.06 ------ Preprocessing Options
% 0.26/1.06
% 0.26/1.06 --preprocessing_flag false
% 0.26/1.06 --time_out_prep_mult 0.1
% 0.26/1.06 --splitting_mode input
% 0.26/1.06 --splitting_grd true
% 0.26/1.06 --splitting_cvd false
% 0.26/1.06 --splitting_cvd_svl false
% 0.26/1.06 --splitting_nvd 32
% 0.26/1.06 --sub_typing false
% 0.26/1.06 --prep_eq_flat_conj false
% 0.26/1.06 --prep_ineq_split false
% 0.26/1.06 --prep_eq_flat_all_gr false
% 0.26/1.06 --prep_gs_sim true
% 0.26/1.06 --prep_unflatten true
% 0.26/1.06 --prep_res_sim true
% 0.26/1.06 --prep_sup_sim_all true
% 0.26/1.06 --prep_sup_sim_sup false
% 0.26/1.06 --prep_upred true
% 0.26/1.06 --prep_well_definedness true
% 0.26/1.06 --prep_sem_filter exhaustive
% 0.26/1.06 --prep_sem_filter_out false
% 0.26/1.06 --pred_elim true
% 0.26/1.06 --res_sim_input true
% 0.26/1.06 --eq_ax_congr_red true
% 0.26/1.06 --pure_diseq_elim true
% 0.26/1.06 --brand_transform false
% 0.26/1.06 --non_eq_to_eq false
% 0.26/1.06 --prep_eq_proxy false
% 0.26/1.06 --prep_def_merge true
% 0.26/1.06 --prep_def_merge_prop_impl false
% 0.26/1.06 --prep_def_merge_mbd true
% 0.26/1.06 --prep_def_merge_tr_red false
% 0.26/1.06 --prep_def_merge_tr_cl false
% 0.26/1.06 --smt_preprocessing false
% 0.26/1.06 --smt_ac_axioms fast
% 0.26/1.06 --preprocessed_out false
% 0.26/1.06 --preprocessed_stats false
% 0.26/1.06
% 0.26/1.06 ------ Abstraction refinement Options
% 0.26/1.06
% 0.26/1.06 --abstr_ref []
% 0.26/1.06 --abstr_ref_prep false
% 0.26/1.06 --abstr_ref_until_sat false
% 0.26/1.06 --abstr_ref_sig_restrict funpre
% 0.26/1.06 --abstr_ref_af_restrict_to_split_sk false
% 0.26/1.06 --abstr_ref_under []
% 0.26/1.06
% 0.26/1.06 ------ SAT Options
% 0.26/1.06
% 0.26/1.06 --sat_mode false
% 0.26/1.06 --sat_fm_restart_options ""
% 0.26/1.06 --sat_gr_def false
% 0.26/1.06 --sat_epr_types true
% 0.26/1.06 --sat_non_cyclic_types false
% 0.26/1.06 --sat_finite_models false
% 0.26/1.06 --sat_fm_lemmas false
% 0.26/1.06 --sat_fm_prep false
% 0.26/1.06 --sat_fm_uc_incr true
% 0.26/1.06 --sat_out_model pos
% 0.26/1.06 --sat_out_clauses false
% 0.26/1.06
% 0.26/1.06 ------ QBF Options
% 0.26/1.06
% 0.26/1.06 --qbf_mode false
% 0.26/1.06 --qbf_elim_univ false
% 0.26/1.06 --qbf_dom_inst none
% 0.26/1.06 --qbf_dom_pre_inst false
% 0.26/1.06 --qbf_sk_in false
% 0.26/1.06 --qbf_pred_elim true
% 0.26/1.06 --qbf_split 512
% 0.26/1.06
% 0.26/1.06 ------ BMC1 Options
% 0.26/1.06
% 0.26/1.06 --bmc1_incremental false
% 0.26/1.06 --bmc1_axioms reachable_all
% 0.26/1.06 --bmc1_min_bound 0
% 0.26/1.06 --bmc1_max_bound -1
% 0.26/1.06 --bmc1_max_bound_default -1
% 0.26/1.06 --bmc1_symbol_reachability true
% 0.26/1.06 --bmc1_property_lemmas false
% 0.26/1.06 --bmc1_k_induction false
% 0.26/1.06 --bmc1_non_equiv_states false
% 0.26/1.06 --bmc1_deadlock false
% 0.26/1.06 --bmc1_ucm false
% 0.26/1.06 --bmc1_add_unsat_core none
% 0.26/1.06 --bmc1_unsat_core_children false
% 0.26/1.06 --bmc1_unsat_core_extrapolate_axioms false
% 0.26/1.06 --bmc1_out_stat full
% 0.26/1.06 --bmc1_ground_init false
% 0.26/1.06 --bmc1_pre_inst_next_state false
% 0.26/1.06 --bmc1_pre_inst_state false
% 0.26/1.06 --bmc1_pre_inst_reach_state false
% 0.26/1.06 --bmc1_out_unsat_core false
% 0.26/1.06 --bmc1_aig_witness_out false
% 0.26/1.06 --bmc1_verbose false
% 0.26/1.06 --bmc1_dump_clauses_tptp false
% 0.26/1.06 --bmc1_dump_unsat_core_tptp false
% 0.26/1.06 --bmc1_dump_file -
% 0.26/1.06 --bmc1_ucm_expand_uc_limit 128
% 0.26/1.06 --bmc1_ucm_n_expand_iterations 6
% 0.26/1.06 --bmc1_ucm_extend_mode 1
% 0.26/1.06 --bmc1_ucm_init_mode 2
% 0.26/1.06 --bmc1_ucm_cone_mode none
% 0.26/1.06 --bmc1_ucm_reduced_relation_type 0
% 0.26/1.06 --bmc1_ucm_relax_model 4
% 0.26/1.06 --bmc1_ucm_full_tr_after_sat true
% 0.26/1.06 --bmc1_ucm_expand_neg_assumptions false
% 0.26/1.06 --bmc1_ucm_layered_model none
% 0.26/1.06 --bmc1_ucm_max_lemma_size 10
% 0.26/1.06
% 0.26/1.06 ------ AIG Options
% 0.26/1.06
% 0.26/1.06 --aig_mode false
% 0.26/1.06
% 0.26/1.06 ------ Instantiation Options
% 0.26/1.06
% 0.26/1.06 --instantiation_flag true
% 0.26/1.06 --inst_sos_flag false
% 0.26/1.06 --inst_sos_phase true
% 0.26/1.06 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 0.26/1.06 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.26/1.06 --inst_lit_sel_side none
% 0.26/1.06 --inst_solver_per_active 1400
% 0.26/1.06 --inst_solver_calls_frac 1.
% 0.26/1.06 --inst_to_smt_solver true
% 0.26/1.06 --inst_passive_queue_type priority_queues
% 0.26/1.06 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.26/1.06 --inst_passive_queues_freq [25;2]
% 0.26/1.06 --inst_dismatching true
% 0.26/1.06 --inst_eager_unprocessed_to_passive true
% 0.26/1.06 --inst_unprocessed_bound 1000
% 0.26/1.06 --inst_prop_sim_given true
% 0.26/1.06 --inst_prop_sim_new false
% 0.26/1.06 --inst_subs_new false
% 0.26/1.06 --inst_eq_res_simp false
% 0.26/1.06 --inst_subs_given false
% 0.26/1.06 --inst_orphan_elimination true
% 0.26/1.06 --inst_learning_loop_flag true
% 0.26/1.06 --inst_learning_start 3000
% 0.26/1.06 --inst_learning_factor 2
% 0.26/1.06 --inst_start_prop_sim_after_learn 3
% 0.26/1.06 --inst_sel_renew solver
% 0.26/1.06 --inst_lit_activity_flag true
% 0.26/1.06 --inst_restr_to_given false
% 0.26/1.06 --inst_activity_threshold 500
% 0.26/1.06
% 0.26/1.06 ------ Resolution Options
% 0.26/1.06
% 0.26/1.06 --resolution_flag false
% 0.26/1.06 --res_lit_sel adaptive
% 0.26/1.06 --res_lit_sel_side none
% 0.26/1.06 --res_ordering kbo
% 0.26/1.06 --res_to_prop_solver active
% 0.26/1.06 --res_prop_simpl_new false
% 0.26/1.06 --res_prop_simpl_given true
% 0.26/1.06 --res_to_smt_solver true
% 0.26/1.06 --res_passive_queue_type priority_queues
% 0.26/1.06 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.26/1.06 --res_passive_queues_freq [15;5]
% 0.26/1.06 --res_forward_subs full
% 0.26/1.06 --res_backward_subs full
% 0.26/1.06 --res_forward_subs_resolution true
% 0.26/1.06 --res_backward_subs_resolution true
% 0.26/1.06 --res_orphan_elimination true
% 0.26/1.06 --res_time_limit 300.
% 0.26/1.06
% 0.26/1.06 ------ Superposition Options
% 0.26/1.06
% 0.26/1.06 --superposition_flag true
% 0.26/1.06 --sup_passive_queue_type priority_queues
% 0.26/1.06 --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.26/1.06 --sup_passive_queues_freq [8;1;4;4]
% 0.26/1.06 --twee_lhs_weight 4
% 0.26/1.06 --sup_set_join false
% 0.26/1.06 --sup_set_join_goals true
% 0.26/1.06 --sup_set_join_limit 1000
% 0.26/1.06 --demod_completeness_check fast
% 0.26/1.06 --demod_use_ground true
% 0.26/1.06 --sup_unprocessed_bound 0
% 0.26/1.06 --sup_to_prop_solver passive
% 0.26/1.06 --sup_prop_simpl_new true
% 0.26/1.06 --sup_prop_simpl_given true
% 0.26/1.06 --sup_fun_splitting false
% 0.26/1.06 --sup_iter_deepening 2
% 0.26/1.06 --sup_restarts_mult 12
% 0.26/1.06 --sup_score sim_d_gen
% 0.26/1.06 --sup_share_score_frac 0.2
% 0.26/1.06 --sup_share_max_num_cl 500
% 0.26/1.06 --sup_ordering kbo
% 0.26/1.06 --sup_symb_ordering invfreq
% 0.26/1.06 --sup_term_weight default
% 0.26/1.06
% 0.26/1.06 ------ Superposition Simplification Setup
% 0.26/1.06
% 0.26/1.06 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 0.26/1.06 --sup_full_triv [SMTSimplify;PropSubs]
% 0.26/1.06 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 0.26/1.06 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 0.26/1.06 --sup_immed_triv []
% 0.26/1.06 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 0.26/1.06 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 0.26/1.06 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 0.26/1.06 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 0.26/1.06 --sup_input_triv [Unflattening;SMTSimplify]
% 0.26/1.06 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 0.26/1.06 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 0.26/1.06 --sup_full_fixpoint true
% 0.26/1.06 --sup_main_fixpoint true
% 0.26/1.06 --sup_immed_fixpoint false
% 0.26/1.06 --sup_input_fixpoint true
% 0.26/1.06 --sup_cache_sim none
% 0.26/1.06 --sup_smt_interval 500
% 0.26/1.06 --sup_bw_gjoin_interval 0
% 0.26/1.06
% 0.26/1.06 ------ Combination Options
% 0.26/1.06
% 0.26/1.06 --comb_mode clause_based
% 0.26/1.06 --comb_inst_mult 5
% 0.26/1.06 --comb_res_mult 1
% 0.26/1.06 --comb_sup_mult 8
% 0.26/1.06 --comb_sup_deep_mult 2
% 0.26/1.06
% 0.26/1.06 ------ Debug Options
% 0.26/1.06
% 0.26/1.06 --dbg_backtrace false
% 0.26/1.06 --dbg_dump_prop_clauses false
% 0.26/1.06 --dbg_dump_prop_clauses_file -
% 0.26/1.06 --dbg_out_stat false
% 0.26/1.06 --dbg_just_parse false
% 0.26/1.06
% 0.26/1.06
% 0.26/1.06
% 0.26/1.06
% 0.26/1.06 ------ Proving...
% 0.26/1.06
% 0.26/1.06
% 0.26/1.06 % SZS status Satisfiable for theBenchmark.p
% 0.26/1.06
% 0.26/1.06 % SZS output start Saturation for theBenchmark.p
% See solution above
% 0.26/1.06
% 0.26/1.06
%------------------------------------------------------------------------------