TSTP Solution File: MGT036-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MGT036-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:37:08 EDT 2023
% Result : Unsatisfiable 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of clauses : 38 ( 14 unt; 0 nHn; 33 RR)
% Number of literals : 87 ( 0 equ; 55 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 72 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(d2_9,hypothesis,
( greater(zero,growth_rate(X2,X4))
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ outcompetes(X3,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.P9Ck4dydEM/E---3.1_29830.p',d2_9) ).
cnf(mp_symmetry_of_FM_and_EP_1,axiom,
( subpopulations(efficient_producers,first_movers,X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.P9Ck4dydEM/E---3.1_29830.p',mp_symmetry_of_FM_and_EP_1) ).
cnf(prove_t5_13,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('/export/starexec/sandbox2/tmp/tmp.P9Ck4dydEM/E---3.1_29830.p',prove_t5_13) ).
cnf(prove_t5_14,negated_conjecture,
outcompetes(first_movers,efficient_producers,sk2),
file('/export/starexec/sandbox2/tmp/tmp.P9Ck4dydEM/E---3.1_29830.p',prove_t5_14) ).
cnf(prove_t5_12,negated_conjecture,
environment(sk1),
file('/export/starexec/sandbox2/tmp/tmp.P9Ck4dydEM/E---3.1_29830.p',prove_t5_12) ).
cnf(mp_growth_rate_relationships_3,axiom,
( environment(X1)
| ~ greater(zero,growth_rate(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.P9Ck4dydEM/E---3.1_29830.p',mp_growth_rate_relationships_3) ).
cnf(d2_8,hypothesis,
( greater_or_equal(growth_rate(X3,X4),zero)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ outcompetes(X3,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.P9Ck4dydEM/E---3.1_29830.p',d2_8) ).
cnf(mp_growth_rate_relationships_4,axiom,
( subpopulations(X1,X2,X3,X4)
| ~ greater(zero,growth_rate(X1,X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.P9Ck4dydEM/E---3.1_29830.p',mp_growth_rate_relationships_4) ).
cnf(a12_10,hypothesis,
( greater(zero,growth_rate(X3,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(resilience(X4),resilience(X3))
| ~ greater(zero,growth_rate(X4,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.P9Ck4dydEM/E---3.1_29830.p',a12_10) ).
cnf(mp_growth_rate_relationships_5,axiom,
( ~ greater_or_equal(growth_rate(X1,X2),zero)
| ~ greater(zero,growth_rate(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.P9Ck4dydEM/E---3.1_29830.p',mp_growth_rate_relationships_5) ).
cnf(a2_11,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
file('/export/starexec/sandbox2/tmp/tmp.P9Ck4dydEM/E---3.1_29830.p',a2_11) ).
cnf(mp_time_point_occur_2,axiom,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.P9Ck4dydEM/E---3.1_29830.p',mp_time_point_occur_2) ).
cnf(c_0_12,hypothesis,
( greater(zero,growth_rate(X2,X4))
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ outcompetes(X3,X2,X4) ),
d2_9 ).
cnf(c_0_13,axiom,
( subpopulations(efficient_producers,first_movers,X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
mp_symmetry_of_FM_and_EP_1 ).
cnf(c_0_14,hypothesis,
( greater(zero,growth_rate(efficient_producers,X1))
| ~ outcompetes(first_movers,efficient_producers,X1)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
prove_t5_13 ).
cnf(c_0_16,negated_conjecture,
outcompetes(first_movers,efficient_producers,sk2),
prove_t5_14 ).
cnf(c_0_17,negated_conjecture,
environment(sk1),
prove_t5_12 ).
cnf(c_0_18,axiom,
( environment(X1)
| ~ greater(zero,growth_rate(X2,X3)) ),
mp_growth_rate_relationships_3 ).
cnf(c_0_19,negated_conjecture,
greater(zero,growth_rate(efficient_producers,sk2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_20,hypothesis,
( greater_or_equal(growth_rate(X3,X4),zero)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ outcompetes(X3,X2,X4) ),
d2_8 ).
cnf(c_0_21,negated_conjecture,
environment(X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,hypothesis,
( greater_or_equal(growth_rate(X1,X2),zero)
| ~ outcompetes(X1,X3,X2)
| ~ subpopulations(X3,X1,X4,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_23,axiom,
( subpopulations(X1,X2,X3,X4)
| ~ greater(zero,growth_rate(X1,X4)) ),
mp_growth_rate_relationships_4 ).
cnf(c_0_24,hypothesis,
( greater_or_equal(growth_rate(X1,X2),zero)
| ~ outcompetes(X1,X3,X2)
| ~ greater(zero,growth_rate(X3,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,hypothesis,
( greater(zero,growth_rate(X3,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(resilience(X4),resilience(X3))
| ~ greater(zero,growth_rate(X4,X2)) ),
a12_10 ).
cnf(c_0_26,axiom,
( ~ greater_or_equal(growth_rate(X1,X2),zero)
| ~ greater(zero,growth_rate(X1,X2)) ),
mp_growth_rate_relationships_5 ).
cnf(c_0_27,negated_conjecture,
( greater_or_equal(growth_rate(X1,sk2),zero)
| ~ outcompetes(X1,efficient_producers,sk2) ),
inference(spm,[status(thm)],[c_0_24,c_0_19]) ).
cnf(c_0_28,hypothesis,
( greater(zero,growth_rate(X1,X2))
| ~ greater(zero,growth_rate(X3,X2))
| ~ greater(resilience(X3),resilience(X1))
| ~ in_environment(X4,X2) ),
inference(csr,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_29,negated_conjecture,
( ~ outcompetes(X1,efficient_producers,sk2)
| ~ greater(zero,growth_rate(X1,sk2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( greater(zero,growth_rate(X1,sk2))
| ~ greater(resilience(efficient_producers),resilience(X1))
| ~ in_environment(X2,sk2) ),
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_31,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
a2_11 ).
cnf(c_0_32,negated_conjecture,
~ greater(zero,growth_rate(first_movers,sk2)),
inference(spm,[status(thm)],[c_0_29,c_0_16]) ).
cnf(c_0_33,axiom,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
mp_time_point_occur_2 ).
cnf(c_0_34,hypothesis,
~ in_environment(X1,sk2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_35,plain,
( in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_21])]) ).
cnf(c_0_36,hypothesis,
~ subpopulations(first_movers,efficient_producers,X1,sk2),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_15,c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT036-1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 00:15:40 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.19/0.49 Running first-order model finding
% 0.19/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.P9Ck4dydEM/E---3.1_29830.p
% 0.19/0.50 # Version: 3.1pre001
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # new_bool_3 with pid 29979 completed with status 0
% 0.19/0.50 # Result found by new_bool_3
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGHNF-FFSS21-SFFFFFNN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.50 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 29984 completed with status 0
% 0.19/0.50 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGHNF-FFSS21-SFFFFFNN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Unsatisfiable
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 14
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 14
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 14
% 0.19/0.50 # Processed clauses : 54
% 0.19/0.50 # ...of these trivial : 0
% 0.19/0.50 # ...subsumed : 4
% 0.19/0.50 # ...remaining for further processing : 50
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 3
% 0.19/0.50 # Backward-rewritten : 7
% 0.19/0.50 # Generated clauses : 37
% 0.19/0.50 # ...of the previous two non-redundant : 34
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 3
% 0.19/0.50 # Paramodulations : 35
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Total rewrite steps : 16
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 24
% 0.19/0.50 # Positive orientable unit clauses : 5
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 4
% 0.19/0.50 # Non-unit-clauses : 15
% 0.19/0.50 # Current number of unprocessed clauses: 7
% 0.19/0.50 # ...number of literals in the above : 24
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 26
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 97
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 69
% 0.19/0.50 # Non-unit clause-clause subsumptions : 5
% 0.19/0.50 # Unit Clause-clause subsumption calls : 41
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 4
% 0.19/0.50 # BW rewrite match successes : 4
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 1135
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.004 s
% 0.19/0.50 # System time : 0.002 s
% 0.19/0.50 # Total time : 0.007 s
% 0.19/0.50 # Maximum resident set size: 1616 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.006 s
% 0.19/0.50 # System time : 0.004 s
% 0.19/0.50 # Total time : 0.010 s
% 0.19/0.50 # Maximum resident set size: 1684 pages
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------