%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT036+2 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n029.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 : Tue Sep 8 06:20:09 AM UTC 2026
% Result : Theorem 0.13s 0.36s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 44 ( 8 unt; 3 def)
% Number of atoms : 141 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 149 ( 52 ~; 40 |; 33 &)
% ( 9 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 125 ( 2 sgn 94 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
fof(mp_growth_rate_relationships,axiom,
! [X1,X2,X3,X4] :
( ( ( environment(X1)
& subpopulations(X2,X3,X1,X4) )
=> greater_or_equal(growth_rate(X2,X4),zero) )
<=> ~ greater(zero,growth_rate(X2,X4)) ),
file('theBenchmark.p',mp_growth_rate_relationships) ).
% FOF SIMPLE INFERENCE
fof(mp_growth_rate_relationships_elimTB,axiom,
! [X1,X2,X3,X4] :
( ( ( environment(X1)
& subpopulations(X2,X3,X1,X4) )
=> greater_or_equal(growth_rate(X2,X4),zero) )
<=> ~ greater(zero,growth_rate(X2,X4)) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[mp_growth_rate_relationships])]) ).
% FOF INTRODUCE RENAMING
fof(ren1_defn,definition,
! [X1,X2,X3,X4] :
( ren1(X1,X2,X3,X4)
<=> ( environment(X1)
& subpopulations(X2,X3,X1,X4) ) ),
introduced(definition,[new_symbols(definition,[ren1])],[mp_growth_rate_relationships_elimTB]) ).
% FOF RENAMING INFERENCE
fof(mp_growth_rate_relationships_renObv,axiom,
! [X1,X2,X3,X4] :
( ( ren1(X1,X2,X3,X4)
=> greater_or_equal(growth_rate(X2,X4),zero) )
<=> ~ greater(zero,growth_rate(X2,X4)) ),
inference(renaming,[status(esa)],[mp_growth_rate_relationships_elimTB,ren1_defn]) ).
% FOF SIMPLE INFERENCE
fof(mp_growth_rate_relationships_elimImpEquivPushNegMiniScope,axiom,
( ! [X1,X2,X3,X4] :
( ( ren1(X1,X2,X3,X4)
& ~ greater_or_equal(growth_rate(X2,X4),zero) )
| ~ greater(zero,growth_rate(X2,X4)) )
& ! [X5,X6,X7,X8] :
( greater(zero,growth_rate(X6,X8))
| ~ ren1(X5,X6,X7,X8)
| greater_or_equal(growth_rate(X6,X8),zero) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[mp_growth_rate_relationships_renObv]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_7,plain,
( ~ greater_or_equal(growth_rate(X0,X1),zero)
| ~ greater(zero,growth_rate(X0,X1)) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[mp_growth_rate_relationships_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(d2,hypothesis,
! [X1,X2,X3,X4] :
( ( environment(X1)
& subpopulations(X2,X3,X1,X4) )
=> ( ( greater_or_equal(growth_rate(X3,X4),zero)
& greater(zero,growth_rate(X2,X4)) )
<=> outcompetes(X3,X2,X4) ) ),
file('theBenchmark.p',d2) ).
% FOF SIMPLE INFERENCE
fof(d2_elimTB,hypothesis,
! [X1,X2,X3,X4] :
( ( environment(X1)
& subpopulations(X2,X3,X1,X4) )
=> ( ( greater_or_equal(growth_rate(X3,X4),zero)
& greater(zero,growth_rate(X2,X4)) )
<=> outcompetes(X3,X2,X4) ) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[d2])]) ).
% FOF INTRODUCE RENAMING
fof(ren2_defn,definition,
! [X3,X4,X2] :
( ren2(X3,X4,X2)
<=> ( greater_or_equal(growth_rate(X3,X4),zero)
& greater(zero,growth_rate(X2,X4)) ) ),
introduced(definition,[new_symbols(definition,[ren2])],[d2_elimTB]) ).
% FOF SIMPLE INFERENCE
fof(ren2_elimImpEquivPushNegMiniScope,plain,
( ! [X1,X2,X3] :
( ~ ren2(X1,X2,X3)
| ( greater_or_equal(growth_rate(X1,X2),zero)
& greater(zero,growth_rate(X3,X2)) ) )
& ! [X4,X5,X6] :
( ~ greater_or_equal(growth_rate(X4,X5),zero)
| ~ greater(zero,growth_rate(X6,X5))
| ren2(X4,X5,X6) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren2_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_9,plain,
( ~ ren2(X0,X1,X2)
| greater_or_equal(growth_rate(X0,X1),zero) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren2_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(a13,hypothesis,
! [X1,X2,X3,X4] :
( ( environment(X1)
& in_environment(X1,X4)
& ~ greater(zero,growth_rate(X2,X4))
& greater(resilience(X3),resilience(X2)) )
=> ~ greater(zero,growth_rate(X3,X4)) ),
file('theBenchmark.p',a13) ).
% FOF SIMPLE INFERENCE
fof(a13_elimTB,hypothesis,
! [X1,X2,X3,X4] :
( ( environment(X1)
& in_environment(X1,X4)
& ~ greater(zero,growth_rate(X2,X4))
& greater(resilience(X3),resilience(X2)) )
=> ~ greater(zero,growth_rate(X3,X4)) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[a13])]) ).
% FOF SIMPLE INFERENCE
fof(a13_elimImpEquivPushNegMiniScope,hypothesis,
! [X1,X2,X3,X4] :
( ~ environment(X1)
| ~ in_environment(X1,X4)
| greater(zero,growth_rate(X2,X4))
| ~ greater(resilience(X3),resilience(X2))
| ~ greater(zero,growth_rate(X3,X4)) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[a13_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_18,plain,
( ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater(resilience(X2),resilience(X3))
| ~ greater(zero,growth_rate(X2,X1))
| greater(zero,growth_rate(X3,X1)) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[a13_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(mp_time_point_occur,axiom,
! [X1,X4] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X4) )
=> in_environment(X1,X4) ),
file('theBenchmark.p',mp_time_point_occur) ).
% FOF SIMPLE INFERENCE
fof(mp_time_point_occur_elimTB,axiom,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> in_environment(X1,X2) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[mp_time_point_occur])]) ).
% FOF SIMPLE INFERENCE
fof(mp_time_point_occur_elimImpEquivPushNegMiniScope,axiom,
! [X1,X2] :
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| in_environment(X1,X2) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[mp_time_point_occur_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_2,plain,
( ~ environment(X0)
| ~ subpopulations(first_movers,efficient_producers,X0,X1)
| in_environment(X0,X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[mp_time_point_occur_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_10,plain,
( ~ ren2(X0,X1,X2)
| greater(zero,growth_rate(X2,X1)) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren2_elimImpEquivPushNegMiniScope])]) ).
% FOF INTRODUCE RENAMING
fof(ren3_defn,definition,
! [X3,X4,X2] :
( ren3(X3,X4,X2)
<=> ( ren2(X3,X4,X2)
<=> outcompetes(X3,X2,X4) ) ),
introduced(definition,[new_symbols(definition,[ren3])],[d2_elimTB]) ).
% FOF RENAMING INFERENCE
fof(d2_renObv,hypothesis,
! [X1,X2,X3,X4] :
( ( environment(X1)
& subpopulations(X2,X3,X1,X4) )
=> ren3(X3,X4,X2) ),
inference(renaming,[status(esa)],[d2_elimTB,ren2_defn,ren3_defn]) ).
% FOF SIMPLE INFERENCE
fof(d2_elimImpEquivPushNegMiniScope,hypothesis,
! [X1,X2,X3,X4] :
( ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ren3(X3,X4,X2) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[d2_renObv]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_16,plain,
( ~ environment(X0)
| ~ subpopulations(X1,X2,X0,X3)
| ren3(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[d2_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(mp_symmetry_of_subpopulations,axiom,
! [X1,X2,X3,X4] :
( ( environment(X1)
& subpopulations(X2,X3,X1,X4) )
=> subpopulations(X3,X2,X1,X4) ),
file('theBenchmark.p',mp_symmetry_of_subpopulations) ).
% FOF SIMPLE INFERENCE
fof(mp_symmetry_of_subpopulations_elimTB,axiom,
! [X1,X2,X3,X4] :
( ( environment(X1)
& subpopulations(X2,X3,X1,X4) )
=> subpopulations(X3,X2,X1,X4) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[mp_symmetry_of_subpopulations])]) ).
% FOF SIMPLE INFERENCE
fof(mp_symmetry_of_subpopulations_elimImpEquivPushNegMiniScope,axiom,
! [X1,X2,X3,X4] :
( ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| subpopulations(X3,X2,X1,X4) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[mp_symmetry_of_subpopulations_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_1,plain,
( ~ environment(X0)
| ~ subpopulations(X1,X2,X0,X3)
| subpopulations(X2,X1,X0,X3) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[mp_symmetry_of_subpopulations_elimImpEquivPushNegMiniScope])]) ).
% FOF SIMPLE INFERENCE
fof(ren3_elimImpEquivPushNegMiniScope,plain,
( ! [X1,X2,X3] :
( ~ ren3(X1,X2,X3)
| ( ( ~ ren2(X1,X2,X3)
| outcompetes(X1,X3,X2) )
& ( ~ outcompetes(X1,X3,X2)
| ren2(X1,X2,X3) ) ) )
& ! [X4,X5,X6] :
( ( ( ~ ren2(X4,X5,X6)
| ~ outcompetes(X4,X6,X5) )
& ( ren2(X4,X5,X6)
| outcompetes(X4,X6,X5) ) )
| ren3(X4,X5,X6) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren3_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_13,plain,
( ~ ren3(X0,X1,X2)
| ~ outcompetes(X0,X2,X1)
| ren2(X0,X1,X2) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren3_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_22,plain,
( ~ environment(X0)
| ~ subpopulations(X1,X2,X0,X3)
| ~ outcompetes(X1,X2,X3)
| ren2(X1,X3,X2) ),
inference(resolution,[status(thm)],[c_16,c_1,c_13]) ).
% FILE RECORD
fof(prove_t5,conjecture,
! [X1,X4] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X4) )
=> ~ outcompetes(first_movers,efficient_producers,X4) ),
file('theBenchmark.p',prove_t5) ).
% NEGATING CONJECTURE
fof(prove_t5_nc,negated_conjecture,
~ ! [X1,X4] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X4) )
=> ~ outcompetes(first_movers,efficient_producers,X4) ),
inference(negating_conjecture,[status(cth)],[prove_t5]) ).
% FOF SIMPLE INFERENCE
fof(prove_t5_nc_elimTB,negated_conjecture,
~ ! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> ~ outcompetes(first_movers,efficient_producers,X2) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[prove_t5_nc])]) ).
% FOF SIMPLE INFERENCE
fof(prove_t5_nc_elimImpEquivPushNegMiniScope,negated_conjecture,
? [X1,X2] :
( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2)
& outcompetes(first_movers,efficient_producers,X2) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[prove_t5_nc_elimTB]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(prove_t5_nc_skol,negated_conjecture,
( environment(skc1)
& subpopulations(first_movers,efficient_producers,skc1,skc2)
& outcompetes(first_movers,efficient_producers,skc2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skc1,skc2]),skolemize(X1,skc1),skolemize(X2,skc2)],[prove_t5_nc_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_20,plain,
subpopulations(first_movers,efficient_producers,skc1,skc2),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[prove_t5_nc_skol])]) ).
% FILE RECORD
fof(a2,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
file('theBenchmark.p',a2) ).
% FOF SIMPLE INFERENCE
fof(a2_elimTB,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[a2])]) ).
% FOF SIMPLE INFERENCE
fof(a2_elimImpEquivPushNegMiniScope,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[a2_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_17,plain,
greater(resilience(efficient_producers),resilience(first_movers)),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[a2_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_21,plain,
outcompetes(first_movers,efficient_producers,skc2),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[prove_t5_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_19,plain,
environment(skc1),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[prove_t5_nc_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_24,plain,
$false,
inference(resolution,[status(thm)],[c_7,c_9,c_18,c_2,c_10,c_22,c_20,c_17,c_21,c_19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT036+2 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n029.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 7 12:43:11 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.13/0.36 Running /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.36
% 0.13/0.36 % Input Clauses:
% 0.13/0.36 % 1:3:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3) -> subpopulations(x2,x1,x0,x3)
% 0.13/0.36 % 2:3:2:INP:TopTop: environment(x0),subpopulations(first_movers,efficient_producers,x0,x1) -> in_environment(x0,x1)
% 0.13/0.36 % 3:2:4:INP:TopTopTopTop: ren1(x0,x1,x2,x3) -> environment(x0)
% 0.13/0.36 % 4:2:4:INP:TopTopTopTop: ren1(x0,x1,x2,x3) -> subpopulations(x1,x2,x0,x3)
% 0.13/0.36 % 5:3:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3) -> ren1(x0,x1,x2,x3)
% 0.13/0.36 % 6:2:4:INP:TopTopTopTop: greater(zero,growth_rate(x0,x1)) -> ren1(x2,x0,x3,x1)
% 0.13/0.36 % 7:2:2:INP:TopTop: greater_or_equal(growth_rate(x0,x1),zero),greater(zero,growth_rate(x0,x1)) ->
% 0.13/0.36 % 8:3:4:INP:TopTopTopTop: ren1(x0,x1,x2,x3) -> greater(zero,growth_rate(x1,x3)),greater_or_equal(growth_rate(x1,x3),zero)
% 0.13/0.36 % 9:2:3:INP:TopTopTop: ren2(x0,x1,x2) -> greater_or_equal(growth_rate(x0,x1),zero)
% 0.13/0.36 % 10:2:3:INP:TopTopTop: ren2(x0,x1,x2) -> greater(zero,growth_rate(x2,x1))
% 0.13/0.36 % 11:3:3:INP:TopTopTop: greater_or_equal(growth_rate(x0,x1),zero),greater(zero,growth_rate(x2,x1)) -> ren2(x0,x1,x2)
% 0.13/0.36 % 12:3:3:INP:TopTopTop: ren3(x0,x1,x2),ren2(x0,x1,x2) -> outcompetes(x0,x2,x1)
% 0.13/0.36 % 13:3:3:INP:TopTopTop: ren3(x0,x1,x2),outcompetes(x0,x2,x1) -> ren2(x0,x1,x2)
% 0.13/0.36 % 14:3:3:INP:TopTopTop: ren2(x0,x1,x2),outcompetes(x0,x2,x1) -> ren3(x0,x1,x2)
% 0.13/0.36 % 15:3:3:INP:TopTopTop: -> ren2(x0,x1,x2),outcompetes(x0,x2,x1),ren3(x0,x1,x2)
% 0.13/0.36 % 16:3:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3) -> ren3(x2,x3,x1)
% 0.13/0.36 % 17:1:0:INP:: -> greater(resilience(efficient_producers),resilience(first_movers))
% 0.13/0.36 % 18:5:4:INP:TopTopTopTop: environment(x0),in_environment(x0,x1),greater(resilience(x2),resilience(x3)),greater(zero,growth_rate(x2,x1)) -> greater(zero,growth_rate(x3,x1))
% 0.13/0.36 % 19:1:0:INP:: -> environment(skc1)
% 0.13/0.36 % 20:1:0:INP:: -> subpopulations(first_movers,efficient_producers,skc1,skc2)
% 0.13/0.36 % 21:1:0:INP:: -> outcompetes(first_movers,efficient_producers,skc2)
% 0.13/0.36
% 0.13/0.36 % Predicates: environment subpopulations in_environment greater_or_equal greater outcompetes ren1 ren2 ren3
% 0.13/0.36 % Fol Constants: first_movers efficient_producers zero skc1 skc2
% 0.13/0.36 % Fol Functions: growth_rate resilience
% 0.13/0.36 % Problem Properties:
% 0.13/0.36 % This is a full first-order problem without equality. The Problem is linear.
% 0.13/0.36
% 0.13/0.36
% 0.13/0.36 % Reduced Input Axiom Clauses:
% 0.13/0.36 % 1:3:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3) -> subpopulations(x2,x1,x0,x3)
% 0.13/0.36 % 2:3:2:INP:TopTop: environment(x0),subpopulations(first_movers,efficient_producers,x0,x1) -> in_environment(x0,x1)
% 0.13/0.36 % 3:2:4:INP:TopTopTopTop: ren1(x0,x1,x2,x3) -> environment(x0)
% 0.13/0.36 % 4:2:4:INP:TopTopTopTop: ren1(x0,x1,x2,x3) -> subpopulations(x1,x2,x0,x3)
% 0.13/0.36 % 5:3:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3) -> ren1(x0,x1,x2,x3)
% 0.13/0.36 % 6:2:4:INP:TopTopTopTop: greater(zero,growth_rate(x0,x1)) -> ren1(x2,x0,x3,x1)
% 0.13/0.36 % 7:2:2:INP:TopTop: greater_or_equal(growth_rate(x0,x1),zero),greater(zero,growth_rate(x0,x1)) ->
% 0.13/0.36 % 8:3:4:INP:TopTopTopTop: ren1(x0,x1,x2,x3) -> greater(zero,growth_rate(x1,x3)),greater_or_equal(growth_rate(x1,x3),zero)
% 0.13/0.36 % 9:2:3:INP:TopTopTop: ren2(x0,x1,x2) -> greater_or_equal(growth_rate(x0,x1),zero)
% 0.13/0.36 % 10:2:3:INP:TopTopTop: ren2(x0,x1,x2) -> greater(zero,growth_rate(x2,x1))
% 0.13/0.36 % 11:3:3:INP:TopTopTop: greater_or_equal(growth_rate(x0,x1),zero),greater(zero,growth_rate(x2,x1)) -> ren2(x0,x1,x2)
% 0.13/0.36 % 12:3:3:INP:TopTopTop: ren3(x0,x1,x2),ren2(x0,x1,x2) -> outcompetes(x0,x2,x1)
% 0.13/0.36 % 13:3:3:INP:TopTopTop: ren3(x0,x1,x2),outcompetes(x0,x2,x1) -> ren2(x0,x1,x2)
% 0.13/0.36 % 14:3:3:INP:TopTopTop: ren2(x0,x1,x2),outcompetes(x0,x2,x1) -> ren3(x0,x1,x2)
% 0.13/0.36 % 15:3:3:INP:TopTopTop: -> ren2(x0,x1,x2),outcompetes(x0,x2,x1),ren3(x0,x1,x2)
% 0.13/0.36
% 0.13/0.36 % Reduced Input Conjecture Clauses:
% 0.13/0.36 % 16:3:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3) -> ren3(x2,x3,x1)
% 0.13/0.36 % 17:1:0:INP:: -> greater(resilience(efficient_producers),resilience(first_movers))
% 0.13/0.36 % 18:5:4:INP:TopTopTopTop: environment(x0),in_environment(x0,x1),greater(resilience(x2),resilience(x3)),greater(zero,growth_rate(x2,x1)) -> greater(zero,growth_rate(x3,x1))
% 0.13/0.36 % 19:1:0:INP:: -> environment(skc1)
% 0.13/0.36 % 20:1:0:INP:: -> subpopulations(first_movers,efficient_producers,skc1,skc2)
% 0.13/0.36 % 21:1:0:INP:: -> outcompetes(first_movers,efficient_producers,skc2)
% 0.13/0.36
% 0.13/0.36
% 0.13/0.36 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 27 atoms initially. Used heuristic: lmodel_grow ===
% 0.13/0.36
% 0.13/0.36
% 0.13/0.36
% 0.13/0.36 % SZS status Theorem
% 0.13/0.36 % Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.36
% 0.13/0.36 % SPASS-SCL-FOL Statistics:
% 0.13/0.36 % Number of learned clauses: 2
% 0.13/0.36 % Number of propagations: 32
% 0.13/0.36 % Number of decisions: 13
% 0.13/0.36 % Number of resolutions: 13
% 0.13/0.36 % Number of condensations: 0
% 0.13/0.36 % Number of sub resolutions: 0
% 0.13/0.36
% 0.13/0.36 % Solver is done. Empty clause found
% 0.13/0.36
% 0.13/0.36 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.13/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.36 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.13/0.36
% 0.13/0.36
% 0.13/0.36 % Needed: 0:00:00.00
% 0.13/0.36
% 0.13/0.36 % ###
% 0.13/0.36 % ### Pagesize: 8192
% 0.13/0.36 % ### Marksize: 0
% 0.13/0.36 % ### Memory demanded: 508 KBytes
% 0.13/0.36 % ### Memory freed: 508 KBytes
% 0.13/0.36 % ### Memory remaining: 0 Bytes
% 0.13/0.36 % ### Pages allocated: 173 Pages
% 0.13/0.36 % ###
%------------------------------------------------------------------------------