TSTP Solution File: MGT040+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : MGT040+2 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:35:46 EDT 2023
% Result : CounterSatisfiable 0.17s 0.46s
% Output : Saturation 0.17s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_18)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_26,plain,
( in_environment(X1,critical_point(X1))
| selection_favors(first_movers,efficient_producers,end_time(X1))
| ~ environment(X1)
| ~ greater(critical_point(X1),X2)
| ~ greater_or_equal(X2,appear(efficient_producers,X1)) ),
inference(cn,[status(thm)],[c_0_18]),
[final] ).
cnf(c_0_27,plain,
( greater(appear(efficient_producers,X1),X2)
| greater_or_equal(X2,appear(efficient_producers,X1))
| ~ in_environment(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]),
[final] ).
cnf(c_0_30,plain,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]),
[final] ).
cnf(c_0_32,plain,
( extreme(X1)
| ~ observational_period(X1)
| ~ environment(X2)
| ~ in_environment(X1,X2)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]),
[final] ).
cnf(c_0_33,plain,
( in_environment(X1,end_time(X1))
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]),
[final] ).
cnf(c_0_35,plain,
propagation_strategy(first_movers),
inference(split_conjunct,[status(thm)],[mp_organizational_sets1]),
[final] ).
cnf(c_0_36,plain,
propagation_strategy(efficient_producers),
inference(split_conjunct,[status(thm)],[mp_organizational_sets2]),
[final] ).
cnf(c_0_41,plain,
( greater(appear(efficient_producers,X1),X2)
| selection_favors(first_movers,efficient_producers,end_time(X1))
| in_environment(X1,critical_point(X1))
| ~ greater(critical_point(X1),X2)
| ~ in_environment(X1,X2)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]),
[final] ).
cnf(c_0_42,plain,
( in_environment(X1,critical_point(X1))
| greater(critical_point(X1),end_time(X1))
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]),
[final] ).
cnf(c_0_43,hypothesis,
( selection_favors(first_movers,efficient_producers,X2)
| ~ environment(X1)
| ~ in_environment(X1,critical_point(X1))
| ~ greater_or_equal(X2,appear(efficient_producers,X1))
| ~ greater(critical_point(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]),
[final] ).
cnf(c_0_44,plain,
( X1 = appear(efficient_producers,X2)
| greater(appear(efficient_producers,X2),X1)
| greater(X1,appear(efficient_producers,X2))
| ~ in_environment(X2,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_27]),
[final] ).
cnf(c_0_45,negated_conjecture,
~ extreme(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_46,plain,
( extreme(X1)
| ~ empty(end_time(X1))
| ~ environment(end_time(X1))
| ~ environment(X1)
| ~ observational_period(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]),
[final] ).
cnf(c_0_47,negated_conjecture,
observational_period(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_48,plain,
( selection_favors(efficient_producers,first_movers,X1)
| ~ selection_favors(efficient_producers,first_movers,end_time(esk1_1(X1)))
| ~ observational_period(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
[final] ).
cnf(c_0_49,plain,
( selection_favors(efficient_producers,first_movers,X1)
| in_environment(X1,esk1_1(X1))
| ~ observational_period(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_35]),c_0_36])]),
[final] ).
cnf(c_0_50,plain,
( selection_favors(efficient_producers,first_movers,X1)
| environment(esk1_1(X1))
| ~ observational_period(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_35]),c_0_36])]),
[final] ).
cnf(c_0_54,plain,
( greater(appear(efficient_producers,X1),end_time(X1))
| selection_favors(first_movers,efficient_producers,end_time(X1))
| in_environment(X1,critical_point(X1))
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_33]),
[final] ).
cnf(c_0_55,hypothesis,
( greater(appear(efficient_producers,X1),X2)
| selection_favors(first_movers,efficient_producers,X2)
| ~ greater(critical_point(X1),X2)
| ~ in_environment(X1,critical_point(X1))
| ~ in_environment(X1,X2)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_27]),
[final] ).
cnf(c_0_56,plain,
( end_time(X1) = appear(efficient_producers,X1)
| greater(end_time(X1),appear(efficient_producers,X1))
| greater(appear(efficient_producers,X1),end_time(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_33]),
[final] ).
cnf(c_0_57,negated_conjecture,
( ~ empty(end_time(esk2_0))
| ~ environment(end_time(esk2_0))
| ~ environment(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]),
[final] ).
cnf(c_0_58,negated_conjecture,
( selection_favors(efficient_producers,first_movers,esk2_0)
| ~ selection_favors(efficient_producers,first_movers,end_time(esk1_1(esk2_0))) ),
inference(spm,[status(thm)],[c_0_48,c_0_47]),
[final] ).
cnf(c_0_59,negated_conjecture,
( selection_favors(efficient_producers,first_movers,esk2_0)
| in_environment(esk2_0,esk1_1(esk2_0)) ),
inference(spm,[status(thm)],[c_0_49,c_0_47]),
[final] ).
cnf(c_0_60,negated_conjecture,
( selection_favors(efficient_producers,first_movers,esk2_0)
| environment(esk1_1(esk2_0)) ),
inference(spm,[status(thm)],[c_0_50,c_0_47]),
[final] ).
cnf(c_0_61,plain,
( ~ observational_period(X1)
| ~ rapid_change(X1)
| ~ environment(X2)
| ~ in_environment(X1,X2)
| ~ in_environment(X2,critical_point(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_51]),
[final] ).
cnf(c_0_62,hypothesis,
( selection_favors(first_movers,efficient_producers,X2)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater_or_equal(X2,appear(first_movers,X1))
| ~ greater(appear(efficient_producers,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]),
[final] ).
cnf(c_0_63,plain,
( empty(X1)
| greater_or_equal(end_time(X1),appear(an_organisation,X1))
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]),
[final] ).
cnf(c_0_64,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_65,negated_conjecture,
rapid_change(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : MGT040+2 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n022.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 : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 00:24:09 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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/tmp/tmp.iwb7gtEsx1/E---3.1_27307.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27385 completed with status 1
% 0.17/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 811s (1) cores
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.46 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.17/0.46 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.46 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with pid 27391 completed with status 1
% 0.17/0.46 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 811s (1) cores
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.46 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # No proof found!
% 0.17/0.46 # SZS status CounterSatisfiable
% 0.17/0.46 # SZS output start Saturation
% See solution above
% 0.17/0.46 # Parsed axioms : 14
% 0.17/0.46 # Removed by relevancy pruning/SinE : 0
% 0.17/0.46 # Initial clauses : 20
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 20
% 0.17/0.46 # Processed clauses : 49
% 0.17/0.46 # ...of these trivial : 0
% 0.17/0.46 # ...subsumed : 1
% 0.17/0.46 # ...remaining for further processing : 48
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 0
% 0.17/0.46 # Backward-rewritten : 0
% 0.17/0.46 # Generated clauses : 10
% 0.17/0.46 # ...of the previous two non-redundant : 10
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 1
% 0.17/0.46 # Paramodulations : 10
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 0
% 0.17/0.46 # Total rewrite steps : 7
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 29
% 0.17/0.46 # Positive orientable unit clauses : 4
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 2
% 0.17/0.46 # Non-unit-clauses : 23
% 0.17/0.46 # Current number of unprocessed clauses: 0
% 0.17/0.46 # ...number of literals in the above : 0
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 19
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 309
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 67
% 0.17/0.46 # Non-unit clause-clause subsumptions : 2
% 0.17/0.46 # Unit Clause-clause subsumption calls : 1
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 0
% 0.17/0.46 # BW rewrite match successes : 0
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 2178
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.006 s
% 0.17/0.46 # System time : 0.002 s
% 0.17/0.46 # Total time : 0.008 s
% 0.17/0.46 # Maximum resident set size: 1768 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.019 s
% 0.17/0.46 # System time : 0.009 s
% 0.17/0.46 # Total time : 0.028 s
% 0.17/0.46 # Maximum resident set size: 1688 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------