%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT030+1 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n012.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:08 AM UTC 2026
% Result : Theorem 0.03s 0.30s
% Output : Proof 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 3 unt; 4 def)
% Number of atoms : 176 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 191 ( 59 ~; 51 |; 54 &)
% ( 0 <=>; 25 =>; 2 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 110 ( 10 sgn 53 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
fof(mp_earliest_time_growth_rate_exceeds,axiom,
! [X1] :
( ( environment(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),growth_rate(first_movers,X3)) ) ) )
=> ? [X2] :
( in_environment(X1,X2)
& ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater(X3,X2) )
=> greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) ) ) ),
file('theBenchmark.p',mp_earliest_time_growth_rate_exceeds) ).
% FOF SIMPLE INFERENCE
fof(mp_earliest_time_growth_rate_exceeds_elimTB,axiom,
! [X1] :
( ( environment(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),growth_rate(first_movers,X3)) ) ) )
=> ? [X4] :
( in_environment(X1,X4)
& ~ greater(growth_rate(efficient_producers,X4),growth_rate(first_movers,X4))
& ! [X5] :
( ( subpopulations(first_movers,efficient_producers,X1,X5)
& greater(X5,X4) )
=> greater(growth_rate(efficient_producers,X5),growth_rate(first_movers,X5)) ) ) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[mp_earliest_time_growth_rate_exceeds])]) ).
% FOF INTRODUCE RENAMING
fof(ren2_defn,definition,
! [X1,X4] :
( ren2(X1,X4)
=> ( in_environment(X1,X4)
& ~ greater(growth_rate(efficient_producers,X4),growth_rate(first_movers,X4))
& ! [X5] :
( ( subpopulations(first_movers,efficient_producers,X1,X5)
& greater(X5,X4) )
=> greater(growth_rate(efficient_producers,X5),growth_rate(first_movers,X5)) ) ) ),
introduced(definition,[new_symbols(definition,[ren2])],[mp_earliest_time_growth_rate_exceeds_elimTB]) ).
% FOF SIMPLE INFERENCE
fof(ren2_elimImpEquivPushNegMiniScope,plain,
! [X1,X2] :
( ~ ren2(X1,X2)
| ( in_environment(X1,X2)
& ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
& ! [X3] :
( ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater(X3,X2)
| greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) ) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren2_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_6,plain,
( ~ ren2(X0,X1)
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| ~ greater(X2,X1)
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren2_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(prove_l12,conjecture,
! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X2] :
( in_environment(X1,X2)
& ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater(X3,X2) )
=> greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) ) ) ),
file('theBenchmark.p',prove_l12) ).
% NEGATING CONJECTURE
fof(prove_l12_nc,negated_conjecture,
~ ! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X2] :
( in_environment(X1,X2)
& ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater(X3,X2) )
=> greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) ) ) ),
inference(negating_conjecture,[status(cth)],[prove_l12]) ).
% FOF SIMPLE INFERENCE
fof(prove_l12_nc_elimTB,negated_conjecture,
~ ! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X2] :
( in_environment(X1,X2)
& ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater(X3,X2) )
=> greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) ) ) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[prove_l12_nc])]) ).
% FOF INTRODUCE RENAMING
fof(ren4_defn,definition,
! [X1,X3,X2] :
( ren4(X1,X3,X2)
<= ( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater(X3,X2) )
=> greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) ) ),
introduced(definition,[new_symbols(definition,[ren4])],[prove_l12_nc_elimTB]) ).
% FOF SIMPLE INFERENCE
fof(ren4_elimImpEquivPushNegMiniScope,plain,
! [X1,X2,X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X2)
& greater(X2,X3)
& ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) )
| ren4(X1,X2,X3) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren4_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_13,plain,
( ~ greater(growth_rate(efficient_producers,X0),growth_rate(first_movers,X0))
| ren4(X1,X0,X2) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren4_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_11,plain,
( subpopulations(first_movers,efficient_producers,X0,X1)
| ren4(X0,X1,X2) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren4_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_12,plain,
( greater(X0,X1)
| ren4(X2,X0,X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren4_elimImpEquivPushNegMiniScope])]) ).
% FOF RENAMING INFERENCE
fof(prove_l12_nc_renObv,negated_conjecture,
~ ! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X2] :
( in_environment(X1,X2)
& ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
& ! [X3] : ren4(X1,X3,X2) ) ),
inference(renaming,[status(esa)],[prove_l12_nc_elimTB,ren4_defn]) ).
% FOF SIMPLE INFERENCE
fof(prove_l12_nc_elimImpEquivPushNegMiniScope,negated_conjecture,
? [X1] :
( environment(X1)
& stable(X1)
& ! [X2] :
( ~ in_environment(X1,X2)
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| ? [X3] : ~ ren4(X1,X3,X2) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[prove_l12_nc_renObv]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(prove_l12_nc_skol,negated_conjecture,
( environment(skc4)
& stable(skc4)
& ! [X2] :
( ~ in_environment(skc4,X2)
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| ~ ren4(skc4,skf5(X2),X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skc4,skf5]),skolemize(X1,skc4),skolemize(X3,skf5(X2))],[prove_l12_nc_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_16,plain,
( ~ in_environment(skc4,X0)
| ~ ren4(skc4,skf5(X0),X0)
| greater(growth_rate(efficient_producers,X0),growth_rate(first_movers,X0)) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[prove_l12_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_5,plain,
( ~ ren2(X0,X1)
| ~ greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1)) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren2_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_4,plain,
( ~ ren2(X0,X1)
| in_environment(X0,X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren2_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(l1,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),growth_rate(first_movers,X3)) ) ) ),
file('theBenchmark.p',l1) ).
% FOF SIMPLE INFERENCE
fof(l1_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),growth_rate(first_movers,X3)) ) ) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[l1])]) ).
% FOF INTRODUCE RENAMING
fof(ren3_defn,definition,
! [X1,X2] :
( ren3(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),growth_rate(first_movers,X3)) ) ) ),
introduced(definition,[new_symbols(definition,[ren3])],[l1_elimTB]) ).
% FOF SIMPLE INFERENCE
fof(ren3_elimImpEquivPushNegMiniScope,plain,
! [X1,X2] :
( ~ ren3(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),growth_rate(first_movers,X3)) ) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren3_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_8,plain,
( ~ ren3(X0,X1)
| in_environment(X0,X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren3_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_9,plain,
( ~ ren3(X0,X1)
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| ~ greater_or_equal(X2,X1)
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren3_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(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) ) ),
introduced(definition,[new_symbols(definition,[ren1])],[mp_earliest_time_growth_rate_exceeds_elimTB]) ).
% FOF SIMPLE INFERENCE
fof(ren1_elimImpEquivPushNegMiniScope,plain,
! [X1,X2,X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X2)
& greater_or_equal(X2,X3)
& ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) )
| ren1(X1,X2,X3) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren1_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_3,plain,
( ~ greater(growth_rate(efficient_producers,X0),growth_rate(first_movers,X0))
| ren1(X1,X0,X2) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren1_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])]) ).
% 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_earliest_time_growth_rate_exceeds_renObv,axiom,
! [X1] :
( ( environment(X1)
& ? [X2] :
( in_environment(X1,X2)
& ! [X3] : ren1(X1,X3,X2) ) )
=> ? [X4] : ren2(X1,X4) ),
inference(renaming,[status(esa)],[mp_earliest_time_growth_rate_exceeds_elimTB,ren1_defn,ren2_defn]) ).
% FOF SIMPLE INFERENCE
fof(mp_earliest_time_growth_rate_exceeds_elimImpEquivPushNegMiniScope,axiom,
! [X1] :
( ~ environment(X1)
| ! [X2] :
( ~ in_environment(X1,X2)
| ? [X3] : ~ ren1(X1,X3,X2) )
| ? [X4] : ren2(X1,X4) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[mp_earliest_time_growth_rate_exceeds_renObv]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(mp_earliest_time_growth_rate_exceeds_skol,axiom,
! [X1] :
( ~ environment(X1)
| ! [X2] :
( ~ in_environment(X1,X2)
| ~ ren1(X1,skf1(X1,X2),X2) )
| ren2(X1,skf2(X1)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skf1,skf2]),skolemize(X3,skf1(X1,X2)),skolemize(X4,skf2(X1))],[mp_earliest_time_growth_rate_exceeds_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_7,plain,
( ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ ren1(X0,skf1(X0,X1),X1)
| ren2(X0,skf2(X0)) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[mp_earliest_time_growth_rate_exceeds_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_21,plain,
( ~ ren3(X0,X1)
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ren2(X0,skf2(X0)) ),
inference(resolution,[status(thm)],[c_9,c_3,c_1,c_2,c_7]) ).
% CNF SPASS RESOLUTION.
cnf(c_22,plain,
( ~ ren3(X0,X1)
| ~ environment(X0)
| ren2(X0,skf2(X0)) ),
inference(resolution,[status(thm)],[c_8,c_21]) ).
% FOF RENAMING INFERENCE
fof(l1_renObv,hypothesis,
! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X2] : ren3(X1,X2) ),
inference(renaming,[status(esa)],[l1_elimTB,ren3_defn]) ).
% FOF SIMPLE INFERENCE
fof(l1_elimImpEquivPushNegMiniScope,hypothesis,
! [X1] :
( ~ environment(X1)
| ~ stable(X1)
| ? [X2] : ren3(X1,X2) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[l1_renObv]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(l1_skol,hypothesis,
! [X1] :
( ~ environment(X1)
| ~ stable(X1)
| ren3(X1,skf3(X1)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skf3]),skolemize(X2,skf3(X1))],[l1_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_10,plain,
( ~ environment(X0)
| ~ stable(X0)
| ren3(X0,skf3(X0)) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[l1_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_24,plain,
( ~ environment(X0)
| ~ stable(X0)
| ren2(X0,skf2(X0)) ),
inference(resolution,[status(thm)],[c_22,c_10]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_14,plain,
environment(skc4),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[prove_l12_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_15,plain,
stable(skc4),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[prove_l12_nc_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_25,plain,
$false,
inference(resolution,[status(thm)],[c_6,c_13,c_11,c_12,c_16,c_5,c_4,c_24,c_14,c_15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : MGT030+1 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.02 % Command : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.29 % Computer : n012.cluster.edu
% 0.03/0.29 % Model : x86_64 x86_64
% 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29 % Memory : 8046.5625MB
% 0.03/0.29 % OS : Linux 6.8.0-71-generic
% 0.03/0.29 % CPULimit : 300
% 0.03/0.29 % WCLimit : 300
% 0.03/0.29 % DateTime : Mon Sep 7 12:18:11 UTC 2026
% 0.03/0.29 % CPUTime :
% 0.03/0.29 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.30
% 0.03/0.30 % Input Clauses:
% 0.03/0.30 % 1:2:3:INP:TopTopTop: -> subpopulations(first_movers,efficient_producers,x0,x1),ren1(x0,x1,x2)
% 0.03/0.30 % 2:2:3:INP:TopTopTop: -> greater_or_equal(x0,x1),ren1(x2,x0,x1)
% 0.03/0.30 % 3:2:3:INP:TopTopTop: greater(growth_rate(efficient_producers,x0),growth_rate(first_movers,x0)) -> ren1(x1,x0,x2)
% 0.03/0.30 % 4:2:2:INP:TopTop: ren2(x0,x1) -> in_environment(x0,x1)
% 0.03/0.30 % 5:2:2:INP:TopTop: ren2(x0,x1),greater(growth_rate(efficient_producers,x1),growth_rate(first_movers,x1)) ->
% 0.03/0.30 % 6:4:3:INP:TopTopTop: ren2(x0,x1),subpopulations(first_movers,efficient_producers,x0,x2),greater(x2,x1) -> greater(growth_rate(efficient_producers,x2),growth_rate(first_movers,x2))
% 0.03/0.30 % 7:4:2:INP:TopTop: environment(x0),in_environment(x0,x1),ren1(x0,skf1(x0,x1),x1) -> ren2(x0,skf2(x0))
% 0.03/0.30 % 8:2:2:INP:TopTop: ren3(x0,x1) -> in_environment(x0,x1)
% 0.03/0.30 % 9:4:3:INP:TopTopTop: ren3(x0,x1),subpopulations(first_movers,efficient_producers,x0,x2),greater_or_equal(x2,x1) -> greater(growth_rate(efficient_producers,x2),growth_rate(first_movers,x2))
% 0.03/0.30 % 10:3:1:INP:Top: environment(x0),stable(x0) -> ren3(x0,skf3(x0))
% 0.03/0.30 % 11:2:3:INP:TopTopTop: -> subpopulations(first_movers,efficient_producers,x0,x1),ren4(x0,x1,x2)
% 0.03/0.30 % 12:2:3:INP:TopTopTop: -> greater(x0,x1),ren4(x2,x0,x1)
% 0.03/0.30 % 13:2:3:INP:TopTopTop: greater(growth_rate(efficient_producers,x0),growth_rate(first_movers,x0)) -> ren4(x1,x0,x2)
% 0.03/0.30 % 14:1:0:INP:: -> environment(skc4)
% 0.03/0.30 % 15:1:0:INP:: -> stable(skc4)
% 0.03/0.30 % 16:3:1:INP:Top: in_environment(skc4,x0),ren4(skc4,skf5(x0),x0) -> greater(growth_rate(efficient_producers,x0),growth_rate(first_movers,x0))
% 0.03/0.30
% 0.03/0.30 % Predicates: environment in_environment subpopulations greater_or_equal greater stable ren1 ren2 ren3 ren4
% 0.03/0.30 % Fol Constants: first_movers efficient_producers skc4
% 0.03/0.30 % Fol Functions: growth_rate skf1 skf2 skf3 skf5
% 0.03/0.30 % Problem Properties:
% 0.03/0.30 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.03/0.30
% 0.03/0.30
% 0.03/0.30 % Reduced Input Axiom Clauses:
% 0.03/0.30 % 1:2:3:INP:TopTopTop: -> subpopulations(first_movers,efficient_producers,x0,x1),ren1(x0,x1,x2)
% 0.03/0.30 % 2:2:3:INP:TopTopTop: -> greater_or_equal(x0,x1),ren1(x2,x0,x1)
% 0.03/0.30 % 3:2:3:INP:TopTopTop: greater(growth_rate(efficient_producers,x0),growth_rate(first_movers,x0)) -> ren1(x1,x0,x2)
% 0.03/0.30 % 4:2:2:INP:TopTop: ren2(x0,x1) -> in_environment(x0,x1)
% 0.03/0.30 % 5:2:2:INP:TopTop: ren2(x0,x1),greater(growth_rate(efficient_producers,x1),growth_rate(first_movers,x1)) ->
% 0.03/0.30 % 6:4:3:INP:TopTopTop: ren2(x0,x1),subpopulations(first_movers,efficient_producers,x0,x2),greater(x2,x1) -> greater(growth_rate(efficient_producers,x2),growth_rate(first_movers,x2))
% 0.03/0.30 % 7:4:2:INP:TopTop: environment(x0),in_environment(x0,x1),ren1(x0,skf1(x0,x1),x1) -> ren2(x0,skf2(x0))
% 0.03/0.30 % 8:2:2:INP:TopTop: ren3(x0,x1) -> in_environment(x0,x1)
% 0.03/0.30 % 9:4:3:INP:TopTopTop: ren3(x0,x1),subpopulations(first_movers,efficient_producers,x0,x2),greater_or_equal(x2,x1) -> greater(growth_rate(efficient_producers,x2),growth_rate(first_movers,x2))
% 0.03/0.30 % 11:2:3:INP:TopTopTop: -> subpopulations(first_movers,efficient_producers,x0,x1),ren4(x0,x1,x2)
% 0.03/0.30 % 12:2:3:INP:TopTopTop: -> greater(x0,x1),ren4(x2,x0,x1)
% 0.03/0.30 % 13:2:3:INP:TopTopTop: greater(growth_rate(efficient_producers,x0),growth_rate(first_movers,x0)) -> ren4(x1,x0,x2)
% 0.03/0.30
% 0.03/0.30 % Reduced Input Conjecture Clauses:
% 0.03/0.30 % 10:3:1:INP:Top: environment(x0),stable(x0) -> ren3(x0,skf3(x0))
% 0.03/0.30 % 14:1:0:INP:: -> environment(skc4)
% 0.03/0.30 % 15:1:0:INP:: -> stable(skc4)
% 0.03/0.30 % 16:3:1:INP:Top: in_environment(skc4,x0),ren4(skc4,skf5(x0),x0) -> greater(growth_rate(efficient_producers,x0),growth_rate(first_movers,x0))
% 0.03/0.30
% 0.03/0.30
% 0.03/0.30 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 31 atoms initially. Used heuristic: lmodel_grow ===
% 0.03/0.30
% 0.03/0.30
% 0.03/0.30
% 0.03/0.30 % SZS status Theorem
% 0.03/0.30 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.30
% 0.03/0.30 % SPASS-SCL-FOL Statistics:
% 0.03/0.30 % Number of learned clauses: 6
% 0.03/0.30 % Number of propagations: 96
% 0.03/0.30 % Number of decisions: 59
% 0.03/0.30 % Number of resolutions: 25
% 0.03/0.30 % Number of condensations: 1
% 0.03/0.30 % Number of sub resolutions: 2
% 0.03/0.30
% 0.03/0.30 % Solver is done. Empty clause found
% 0.03/0.30
% 0.03/0.30 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.03/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.03/0.30 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.03/0.30
% 0.03/0.30
% 0.03/0.30 % Needed: 0:00:00.00
% 0.03/0.30
% 0.03/0.30 % ###
% 0.03/0.30 % ### Pagesize: 8192
% 0.03/0.30 % ### Marksize: 0
% 0.03/0.30 % ### Memory demanded: 959 KBytes
% 0.03/0.30 % ### Memory freed: 959 KBytes
% 0.03/0.30 % ### Memory remaining: 0 Bytes
% 0.03/0.30 % ### Pages allocated: 217 Pages
% 0.03/0.30 % ###
%------------------------------------------------------------------------------