TSTP Solution File: MGT019-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : MGT019-2 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:59 EDT 2024
% Result : Satisfiable 0.16s 0.42s
% Output : Saturation 0.16s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_14)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_15,plain,
( greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
| ~ greater(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))
| ~ greater_or_equal(founding_rate(efficient_producers,X1),founding_rate(first_movers,X1)) ),
c_0_12,
[final] ).
cnf(c_0_16,plain,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
c_0_13,
[final] ).
cnf(c_0_19,negated_conjecture,
( ~ in_environment(sk4,X1)
| ~ greater(growth_rate(efficient_producers,sk5(X1)),growth_rate(first_movers,sk5(X1))) ),
c_0_14,
[final] ).
cnf(c_0_20,plain,
( disbanding_rate(efficient_producers,X1) = disbanding_rate(first_movers,X1)
| greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
| ~ greater_or_equal(founding_rate(efficient_producers,X1),founding_rate(first_movers,X1))
| ~ greater_or_equal(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]),
[final] ).
cnf(c_0_21,hypothesis,
( greater_or_equal(founding_rate(efficient_producers,X2),founding_rate(first_movers,X2))
| ~ environment(X1)
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater_or_equal(X2,sk3(X1)) ),
c_0_17,
[final] ).
cnf(c_0_22,negated_conjecture,
( greater_or_equal(sk5(X1),X1)
| ~ in_environment(sk4,X1) ),
c_0_18,
[final] ).
cnf(c_0_24,negated_conjecture,
( disbanding_rate(efficient_producers,sk5(X1)) = disbanding_rate(first_movers,sk5(X1))
| ~ in_environment(sk4,X1)
| ~ greater_or_equal(founding_rate(efficient_producers,sk5(X1)),founding_rate(first_movers,sk5(X1)))
| ~ greater_or_equal(disbanding_rate(first_movers,sk5(X1)),disbanding_rate(efficient_producers,sk5(X1))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]),
[final] ).
cnf(c_0_25,negated_conjecture,
( greater_or_equal(founding_rate(efficient_producers,sk5(sk3(X1))),founding_rate(first_movers,sk5(sk3(X1))))
| ~ in_environment(sk4,sk3(X1))
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,sk5(sk3(X1)))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]),
[final] ).
cnf(c_0_26,plain,
~ greater(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)),
c_0_23,
[final] ).
cnf(c_0_29,negated_conjecture,
( disbanding_rate(efficient_producers,sk5(sk3(X1))) = disbanding_rate(first_movers,sk5(sk3(X1)))
| ~ in_environment(sk4,sk3(X1))
| ~ stable(X1)
| ~ greater_or_equal(disbanding_rate(first_movers,sk5(sk3(X1))),disbanding_rate(efficient_producers,sk5(sk3(X1))))
| ~ subpopulations(first_movers,efficient_producers,X1,sk5(sk3(X1)))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]),
[final] ).
cnf(c_0_30,negated_conjecture,
( growth_rate(efficient_producers,sk5(X1)) = growth_rate(first_movers,sk5(X1))
| ~ in_environment(sk4,X1)
| ~ greater_or_equal(growth_rate(efficient_producers,sk5(X1)),growth_rate(first_movers,sk5(X1))) ),
inference(spm,[status(thm)],[c_0_19,c_0_16]),
[final] ).
cnf(c_0_31,plain,
( disbanding_rate(efficient_producers,sk2) = disbanding_rate(first_movers,sk2)
| ~ greater_or_equal(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_16]),
[final] ).
cnf(c_0_32,hypothesis,
( in_environment(X1,sk3(X1))
| ~ environment(X1)
| ~ stable(X1) ),
c_0_27,
[final] ).
cnf(c_0_33,negated_conjecture,
( subpopulations(first_movers,efficient_producers,sk4,sk5(X1))
| ~ in_environment(sk4,X1) ),
c_0_28,
[final] ).
cnf(c_0_34,axiom,
subpopulations(first_movers,efficient_producers,sk1,sk2),
l2_23,
[final] ).
cnf(c_0_35,axiom,
environment(sk1),
l2_22,
[final] ).
cnf(c_0_36,negated_conjecture,
stable(sk4),
prove_l1_30,
[final] ).
cnf(c_0_37,negated_conjecture,
environment(sk4),
prove_l1_29,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : MGT019-2 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.10 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n006.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 00:07:38 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order model finding
% 0.16/0.41 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/benchmark/theBenchmark.p
% 0.16/0.42 # Version: 3.1.0
% 0.16/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.42 # Starting sh5l with 300s (1) cores
% 0.16/0.42 # new_bool_1 with pid 9766 completed with status 1
% 0.16/0.42 # Result found by new_bool_1
% 0.16/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.42 # Search class: FGHSF-FFSS21-SFFFFFNN
% 0.16/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.42 # SAT001_MinMin_p005000_rr_RG with pid 9772 completed with status 1
% 0.16/0.42 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.42 # Search class: FGHSF-FFSS21-SFFFFFNN
% 0.16/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.42 # Preprocessing time : 0.001 s
% 0.16/0.42 # Presaturation interreduction done
% 0.16/0.42
% 0.16/0.42 # No proof found!
% 0.16/0.42 # SZS status Satisfiable
% 0.16/0.42 # SZS output start Saturation
% See solution above
% 0.16/0.42 # Parsed axioms : 12
% 0.16/0.42 # Removed by relevancy pruning/SinE : 0
% 0.16/0.42 # Initial clauses : 12
% 0.16/0.42 # Removed in clause preprocessing : 0
% 0.16/0.42 # Initial clauses in saturation : 12
% 0.16/0.42 # Processed clauses : 30
% 0.16/0.42 # ...of these trivial : 0
% 0.16/0.42 # ...subsumed : 0
% 0.16/0.42 # ...remaining for further processing : 30
% 0.16/0.42 # Other redundant clauses eliminated : 0
% 0.16/0.42 # Clauses deleted for lack of memory : 0
% 0.16/0.42 # Backward-subsumed : 0
% 0.16/0.42 # Backward-rewritten : 0
% 0.16/0.42 # Generated clauses : 6
% 0.16/0.42 # ...of the previous two non-redundant : 6
% 0.16/0.42 # ...aggressively subsumed : 0
% 0.16/0.42 # Contextual simplify-reflections : 0
% 0.16/0.42 # Paramodulations : 6
% 0.16/0.42 # Factorizations : 0
% 0.16/0.42 # NegExts : 0
% 0.16/0.42 # Equation resolutions : 0
% 0.16/0.42 # Disequality decompositions : 0
% 0.16/0.42 # Total rewrite steps : 0
% 0.16/0.42 # ...of those cached : 0
% 0.16/0.42 # Propositional unsat checks : 0
% 0.16/0.42 # Propositional check models : 0
% 0.16/0.42 # Propositional check unsatisfiable : 0
% 0.16/0.42 # Propositional clauses : 0
% 0.16/0.42 # Propositional clauses after purity: 0
% 0.16/0.42 # Propositional unsat core size : 0
% 0.16/0.42 # Propositional preprocessing time : 0.000
% 0.16/0.42 # Propositional encoding time : 0.000
% 0.16/0.42 # Propositional solver time : 0.000
% 0.16/0.42 # Success case prop preproc time : 0.000
% 0.16/0.42 # Success case prop encoding time : 0.000
% 0.16/0.42 # Success case prop solver time : 0.000
% 0.16/0.42 # Current number of processed clauses : 18
% 0.16/0.42 # Positive orientable unit clauses : 4
% 0.16/0.42 # Positive unorientable unit clauses: 0
% 0.16/0.42 # Negative unit clauses : 1
% 0.16/0.42 # Non-unit-clauses : 13
% 0.16/0.42 # Current number of unprocessed clauses: 0
% 0.16/0.42 # ...number of literals in the above : 0
% 0.16/0.42 # Current number of archived formulas : 0
% 0.16/0.42 # Current number of archived clauses : 12
% 0.16/0.42 # Clause-clause subsumption calls (NU) : 65
% 0.16/0.42 # Rec. Clause-clause subsumption calls : 24
% 0.16/0.42 # Non-unit clause-clause subsumptions : 0
% 0.16/0.42 # Unit Clause-clause subsumption calls : 2
% 0.16/0.42 # Rewrite failures with RHS unbound : 0
% 0.16/0.42 # BW rewrite match attempts : 2
% 0.16/0.42 # BW rewrite match successes : 0
% 0.16/0.42 # Condensation attempts : 0
% 0.16/0.42 # Condensation successes : 0
% 0.16/0.42 # Termbank termtop insertions : 799
% 0.16/0.42 # Search garbage collected termcells : 32
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.004 s
% 0.16/0.42 # System time : 0.000 s
% 0.16/0.42 # Total time : 0.004 s
% 0.16/0.42 # Maximum resident set size: 1608 pages
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.006 s
% 0.16/0.42 # System time : 0.001 s
% 0.16/0.42 # Total time : 0.007 s
% 0.16/0.42 # Maximum resident set size: 1696 pages
% 0.16/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------