%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT028+1 : 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 : n018.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:07 AM UTC 2026
% Result : Theorem 0.14s 0.38s
% Output : Proof 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 55 ( 5 unt; 5 def)
% Number of atoms : 207 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 227 ( 75 ~; 71 |; 53 &)
% ( 0 <=>; 26 =>; 2 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 136 ( 19 sgn 55 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
fof(prove_l10,conjecture,
! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X5] :
( greater(X5,appear(efficient_producers,X1))
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater_or_equal(X3,X5) )
=> greater(zero,growth_rate(first_movers,X3)) ) ) ),
file('theBenchmark.p',prove_l10) ).
% NEGATING CONJECTURE
fof(prove_l10_nc,negated_conjecture,
~ ! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X5] :
( greater(X5,appear(efficient_producers,X1))
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater_or_equal(X3,X5) )
=> greater(zero,growth_rate(first_movers,X3)) ) ) ),
inference(negating_conjecture,[status(cth)],[prove_l10]) ).
% FOF SIMPLE INFERENCE
fof(prove_l10_nc_elimTB,negated_conjecture,
~ ! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X2] :
( greater(X2,appear(efficient_producers,X1))
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater_or_equal(X3,X2) )
=> greater(zero,growth_rate(first_movers,X3)) ) ) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[prove_l10_nc])]) ).
% FOF INTRODUCE RENAMING
fof(ren5_defn,definition,
! [X1,X3,X2] :
( ren5(X1,X3,X2)
<= ( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater_or_equal(X3,X2) )
=> greater(zero,growth_rate(first_movers,X3)) ) ),
introduced(definition,[new_symbols(definition,[ren5])],[prove_l10_nc_elimTB]) ).
% FOF RENAMING INFERENCE
fof(prove_l10_nc_renObv,negated_conjecture,
~ ! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X2] :
( greater(X2,appear(efficient_producers,X1))
& ! [X3] : ren5(X1,X3,X2) ) ),
inference(renaming,[status(esa)],[prove_l10_nc_elimTB,ren5_defn]) ).
% FOF SIMPLE INFERENCE
fof(prove_l10_nc_elimImpEquivPushNegMiniScope,negated_conjecture,
? [X1] :
( environment(X1)
& stable(X1)
& ! [X2] :
( ~ greater(X2,appear(efficient_producers,X1))
| ? [X3] : ~ ren5(X1,X3,X2) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[prove_l10_nc_renObv]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(prove_l10_nc_skol,negated_conjecture,
( environment(skc4)
& stable(skc4)
& ! [X2] :
( ~ greater(X2,appear(efficient_producers,skc4))
| ~ ren5(skc4,skf5(X2),X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skc4,skf5]),skolemize(X1,skc4),skolemize(X3,skf5(X2))],[prove_l10_nc_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_16,plain,
stable(skc4),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[prove_l10_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_15,plain,
environment(skc4),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[prove_l10_nc_skol])]) ).
% FOF SIMPLE INFERENCE
fof(ren5_elimImpEquivPushNegMiniScope,plain,
! [X1,X2,X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X2)
& greater_or_equal(X2,X3)
& ~ greater(zero,growth_rate(first_movers,X2)) )
| ren5(X1,X2,X3) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren5_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_14,plain,
( ~ greater(zero,growth_rate(first_movers,X0))
| ren5(X1,X0,X2) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren5_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_12,plain,
( subpopulations(first_movers,efficient_producers,X0,X1)
| ren5(X0,X1,X2) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren5_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(mp_first_movers_negative_growth,axiom,
! [X1] :
( ( environment(X1)
& stable(X1)
& ? [X2] :
( in_environment(X1,X2)
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater_or_equal(X3,X2) )
=> greater(zero,growth_rate(first_movers,X3)) ) ) )
=> ? [X4] :
( greater(X4,appear(efficient_producers,X1))
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater_or_equal(X3,X4) )
=> greater(zero,growth_rate(first_movers,X3)) ) ) ),
file('theBenchmark.p',mp_first_movers_negative_growth) ).
% FOF SIMPLE INFERENCE
fof(mp_first_movers_negative_growth_elimTB,axiom,
! [X1] :
( ( environment(X1)
& stable(X1)
& ? [X2] :
( in_environment(X1,X2)
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater_or_equal(X3,X2) )
=> greater(zero,growth_rate(first_movers,X3)) ) ) )
=> ? [X4] :
( greater(X4,appear(efficient_producers,X1))
& ! [X5] :
( ( subpopulations(first_movers,efficient_producers,X1,X5)
& greater_or_equal(X5,X4) )
=> greater(zero,growth_rate(first_movers,X5)) ) ) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[mp_first_movers_negative_growth])]) ).
% FOF INTRODUCE RENAMING
fof(ren2_defn,definition,
! [X4,X1] :
( ren2(X4,X1)
=> ( greater(X4,appear(efficient_producers,X1))
& ! [X5] :
( ( subpopulations(first_movers,efficient_producers,X1,X5)
& greater_or_equal(X5,X4) )
=> greater(zero,growth_rate(first_movers,X5)) ) ) ),
introduced(definition,[new_symbols(definition,[ren2])],[mp_first_movers_negative_growth_elimTB]) ).
% FOF SIMPLE INFERENCE
fof(ren2_elimImpEquivPushNegMiniScope,plain,
! [X1,X2] :
( ~ ren2(X1,X2)
| ( greater(X1,appear(efficient_producers,X2))
& ! [X3] :
( ~ subpopulations(first_movers,efficient_producers,X2,X3)
| ~ greater_or_equal(X3,X1)
| greater(zero,growth_rate(first_movers,X3)) ) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren2_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_5,plain,
( ~ ren2(X0,X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater_or_equal(X2,X0)
| greater(zero,growth_rate(first_movers,X2)) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren2_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_32,plain,
( ~ ren2(X0,X1)
| ~ greater_or_equal(X2,X0)
| ren5(X1,X2,X3)
| greater(zero,growth_rate(first_movers,X2)) ),
inference(resolution,[status(thm)],[c_12,c_5]) ).
% CNF SPASS RESOLUTION.
cnf(c_33,plain,
( ~ ren2(X0,X1)
| ~ greater_or_equal(X2,X0)
| ren5(X1,X2,X3) ),
inference(resolution,[status(thm)],[c_14,c_32]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_13,plain,
( greater_or_equal(X0,X1)
| ren5(X2,X0,X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren5_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_17,plain,
( ~ greater(X0,appear(efficient_producers,skc4))
| ~ ren5(skc4,skf5(X0),X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[prove_l10_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_4,plain,
( ~ ren2(X0,X1)
| greater(X0,appear(efficient_producers,X1)) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren2_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_34,plain,
~ ren2(X0,skc4),
inference(resolution,[status(thm)],[c_33,c_13,c_17,c_4]) ).
% FILE RECORD
fof(l11,hypothesis,
! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X5] :
( in_environment(X1,X5)
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater_or_equal(X3,X5) )
=> ( greater(growth_rate(efficient_producers,X3),zero)
& greater(zero,growth_rate(first_movers,X3)) ) ) ) ),
file('theBenchmark.p',l11) ).
% FOF SIMPLE INFERENCE
fof(l11_elimTB,hypothesis,
! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X2] :
( in_environment(X1,X2)
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater_or_equal(X3,X2) )
=> ( greater(growth_rate(efficient_producers,X3),zero)
& greater(zero,growth_rate(first_movers,X3)) ) ) ) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[l11])]) ).
% FOF INTRODUCE RENAMING
fof(ren4_defn,definition,
! [X1,X2] :
( ren4(X1,X2)
=> ( in_environment(X1,X2)
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater_or_equal(X3,X2) )
=> ren3(X3) ) ) ),
introduced(definition,[new_symbols(definition,[ren4])],[l11_elimTB]) ).
% FOF SIMPLE INFERENCE
fof(ren4_elimImpEquivPushNegMiniScope,plain,
! [X1,X2] :
( ~ ren4(X1,X2)
| ( in_environment(X1,X2)
& ! [X3] :
( ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater_or_equal(X3,X2)
| ren3(X3) ) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren4_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_9,plain,
( ~ ren4(X0,X1)
| in_environment(X0,X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren4_elimImpEquivPushNegMiniScope])]) ).
% FOF INTRODUCE RENAMING
fof(ren1_defn,definition,
! [X1,X3,X2] :
( ren1(X1,X3,X2)
<= ( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater_or_equal(X3,X2) )
=> greater(zero,growth_rate(first_movers,X3)) ) ),
introduced(definition,[new_symbols(definition,[ren1])],[mp_first_movers_negative_growth_elimTB]) ).
% FOF SIMPLE INFERENCE
fof(ren1_elimImpEquivPushNegMiniScope,plain,
! [X1,X2,X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X2)
& greater_or_equal(X2,X3)
& ~ greater(zero,growth_rate(first_movers,X2)) )
| ren1(X1,X2,X3) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren1_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_2,plain,
( greater_or_equal(X0,X1)
| ren1(X2,X0,X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren1_elimImpEquivPushNegMiniScope])]) ).
% FOF RENAMING INFERENCE
fof(mp_first_movers_negative_growth_renObv,axiom,
! [X1] :
( ( environment(X1)
& stable(X1)
& ? [X2] :
( in_environment(X1,X2)
& ! [X3] : ren1(X1,X3,X2) ) )
=> ? [X4] : ren2(X4,X1) ),
inference(renaming,[status(esa)],[mp_first_movers_negative_growth_elimTB,ren1_defn,ren2_defn]) ).
% FOF SIMPLE INFERENCE
fof(mp_first_movers_negative_growth_elimImpEquivPushNegMiniScope,axiom,
! [X1] :
( ~ environment(X1)
| ~ stable(X1)
| ! [X2] :
( ~ in_environment(X1,X2)
| ? [X3] : ~ ren1(X1,X3,X2) )
| ? [X4] : ren2(X4,X1) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[mp_first_movers_negative_growth_renObv]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(mp_first_movers_negative_growth_skol,axiom,
! [X1] :
( ~ environment(X1)
| ~ stable(X1)
| ! [X2] :
( ~ in_environment(X1,X2)
| ~ ren1(X1,skf1(X1,X2),X2) )
| ren2(skf2(X1),X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skf1,skf2]),skolemize(X3,skf1(X1,X2)),skolemize(X4,skf2(X1))],[mp_first_movers_negative_growth_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_6,plain,
( ~ environment(X0)
| ~ stable(X0)
| ~ in_environment(X0,X1)
| ~ ren1(X0,skf1(X0,X1),X1)
| ren2(skf2(X0),X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[mp_first_movers_negative_growth_skol])]) ).
% FOF INTRODUCE RENAMING
fof(ren3_defn,definition,
! [X3] :
( ren3(X3)
=> ( greater(growth_rate(efficient_producers,X3),zero)
& greater(zero,growth_rate(first_movers,X3)) ) ),
introduced(definition,[new_symbols(definition,[ren3])],[l11_elimTB]) ).
% FOF SIMPLE INFERENCE
fof(ren3_elimImpEquivPushNegMiniScope,plain,
! [X1] :
( ~ ren3(X1)
| ( greater(growth_rate(efficient_producers,X1),zero)
& greater(zero,growth_rate(first_movers,X1)) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren3_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_8,plain,
( ~ ren3(X0)
| greater(zero,growth_rate(first_movers,X0)) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren3_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_3,plain,
( ~ greater(zero,growth_rate(first_movers,X0))
| ren1(X1,X0,X2) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren1_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_20,plain,
( ~ ren3(X0)
| ren1(X1,X0,X2) ),
inference(resolution,[status(thm)],[c_8,c_3]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_10,plain,
( ~ ren4(X0,X1)
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| ~ greater_or_equal(X2,X1)
| ren3(X2) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren4_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_1,plain,
( subpopulations(first_movers,efficient_producers,X0,X1)
| ren1(X0,X1,X2) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren1_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_24,plain,
( ~ ren4(X0,X1)
| ~ greater_or_equal(X2,X1)
| ren3(X2)
| ren1(X0,X2,X3) ),
inference(resolution,[status(thm)],[c_10,c_1]) ).
% CNF SPASS RESOLUTION.
cnf(c_25,plain,
( ~ ren4(X0,X1)
| ~ greater_or_equal(X2,X1)
| ren1(X0,X2,X3) ),
inference(resolution,[status(thm)],[c_20,c_24]) ).
% CNF SPASS RESOLUTION.
cnf(c_26,plain,
( ~ ren4(X0,X1)
| ~ greater_or_equal(skf1(X0,X2),X1)
| ~ environment(X0)
| ~ stable(X0)
| ~ in_environment(X0,X2)
| ren2(skf2(X0),X0) ),
inference(resolution,[status(thm)],[c_25,c_6]) ).
% CNF SPASS RESOLUTION.
cnf(c_27,plain,
( ~ ren4(X0,X1)
| ~ environment(X0)
| ~ stable(X0)
| ~ in_environment(X0,X1)
| ren2(skf2(X0),X0) ),
inference(resolution,[status(thm)],[c_2,c_6,c_26]) ).
% CNF SPASS RESOLUTION.
cnf(c_28,plain,
( ~ ren4(X0,X1)
| ~ environment(X0)
| ~ stable(X0)
| ren2(skf2(X0),X0) ),
inference(resolution,[status(thm)],[c_9,c_27]) ).
% CNF SPASS RESOLUTION.
cnf(c_35,plain,
( ~ ren4(skc4,X0)
| ~ environment(skc4)
| ~ stable(skc4) ),
inference(resolution,[status(thm)],[c_34,c_28]) ).
% CNF SPASS RESOLUTION.
cnf(c_36,plain,
( ~ ren4(skc4,X0)
| ~ stable(skc4) ),
inference(resolution,[status(thm)],[c_15,c_35]) ).
% CNF SPASS RESOLUTION.
cnf(c_37,plain,
~ ren4(skc4,X0),
inference(resolution,[status(thm)],[c_16,c_36]) ).
% FOF RENAMING INFERENCE
fof(l11_renObv,hypothesis,
! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X2] : ren4(X1,X2) ),
inference(renaming,[status(esa)],[l11_elimTB,ren3_defn,ren4_defn]) ).
% FOF SIMPLE INFERENCE
fof(l11_elimImpEquivPushNegMiniScope,hypothesis,
! [X1] :
( ~ environment(X1)
| ~ stable(X1)
| ? [X2] : ren4(X1,X2) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[l11_renObv]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(l11_skol,hypothesis,
! [X1] :
( ~ environment(X1)
| ~ stable(X1)
| ren4(X1,skf3(X1)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skf3]),skolemize(X2,skf3(X1))],[l11_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_11,plain,
( ~ environment(X0)
| ~ stable(X0)
| ren4(X0,skf3(X0)) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[l11_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_38,plain,
$false,
inference(resolution,[status(thm)],[c_37,c_11,c_15,c_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT028+1 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 7 12:16:52 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38
% 0.14/0.38 % Input Clauses:
% 0.14/0.38 % 1:2:3:INP:TopTopTop: -> subpopulations(first_movers,efficient_producers,x0,x1),ren1(x0,x1,x2)
% 0.14/0.38 % 2:2:3:INP:TopTopTop: -> greater_or_equal(x0,x1),ren1(x2,x0,x1)
% 0.14/0.38 % 3:2:3:INP:TopTopTop: greater(zero,growth_rate(first_movers,x0)) -> ren1(x1,x0,x2)
% 0.14/0.38 % 4:2:2:INP:TopTop: ren2(x0,x1) -> greater(x0,appear(efficient_producers,x1))
% 0.14/0.38 % 5:4:3:INP:TopTopTop: ren2(x0,x1),subpopulations(first_movers,efficient_producers,x1,x2),greater_or_equal(x2,x0) -> greater(zero,growth_rate(first_movers,x2))
% 0.14/0.38 % 6:5:2:INP:TopTop: environment(x0),stable(x0),in_environment(x0,x1),ren1(x0,skf1(x0,x1),x1) -> ren2(skf2(x0),x0)
% 0.14/0.38 % 7:2:1:INP:Top: ren3(x0) -> greater(growth_rate(efficient_producers,x0),zero)
% 0.14/0.38 % 8:2:1:INP:Top: ren3(x0) -> greater(zero,growth_rate(first_movers,x0))
% 0.14/0.38 % 9:2:2:INP:TopTop: ren4(x0,x1) -> in_environment(x0,x1)
% 0.14/0.38 % 10:4:3:INP:TopTopTop: ren4(x0,x1),subpopulations(first_movers,efficient_producers,x0,x2),greater_or_equal(x2,x1) -> ren3(x2)
% 0.14/0.38 % 11:3:1:INP:Top: environment(x0),stable(x0) -> ren4(x0,skf3(x0))
% 0.14/0.38 % 12:2:3:INP:TopTopTop: -> subpopulations(first_movers,efficient_producers,x0,x1),ren5(x0,x1,x2)
% 0.14/0.38 % 13:2:3:INP:TopTopTop: -> greater_or_equal(x0,x1),ren5(x2,x0,x1)
% 0.14/0.38 % 14:2:3:INP:TopTopTop: greater(zero,growth_rate(first_movers,x0)) -> ren5(x1,x0,x2)
% 0.14/0.38 % 15:1:0:INP:: -> environment(skc4)
% 0.14/0.38 % 16:1:0:INP:: -> stable(skc4)
% 0.14/0.38 % 17:2:1:INP:Top: greater(x0,appear(efficient_producers,skc4)),ren5(skc4,skf5(x0),x0) ->
% 0.14/0.38
% 0.14/0.38 % Predicates: environment stable in_environment subpopulations greater_or_equal greater ren1 ren2 ren3 ren4 ren5
% 0.14/0.38 % Fol Constants: first_movers efficient_producers zero skc4
% 0.14/0.38 % Fol Functions: growth_rate appear skf1 skf2 skf3 skf5
% 0.14/0.38 % Problem Properties:
% 0.14/0.38 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % Reduced Input Axiom Clauses:
% 0.14/0.38 % 1:2:3:INP:TopTopTop: -> subpopulations(first_movers,efficient_producers,x0,x1),ren1(x0,x1,x2)
% 0.14/0.38 % 2:2:3:INP:TopTopTop: -> greater_or_equal(x0,x1),ren1(x2,x0,x1)
% 0.14/0.38 % 3:2:3:INP:TopTopTop: greater(zero,growth_rate(first_movers,x0)) -> ren1(x1,x0,x2)
% 0.14/0.38 % 4:2:2:INP:TopTop: ren2(x0,x1) -> greater(x0,appear(efficient_producers,x1))
% 0.14/0.38 % 5:4:3:INP:TopTopTop: ren2(x0,x1),subpopulations(first_movers,efficient_producers,x1,x2),greater_or_equal(x2,x0) -> greater(zero,growth_rate(first_movers,x2))
% 0.14/0.38 % 6:5:2:INP:TopTop: environment(x0),stable(x0),in_environment(x0,x1),ren1(x0,skf1(x0,x1),x1) -> ren2(skf2(x0),x0)
% 0.14/0.38 % 7:2:1:INP:Top: ren3(x0) -> greater(growth_rate(efficient_producers,x0),zero)
% 0.14/0.38 % 8:2:1:INP:Top: ren3(x0) -> greater(zero,growth_rate(first_movers,x0))
% 0.14/0.38 % 9:2:2:INP:TopTop: ren4(x0,x1) -> in_environment(x0,x1)
% 0.14/0.38 % 10:4:3:INP:TopTopTop: ren4(x0,x1),subpopulations(first_movers,efficient_producers,x0,x2),greater_or_equal(x2,x1) -> ren3(x2)
% 0.14/0.38 % 12:2:3:INP:TopTopTop: -> subpopulations(first_movers,efficient_producers,x0,x1),ren5(x0,x1,x2)
% 0.14/0.38 % 13:2:3:INP:TopTopTop: -> greater_or_equal(x0,x1),ren5(x2,x0,x1)
% 0.14/0.38 % 14:2:3:INP:TopTopTop: greater(zero,growth_rate(first_movers,x0)) -> ren5(x1,x0,x2)
% 0.14/0.38
% 0.14/0.38 % Reduced Input Conjecture Clauses:
% 0.14/0.38 % 11:3:1:INP:Top: environment(x0),stable(x0) -> ren4(x0,skf3(x0))
% 0.14/0.38 % 15:1:0:INP:: -> environment(skc4)
% 0.14/0.38 % 16:1:0:INP:: -> stable(skc4)
% 0.14/0.38 % 17:2:1:INP:Top: greater(x0,appear(efficient_producers,skc4)),ren5(skc4,skf5(x0),x0) ->
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 31 atoms initially. Used heuristic: lmodel_grow ===
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % SZS status Theorem
% 0.14/0.38 % Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38
% 0.14/0.38 % SPASS-SCL-FOL Statistics:
% 0.14/0.38 % Number of learned clauses: 13
% 0.14/0.38 % Number of propagations: 226
% 0.14/0.38 % Number of decisions: 313
% 0.14/0.38 % Number of resolutions: 19
% 0.14/0.38 % Number of condensations: 0
% 0.14/0.38 % Number of sub resolutions: 7
% 0.14/0.38
% 0.14/0.38 % Solver is done. Empty clause found
% 0.14/0.38
% 0.14/0.38 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.14/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.39 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 % Needed: 0:00:00.02
% 0.14/0.39
% 0.14/0.39 % ###
% 0.14/0.39 % ### Pagesize: 8192
% 0.14/0.39 % ### Marksize: 0
% 0.14/0.39 % ### Memory demanded: 1209 KBytes
% 0.14/0.39 % ### Memory freed: 1209 KBytes
% 0.14/0.39 % ### Memory remaining: 0 Bytes
% 0.14/0.39 % ### Pages allocated: 253 Pages
% 0.14/0.39 % ###
%------------------------------------------------------------------------------