%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT036-3 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n013.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:12:31 PM UTC 2026
% Result : Unsatisfiable 0.47s 1.28s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 11 unt; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 62 ( 34 ~; 28 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 3 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 32 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X3,X0,X1] :
( subpopulations(X2,X1,X0,X3)
| ~ subpopulations(X1,X2,X0,X3)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_symmetry_of_subpopulations_1) ).
fof(f2,axiom,
! [X2,X3,X0,X1] :
( outcompetes(X2,X1,X3)
| ~ greater(zero,growth_rate(X1,X3))
| ~ greater_or_equal(growth_rate(X2,X3),zero)
| ~ subpopulations(X1,X2,X0,X3)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_2) ).
fof(f5,axiom,
environment(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a13_star_5) ).
fof(f6,axiom,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a13_star_6) ).
fof(f7,axiom,
greater_or_equal(growth_rate(first_movers,sk2),zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a13_star_7) ).
fof(f8,axiom,
greater(zero,growth_rate(efficient_producers,sk2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a13_star_8) ).
fof(f9,negated_conjecture,
! [X0,X1] :
( ~ outcompetes(first_movers,efficient_producers,X1)
| ~ subpopulations(first_movers,efficient_producers,X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t5_star_9) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( subpopulations(X1,X0,X2,X3)
| ~ environment(X2)
| ~ subpopulations(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( outcompetes(X1,X0,X3)
| ~ environment(X2)
| ~ greater(zero,growth_rate(X0,X3))
| ~ greater_or_equal(growth_rate(X1,X3),zero)
| ~ subpopulations(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_62,plain,
environment(sk1),
inference(cnf_transformation,[],[f5]) ).
tcf(c_63,plain,
subpopulations(first_movers,efficient_producers,sk1,sk2),
inference(cnf_transformation,[],[f6]) ).
tcf(c_64,plain,
greater_or_equal(growth_rate(first_movers,sk2),zero),
inference(cnf_transformation,[],[f7]) ).
tcf(c_65,plain,
greater(zero,growth_rate(efficient_producers,sk2)),
inference(cnf_transformation,[],[f8]) ).
tcf(c_66,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ environment(X0)
| ~ outcompetes(first_movers,efficient_producers,X1)
| ~ subpopulations(first_movers,efficient_producers,X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_211,plain,
! [X0: $i] :
( ~ outcompetes(first_movers,efficient_producers,X0)
| ~ subpopulations(first_movers,efficient_producers,sk1,X0) ),
inference(resolution,[status(thm)],[c_66,c_62]) ).
tcf(c_241,plain,
! [X0: $i,X1: $i,X2: $i] :
( outcompetes(X1,X0,X2)
| ~ greater(zero,growth_rate(X0,X2))
| ~ greater_or_equal(growth_rate(X1,X2),zero)
| ~ subpopulations(X0,X1,sk1,X2) ),
inference(resolution,[status(thm)],[c_59,c_62]) ).
tcf(c_255,plain,
! [X0: $i,X1: $i,X2: $i] :
( subpopulations(X1,X0,sk1,X2)
| ~ subpopulations(X0,X1,sk1,X2) ),
inference(resolution,[status(thm)],[c_58,c_62]) ).
tcf(c_348,plain,
! [X0: $i] :
( ~ greater(zero,growth_rate(efficient_producers,X0))
| ~ greater_or_equal(growth_rate(first_movers,X0),zero)
| ~ subpopulations(efficient_producers,first_movers,sk1,X0)
| ~ subpopulations(first_movers,efficient_producers,sk1,X0) ),
inference(resolution,[status(thm)],[c_211,c_241]) ).
tcf(c_358,plain,
! [X0: $i] :
( ~ greater(zero,growth_rate(efficient_producers,X0))
| ~ greater_or_equal(growth_rate(first_movers,X0),zero)
| ~ subpopulations(efficient_producers,first_movers,sk1,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_348,c_255]) ).
tcf(c_366,plain,
( ~ greater(zero,growth_rate(efficient_producers,sk2))
| ~ subpopulations(efficient_producers,first_movers,sk1,sk2) ),
inference(resolution,[status(thm)],[c_64,c_358]) ).
tcf(c_382,plain,
! [X0_iProver_subpopulations_2: iProver_subpopulations_2,X0_iProver_subpopulations_4: iProver_subpopulations_4,X1_iProver_subpopulations_2: iProver_subpopulations_2] :
( subpopulations(X1_iProver_subpopulations_2,X0_iProver_subpopulations_2,sk1,X0_iProver_subpopulations_4)
| ~ subpopulations(X0_iProver_subpopulations_2,X1_iProver_subpopulations_2,sk1,X0_iProver_subpopulations_4) ),
inference(subtyping,[status(esa)],[c_255]) ).
tcf(c_383,plain,
subpopulations(first_movers,efficient_producers,sk1,sk2),
inference(subtyping,[status(esa)],[c_63]) ).
tcf(c_385,plain,
subpopulations(efficient_producers,first_movers,sk1,sk2),
inference(resolution,[status(thm)],[c_382,c_383]) ).
tcf(c_386,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_385,c_366,c_65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT036-3 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.36 % Computer : n013.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8046.5625MB
% 0.13/0.36 % OS : Linux 6.8.0-71-generic
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Thu Sep 24 01:08:06 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.40 Running first-order theorem proving
% 0.17/0.40 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.41
% 0.17/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.17/0.41
% 0.17/0.42 % Detected problem language: tptp
% 0.17/0.43 % Proving...
% 0.47/1.28 % SZS status Started for theBenchmark.p
% 0.47/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.28
% 0.47/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.47/1.28
% 0.47/1.28 % ------ iProver source info
% 0.47/1.28
% 0.47/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 0.47/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.47/1.28 % git: non_committed_changes: false
% 0.47/1.28
% 0.47/1.28 % ------ Parsing...% successful
% 0.47/1.28
% 0.47/1.28
% 0.47/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.47/1.28
% 0.47/1.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.47/1.28
% 0.47/1.28 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 0.47/1.28 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.47/1.28 % ------ Proving...
% 0.47/1.28 % ------ Problem Properties
% 0.47/1.28
% 0.47/1.28 %
% 0.47/1.28 % clauses 3
% 0.47/1.28 % conjectures 0
% 0.47/1.28 % EPR 3
% 0.47/1.28 % Horn 3
% 0.47/1.28 % unary 2
% 0.47/1.28 % binary 1
% 0.47/1.28 % lits 4
% 0.47/1.28 % lits eq 0
% 0.47/1.28 % fd_pure 0
% 0.47/1.28 % fd_pseudo 0
% 0.47/1.28 % fd_cond 0
% 0.47/1.28 % fd_pseudo_cond 0
% 0.47/1.28 % AC symbols 0
% 0.47/1.28
% 0.47/1.28 % ------ Schedule EPR Horn non eq is on
% 0.47/1.28
% 0.47/1.28 % ------ no conjectures: strip conj schedule
% 0.47/1.28
% 0.47/1.28 % ------ no equalities: superposition off
% 0.47/1.28
% 0.47/1.28 % ------ Option_epr_horn stripped conjectures Time Limit: Unbounded
% 0.47/1.28
% 0.47/1.28
% 0.47/1.28 % ------
% 0.47/1.28 % Current options:
% 0.47/1.28 % ------
% 0.47/1.28
% 0.47/1.28
% 0.47/1.28 %
% 0.47/1.28
% 0.47/1.28 % ------ Proving...
% 0.47/1.28 %
% 0.47/1.28
% 0.47/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.28
% 0.47/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.28
% 0.47/1.28
%------------------------------------------------------------------------------