TSTP Solution File: MGT023-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MGT023-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:36:02 EDT 2023
% Result : Unsatisfiable 0.21s 0.46s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 23 ( 8 unt; 8 nHn; 23 RR)
% Number of literals : 72 ( 9 equ; 42 neg)
% Maximal clause size : 5 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(d1_17,hypothesis,
( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))
| X2 = critical_point(X1)
| ~ environment(X1)
| ~ in_environment(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.dXfjkxglDs/E---3.1_28562.p',d1_17) ).
cnf(l12_20,hypothesis,
( in_environment(X1,sk2(X1))
| ~ environment(X1)
| ~ stable(X1) ),
file('/export/starexec/sandbox/tmp/tmp.dXfjkxglDs/E---3.1_28562.p',l12_20) ).
cnf(l12_21,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ greater(growth_rate(efficient_producers,sk2(X1)),growth_rate(first_movers,sk2(X1))) ),
file('/export/starexec/sandbox/tmp/tmp.dXfjkxglDs/E---3.1_28562.p',l12_21) ).
cnf(l12_22,hypothesis,
( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater(X2,sk2(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.dXfjkxglDs/E---3.1_28562.p',l12_22) ).
cnf(d1_19,hypothesis,
( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| X2 = critical_point(X1)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(growth_rate(efficient_producers,sk1(X2,X1)),growth_rate(first_movers,sk1(X2,X1))) ),
file('/export/starexec/sandbox/tmp/tmp.dXfjkxglDs/E---3.1_28562.p',d1_19) ).
cnf(d1_18,hypothesis,
( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| greater(sk1(X2,X1),X2)
| X2 = critical_point(X1)
| ~ environment(X1)
| ~ in_environment(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.dXfjkxglDs/E---3.1_28562.p',d1_18) ).
cnf(prove_l5_25,negated_conjecture,
~ in_environment(sk3,critical_point(sk3)),
file('/export/starexec/sandbox/tmp/tmp.dXfjkxglDs/E---3.1_28562.p',prove_l5_25) ).
cnf(prove_l5_24,negated_conjecture,
stable(sk3),
file('/export/starexec/sandbox/tmp/tmp.dXfjkxglDs/E---3.1_28562.p',prove_l5_24) ).
cnf(prove_l5_23,negated_conjecture,
environment(sk3),
file('/export/starexec/sandbox/tmp/tmp.dXfjkxglDs/E---3.1_28562.p',prove_l5_23) ).
cnf(c_0_9,hypothesis,
( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))
| X2 = critical_point(X1)
| ~ environment(X1)
| ~ in_environment(X1,X2) ),
d1_17 ).
cnf(c_0_10,hypothesis,
( in_environment(X1,sk2(X1))
| ~ environment(X1)
| ~ stable(X1) ),
l12_20 ).
cnf(c_0_11,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ greater(growth_rate(efficient_producers,sk2(X1)),growth_rate(first_movers,sk2(X1))) ),
l12_21 ).
cnf(c_0_12,hypothesis,
( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater(X2,sk2(X1)) ),
l12_22 ).
cnf(c_0_13,hypothesis,
( critical_point(X1) = sk2(X1)
| subpopulations(first_movers,efficient_producers,X1,sk1(sk2(X1),X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_14,hypothesis,
( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| X2 = critical_point(X1)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(growth_rate(efficient_producers,sk1(X2,X1)),growth_rate(first_movers,sk1(X2,X1))) ),
d1_19 ).
cnf(c_0_15,hypothesis,
( critical_point(X1) = sk2(X1)
| greater(growth_rate(efficient_producers,sk1(sk2(X1),X1)),growth_rate(first_movers,sk1(sk2(X1),X1)))
| ~ stable(X1)
| ~ greater(sk1(sk2(X1),X1),sk2(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,hypothesis,
( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| greater(sk1(X2,X1),X2)
| X2 = critical_point(X1)
| ~ environment(X1)
| ~ in_environment(X1,X2) ),
d1_18 ).
cnf(c_0_17,negated_conjecture,
~ in_environment(sk3,critical_point(sk3)),
prove_l5_25 ).
cnf(c_0_18,hypothesis,
( critical_point(X1) = sk2(X1)
| ~ stable(X1)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_10]),c_0_11]) ).
cnf(c_0_19,negated_conjecture,
stable(sk3),
prove_l5_24 ).
cnf(c_0_20,negated_conjecture,
environment(sk3),
prove_l5_23 ).
cnf(c_0_21,negated_conjecture,
~ in_environment(sk3,sk2(sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_22,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_10]),c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : MGT023-1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.15 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n007.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 2400
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Tue Oct 3 00:15:24 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.21/0.45 Running first-order model finding
% 0.21/0.45 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.dXfjkxglDs/E---3.1_28562.p
% 0.21/0.46 # Version: 3.1pre001
% 0.21/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.46 # Starting sh5l with 300s (1) cores
% 0.21/0.46 # new_bool_3 with pid 28675 completed with status 0
% 0.21/0.46 # Result found by new_bool_3
% 0.21/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.46 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.21/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.46 # SAT001_MinMin_p005000_rr_RG with pid 28679 completed with status 0
% 0.21/0.46 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.46 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.21/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.46 # Preprocessing time : 0.001 s
% 0.21/0.46 # Presaturation interreduction done
% 0.21/0.46
% 0.21/0.46 # Proof found!
% 0.21/0.46 # SZS status Unsatisfiable
% 0.21/0.46 # SZS output start CNFRefutation
% See solution above
% 0.21/0.46 # Parsed axioms : 9
% 0.21/0.46 # Removed by relevancy pruning/SinE : 0
% 0.21/0.46 # Initial clauses : 9
% 0.21/0.46 # Removed in clause preprocessing : 0
% 0.21/0.46 # Initial clauses in saturation : 9
% 0.21/0.46 # Processed clauses : 22
% 0.21/0.46 # ...of these trivial : 0
% 0.21/0.46 # ...subsumed : 0
% 0.21/0.46 # ...remaining for further processing : 22
% 0.21/0.46 # Other redundant clauses eliminated : 0
% 0.21/0.46 # Clauses deleted for lack of memory : 0
% 0.21/0.46 # Backward-subsumed : 2
% 0.21/0.46 # Backward-rewritten : 0
% 0.21/0.46 # Generated clauses : 5
% 0.21/0.46 # ...of the previous two non-redundant : 4
% 0.21/0.46 # ...aggressively subsumed : 0
% 0.21/0.46 # Contextual simplify-reflections : 4
% 0.21/0.46 # Paramodulations : 5
% 0.21/0.46 # Factorizations : 0
% 0.21/0.46 # NegExts : 0
% 0.21/0.46 # Equation resolutions : 0
% 0.21/0.46 # Total rewrite steps : 4
% 0.21/0.46 # Propositional unsat checks : 0
% 0.21/0.46 # Propositional check models : 0
% 0.21/0.46 # Propositional check unsatisfiable : 0
% 0.21/0.46 # Propositional clauses : 0
% 0.21/0.46 # Propositional clauses after purity: 0
% 0.21/0.46 # Propositional unsat core size : 0
% 0.21/0.46 # Propositional preprocessing time : 0.000
% 0.21/0.46 # Propositional encoding time : 0.000
% 0.21/0.46 # Propositional solver time : 0.000
% 0.21/0.46 # Success case prop preproc time : 0.000
% 0.21/0.46 # Success case prop encoding time : 0.000
% 0.21/0.46 # Success case prop solver time : 0.000
% 0.21/0.46 # Current number of processed clauses : 11
% 0.21/0.46 # Positive orientable unit clauses : 2
% 0.21/0.46 # Positive unorientable unit clauses: 0
% 0.21/0.46 # Negative unit clauses : 2
% 0.21/0.46 # Non-unit-clauses : 7
% 0.21/0.46 # Current number of unprocessed clauses: 0
% 0.21/0.46 # ...number of literals in the above : 0
% 0.21/0.46 # Current number of archived formulas : 0
% 0.21/0.46 # Current number of archived clauses : 11
% 0.21/0.46 # Clause-clause subsumption calls (NU) : 66
% 0.21/0.46 # Rec. Clause-clause subsumption calls : 10
% 0.21/0.46 # Non-unit clause-clause subsumptions : 6
% 0.21/0.46 # Unit Clause-clause subsumption calls : 0
% 0.21/0.46 # Rewrite failures with RHS unbound : 0
% 0.21/0.46 # BW rewrite match attempts : 0
% 0.21/0.46 # BW rewrite match successes : 0
% 0.21/0.46 # Condensation attempts : 0
% 0.21/0.46 # Condensation successes : 0
% 0.21/0.46 # Termbank termtop insertions : 653
% 0.21/0.46
% 0.21/0.46 # -------------------------------------------------
% 0.21/0.46 # User time : 0.001 s
% 0.21/0.46 # System time : 0.002 s
% 0.21/0.46 # Total time : 0.003 s
% 0.21/0.46 # Maximum resident set size: 1632 pages
% 0.21/0.46
% 0.21/0.46 # -------------------------------------------------
% 0.21/0.46 # User time : 0.001 s
% 0.21/0.46 # System time : 0.005 s
% 0.21/0.46 # Total time : 0.006 s
% 0.21/0.46 # Maximum resident set size: 1680 pages
% 0.21/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------