%------------------------------------------------------------------------------
% File : iProver-SAT---3.9.4
% Problem : MGT033+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 : n009.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.39s 1.17s
% Output : Saturation 0.39s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2,X3] :
( ( cardinality_at_time(X2,X3) = zero
& greater(cardinality_at_time(X1,X3),zero)
& subpopulation(X2,X0,X3)
& subpopulation(X1,X0,X3)
& environment(X0) )
=> selection_favors(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp2_favour_members) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( greater(appear(X1,X0),X2)
& in_environment(X0,X2)
& environment(X0) )
=> cardinality_at_time(X1,X2) = zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_not_present_before_appearance) ).
fof(f3,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_positive_sum_means_members) ).
fof(f4,axiom,
! [X0,X1] :
( cardinality_at_time(X0,t) = zero
=> ~ greater(cardinality_at_time(X0,X1),zero) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_zero_is_not_positive) ).
fof(f5,axiom,
! [X0,X1] :
( ( greater(number_of_organizations(X0,X1),zero)
& environment(X0) )
=> in_environment(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_positive_and_sustains) ).
fof(f6,axiom,
! [X0,X1,X2,X3] :
( ( greater_or_equal(X3,X1)
& greater_or_equal(X2,X3)
& in_environment(X0,X2)
& in_environment(X0,X1)
& environment(X0) )
=> in_environment(X0,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_durations_are_time_intervals) ).
fof(f7,axiom,
! [X0] :
( environment(X0)
=> in_environment(X0,start_time(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_opening_time_in_duration) ).
fof(f8,axiom,
! [X0] :
( environment(X0)
=> greater_or_equal(appear(first_movers,X0),start_time(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_no_FM_before_opening) ).
fof(f9,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(f10,axiom,
! [X0] :
( ( in_environment(X0,appear(first_movers,X0))
& environment(X0) )
=> in_environment(X0,appear(an_organisation,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_FM_means_organisations) ).
fof(f11,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(f12,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(f13,axiom,
! [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',l13) ).
fof(f14,conjecture,
! [X0,X1] :
( ( greater(appear(efficient_producers,X0),X1)
& greater_or_equal(X1,appear(first_movers,X0))
& in_environment(X0,X1)
& environment(X0) )
=> selection_favors(first_movers,efficient_producers,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t2) ).
fof(f15,negated_conjecture,
~ ! [X0,X1] :
( ( greater(appear(efficient_producers,X0),X1)
& greater_or_equal(X1,appear(first_movers,X0))
& in_environment(X0,X1)
& environment(X0) )
=> selection_favors(first_movers,efficient_producers,X1) ),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f16,plain,
! [X0,X1,X2,X3] :
( zero != cardinality_at_time(X2,X3)
| ~ greater(cardinality_at_time(X1,X3),zero)
| ~ subpopulation(X2,X0,X3)
| ~ subpopulation(X1,X0,X3)
| ~ environment(X0)
| selection_favors(X1,X2,X3) ),
inference(ennf_transformation,[],[f1]) ).
fof(f17,plain,
! [X0,X1,X2,X3] :
( zero != cardinality_at_time(X2,X3)
| ~ greater(cardinality_at_time(X1,X3),zero)
| ~ subpopulation(X2,X0,X3)
| ~ subpopulation(X1,X0,X3)
| ~ environment(X0)
| selection_favors(X1,X2,X3) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ~ greater(appear(X1,X0),X2)
| ~ in_environment(X0,X2)
| ~ environment(X0)
| cardinality_at_time(X1,X2) = zero ),
inference(ennf_transformation,[],[f2]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ~ greater(appear(X1,X0),X2)
| ~ in_environment(X0,X2)
| ~ environment(X0)
| cardinality_at_time(X1,X2) = zero ),
inference(flattening,[],[f18]) ).
fof(f20,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,[],[f3]) ).
fof(f21,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,[],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( zero != cardinality_at_time(X0,t)
| ~ greater(cardinality_at_time(X0,X1),zero) ),
inference(ennf_transformation,[],[f4]) ).
fof(f23,plain,
! [X0,X1] :
( ~ greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0)
| in_environment(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f24,plain,
! [X0,X1] :
( ~ greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0)
| in_environment(X0,X1) ),
inference(flattening,[],[f23]) ).
fof(f25,plain,
! [X0,X1,X2,X3] :
( ~ greater_or_equal(X3,X1)
| ~ greater_or_equal(X2,X3)
| ~ in_environment(X0,X2)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| in_environment(X0,X3) ),
inference(ennf_transformation,[],[f6]) ).
fof(f26,plain,
! [X0,X1,X2,X3] :
( ~ greater_or_equal(X3,X1)
| ~ greater_or_equal(X2,X3)
| ~ in_environment(X0,X2)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| in_environment(X0,X3) ),
inference(flattening,[],[f25]) ).
fof(f27,plain,
! [X0] :
( ~ environment(X0)
| in_environment(X0,start_time(X0)) ),
inference(ennf_transformation,[],[f7]) ).
fof(f28,plain,
! [X0] :
( ~ environment(X0)
| greater_or_equal(appear(first_movers,X0),start_time(X0)) ),
inference(ennf_transformation,[],[f8]) ).
fof(f29,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| ~ environment(X0)
| ( subpopulation(efficient_producers,X0,X1)
& subpopulation(first_movers,X0,X1) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f30,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| ~ environment(X0)
| ( subpopulation(efficient_producers,X0,X1)
& subpopulation(first_movers,X0,X1) ) ),
inference(flattening,[],[f29]) ).
fof(f31,plain,
! [X0] :
( ~ in_environment(X0,appear(first_movers,X0))
| ~ environment(X0)
| in_environment(X0,appear(an_organisation,X0)) ),
inference(ennf_transformation,[],[f10]) ).
fof(f32,plain,
! [X0] :
( ~ in_environment(X0,appear(first_movers,X0))
| ~ environment(X0)
| in_environment(X0,appear(an_organisation,X0)) ),
inference(flattening,[],[f31]) ).
fof(f33,plain,
! [X0,X1] :
( ~ greater_or_equal(X1,appear(an_organisation,X0))
| ~ in_environment(X0,X1)
| ~ environment(X0)
| greater(number_of_organizations(X0,X1),zero) ),
inference(ennf_transformation,[],[f11]) ).
fof(f34,plain,
! [X0,X1] :
( ~ greater_or_equal(X1,appear(an_organisation,X0))
| ~ in_environment(X0,X1)
| ~ environment(X0)
| greater(number_of_organizations(X0,X1),zero) ),
inference(flattening,[],[f33]) ).
fof(f35,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,[],[f12]) ).
fof(f36,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,[],[f35]) ).
fof(f37,plain,
! [X0] :
( ~ in_environment(X0,appear(an_organisation,X0))
| ~ environment(X0)
| appear(an_organisation,X0) = appear(first_movers,X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f38,plain,
! [X0] :
( ~ in_environment(X0,appear(an_organisation,X0))
| ~ environment(X0)
| appear(an_organisation,X0) = appear(first_movers,X0) ),
inference(flattening,[],[f37]) ).
fof(f39,plain,
? [X0,X1] :
( greater(appear(efficient_producers,X0),X1)
& greater_or_equal(X1,appear(first_movers,X0))
& in_environment(X0,X1)
& environment(X0)
& ~ selection_favors(first_movers,efficient_producers,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f40,plain,
? [X0,X1] :
( greater(appear(efficient_producers,X0),X1)
& greater_or_equal(X1,appear(first_movers,X0))
& in_environment(X0,X1)
& environment(X0)
& ~ selection_favors(first_movers,efficient_producers,X1) ),
inference(flattening,[],[f39]) ).
fof(f41,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))],[f21]) ).
fof(f42,plain,
( greater(appear(efficient_producers,sK1),sK2)
& greater_or_equal(sK2,appear(first_movers,sK1))
& in_environment(sK1,sK2)
& environment(sK1)
& ~ selection_favors(first_movers,efficient_producers,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f40]) ).
fof(f43,plain,
! [X2,X3,X0,X1] :
( zero != cardinality_at_time(X2,X3)
| ~ greater(cardinality_at_time(X1,X3),zero)
| ~ subpopulation(X2,X0,X3)
| ~ subpopulation(X1,X0,X3)
| ~ environment(X0)
| selection_favors(X1,X2,X3) ),
inference(cnf_transformation,[],[f17]) ).
fof(f44,plain,
! [X2,X0,X1] :
( ~ greater(appear(X1,X0),X2)
| ~ in_environment(X0,X2)
| ~ environment(X0)
| zero = cardinality_at_time(X1,X2) ),
inference(cnf_transformation,[],[f19]) ).
fof(f45,plain,
! [X0,X1] :
( ~ greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0)
| greater(cardinality_at_time(sK0(X0,X1),X1),zero) ),
inference(cnf_transformation,[],[f41]) ).
fof(f46,plain,
! [X0,X1] :
( ~ greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0)
| subpopulation(sK0(X0,X1),X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f47,plain,
! [X0,X1] :
( zero != cardinality_at_time(X0,t)
| ~ greater(cardinality_at_time(X0,X1),zero) ),
inference(cnf_transformation,[],[f22]) ).
fof(f48,plain,
! [X0,X1] :
( ~ greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0)
| in_environment(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f49,plain,
! [X2,X3,X0,X1] :
( ~ greater_or_equal(X3,X1)
| ~ greater_or_equal(X2,X3)
| ~ in_environment(X0,X2)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| in_environment(X0,X3) ),
inference(cnf_transformation,[],[f26]) ).
fof(f50,plain,
! [X0] :
( ~ environment(X0)
| in_environment(X0,start_time(X0)) ),
inference(cnf_transformation,[],[f27]) ).
fof(f51,plain,
! [X0] :
( ~ environment(X0)
| greater_or_equal(appear(first_movers,X0),start_time(X0)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f52,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| ~ environment(X0)
| subpopulation(efficient_producers,X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f53,plain,
! [X0,X1] :
( ~ in_environment(X0,X1)
| ~ environment(X0)
| subpopulation(first_movers,X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f54,plain,
! [X0] :
( ~ in_environment(X0,appear(first_movers,X0))
| ~ environment(X0)
| in_environment(X0,appear(an_organisation,X0)) ),
inference(cnf_transformation,[],[f32]) ).
fof(f55,plain,
! [X0,X1] :
( ~ greater_or_equal(X1,appear(an_organisation,X0))
| ~ in_environment(X0,X1)
| ~ environment(X0)
| greater(number_of_organizations(X0,X1),zero) ),
inference(cnf_transformation,[],[f34]) ).
fof(f56,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,[],[f36]) ).
fof(f57,plain,
! [X0] :
( ~ in_environment(X0,appear(an_organisation,X0))
| ~ environment(X0)
| appear(first_movers,X0) = appear(an_organisation,X0) ),
inference(cnf_transformation,[],[f38]) ).
fof(f58,plain,
greater(appear(efficient_producers,sK1),sK2),
inference(cnf_transformation,[],[f42]) ).
fof(f59,plain,
greater_or_equal(sK2,appear(first_movers,sK1)),
inference(cnf_transformation,[],[f42]) ).
fof(f60,plain,
in_environment(sK1,sK2),
inference(cnf_transformation,[],[f42]) ).
fof(f61,plain,
environment(sK1),
inference(cnf_transformation,[],[f42]) ).
fof(f62,plain,
~ selection_favors(first_movers,efficient_producers,sK2),
inference(cnf_transformation,[],[f42]) ).
tcf(c_49,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,[],[f43]) ).
tcf(c_50,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,[],[f44]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( subpopulation(sK0(X0,X1),X0,X1)
| ~ environment(X0)
| ~ greater(number_of_organizations(X0,X1),zero) ),
inference(cnf_transformation,[],[f46]) ).
tcf(c_52,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,[],[f45]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( ~ greater(cardinality_at_time(X0,X1),zero)
| ( cardinality_at_time(X0,t) != zero ) ),
inference(cnf_transformation,[],[f47]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( in_environment(X0,X1)
| ~ environment(X0)
| ~ greater(number_of_organizations(X0,X1),zero) ),
inference(cnf_transformation,[],[f48]) ).
tcf(c_55,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,[],[f49]) ).
tcf(c_56,plain,
! [X0: $i] :
( in_environment(X0,start_time(X0))
| ~ environment(X0) ),
inference(cnf_transformation,[],[f50]) ).
tcf(c_57,plain,
! [X0: $i] :
( greater_or_equal(appear(first_movers,X0),start_time(X0))
| ~ environment(X0) ),
inference(cnf_transformation,[],[f51]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( subpopulation(first_movers,X0,X1)
| ~ environment(X0)
| ~ in_environment(X0,X1) ),
inference(cnf_transformation,[],[f53]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( subpopulation(efficient_producers,X0,X1)
| ~ environment(X0)
| ~ in_environment(X0,X1) ),
inference(cnf_transformation,[],[f52]) ).
tcf(c_60,plain,
! [X0: $i] :
( in_environment(X0,appear(an_organisation,X0))
| ~ environment(X0)
| ~ in_environment(X0,appear(first_movers,X0)) ),
inference(cnf_transformation,[],[f54]) ).
tcf(c_61,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,[],[f55]) ).
tcf(c_62,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,[],[f56]) ).
tcf(c_63,plain,
! [X0: $i] :
( ( appear(first_movers,X0) = appear(an_organisation,X0) )
| ~ environment(X0)
| ~ in_environment(X0,appear(an_organisation,X0)) ),
inference(cnf_transformation,[],[f57]) ).
tcf(c_64,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,sK2),
inference(cnf_transformation,[],[f62]) ).
tcf(c_65,negated_conjecture,
environment(sK1),
inference(cnf_transformation,[],[f61]) ).
tcf(c_66,negated_conjecture,
in_environment(sK1,sK2),
inference(cnf_transformation,[],[f60]) ).
tcf(c_67,negated_conjecture,
greater_or_equal(sK2,appear(first_movers,sK1)),
inference(cnf_transformation,[],[f59]) ).
tcf(c_68,negated_conjecture,
greater(appear(efficient_producers,sK1),sK2),
inference(cnf_transformation,[],[f58]) ).
tcf(c_122,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_56,c_55]) ).
tcf(c_123,plain,
! [X0: $i,X1: $i] :
( in_environment(sK1,X1)
| ~ environment(sK1)
| ~ greater_or_equal(X1,sK2)
| ~ in_environment(sK1,X0)
| ~ greater_or_equal(X0,X1) ),
inference(superposition,[status(thm)],[c_66,c_55]) ).
tcf(c_124,plain,
! [X0: $i,X1: $i] :
( in_environment(sK1,X1)
| ~ greater_or_equal(X1,sK2)
| ~ in_environment(sK1,X0)
| ~ greater_or_equal(X0,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_123,c_65]) ).
tcf(c_170,plain,
! [X0: $i] :
( in_environment(sK1,X0)
| ~ environment(sK1)
| ~ greater_or_equal(X0,sK2)
| ~ greater_or_equal(start_time(sK1),X0) ),
inference(superposition,[status(thm)],[c_56,c_124]) ).
tcf(c_171,plain,
! [X0: $i] :
( in_environment(sK1,X0)
| ~ greater_or_equal(sK2,X0)
| ~ greater_or_equal(X0,sK2) ),
inference(superposition,[status(thm)],[c_66,c_124]) ).
tcf(c_175,plain,
! [X0: $i] :
( in_environment(sK1,X0)
| ~ greater_or_equal(X0,sK2)
| ~ greater_or_equal(start_time(sK1),X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_170,c_65]) ).
tcf(c_221,plain,
( ( cardinality_at_time(efficient_producers,sK2) = zero )
| ~ environment(sK1)
| ~ in_environment(sK1,sK2) ),
inference(superposition,[status(thm)],[c_68,c_50]) ).
tcf(c_222,plain,
cardinality_at_time(efficient_producers,sK2) = zero,
inference(forward_subsumption_resolution,[status(thm)],[c_221,c_65,c_66]) ).
tcf(c_233,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_57,c_122]) ).
tcf(c_247,plain,
( in_environment(sK1,appear(first_movers,sK1))
| ~ environment(sK1)
| ~ in_environment(sK1,sK2) ),
inference(superposition,[status(thm)],[c_67,c_233]) ).
tcf(c_248,plain,
in_environment(sK1,appear(first_movers,sK1)),
inference(forward_subsumption_resolution,[status(thm)],[c_247,c_65,c_66]) ).
tcf(c_249,plain,
! [X0: $i,X1: $i] :
( in_environment(sK1,X0)
| ~ environment(sK1)
| ~ in_environment(sK1,X1)
| ~ greater_or_equal(X1,X0)
| ~ greater_or_equal(X0,appear(first_movers,sK1)) ),
inference(superposition,[status(thm)],[c_248,c_55]) ).
tcf(c_250,plain,
( in_environment(sK1,appear(an_organisation,sK1))
| ~ environment(sK1) ),
inference(superposition,[status(thm)],[c_248,c_60]) ).
tcf(c_251,plain,
! [X0: $i] :
( in_environment(sK1,X0)
| ~ greater_or_equal(X0,sK2)
| ~ greater_or_equal(appear(first_movers,sK1),X0) ),
inference(superposition,[status(thm)],[c_248,c_124]) ).
tcf(c_252,plain,
in_environment(sK1,appear(an_organisation,sK1)),
inference(forward_subsumption_resolution,[status(thm)],[c_250,c_65]) ).
tcf(c_256,plain,
! [X0: $i,X1: $i] :
( in_environment(sK1,X0)
| ~ in_environment(sK1,X1)
| ~ greater_or_equal(X1,X0)
| ~ greater_or_equal(X0,appear(first_movers,sK1)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_249,c_65]) ).
tcf(c_268,plain,
( in_environment(sK1,start_time(sK1))
| ~ environment(sK1)
| ~ greater_or_equal(start_time(sK1),sK2) ),
inference(superposition,[status(thm)],[c_57,c_251]) ).
tcf(c_269,plain,
( in_environment(sK1,start_time(sK1))
| ~ greater_or_equal(start_time(sK1),sK2) ),
inference(forward_subsumption_resolution,[status(thm)],[c_268,c_65]) ).
tcf(c_282,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( sK0(X0,X1) = efficient_producers )
| ( sK0(X0,X1) = first_movers )
| ~ environment(X2)
| ~ environment(X0)
| ~ greater(number_of_organizations(X0,X1),zero)
| ~ subpopulation(sK0(X0,X1),X2,X1) ),
inference(superposition,[status(thm)],[c_52,c_62]) ).
tcf(c_303,plain,
! [X0: $i,X1: $i] :
( selection_favors(X0,efficient_producers,sK2)
| ~ environment(X1)
| ~ subpopulation(efficient_producers,X1,sK2)
| ~ subpopulation(X0,X1,sK2)
| ~ greater(cardinality_at_time(X0,sK2),zero) ),
inference(superposition,[status(thm)],[c_222,c_49]) ).
tcf(c_311,plain,
( ( appear(first_movers,sK1) = appear(an_organisation,sK1) )
| ~ environment(sK1) ),
inference(superposition,[status(thm)],[c_252,c_63]) ).
tcf(c_313,plain,
appear(first_movers,sK1) = appear(an_organisation,sK1),
inference(forward_subsumption_resolution,[status(thm)],[c_311,c_65]) ).
tcf(c_324,plain,
! [X0: $i] :
( ( cardinality_at_time(an_organisation,X0) = zero )
| ~ environment(sK1)
| ~ in_environment(sK1,X0)
| ~ greater(appear(first_movers,sK1),X0) ),
inference(superposition,[status(thm)],[c_313,c_50]) ).
tcf(c_326,plain,
! [X0: $i] :
( greater(number_of_organizations(sK1,X0),zero)
| ~ environment(sK1)
| ~ in_environment(sK1,X0)
| ~ greater_or_equal(X0,appear(first_movers,sK1)) ),
inference(superposition,[status(thm)],[c_313,c_61]) ).
tcf(c_327,plain,
! [X0: $i] :
( greater(number_of_organizations(sK1,X0),zero)
| ~ in_environment(sK1,X0)
| ~ greater_or_equal(X0,appear(first_movers,sK1)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_326,c_65]) ).
tcf(c_331,plain,
! [X0: $i] :
( ( cardinality_at_time(an_organisation,X0) = zero )
| ~ in_environment(sK1,X0)
| ~ greater(appear(first_movers,sK1),X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_324,c_65]) ).
tcf(c_348,plain,
( greater(number_of_organizations(sK1,sK2),zero)
| ~ in_environment(sK1,sK2) ),
inference(superposition,[status(thm)],[c_67,c_327]) ).
tcf(c_349,plain,
greater(number_of_organizations(sK1,sK2),zero),
inference(forward_subsumption_resolution,[status(thm)],[c_348,c_66]) ).
tcf(c_377,plain,
! [X0: $i,X1: $i] :
( selection_favors(sK0(X0,sK2),efficient_producers,sK2)
| ~ environment(X1)
| ~ environment(X0)
| ~ subpopulation(efficient_producers,X1,sK2)
| ~ greater(number_of_organizations(X0,sK2),zero)
| ~ subpopulation(sK0(X0,sK2),X1,sK2) ),
inference(superposition,[status(thm)],[c_52,c_303]) ).
tcf(c_378,plain,
! [X0: $i] :
( selection_favors(efficient_producers,efficient_producers,sK2)
| ~ environment(X0)
| ~ greater(zero,zero)
| ~ subpopulation(efficient_producers,X0,sK2) ),
inference(superposition,[status(thm)],[c_222,c_303]) ).
tcf(c_399,plain,
! [X0: $i] :
( selection_favors(efficient_producers,efficient_producers,sK2)
| ~ environment(X0)
| ~ greater(zero,zero)
| ~ in_environment(X0,sK2) ),
inference(superposition,[status(thm)],[c_59,c_378]) ).
tcf(c_413,plain,
( selection_favors(efficient_producers,efficient_producers,sK2)
| ~ environment(sK1)
| ~ greater(zero,zero) ),
inference(superposition,[status(thm)],[c_66,c_399]) ).
tcf(c_414,plain,
( selection_favors(efficient_producers,efficient_producers,sK2)
| ~ greater(zero,zero) ),
inference(forward_subsumption_resolution,[status(thm)],[c_413,c_65]) ).
tcf(c_435,plain,
! [X0: $i] :
( selection_favors(sK0(X0,sK2),efficient_producers,sK2)
| ~ environment(X0)
| ~ subpopulation(efficient_producers,X0,sK2)
| ~ greater(number_of_organizations(X0,sK2),zero) ),
inference(superposition,[status(thm)],[c_51,c_377]) ).
tcf(c_453,plain,
! [X0: $i,X1: $i] :
( ( sK0(X0,X1) = efficient_producers )
| ( sK0(X0,X1) = first_movers )
| ~ environment(X0)
| ~ greater(number_of_organizations(X0,X1),zero) ),
inference(superposition,[status(thm)],[c_51,c_282]) ).
tcf(c_479,plain,
( ( sK0(sK1,sK2) = efficient_producers )
| ( sK0(sK1,sK2) = first_movers )
| ~ environment(sK1) ),
inference(superposition,[status(thm)],[c_349,c_453]) ).
tcf(c_480,plain,
( ( sK0(sK1,sK2) = efficient_producers )
| ( sK0(sK1,sK2) = first_movers ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_479,c_65]) ).
tcf(c_487,plain,
( greater(cardinality_at_time(efficient_producers,sK2),zero)
| ( sK0(sK1,sK2) = first_movers )
| ~ environment(sK1)
| ~ greater(number_of_organizations(sK1,sK2),zero) ),
inference(superposition,[status(thm)],[c_480,c_52]) ).
tcf(c_488,plain,
( subpopulation(efficient_producers,sK1,sK2)
| ( sK0(sK1,sK2) = first_movers )
| ~ environment(sK1)
| ~ greater(number_of_organizations(sK1,sK2),zero) ),
inference(superposition,[status(thm)],[c_480,c_51]) ).
tcf(c_489,plain,
( selection_favors(efficient_producers,efficient_producers,sK2)
| ( sK0(sK1,sK2) = first_movers )
| ~ environment(sK1)
| ~ subpopulation(efficient_producers,sK1,sK2)
| ~ greater(number_of_organizations(sK1,sK2),zero) ),
inference(superposition,[status(thm)],[c_480,c_435]) ).
tcf(c_490,plain,
! [X0: $i] :
( selection_favors(sK0(sK1,sK2),efficient_producers,sK2)
| ( sK0(sK1,sK2) = first_movers )
| ~ environment(sK1)
| ~ environment(X0)
| ~ subpopulation(efficient_producers,X0,sK2)
| ~ greater(number_of_organizations(sK1,sK2),zero) ),
inference(superposition,[status(thm)],[c_480,c_377]) ).
tcf(c_491,plain,
( subpopulation(efficient_producers,sK1,sK2)
| ( sK0(sK1,sK2) = first_movers ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_488,c_65,c_349]) ).
tcf(c_494,plain,
( greater(zero,zero)
| ( sK0(sK1,sK2) = first_movers )
| ~ environment(sK1)
| ~ greater(number_of_organizations(sK1,sK2),zero) ),
inference(light_normalisation,[status(thm)],[c_487,c_222]) ).
tcf(c_495,plain,
( greater(zero,zero)
| ( sK0(sK1,sK2) = first_movers ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_494,c_65,c_349]) ).
tcf(c_498,plain,
( selection_favors(efficient_producers,efficient_producers,sK2)
| ( sK0(sK1,sK2) = first_movers )
| ~ subpopulation(efficient_producers,sK1,sK2) ),
inference(forward_subsumption_resolution,[status(thm)],[c_489,c_65,c_349]) ).
tcf(c_502,plain,
! [X0: $i] :
( selection_favors(sK0(sK1,sK2),efficient_producers,sK2)
| ( sK0(sK1,sK2) = first_movers )
| ~ environment(X0)
| ~ subpopulation(efficient_producers,X0,sK2) ),
inference(forward_subsumption_resolution,[status(thm)],[c_490,c_65,c_349]) ).
tcf(c_516,plain,
( selection_favors(efficient_producers,efficient_producers,sK2)
| ( sK0(sK1,sK2) = first_movers ) ),
inference(global_subsumption_just,[status(thm)],[c_498,c_491,c_498]) ).
tcf(c_531,plain,
( selection_favors(sK0(sK1,sK2),efficient_producers,sK2)
| ( sK0(sK1,sK2) = first_movers )
| ~ environment(sK1) ),
inference(superposition,[status(thm)],[c_491,c_502]) ).
tcf(c_532,plain,
( selection_favors(sK0(sK1,sK2),efficient_producers,sK2)
| ( sK0(sK1,sK2) = first_movers ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_531,c_65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT033+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 : n009.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:06:28 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.42 % Proving...
% 0.39/1.17 % SZS status Started for theBenchmark.p
% 0.39/1.17 % SZS status CounterSatisfiable for theBenchmark.p
% 0.39/1.17
% 0.39/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.39/1.17
% 0.39/1.17 ------ iProver source info
% 0.39/1.17
% 0.39/1.17 git: date: 2026-07-19 20:42:38 +0200
% 0.39/1.17 git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.39/1.17 git: non_committed_changes: false
% 0.39/1.17
% 0.39/1.17 ------ Parsing...
% 0.39/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.39/1.17 ------ Proving...
% 0.39/1.17 ------ Problem Properties
% 0.39/1.17
% 0.39/1.17
% 0.39/1.17 clauses 20
% 0.39/1.17 conjectures 5
% 0.39/1.17 EPR 6
% 0.39/1.17 Horn 19
% 0.39/1.17 unary 5
% 0.39/1.17 binary 3
% 0.39/1.17 lits 57
% 0.39/1.17 lits eq 6
% 0.39/1.17 fd_pure 0
% 0.39/1.17 fd_pseudo 0
% 0.39/1.17 fd_cond 1
% 0.39/1.17 fd_pseudo_cond 0
% 0.39/1.17 AC symbols 0
% 0.39/1.17
% 0.39/1.17 ------ Schedule dynamic 5 is on
% 0.39/1.17
% 0.39/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.39/1.17
% 0.39/1.17
% 0.39/1.17 ------
% 0.39/1.17 Current options:
% 0.39/1.17 ------
% 0.39/1.17
% 0.39/1.17 ------ Input Options
% 0.39/1.17
% 0.39/1.17 --out_options all
% 0.39/1.17 --tptp_safe_out true
% 0.39/1.17 --problem_path ""
% 0.39/1.17 --include_path ""
% 0.39/1.17 --clausifier res/vclausify_rel
% 0.39/1.17 --clausifier_options --mode clausify -t 101.67 -updr off
% 0.39/1.17 --stdin false
% 0.39/1.17 --proof_out true
% 0.39/1.17 --proof_dot_file ""
% 0.39/1.17 --proof_reduce_dot []
% 0.39/1.17 --suppress_sat_res false
% 0.39/1.17 --suppress_unsat_res true
% 0.39/1.17 --stats_out none
% 0.39/1.17 --stats_mem false
% 0.39/1.17 --theory_stats_out false
% 0.39/1.17
% 0.39/1.17 ------ General Options
% 0.39/1.17
% 0.39/1.17 --fof false
% 0.39/1.17 --time_out_real 305.
% 0.39/1.17 --time_out_virtual -1.
% 0.39/1.17 --rnd_seed 13
% 0.39/1.17 --symbol_type_check false
% 0.39/1.17 --clausify_out false
% 0.39/1.17 --sig_cnt_out false
% 0.39/1.17 --trig_cnt_out false
% 0.39/1.17 --trig_cnt_out_tolerance 1.
% 0.39/1.17 --trig_cnt_out_sk_spl false
% 0.39/1.17 --abstr_cl_out false
% 0.39/1.17
% 0.39/1.17 ------ Interactive Mode
% 0.39/1.17
% 0.39/1.17 --interactive_mode false
% 0.39/1.17 --external_ip_address ""
% 0.39/1.17 --external_port 0
% 0.39/1.17
% 0.39/1.17 ------ Global Options
% 0.39/1.17
% 0.39/1.17 --schedule default
% 0.39/1.17 --add_important_lit false
% 0.39/1.17 --prop_solver_per_cl 500
% 0.39/1.17 --subs_bck_mult 8
% 0.39/1.17 --min_unsat_core false
% 0.39/1.17 --soft_assumptions false
% 0.39/1.17 --soft_lemma_size 3
% 0.39/1.17 --prop_impl_unit_size 0
% 0.39/1.17 --prop_impl_unit []
% 0.39/1.17 --share_sel_clauses true
% 0.39/1.17 --reset_solvers false
% 0.39/1.17 --bc_imp_inh [conj_cone]
% 0.39/1.17 --conj_cone_tolerance 3.
% 0.39/1.17 --extra_neg_conj none
% 0.39/1.17 --large_theory_mode true
% 0.39/1.17 --prolific_symb_bound 200
% 0.39/1.17 --lt_threshold 2000
% 0.39/1.17 --clause_weak_htbl true
% 0.39/1.17 --gc_record_bc_elim false
% 0.39/1.17
% 0.39/1.17 ------ Preprocessing Options
% 0.39/1.17
% 0.39/1.17 --preprocessing_flag false
% 0.39/1.17 --time_out_prep_mult 0.1
% 0.39/1.17 --splitting_mode input
% 0.39/1.17 --splitting_grd true
% 0.39/1.17 --splitting_cvd false
% 0.39/1.17 --splitting_cvd_svl false
% 0.39/1.17 --splitting_nvd 32
% 0.39/1.17 --sub_typing false
% 0.39/1.17 --prep_eq_flat_conj false
% 0.39/1.17 --prep_ineq_split false
% 0.39/1.17 --prep_eq_flat_all_gr false
% 0.39/1.17 --prep_gs_sim true
% 0.39/1.17 --prep_unflatten true
% 0.39/1.17 --prep_res_sim true
% 0.39/1.17 --prep_sup_sim_all true
% 0.39/1.17 --prep_sup_sim_sup false
% 0.39/1.17 --prep_upred true
% 0.39/1.17 --prep_well_definedness true
% 0.39/1.17 --prep_sem_filter exhaustive
% 0.39/1.17 --prep_sem_filter_out false
% 0.39/1.17 --pred_elim true
% 0.39/1.17 --res_sim_input true
% 0.39/1.17 --eq_ax_congr_red true
% 0.39/1.17 --pure_diseq_elim true
% 0.39/1.17 --brand_transform false
% 0.39/1.17 --non_eq_to_eq false
% 0.39/1.17 --prep_eq_proxy false
% 0.39/1.17 --prep_def_merge true
% 0.39/1.17 --prep_def_merge_prop_impl false
% 0.39/1.17 --prep_def_merge_mbd true
% 0.39/1.17 --prep_def_merge_tr_red false
% 0.39/1.17 --prep_def_merge_tr_cl false
% 0.39/1.17 --smt_preprocessing false
% 0.39/1.17 --smt_ac_axioms fast
% 0.39/1.17 --preprocessed_out false
% 0.39/1.17 --preprocessed_stats false
% 0.39/1.17
% 0.39/1.17 ------ Abstraction refinement Options
% 0.39/1.17
% 0.39/1.17 --abstr_ref []
% 0.39/1.17 --abstr_ref_prep false
% 0.39/1.17 --abstr_ref_until_sat false
% 0.39/1.17 --abstr_ref_sig_restrict funpre
% 0.39/1.17 --abstr_ref_af_restrict_to_split_sk false
% 0.39/1.17 --abstr_ref_under []
% 0.39/1.17
% 0.39/1.17 ------ SAT Options
% 0.39/1.17
% 0.39/1.17 --sat_mode false
% 0.39/1.17 --sat_fm_restart_options ""
% 0.39/1.17 --sat_gr_def false
% 0.39/1.17 --sat_epr_types true
% 0.39/1.17 --sat_non_cyclic_types false
% 0.39/1.17 --sat_finite_models false
% 0.39/1.17 --sat_fm_lemmas false
% 0.39/1.17 --sat_fm_prep false
% 0.39/1.17 --sat_fm_uc_incr true
% 0.39/1.17 --sat_out_model pos
% 0.39/1.17 --sat_out_clauses false
% 0.39/1.17
% 0.39/1.17 ------ QBF Options
% 0.39/1.17
% 0.39/1.17 --qbf_mode false
% 0.39/1.17 --qbf_elim_univ false
% 0.39/1.17 --qbf_dom_inst none
% 0.39/1.17 --qbf_dom_pre_inst false
% 0.39/1.17 --qbf_sk_in false
% 0.39/1.17 --qbf_pred_elim true
% 0.39/1.17 --qbf_split 512
% 0.39/1.17
% 0.39/1.17 ------ BMC1 Options
% 0.39/1.17
% 0.39/1.17 --bmc1_incremental false
% 0.39/1.17 --bmc1_axioms reachable_all
% 0.39/1.17 --bmc1_min_bound 0
% 0.39/1.17 --bmc1_max_bound -1
% 0.39/1.17 --bmc1_max_bound_default -1
% 0.39/1.17 --bmc1_symbol_reachability true
% 0.39/1.17 --bmc1_property_lemmas false
% 0.39/1.17 --bmc1_k_induction false
% 0.39/1.17 --bmc1_non_equiv_states false
% 0.39/1.17 --bmc1_deadlock false
% 0.39/1.17 --bmc1_ucm false
% 0.39/1.17 --bmc1_add_unsat_core none
% 0.39/1.17 --bmc1_unsat_core_children false
% 0.39/1.17 --bmc1_unsat_core_extrapolate_axioms false
% 0.39/1.17 --bmc1_out_stat full
% 0.39/1.17 --bmc1_ground_init false
% 0.39/1.17 --bmc1_pre_inst_next_state false
% 0.39/1.17 --bmc1_pre_inst_state false
% 0.39/1.17 --bmc1_pre_inst_reach_state false
% 0.39/1.17 --bmc1_out_unsat_core false
% 0.39/1.17 --bmc1_aig_witness_out false
% 0.39/1.17 --bmc1_verbose false
% 0.39/1.17 --bmc1_dump_clauses_tptp false
% 0.39/1.17 --bmc1_dump_unsat_core_tptp false
% 0.39/1.17 --bmc1_dump_file -
% 0.39/1.17 --bmc1_ucm_expand_uc_limit 128
% 0.39/1.17 --bmc1_ucm_n_expand_iterations 6
% 0.39/1.17 --bmc1_ucm_extend_mode 1
% 0.39/1.17 --bmc1_ucm_init_mode 2
% 0.39/1.17 --bmc1_ucm_cone_mode none
% 0.39/1.17 --bmc1_ucm_reduced_relation_type 0
% 0.39/1.17 --bmc1_ucm_relax_model 4
% 0.39/1.17 --bmc1_ucm_full_tr_after_sat true
% 0.39/1.17 --bmc1_ucm_expand_neg_assumptions false
% 0.39/1.17 --bmc1_ucm_layered_model none
% 0.39/1.17 --bmc1_ucm_max_lemma_size 10
% 0.39/1.17
% 0.39/1.17 ------ AIG Options
% 0.39/1.17
% 0.39/1.17 --aig_mode false
% 0.39/1.17
% 0.39/1.17 ------ Instantiation Options
% 0.39/1.17
% 0.39/1.17 --instantiation_flag true
% 0.39/1.17 --inst_sos_flag false
% 0.39/1.17 --inst_sos_phase true
% 0.39/1.17 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 0.39/1.17 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.39/1.17 --inst_lit_sel_side none
% 0.39/1.17 --inst_solver_per_active 1400
% 0.39/1.17 --inst_solver_calls_frac 1.
% 0.39/1.17 --inst_to_smt_solver true
% 0.39/1.17 --inst_passive_queue_type priority_queues
% 0.39/1.17 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.39/1.17 --inst_passive_queues_freq [25;2]
% 0.39/1.17 --inst_dismatching true
% 0.39/1.17 --inst_eager_unprocessed_to_passive true
% 0.39/1.17 --inst_unprocessed_bound 1000
% 0.39/1.17 --inst_prop_sim_given true
% 0.39/1.17 --inst_prop_sim_new false
% 0.39/1.17 --inst_subs_new false
% 0.39/1.17 --inst_eq_res_simp false
% 0.39/1.17 --inst_subs_given false
% 0.39/1.17 --inst_orphan_elimination true
% 0.39/1.17 --inst_learning_loop_flag true
% 0.39/1.17 --inst_learning_start 3000
% 0.39/1.17 --inst_learning_factor 2
% 0.39/1.17 --inst_start_prop_sim_after_learn 3
% 0.39/1.17 --inst_sel_renew solver
% 0.39/1.17 --inst_lit_activity_flag true
% 0.39/1.17 --inst_restr_to_given false
% 0.39/1.17 --inst_activity_threshold 500
% 0.39/1.17
% 0.39/1.17 ------ Resolution Options
% 0.39/1.17
% 0.39/1.17 --resolution_flag false
% 0.39/1.17 --res_lit_sel adaptive
% 0.39/1.17 --res_lit_sel_side none
% 0.39/1.17 --res_ordering kbo
% 0.39/1.17 --res_to_prop_solver active
% 0.39/1.17 --res_prop_simpl_new false
% 0.39/1.17 --res_prop_simpl_given true
% 0.39/1.17 --res_to_smt_solver true
% 0.39/1.17 --res_passive_queue_type priority_queues
% 0.39/1.17 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.39/1.17 --res_passive_queues_freq [15;5]
% 0.39/1.17 --res_forward_subs full
% 0.39/1.17 --res_backward_subs full
% 0.39/1.17 --res_forward_subs_resolution true
% 0.39/1.17 --res_backward_subs_resolution true
% 0.39/1.17 --res_orphan_elimination true
% 0.39/1.17 --res_time_limit 300.
% 0.39/1.17
% 0.39/1.17 ------ Superposition Options
% 0.39/1.17
% 0.39/1.17 --superposition_flag true
% 0.39/1.17 --sup_passive_queue_type priority_queues
% 0.39/1.17 --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.39/1.17 --sup_passive_queues_freq [8;1;4;4]
% 0.39/1.17 --twee_lhs_weight 4
% 0.39/1.17 --sup_set_join false
% 0.39/1.17 --sup_set_join_goals true
% 0.39/1.17 --sup_set_join_limit 1000
% 0.39/1.17 --demod_completeness_check fast
% 0.39/1.17 --demod_use_ground true
% 0.39/1.17 --sup_unprocessed_bound 0
% 0.39/1.17 --sup_to_prop_solver passive
% 0.39/1.17 --sup_prop_simpl_new true
% 0.39/1.17 --sup_prop_simpl_given true
% 0.39/1.17 --sup_fun_splitting false
% 0.39/1.17 --sup_iter_deepening 2
% 0.39/1.17 --sup_restarts_mult 12
% 0.39/1.17 --sup_score sim_d_gen
% 0.39/1.17 --sup_share_score_frac 0.2
% 0.39/1.17 --sup_share_max_num_cl 500
% 0.39/1.17 --sup_ordering kbo
% 0.39/1.17 --sup_symb_ordering invfreq
% 0.39/1.17 --sup_term_weight default
% 0.39/1.17
% 0.39/1.17 ------ Superposition Simplification Setup
% 0.39/1.17
% 0.39/1.17 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 0.39/1.17 --sup_full_triv [SMTSimplify;PropSubs]
% 0.39/1.17 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 0.39/1.17 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 0.39/1.17 --sup_immed_triv []
% 0.39/1.17 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 0.39/1.17 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 0.39/1.17 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 0.39/1.17 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 0.39/1.17 --sup_input_triv [Unflattening;SMTSimplify]
% 0.39/1.17 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 0.39/1.17 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 0.39/1.17 --sup_full_fixpoint true
% 0.39/1.17 --sup_main_fixpoint true
% 0.39/1.17 --sup_immed_fixpoint false
% 0.39/1.17 --sup_input_fixpoint true
% 0.39/1.17 --sup_cache_sim none
% 0.39/1.17 --sup_smt_interval 500
% 0.39/1.17 --sup_bw_gjoin_interval 0
% 0.39/1.17
% 0.39/1.17 ------ Combination Options
% 0.39/1.17
% 0.39/1.17 --comb_mode clause_based
% 0.39/1.17 --comb_inst_mult 5
% 0.39/1.17 --comb_res_mult 1
% 0.39/1.17 --comb_sup_mult 8
% 0.39/1.17 --comb_sup_deep_mult 2
% 0.39/1.17
% 0.39/1.17 ------ Debug Options
% 0.39/1.17
% 0.39/1.17 --dbg_backtrace false
% 0.39/1.17 --dbg_dump_prop_clauses false
% 0.39/1.17 --dbg_dump_prop_clauses_file -
% 0.39/1.17 --dbg_out_stat false
% 0.39/1.17 --dbg_just_parse false
% 0.39/1.17
% 0.39/1.17
% 0.39/1.17
% 0.39/1.17
% 0.39/1.17 ------ Proving...
% 0.39/1.17
% 0.39/1.17
% 0.39/1.17 % SZS status CounterSatisfiable for theBenchmark.p
% 0.39/1.17
% 0.39/1.17 % SZS output start Saturation for theBenchmark.p
% See solution above
% 0.39/1.17
% 0.39/1.17
%------------------------------------------------------------------------------