%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT022-2 : TPTP v9.3.0. Released v2.4.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:07 AM UTC 2026
% Result : Unsatisfiable 0.02s 0.30s
% Output : Proof 0.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of clauses : 12 ( 4 unt; 2 nHn; 12 RR)
% Number of literals : 31 ( 0 equ; 20 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
cnf(mp_constant_not_decrease_1,axiom,
( ~ constant(X0)
| ~ decreases(X0) ),
file('theBenchmark.p',mp_constant_not_decrease_1) ).
% FILE RECORD
cnf(a6_3,hypothesis,
( ~ environment(X0)
| ~ subpopulations(X1,X2,X0,X3)
| ~ greater(resilience(X2),resilience(X1))
| ~ constant(resources(X0,X3))
| constant(difference(disbanding_rate(X1,X3),disbanding_rate(X2,X3))) ),
file('theBenchmark.p',a6_3) ).
% FILE RECORD
cnf(prove_l4_8,negated_conjecture,
( decreases(resources(sk1,sk2))
| decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))) ),
file('theBenchmark.p',prove_l4_8) ).
% FILE RECORD
cnf(prove_l4_7,negated_conjecture,
( decreases(resources(sk1,sk2))
| constant(resources(sk1,sk2)) ),
file('theBenchmark.p',prove_l4_7) ).
% FILE RECORD
cnf(a2_4,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
file('theBenchmark.p',a2_4) ).
% FILE RECORD
cnf(prove_l4_9,negated_conjecture,
( ~ increases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)))
| constant(resources(sk1,sk2)) ),
file('theBenchmark.p',prove_l4_9) ).
% FILE RECORD
cnf(a6_2,hypothesis,
( ~ environment(X0)
| ~ subpopulations(X1,X2,X0,X3)
| ~ greater(resilience(X2),resilience(X1))
| ~ decreases(resources(X0,X3))
| increases(difference(disbanding_rate(X1,X3),disbanding_rate(X2,X3))) ),
file('theBenchmark.p',a6_2) ).
% CNF SPASS RESOLUTION.
cnf(c_11,plain,
( ~ environment(X0)
| ~ subpopulations(first_movers,efficient_producers,X0,sk2)
| ~ greater(resilience(efficient_producers),resilience(first_movers))
| ~ decreases(resources(X0,sk2))
| ~ decreases(resources(sk1,sk2)) ),
inference(resolution,[status(thm)],[prove_l4_9,a6_2,mp_constant_not_decrease_1]) ).
% CNF SPASS RESOLUTION.
cnf(c_12,plain,
( ~ environment(X0)
| ~ subpopulations(first_movers,efficient_producers,X0,sk2)
| ~ decreases(resources(X0,sk2))
| ~ decreases(resources(sk1,sk2)) ),
inference(resolution,[status(thm)],[a2_4,c_11]) ).
% FILE RECORD
cnf(prove_l4_6,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('theBenchmark.p',prove_l4_6) ).
% FILE RECORD
cnf(prove_l4_5,negated_conjecture,
environment(sk1),
file('theBenchmark.p',prove_l4_5) ).
% CNF SPASS RESOLUTION.
cnf(c_13,plain,
$false,
inference(resolution,[status(thm)],[mp_constant_not_decrease_1,a6_3,prove_l4_8,prove_l4_7,c_12,prove_l4_6,a2_4,prove_l4_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : MGT022-2 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.02 % Command : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.30 % Computer : n012.cluster.edu
% 0.02/0.30 % Model : x86_64 x86_64
% 0.02/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.30 % Memory : 8046.5625MB
% 0.02/0.30 % OS : Linux 6.8.0-71-generic
% 0.02/0.30 % CPULimit : 300
% 0.02/0.30 % WCLimit : 300
% 0.02/0.30 % DateTime : Mon Sep 7 12:06:11 UTC 2026
% 0.02/0.30 % CPUTime :
% 0.02/0.30 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.30
% 0.02/0.30 % Input Clauses:
% 0.02/0.30 % 1:2:1:INP:Top: constant(x0),decreases(x0) ->
% 0.02/0.30 % 2:5:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3),greater(resilience(x2),resilience(x1)),decreases(resources(x0,x3)) -> increases(difference(disbanding_rate(x1,x3),disbanding_rate(x2,x3)))
% 0.02/0.30 % 3:5:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3),greater(resilience(x2),resilience(x1)),constant(resources(x0,x3)) -> constant(difference(disbanding_rate(x1,x3),disbanding_rate(x2,x3)))
% 0.02/0.30 % 4:1:0:INP:: -> greater(resilience(efficient_producers),resilience(first_movers))
% 0.02/0.30 % 5:1:0:INP:: -> environment(sk1)
% 0.02/0.30 % 6:1:0:INP:: -> subpopulations(first_movers,efficient_producers,sk1,sk2)
% 0.02/0.30 % 7:2:0:INP:: -> decreases(resources(sk1,sk2)),constant(resources(sk1,sk2))
% 0.02/0.30 % 8:2:0:INP:: -> decreases(resources(sk1,sk2)),decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)))
% 0.02/0.30 % 9:2:0:INP:: increases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))) -> constant(resources(sk1,sk2))
% 0.02/0.30 % 10:2:0:INP:: increases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))) -> decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)))
% 0.02/0.30
% 0.02/0.30 % Predicates: constant decreases environment subpopulations greater increases
% 0.02/0.30 % Fol Constants: efficient_producers first_movers sk1 sk2
% 0.02/0.30 % Fol Functions: resilience resources disbanding_rate difference
% 0.02/0.30 % Problem Properties:
% 0.02/0.30 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.02/0.30
% 0.02/0.30
% 0.02/0.30 % Reduced Input Axiom Clauses:
% 0.02/0.30 % 1:2:1:INP:Top: constant(x0),decreases(x0) ->
% 0.02/0.30
% 0.02/0.30 % Reduced Input Conjecture Clauses:
% 0.02/0.30 % 2:5:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3),greater(resilience(x2),resilience(x1)),decreases(resources(x0,x3)) -> increases(difference(disbanding_rate(x1,x3),disbanding_rate(x2,x3)))
% 0.02/0.30 % 3:5:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3),greater(resilience(x2),resilience(x1)),constant(resources(x0,x3)) -> constant(difference(disbanding_rate(x1,x3),disbanding_rate(x2,x3)))
% 0.02/0.30 % 4:1:0:INP:: -> greater(resilience(efficient_producers),resilience(first_movers))
% 0.02/0.30 % 5:1:0:INP:: -> environment(sk1)
% 0.02/0.30 % 6:1:0:INP:: -> subpopulations(first_movers,efficient_producers,sk1,sk2)
% 0.02/0.30 % 7:2:0:INP:: -> decreases(resources(sk1,sk2)),constant(resources(sk1,sk2))
% 0.02/0.30 % 8:2:0:INP:: -> decreases(resources(sk1,sk2)),decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)))
% 0.02/0.30 % 9:2:0:INP:: increases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))) -> constant(resources(sk1,sk2))
% 0.02/0.30 % 10:2:0:INP:: increases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))) -> decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)))
% 0.02/0.30
% 0.02/0.30
% 0.02/0.30 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 23 atoms initially. Used heuristic: lmodel_grow ===
% 0.02/0.30
% 0.02/0.30
% 0.02/0.30
% 0.02/0.30 % SZS status Unsatisfiable
% 0.02/0.30 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.30
% 0.02/0.30 % SPASS-SCL-FOL Statistics:
% 0.02/0.30 % Number of learned clauses: 1
% 0.02/0.30 % Number of propagations: 17
% 0.02/0.30 % Number of decisions: 15
% 0.02/0.30 % Number of resolutions: 9
% 0.02/0.30 % Number of condensations: 0
% 0.02/0.30 % Number of sub resolutions: 1
% 0.02/0.30
% 0.02/0.30 % Solver is done. Empty clause found
% 0.02/0.30
% 0.02/0.30 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.02/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.02/0.30 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.02/0.30
% 0.02/0.30
% 0.02/0.30 % Needed: 0:00:00.00
% 0.02/0.30
% 0.02/0.30 % ###
% 0.02/0.30 % ### Pagesize: 8192
% 0.02/0.30 % ### Marksize: 0
% 0.02/0.30 % ### Memory demanded: 430 KBytes
% 0.02/0.30 % ### Memory freed: 430 KBytes
% 0.02/0.30 % ### Memory remaining: 0 Bytes
% 0.02/0.30 % ### Pages allocated: 113 Pages
% 0.02/0.30 % ###
%------------------------------------------------------------------------------