TSTP Solution File: MGT036-3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : MGT036-3 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 00:39:38 EDT 2024
% Result : Unsatisfiable 0.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 11 unt; 0 nHn; 22 RR)
% Number of literals : 50 ( 0 equ; 33 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(d2_2,hypothesis,
( outcompetes(X3,X2,X4)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ greater_or_equal(growth_rate(X3,X4),zero)
| ~ greater(zero,growth_rate(X2,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_2) ).
cnf(prove_t5_star_9,negated_conjecture,
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ outcompetes(first_movers,efficient_producers,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t5_star_9) ).
cnf(a13_star_8,hypothesis,
greater(zero,growth_rate(efficient_producers,sk2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a13_star_8) ).
cnf(a13_star_6,hypothesis,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a13_star_6) ).
cnf(a13_star_5,hypothesis,
environment(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a13_star_5) ).
cnf(mp_symmetry_of_subpopulations_1,axiom,
( subpopulations(X3,X2,X1,X4)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_symmetry_of_subpopulations_1) ).
cnf(a13_star_7,hypothesis,
greater_or_equal(growth_rate(first_movers,sk2),zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a13_star_7) ).
cnf(c_0_7,hypothesis,
( outcompetes(X3,X2,X4)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ greater_or_equal(growth_rate(X3,X4),zero)
| ~ greater(zero,growth_rate(X2,X4)) ),
inference(fof_simplification,[status(thm)],[d2_2]) ).
cnf(c_0_8,negated_conjecture,
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ outcompetes(first_movers,efficient_producers,X2) ),
inference(fof_simplification,[status(thm)],[prove_t5_star_9]) ).
cnf(c_0_9,hypothesis,
( outcompetes(X3,X2,X4)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ greater_or_equal(growth_rate(X3,X4),zero)
| ~ greater(zero,growth_rate(X2,X4)) ),
c_0_7 ).
cnf(c_0_10,hypothesis,
greater(zero,growth_rate(efficient_producers,sk2)),
a13_star_8 ).
cnf(c_0_11,negated_conjecture,
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ outcompetes(first_movers,efficient_producers,X2) ),
c_0_8 ).
cnf(c_0_12,hypothesis,
subpopulations(first_movers,efficient_producers,sk1,sk2),
a13_star_6 ).
cnf(c_0_13,hypothesis,
environment(sk1),
a13_star_5 ).
cnf(c_0_14,plain,
( subpopulations(X3,X2,X1,X4)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4) ),
inference(fof_simplification,[status(thm)],[mp_symmetry_of_subpopulations_1]) ).
cnf(c_0_15,hypothesis,
( outcompetes(X1,efficient_producers,sk2)
| ~ greater_or_equal(growth_rate(X1,sk2),zero)
| ~ subpopulations(efficient_producers,X1,X2,sk2)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,hypothesis,
greater_or_equal(growth_rate(first_movers,sk2),zero),
a13_star_7 ).
cnf(c_0_17,negated_conjecture,
~ outcompetes(first_movers,efficient_producers,sk2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_18,plain,
( subpopulations(X3,X2,X1,X4)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4) ),
c_0_14 ).
cnf(c_0_19,hypothesis,
( ~ subpopulations(efficient_producers,first_movers,X1,sk2)
| ~ environment(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_20,hypothesis,
subpopulations(efficient_producers,first_movers,sk1,sk2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_12]),c_0_13])]) ).
cnf(c_0_21,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : MGT036-3 : TPTP v8.2.0. Released v2.4.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n007.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 00:04:22 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.47 # Version: 3.1.0
% 0.18/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # Starting sh5l with 300s (1) cores
% 0.18/0.47 # new_bool_3 with pid 11483 completed with status 0
% 0.18/0.47 # Result found by new_bool_3
% 0.18/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FHHNF-FFSS22-SFFFFFNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.47 # SAT001_MinMin_p005000_rr_RG with pid 11488 completed with status 0
% 0.18/0.47 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FHHNF-FFSS22-SFFFFFNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.47 # Preprocessing time : 0.001 s
% 0.18/0.47 # Presaturation interreduction done
% 0.18/0.47
% 0.18/0.47 # Proof found!
% 0.18/0.47 # SZS status Unsatisfiable
% 0.18/0.47 # SZS output start CNFRefutation
% See solution above
% 0.18/0.47 # Parsed axioms : 9
% 0.18/0.47 # Removed by relevancy pruning/SinE : 0
% 0.18/0.47 # Initial clauses : 9
% 0.18/0.47 # Removed in clause preprocessing : 0
% 0.18/0.47 # Initial clauses in saturation : 9
% 0.18/0.47 # Processed clauses : 24
% 0.18/0.47 # ...of these trivial : 0
% 0.18/0.47 # ...subsumed : 0
% 0.18/0.47 # ...remaining for further processing : 24
% 0.18/0.47 # Other redundant clauses eliminated : 0
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 0
% 0.18/0.47 # Backward-rewritten : 0
% 0.18/0.47 # Generated clauses : 12
% 0.18/0.47 # ...of the previous two non-redundant : 8
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 0
% 0.18/0.47 # Paramodulations : 12
% 0.18/0.47 # Factorizations : 0
% 0.18/0.47 # NegExts : 0
% 0.18/0.47 # Equation resolutions : 0
% 0.18/0.47 # Disequality decompositions : 0
% 0.18/0.47 # Total rewrite steps : 11
% 0.18/0.47 # ...of those cached : 7
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 15
% 0.18/0.47 # Positive orientable unit clauses : 5
% 0.18/0.47 # Positive unorientable unit clauses: 0
% 0.18/0.47 # Negative unit clauses : 1
% 0.18/0.47 # Non-unit-clauses : 9
% 0.18/0.47 # Current number of unprocessed clauses: 2
% 0.18/0.47 # ...number of literals in the above : 9
% 0.18/0.47 # Current number of archived formulas : 0
% 0.18/0.47 # Current number of archived clauses : 9
% 0.18/0.47 # Clause-clause subsumption calls (NU) : 1
% 0.18/0.47 # Rec. Clause-clause subsumption calls : 0
% 0.18/0.47 # Non-unit clause-clause subsumptions : 0
% 0.18/0.47 # Unit Clause-clause subsumption calls : 1
% 0.18/0.47 # Rewrite failures with RHS unbound : 0
% 0.18/0.47 # BW rewrite match attempts : 1
% 0.18/0.47 # BW rewrite match successes : 0
% 0.18/0.47 # Condensation attempts : 0
% 0.18/0.47 # Condensation successes : 0
% 0.18/0.47 # Termbank termtop insertions : 583
% 0.18/0.47 # Search garbage collected termcells : 25
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.002 s
% 0.18/0.47 # System time : 0.003 s
% 0.18/0.47 # Total time : 0.005 s
% 0.18/0.47 # Maximum resident set size: 1720 pages
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.005 s
% 0.18/0.47 # System time : 0.003 s
% 0.18/0.47 # Total time : 0.008 s
% 0.18/0.47 # Maximum resident set size: 1692 pages
% 0.18/0.47 % E---3.1 exiting
% 0.18/0.47 % E exiting
%------------------------------------------------------------------------------