TSTP Solution File: MGT040-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : MGT040-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:41:01 EDT 2024
% Result : Satisfiable 0.19s 0.48s
% Output : Saturation 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_33)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_24,plain,
( extreme(X1)
| ~ observational_period(X1)
| ~ environment(X2)
| ~ in_environment(X1,X2)
| ~ empty(X2) ),
c_0_21,
[final] ).
cnf(c_0_25,plain,
( in_environment(X1,end_time(X1))
| ~ environment(X1) ),
c_0_22,
[final] ).
cnf(c_0_26,negated_conjecture,
~ extreme(sk2),
c_0_23,
[final] ).
cnf(c_0_27,plain,
( extreme(X1)
| ~ empty(end_time(X1))
| ~ environment(end_time(X1))
| ~ environment(X1)
| ~ observational_period(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]),
[final] ).
cnf(c_0_28,negated_conjecture,
observational_period(sk2),
prove_t9_41,
[final] ).
cnf(c_0_34,negated_conjecture,
( ~ empty(end_time(sk2))
| ~ environment(end_time(sk2))
| ~ environment(sk2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),
[final] ).
cnf(c_0_35,plain,
( empty(X1)
| greater_or_equal(end_time(X1),appear(an_organisation,X1))
| ~ environment(X1) ),
c_0_29,
[final] ).
cnf(c_0_37,axiom,
propagation_strategy(first_movers),
mp_organizational_sets1_28,
[final] ).
cnf(c_0_38,axiom,
propagation_strategy(efficient_producers),
mp_organizational_sets2_29,
[final] ).
cnf(c_0_41,plain,
( in_environment(X1,appear(an_organisation,X1))
| ~ environment(X1)
| ~ greater_or_equal(end_time(X1),appear(an_organisation,X1)) ),
c_0_33,
[final] ).
cnf(c_0_42,negated_conjecture,
( greater_or_equal(end_time(end_time(sk2)),appear(an_organisation,end_time(sk2)))
| ~ environment(end_time(sk2))
| ~ environment(sk2) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]),
[final] ).
cnf(c_0_43,plain,
( selection_favors(efficient_producers,first_movers,X1)
| ~ selection_favors(efficient_producers,first_movers,end_time(sk1(X1)))
| ~ observational_period(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_38])]),
[final] ).
cnf(c_0_44,plain,
( in_environment(X1,sk1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_37]),c_0_38])]),
[final] ).
cnf(c_0_45,plain,
( selection_favors(efficient_producers,first_movers,X1)
| environment(sk1(X1))
| ~ observational_period(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_37]),c_0_38])]),
[final] ).
cnf(c_0_55,negated_conjecture,
( in_environment(end_time(sk2),appear(an_organisation,end_time(sk2)))
| ~ environment(end_time(sk2))
| ~ environment(sk2) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]),
[final] ).
cnf(c_0_56,negated_conjecture,
( selection_favors(efficient_producers,first_movers,sk2)
| ~ selection_favors(efficient_producers,first_movers,end_time(sk1(sk2))) ),
inference(spm,[status(thm)],[c_0_43,c_0_28]),
[final] ).
cnf(c_0_57,negated_conjecture,
( in_environment(sk2,sk1(sk2))
| selection_favors(efficient_producers,first_movers,sk2) ),
inference(spm,[status(thm)],[c_0_44,c_0_28]),
[final] ).
cnf(c_0_58,negated_conjecture,
( selection_favors(efficient_producers,first_movers,sk2)
| environment(sk1(sk2)) ),
inference(spm,[status(thm)],[c_0_45,c_0_28]),
[final] ).
cnf(c_0_59,plain,
( in_environment(X1,critical_point(X1))
| selection_favors(first_movers,efficient_producers,end_time(X1))
| ~ environment(X1)
| ~ greater_or_equal(X2,appear(efficient_producers,X1))
| ~ greater(critical_point(X1),X2) ),
c_0_46,
[final] ).
cnf(c_0_60,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) ),
c_0_47,
[final] ).
cnf(c_0_61,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) ),
c_0_48,
[final] ).
cnf(c_0_62,plain,
( ~ observational_period(X1)
| ~ rapid_change(X1)
| ~ environment(X2)
| ~ in_environment(X1,X2)
| ~ in_environment(X2,critical_point(X2)) ),
c_0_49,
[final] ).
cnf(c_0_63,hypothesis,
( appear(an_organisation,X1) = appear(first_movers,X1)
| ~ environment(X1)
| ~ in_environment(X1,appear(an_organisation,X1)) ),
c_0_50,
[final] ).
cnf(c_0_64,plain,
( in_environment(X1,critical_point(X1))
| greater(critical_point(X1),end_time(X1))
| ~ environment(X1) ),
c_0_51,
[final] ).
cnf(c_0_65,plain,
( greater(appear(efficient_producers,X1),X2)
| greater_or_equal(X2,appear(efficient_producers,X1))
| ~ in_environment(X1,X2) ),
c_0_52,
[final] ).
cnf(c_0_66,plain,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
c_0_53,
[final] ).
cnf(c_0_67,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,sk2),
c_0_54,
[final] ).
cnf(c_0_68,negated_conjecture,
rapid_change(sk2),
prove_t9_42,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT040-1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 00:07:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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.19/0.48 # Version: 3.1.0
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 25827 completed with status 1
% 0.19/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 811s (1) cores
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.48 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.19/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.48 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with pid 25835 completed with status 1
% 0.19/0.48 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 811s (1) cores
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.48 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # No proof found!
% 0.19/0.48 # SZS status Satisfiable
% 0.19/0.48 # SZS output start Saturation
% See solution above
% 0.19/0.48 # Parsed axioms : 22
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 22
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 22
% 0.19/0.48 # Processed clauses : 50
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 1
% 0.19/0.48 # ...remaining for further processing : 49
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 0
% 0.19/0.48 # Generated clauses : 7
% 0.19/0.48 # ...of the previous two non-redundant : 7
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 7
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 7
% 0.19/0.48 # ...of those cached : 4
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 28
% 0.19/0.48 # Positive orientable unit clauses : 4
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 2
% 0.19/0.48 # Non-unit-clauses : 22
% 0.19/0.48 # Current number of unprocessed clauses: 0
% 0.19/0.48 # ...number of literals in the above : 0
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 21
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 250
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 74
% 0.19/0.48 # Non-unit clause-clause subsumptions : 1
% 0.19/0.48 # Unit Clause-clause subsumption calls : 0
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 0
% 0.19/0.48 # BW rewrite match successes : 0
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 1337
% 0.19/0.48 # Search garbage collected termcells : 72
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.006 s
% 0.19/0.48 # System time : 0.001 s
% 0.19/0.48 # Total time : 0.007 s
% 0.19/0.48 # Maximum resident set size: 1656 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.021 s
% 0.19/0.48 # System time : 0.009 s
% 0.19/0.48 # Total time : 0.029 s
% 0.19/0.48 # Maximum resident set size: 1704 pages
% 0.19/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------