TSTP Solution File: MGT039+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MGT039+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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 : 600s
% DateTime : Sun Jul 17 22:10:10 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 58 ( 9 unt; 0 def)
% Number of atoms : 215 ( 10 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 267 ( 110 ~; 123 |; 22 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 85 ( 2 sgn 35 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp_environment_end_point,axiom,
! [X2,X3] :
( ( environment(X2)
& in_environment(X2,X3) )
=> greater_or_equal(end_time(X2),X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_environment_end_point) ).
fof(mp4_critical_point,axiom,
! [X1] :
( ( observational_period(X1)
& slow_change(X1) )
=> ! [X2] :
( ( environment(X2)
& in_environment(X1,X2) )
=> ? [X3] :
( in_environment(X2,X3)
& greater(X3,critical_point(X2)) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp4_critical_point) ).
fof(mp_time_in_environment,axiom,
! [X2,X3] :
( ( environment(X2)
& greater_or_equal(X3,start_time(X2))
& greater_or_equal(end_time(X2),X3) )
=> in_environment(X2,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_time_in_environment) ).
fof(mp_greater_or_equal,axiom,
! [X4,X5] :
( greater_or_equal(X4,X5)
<=> ( greater(X4,X5)
| X4 = X5 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_greater_or_equal) ).
fof(mp_time_of_critical_point,axiom,
! [X2] :
( environment(X2)
=> greater_or_equal(critical_point(X2),start_time(X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_time_of_critical_point) ).
fof(mp_greater_transitivity,axiom,
! [X4,X5,X6] :
( ( greater(X4,X5)
& greater(X5,X6) )
=> greater(X4,X6) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_greater_transitivity) ).
fof(mp3_favoured_trategy,axiom,
! [X1] :
( ( observational_period(X1)
& propagation_strategy(first_movers)
& propagation_strategy(efficient_producers)
& ! [X2] :
( ( environment(X2)
& in_environment(X1,X2) )
=> selection_favors(efficient_producers,first_movers,end_time(X2)) ) )
=> selection_favors(efficient_producers,first_movers,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp3_favoured_trategy) ).
fof(mp_organizational_sets1,axiom,
propagation_strategy(first_movers),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_organizational_sets1) ).
fof(mp_organizational_sets2,axiom,
propagation_strategy(efficient_producers),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_organizational_sets2) ).
fof(l8,hypothesis,
! [X2,X3] :
( ( environment(X2)
& in_environment(X2,X3)
& greater(X3,critical_point(X2)) )
=> selection_favors(efficient_producers,first_movers,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l8) ).
fof(prove_t8,conjecture,
! [X1] :
( ( observational_period(X1)
& slow_change(X1) )
=> selection_favors(efficient_producers,first_movers,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_t8) ).
fof(c_0_11,plain,
! [X4,X5] :
( ~ environment(X4)
| ~ in_environment(X4,X5)
| greater_or_equal(end_time(X4),X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_environment_end_point])]) ).
fof(c_0_12,plain,
! [X4,X5] :
( ( in_environment(X5,esk3_2(X4,X5))
| ~ environment(X5)
| ~ in_environment(X4,X5)
| ~ observational_period(X4)
| ~ slow_change(X4) )
& ( greater(esk3_2(X4,X5),critical_point(X5))
| ~ environment(X5)
| ~ in_environment(X4,X5)
| ~ observational_period(X4)
| ~ slow_change(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp4_critical_point])])])])])])]) ).
fof(c_0_13,plain,
! [X4,X5] :
( ~ environment(X4)
| ~ greater_or_equal(X5,start_time(X4))
| ~ greater_or_equal(end_time(X4),X5)
| in_environment(X4,X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_in_environment])]) ).
fof(c_0_14,plain,
! [X6,X7,X6,X7] :
( ( ~ greater_or_equal(X6,X7)
| greater(X6,X7)
| X6 = X7 )
& ( ~ greater(X6,X7)
| greater_or_equal(X6,X7) )
& ( X6 != X7
| greater_or_equal(X6,X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_or_equal])])])])]) ).
fof(c_0_15,plain,
! [X3] :
( ~ environment(X3)
| greater_or_equal(critical_point(X3),start_time(X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_of_critical_point])]) ).
fof(c_0_16,plain,
! [X7,X8,X9] :
( ~ greater(X7,X8)
| ~ greater(X8,X9)
| greater(X7,X9) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_transitivity])]) ).
cnf(c_0_17,plain,
( greater_or_equal(end_time(X1),X2)
| ~ in_environment(X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( in_environment(X2,esk3_2(X1,X2))
| ~ slow_change(X1)
| ~ observational_period(X1)
| ~ in_environment(X1,X2)
| ~ environment(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( in_environment(X1,X2)
| ~ greater_or_equal(end_time(X1),X2)
| ~ greater_or_equal(X2,start_time(X1))
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( greater_or_equal(critical_point(X1),start_time(X1))
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
( greater(esk3_2(X1,X2),critical_point(X2))
| ~ slow_change(X1)
| ~ observational_period(X1)
| ~ in_environment(X1,X2)
| ~ environment(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_26,plain,
( greater_or_equal(end_time(X1),esk3_2(X2,X1))
| ~ slow_change(X2)
| ~ in_environment(X2,X1)
| ~ environment(X1)
| ~ observational_period(X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,plain,
( in_environment(X1,X2)
| ~ greater_or_equal(end_time(X1),X2)
| ~ greater(X2,start_time(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
( start_time(X1) = critical_point(X1)
| greater(critical_point(X1),start_time(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
( greater(X1,critical_point(X2))
| ~ greater(X1,esk3_2(X3,X2))
| ~ slow_change(X3)
| ~ in_environment(X3,X2)
| ~ environment(X2)
| ~ observational_period(X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( esk3_2(X1,X2) = end_time(X2)
| greater(end_time(X2),esk3_2(X1,X2))
| ~ slow_change(X1)
| ~ in_environment(X1,X2)
| ~ environment(X2)
| ~ observational_period(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_26]) ).
fof(c_0_32,plain,
! [X3] :
( ( environment(esk2_1(X3))
| ~ observational_period(X3)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| selection_favors(efficient_producers,first_movers,X3) )
& ( in_environment(X3,esk2_1(X3))
| ~ observational_period(X3)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| selection_favors(efficient_producers,first_movers,X3) )
& ( ~ selection_favors(efficient_producers,first_movers,end_time(esk2_1(X3)))
| ~ observational_period(X3)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| selection_favors(efficient_producers,first_movers,X3) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp3_favoured_trategy])])])])])]) ).
cnf(c_0_33,plain,
( in_environment(X1,end_time(X1))
| ~ greater(end_time(X1),start_time(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( start_time(X1) = critical_point(X1)
| greater(X2,start_time(X1))
| ~ greater(X2,critical_point(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_35,plain,
( esk3_2(X1,X2) = end_time(X2)
| greater(end_time(X2),critical_point(X2))
| ~ slow_change(X1)
| ~ in_environment(X1,X2)
| ~ environment(X2)
| ~ observational_period(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( selection_favors(efficient_producers,first_movers,X1)
| in_environment(X1,esk2_1(X1))
| ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,plain,
propagation_strategy(first_movers),
inference(split_conjunct,[status(thm)],[mp_organizational_sets1]) ).
cnf(c_0_38,plain,
propagation_strategy(efficient_producers),
inference(split_conjunct,[status(thm)],[mp_organizational_sets2]) ).
cnf(c_0_39,plain,
( selection_favors(efficient_producers,first_movers,X1)
| environment(esk2_1(X1))
| ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
( start_time(X1) = critical_point(X1)
| in_environment(X1,end_time(X1))
| ~ greater(end_time(X1),critical_point(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
( greater(end_time(X1),critical_point(X1))
| ~ slow_change(X2)
| ~ in_environment(X2,X1)
| ~ environment(X1)
| ~ observational_period(X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_35]) ).
cnf(c_0_42,plain,
( selection_favors(efficient_producers,first_movers,X1)
| in_environment(X1,esk2_1(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])]) ).
cnf(c_0_43,plain,
( selection_favors(efficient_producers,first_movers,X1)
| environment(esk2_1(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])]) ).
fof(c_0_44,hypothesis,
! [X4,X5] :
( ~ environment(X4)
| ~ in_environment(X4,X5)
| ~ greater(X5,critical_point(X4))
| selection_favors(efficient_producers,first_movers,X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l8])]) ).
cnf(c_0_45,plain,
( in_environment(X1,end_time(X1))
| ~ greater(end_time(X1),critical_point(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_40]) ).
cnf(c_0_46,plain,
( greater(end_time(esk2_1(X1)),critical_point(esk2_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| ~ slow_change(X1)
| ~ observational_period(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_47,plain,
( selection_favors(efficient_producers,first_movers,X1)
| ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X1)
| ~ selection_favors(efficient_producers,first_movers,end_time(esk2_1(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_48,negated_conjecture,
~ ! [X1] :
( ( observational_period(X1)
& slow_change(X1) )
=> selection_favors(efficient_producers,first_movers,X1) ),
inference(assume_negation,[status(cth)],[prove_t8]) ).
cnf(c_0_49,hypothesis,
( selection_favors(efficient_producers,first_movers,X1)
| ~ greater(X1,critical_point(X2))
| ~ in_environment(X2,X1)
| ~ environment(X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,plain,
( selection_favors(efficient_producers,first_movers,X1)
| in_environment(esk2_1(X1),end_time(esk2_1(X1)))
| ~ slow_change(X1)
| ~ observational_period(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_43]) ).
cnf(c_0_51,plain,
( selection_favors(efficient_producers,first_movers,X1)
| ~ selection_favors(efficient_producers,first_movers,end_time(esk2_1(X1)))
| ~ observational_period(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_37]),c_0_38])]) ).
fof(c_0_52,negated_conjecture,
( observational_period(esk1_0)
& slow_change(esk1_0)
& ~ selection_favors(efficient_producers,first_movers,esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_48])])]) ).
cnf(c_0_53,hypothesis,
( selection_favors(efficient_producers,first_movers,X1)
| ~ slow_change(X1)
| ~ observational_period(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_46]),c_0_43]),c_0_50]),c_0_51]) ).
cnf(c_0_54,negated_conjecture,
slow_change(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_55,negated_conjecture,
observational_period(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_56,negated_conjecture,
~ selection_favors(efficient_producers,first_movers,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : MGT039+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 07:50:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.016 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 58
% 0.22/1.40 # Proof object clause steps : 37
% 0.22/1.40 # Proof object formula steps : 21
% 0.22/1.40 # Proof object conjectures : 7
% 0.22/1.40 # Proof object clause conjectures : 4
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 18
% 0.22/1.40 # Proof object initial formulas used : 11
% 0.22/1.40 # Proof object generating inferences : 15
% 0.22/1.40 # Proof object simplifying inferences : 18
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 12
% 0.22/1.40 # Removed by relevancy pruning/SinE : 0
% 0.22/1.40 # Initial clauses : 19
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 19
% 0.22/1.40 # Processed clauses : 51
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 4
% 0.22/1.40 # ...remaining for further processing : 47
% 0.22/1.40 # Other redundant clauses eliminated : 1
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 4
% 0.22/1.40 # Backward-rewritten : 0
% 0.22/1.40 # Generated clauses : 70
% 0.22/1.40 # ...of the previous two non-trivial : 59
% 0.22/1.40 # Contextual simplify-reflections : 11
% 0.22/1.40 # Paramodulations : 69
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 1
% 0.22/1.40 # Current number of processed clauses : 42
% 0.22/1.40 # Positive orientable unit clauses : 5
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 1
% 0.22/1.40 # Non-unit-clauses : 36
% 0.22/1.40 # Current number of unprocessed clauses: 17
% 0.22/1.40 # ...number of literals in the above : 113
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 4
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 243
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 91
% 0.22/1.40 # Non-unit clause-clause subsumptions : 19
% 0.22/1.40 # Unit Clause-clause subsumption calls : 4
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 4
% 0.22/1.40 # BW rewrite match successes : 0
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 3044
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.019 s
% 0.22/1.40 # System time : 0.001 s
% 0.22/1.40 # Total time : 0.020 s
% 0.22/1.40 # Maximum resident set size: 2780 pages
%------------------------------------------------------------------------------