TSTP Solution File: MGT020+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MGT020+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 22:09:35 EDT 2022
% Result : Theorem 0.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 42 ( 5 unt; 0 def)
% Number of atoms : 138 ( 9 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 162 ( 66 ~; 68 |; 15 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp_times_in_order,axiom,
! [X1,X3,X4] :
( ( environment(X1)
& greater_or_equal(X3,start_time(X1))
& greater(X4,X3)
& in_environment(X1,X4) )
=> in_environment(X1,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_times_in_order) ).
fof(mp_initial_time,axiom,
! [X1] :
( environment(X1)
=> greater_or_equal(initial_FM_EP(X1),start_time(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_initial_time) ).
fof(mp_greater_or_equal,axiom,
! [X5,X6] :
( greater_or_equal(X5,X6)
=> ( greater(X5,X6)
| X5 = X6 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_greater_or_equal) ).
fof(mp_earliest_time_point,axiom,
! [X1,X2] :
( environment(X1)
=> ( ( in_environment(X1,initial_FM_EP(X1))
=> subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1)) )
& ( subpopulations(first_movers,efficient_producers,X1,X2)
=> greater_or_equal(X2,initial_FM_EP(X1)) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_earliest_time_point) ).
fof(mp_positive_function_difference,axiom,
! [X1,X2,X3,X4] :
( ( environment(X1)
& greater_or_equal(X2,X3)
& greater_or_equal(X4,X2)
& subpopulations(first_movers,efficient_producers,X1,X4)
& greater(disbanding_rate(first_movers,X3),disbanding_rate(efficient_producers,X3)) )
=> ( ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
=> greater(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_positive_function_difference) ).
fof(a8,hypothesis,
! [X1] :
( environment(X1)
=> greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',a8) ).
fof(prove_l2,conjecture,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> greater(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_l2) ).
fof(mp_time_point_occurs,axiom,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> in_environment(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_time_point_occurs) ).
fof(l3,axiom,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l3) ).
fof(c_0_9,plain,
! [X5,X6,X7] :
( ~ environment(X5)
| ~ greater_or_equal(X6,start_time(X5))
| ~ greater(X7,X6)
| ~ in_environment(X5,X7)
| in_environment(X5,X6) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_times_in_order])])])]) ).
fof(c_0_10,plain,
! [X2] :
( ~ environment(X2)
| greater_or_equal(initial_FM_EP(X2),start_time(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_initial_time])]) ).
fof(c_0_11,plain,
! [X7,X8] :
( ~ greater_or_equal(X7,X8)
| greater(X7,X8)
| X7 = X8 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_or_equal])]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ( ~ in_environment(X3,initial_FM_EP(X3))
| subpopulations(first_movers,efficient_producers,X3,initial_FM_EP(X3))
| ~ environment(X3) )
& ( ~ subpopulations(first_movers,efficient_producers,X3,X4)
| greater_or_equal(X4,initial_FM_EP(X3))
| ~ environment(X3) ) ),
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_earliest_time_point])])])])]) ).
fof(c_0_13,plain,
! [X5,X6,X7,X8] :
( ~ environment(X5)
| ~ greater_or_equal(X6,X7)
| ~ greater_or_equal(X8,X6)
| ~ subpopulations(first_movers,efficient_producers,X5,X8)
| ~ greater(disbanding_rate(first_movers,X7),disbanding_rate(efficient_producers,X7))
| decreases(difference(disbanding_rate(first_movers,X6),disbanding_rate(efficient_producers,X6)))
| greater(disbanding_rate(first_movers,X8),disbanding_rate(efficient_producers,X8)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[mp_positive_function_difference])])]) ).
fof(c_0_14,hypothesis,
! [X2] :
( ~ environment(X2)
| greater(disbanding_rate(first_movers,initial_FM_EP(X2)),disbanding_rate(efficient_producers,initial_FM_EP(X2))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a8])]) ).
fof(c_0_15,negated_conjecture,
~ ! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> greater(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)) ),
inference(assume_negation,[status(cth)],[prove_l2]) ).
cnf(c_0_16,plain,
( in_environment(X1,X2)
| ~ in_environment(X1,X3)
| ~ greater(X3,X2)
| ~ greater_or_equal(X2,start_time(X1))
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( greater_or_equal(initial_FM_EP(X1),start_time(X1))
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( greater_or_equal(X2,initial_FM_EP(X1))
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_20,plain,
! [X3,X4] :
( ~ environment(X3)
| ~ subpopulations(first_movers,efficient_producers,X3,X4)
| in_environment(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_point_occurs])]) ).
cnf(c_0_21,plain,
( greater(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))
| decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
| ~ greater(disbanding_rate(first_movers,X3),disbanding_rate(efficient_producers,X3))
| ~ subpopulations(first_movers,efficient_producers,X4,X1)
| ~ greater_or_equal(X1,X2)
| ~ greater_or_equal(X2,X3)
| ~ environment(X4) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,hypothesis,
( greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1)))
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_23,negated_conjecture,
( environment(esk1_0)
& subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)
& ~ greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_24,plain,
( in_environment(X1,initial_FM_EP(X1))
| ~ greater(X2,initial_FM_EP(X1))
| ~ in_environment(X1,X2)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_25,plain,
( X1 = initial_FM_EP(X2)
| greater(X1,initial_FM_EP(X2))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,hypothesis,
( greater(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))
| decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
| ~ greater_or_equal(X2,initial_FM_EP(X3))
| ~ greater_or_equal(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X4,X1)
| ~ environment(X4)
| ~ environment(X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
~ greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_31,plain,
! [X3,X4] :
( ~ environment(X3)
| ~ subpopulations(first_movers,efficient_producers,X3,X4)
| ~ decreases(difference(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[l3])])]) ).
cnf(c_0_32,plain,
( X1 = initial_FM_EP(X2)
| in_environment(X2,initial_FM_EP(X2))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_33,negated_conjecture,
( decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))
| ~ greater_or_equal(X1,initial_FM_EP(X2))
| ~ greater_or_equal(esk2_0,X1)
| ~ environment(X2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_34,plain,
( ~ decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_35,plain,
( subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1))
| ~ environment(X1)
| ~ in_environment(X1,initial_FM_EP(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,negated_conjecture,
( initial_FM_EP(esk1_0) = esk2_0
| in_environment(esk1_0,initial_FM_EP(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_28]),c_0_29])]) ).
cnf(c_0_37,negated_conjecture,
( ~ greater_or_equal(esk2_0,X1)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_19]),c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( initial_FM_EP(esk1_0) = esk2_0
| subpopulations(first_movers,efficient_producers,esk1_0,initial_FM_EP(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_29])]) ).
cnf(c_0_39,negated_conjecture,
( initial_FM_EP(esk1_0) = esk2_0
| ~ greater_or_equal(esk2_0,initial_FM_EP(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_29])]) ).
cnf(c_0_40,negated_conjecture,
initial_FM_EP(esk1_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_19]),c_0_28]),c_0_29])]) ).
cnf(c_0_41,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_40]),c_0_29])]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : MGT020+1 : TPTP v8.1.0. Released v2.0.0.
% 0.08/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n020.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 12:31:21 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40 # Preprocessing time : 0.014 s
% 0.23/1.40
% 0.23/1.40 # Failure: Out of unprocessed clauses!
% 0.23/1.40 # OLD status GaveUp
% 0.23/1.40 # Parsed axioms : 11
% 0.23/1.40 # Removed by relevancy pruning/SinE : 4
% 0.23/1.40 # Initial clauses : 10
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 10
% 0.23/1.40 # Processed clauses : 17
% 0.23/1.40 # ...of these trivial : 0
% 0.23/1.40 # ...subsumed : 0
% 0.23/1.40 # ...remaining for further processing : 17
% 0.23/1.40 # Other redundant clauses eliminated : 0
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 0
% 0.23/1.40 # Backward-rewritten : 0
% 0.23/1.40 # Generated clauses : 8
% 0.23/1.40 # ...of the previous two non-trivial : 7
% 0.23/1.40 # Contextual simplify-reflections : 0
% 0.23/1.40 # Paramodulations : 8
% 0.23/1.40 # Factorizations : 0
% 0.23/1.40 # Equation resolutions : 0
% 0.23/1.40 # Current number of processed clauses : 17
% 0.23/1.40 # Positive orientable unit clauses : 2
% 0.23/1.40 # Positive unorientable unit clauses: 0
% 0.23/1.40 # Negative unit clauses : 1
% 0.23/1.40 # Non-unit-clauses : 14
% 0.23/1.40 # Current number of unprocessed clauses: 0
% 0.23/1.40 # ...number of literals in the above : 0
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 0
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 29
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 15
% 0.23/1.40 # Non-unit clause-clause subsumptions : 0
% 0.23/1.40 # Unit Clause-clause subsumption calls : 0
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 0
% 0.23/1.40 # BW rewrite match successes : 0
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 1126
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.015 s
% 0.23/1.40 # System time : 0.000 s
% 0.23/1.40 # Total time : 0.015 s
% 0.23/1.40 # Maximum resident set size: 2784 pages
% 0.23/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.40 # Preprocessing time : 0.015 s
% 0.23/1.40
% 0.23/1.40 # Proof found!
% 0.23/1.40 # SZS status Theorem
% 0.23/1.40 # SZS output start CNFRefutation
% See solution above
% 0.23/1.40 # Proof object total steps : 42
% 0.23/1.40 # Proof object clause steps : 23
% 0.23/1.40 # Proof object formula steps : 19
% 0.23/1.40 # Proof object conjectures : 12
% 0.23/1.40 # Proof object clause conjectures : 9
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 12
% 0.23/1.40 # Proof object initial formulas used : 9
% 0.23/1.40 # Proof object generating inferences : 11
% 0.23/1.40 # Proof object simplifying inferences : 17
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 11
% 0.23/1.40 # Removed by relevancy pruning/SinE : 0
% 0.23/1.40 # Initial clauses : 14
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 14
% 0.23/1.40 # Processed clauses : 70
% 0.23/1.40 # ...of these trivial : 0
% 0.23/1.40 # ...subsumed : 9
% 0.23/1.40 # ...remaining for further processing : 61
% 0.23/1.40 # Other redundant clauses eliminated : 0
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 23
% 0.23/1.40 # Backward-rewritten : 6
% 0.23/1.40 # Generated clauses : 92
% 0.23/1.40 # ...of the previous two non-trivial : 78
% 0.23/1.40 # Contextual simplify-reflections : 10
% 0.23/1.40 # Paramodulations : 92
% 0.23/1.40 # Factorizations : 0
% 0.23/1.40 # Equation resolutions : 0
% 0.23/1.40 # Current number of processed clauses : 32
% 0.23/1.40 # Positive orientable unit clauses : 3
% 0.23/1.40 # Positive unorientable unit clauses: 0
% 0.23/1.40 # Negative unit clauses : 3
% 0.23/1.40 # Non-unit-clauses : 26
% 0.23/1.40 # Current number of unprocessed clauses: 3
% 0.23/1.40 # ...number of literals in the above : 8
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 29
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 404
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 166
% 0.23/1.40 # Non-unit clause-clause subsumptions : 38
% 0.23/1.40 # Unit Clause-clause subsumption calls : 37
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 1
% 0.23/1.40 # BW rewrite match successes : 1
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 3731
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.018 s
% 0.23/1.40 # System time : 0.002 s
% 0.23/1.40 # Total time : 0.020 s
% 0.23/1.40 # Maximum resident set size: 2788 pages
%------------------------------------------------------------------------------