TSTP Solution File: MGT038-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : MGT038-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:45 EDT 2023
% Result : Satisfiable 0.21s 0.51s
% Output : Saturation 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named mp_long_stable_environments_21)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_12,hypothesis,
( greater(sk2(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
l9_23,
[final] ).
cnf(c_0_13,negated_conjecture,
stable(sk3),
prove_t7_27,
[final] ).
cnf(c_0_14,negated_conjecture,
environment(sk3),
prove_t7_26,
[final] ).
cnf(c_0_15,axiom,
( greater(sk1(X2,X1),X2)
| ~ finite_set(X1)
| ~ contracts_from(X2,X1) ),
mp_contracting_time_19,
[final] ).
cnf(c_0_16,hypothesis,
( contracts_from(sk2(X1),first_movers)
| ~ environment(X1)
| ~ stable(X1) ),
l9_24,
[final] ).
cnf(c_0_17,axiom,
finite_set(first_movers),
mp7_first_movers_exist_17,
[final] ).
cnf(c_0_18,axiom,
( greater(X1,X3)
| ~ greater(X1,X2)
| ~ greater(X2,X3) ),
mp_greater_transitivity_22,
[final] ).
cnf(c_0_19,negated_conjecture,
greater(sk2(sk3),appear(efficient_producers,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[final] ).
cnf(c_0_20,hypothesis,
( greater(sk1(sk2(X1),first_movers),sk2(X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[final] ).
cnf(c_0_21,hypothesis,
( greater(appear(efficient_producers,e),appear(first_movers,X1))
| ~ environment(X1) ),
a13_25,
[final] ).
cnf(c_0_22,negated_conjecture,
( greater(X1,appear(efficient_producers,sk3))
| ~ greater(X1,sk2(sk3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]),
[final] ).
cnf(c_0_23,negated_conjecture,
greater(sk1(sk2(sk3),first_movers),sk2(sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_13]),c_0_14])]),
[final] ).
cnf(c_0_24,axiom,
( in_environment(X1,X3)
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ greater(X3,X2) ),
mp_long_stable_environments_21,
[final] ).
cnf(c_0_25,negated_conjecture,
greater(appear(efficient_producers,e),appear(first_movers,sk3)),
inference(spm,[status(thm)],[c_0_21,c_0_14]),
[final] ).
cnf(c_0_27,negated_conjecture,
greater(sk1(sk2(sk3),first_movers),appear(efficient_producers,sk3)),
inference(spm,[status(thm)],[c_0_22,c_0_23]),
[final] ).
cnf(c_0_28,negated_conjecture,
( in_environment(X1,appear(efficient_producers,e))
| ~ in_environment(X1,appear(first_movers,sk3))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]),
[final] ).
cnf(c_0_29,axiom,
( in_environment(X1,appear(first_movers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
mp_stable_first_movers_18,
[final] ).
cnf(c_0_31,negated_conjecture,
( in_environment(X1,sk1(sk2(sk3),first_movers))
| ~ in_environment(X1,appear(efficient_producers,sk3))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_27]),
[final] ).
cnf(c_0_32,negated_conjecture,
( in_environment(X1,sk1(sk2(sk3),first_movers))
| ~ in_environment(X1,sk2(sk3))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]),
[final] ).
cnf(c_0_33,negated_conjecture,
( greater(X1,appear(efficient_producers,sk3))
| ~ greater(X1,sk1(sk2(sk3),first_movers)) ),
inference(spm,[status(thm)],[c_0_18,c_0_27]),
[final] ).
cnf(c_0_34,negated_conjecture,
( greater(X1,sk2(sk3))
| ~ greater(X1,sk1(sk2(sk3),first_movers)) ),
inference(spm,[status(thm)],[c_0_18,c_0_23]),
[final] ).
cnf(c_0_35,negated_conjecture,
( in_environment(X1,sk2(sk3))
| ~ in_environment(X1,appear(efficient_producers,sk3))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_19]),
[final] ).
cnf(c_0_36,negated_conjecture,
( greater(X1,appear(first_movers,sk3))
| ~ greater(X1,appear(efficient_producers,e)) ),
inference(spm,[status(thm)],[c_0_18,c_0_25]),
[final] ).
cnf(c_0_37,negated_conjecture,
( ~ in_environment(sk3,X1)
| ~ greater(X1,appear(first_movers,sk3))
| cardinality_at_time(first_movers,to) != zero ),
prove_t7_28,
[final] ).
cnf(c_0_38,negated_conjecture,
in_environment(sk3,appear(efficient_producers,e)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_13]),c_0_14])]),
[final] ).
cnf(c_0_39,negated_conjecture,
cardinality_at_time(s,t2) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_13]),c_0_14])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : MGT038-1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n020.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.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 00:25:16 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.rlEI4lyW73/E---3.1_29849.p
% 0.21/0.51 # Version: 3.1pre001
% 0.21/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 29927 completed with status 1
% 0.21/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.21/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FHHSF-FFSS21-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 811s (1) cores
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.51 # Starting sh5l with 136s (1) cores
% 0.21/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 29933 completed with status 1
% 0.21/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.21/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FHHSF-FFSS21-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 811s (1) cores
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # No proof found!
% 0.21/0.51 # SZS status Satisfiable
% 0.21/0.51 # SZS output start Saturation
% See solution above
% 0.21/0.51 # Parsed axioms : 12
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 12
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 12
% 0.21/0.51 # Processed clauses : 40
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 40
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 2
% 0.21/0.51 # Generated clauses : 16
% 0.21/0.51 # ...of the previous two non-redundant : 16
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 16
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Total rewrite steps : 9
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 26
% 0.21/0.51 # Positive orientable unit clauses : 9
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 0
% 0.21/0.51 # Non-unit-clauses : 17
% 0.21/0.51 # Current number of unprocessed clauses: 0
% 0.21/0.51 # ...number of literals in the above : 0
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 14
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 19
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 13
% 0.21/0.51 # Non-unit clause-clause subsumptions : 0
% 0.21/0.51 # Unit Clause-clause subsumption calls : 8
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 1
% 0.21/0.51 # BW rewrite match successes : 1
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 787
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.002 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.006 s
% 0.21/0.51 # Maximum resident set size: 1656 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.015 s
% 0.21/0.51 # System time : 0.012 s
% 0.21/0.51 # Total time : 0.027 s
% 0.21/0.51 # Maximum resident set size: 1680 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------