TSTP Solution File: MGT022+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MGT022+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 22:09:35 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 8 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 84 ( 33 ~; 28 |; 13 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_l4,conjecture,
! [X2,X5] :
( ( environment(X2)
& subpopulations(first_movers,efficient_producers,X2,X5) )
=> ( ( decreases(resources(X2,X5))
=> increases(difference(disbanding_rate(first_movers,X5),disbanding_rate(efficient_producers,X5))) )
& ( constant(resources(X2,X5))
=> ~ decreases(difference(disbanding_rate(first_movers,X5),disbanding_rate(efficient_producers,X5))) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_l4) ).
fof(a5,hypothesis,
! [X2,X3,X4,X5] :
( ( environment(X2)
& subpopulations(X3,X4,X2,X5)
& greater(resilience(X4),resilience(X3)) )
=> ( ( decreases(resources(X2,X5))
=> increases(difference(disbanding_rate(X3,X5),disbanding_rate(X4,X5))) )
& ( constant(resources(X2,X5))
=> constant(difference(disbanding_rate(X3,X5),disbanding_rate(X4,X5))) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',a5) ).
fof(mp_constant_not_decrease,axiom,
! [X1] :
( constant(X1)
=> ~ decreases(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_constant_not_decrease) ).
fof(a2,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',a2) ).
fof(c_0_4,negated_conjecture,
~ ! [X2,X5] :
( ( environment(X2)
& subpopulations(first_movers,efficient_producers,X2,X5) )
=> ( ( decreases(resources(X2,X5))
=> increases(difference(disbanding_rate(first_movers,X5),disbanding_rate(efficient_producers,X5))) )
& ( constant(resources(X2,X5))
=> ~ decreases(difference(disbanding_rate(first_movers,X5),disbanding_rate(efficient_producers,X5))) ) ) ),
inference(assume_negation,[status(cth)],[prove_l4]) ).
fof(c_0_5,hypothesis,
! [X6,X7,X8,X9] :
( ( ~ decreases(resources(X6,X9))
| increases(difference(disbanding_rate(X7,X9),disbanding_rate(X8,X9)))
| ~ environment(X6)
| ~ subpopulations(X7,X8,X6,X9)
| ~ greater(resilience(X8),resilience(X7)) )
& ( ~ constant(resources(X6,X9))
| constant(difference(disbanding_rate(X7,X9),disbanding_rate(X8,X9)))
| ~ environment(X6)
| ~ subpopulations(X7,X8,X6,X9)
| ~ greater(resilience(X8),resilience(X7)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a5])])]) ).
fof(c_0_6,negated_conjecture,
( environment(esk1_0)
& subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)
& ( constant(resources(esk1_0,esk2_0))
| decreases(resources(esk1_0,esk2_0)) )
& ( decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))
| decreases(resources(esk1_0,esk2_0)) )
& ( constant(resources(esk1_0,esk2_0))
| ~ increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))) )
& ( decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))
| ~ increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])])])])]) ).
fof(c_0_7,plain,
! [X2] :
( ~ constant(X2)
| ~ decreases(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[mp_constant_not_decrease])])]) ).
cnf(c_0_8,hypothesis,
( constant(difference(disbanding_rate(X2,X4),disbanding_rate(X1,X4)))
| ~ greater(resilience(X1),resilience(X2))
| ~ subpopulations(X2,X1,X3,X4)
| ~ environment(X3)
| ~ constant(resources(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
inference(split_conjunct,[status(thm)],[a2]) ).
cnf(c_0_11,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,hypothesis,
( increases(difference(disbanding_rate(X2,X4),disbanding_rate(X1,X4)))
| ~ greater(resilience(X1),resilience(X2))
| ~ subpopulations(X2,X1,X3,X4)
| ~ environment(X3)
| ~ decreases(resources(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( ~ decreases(X1)
| ~ constant(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
( constant(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))
| ~ constant(resources(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_15,negated_conjecture,
( constant(resources(esk1_0,esk2_0))
| ~ increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
( increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))
| ~ decreases(resources(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_17,negated_conjecture,
( decreases(resources(esk1_0,esk2_0))
| constant(resources(esk1_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
( ~ decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))
| ~ constant(resources(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
constant(resources(esk1_0,esk2_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( decreases(resources(esk1_0,esk2_0))
| decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_21,negated_conjecture,
~ decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
~ decreases(resources(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : MGT022+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n022.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 : 600
% 0.13/0.34 % DateTime : Thu Jun 9 11:30:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.014 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 24
% 0.23/1.42 # Proof object clause steps : 16
% 0.23/1.42 # Proof object formula steps : 8
% 0.23/1.42 # Proof object conjectures : 15
% 0.23/1.42 # Proof object clause conjectures : 12
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 9
% 0.23/1.42 # Proof object initial formulas used : 4
% 0.23/1.42 # Proof object generating inferences : 5
% 0.23/1.42 # Proof object simplifying inferences : 11
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 4
% 0.23/1.42 # Removed by relevancy pruning/SinE : 0
% 0.23/1.42 # Initial clauses : 10
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 10
% 0.23/1.42 # Processed clauses : 17
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 0
% 0.23/1.42 # ...remaining for further processing : 16
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 1
% 0.23/1.42 # Backward-rewritten : 3
% 0.23/1.42 # Generated clauses : 9
% 0.23/1.42 # ...of the previous two non-trivial : 10
% 0.23/1.42 # Contextual simplify-reflections : 1
% 0.23/1.42 # Paramodulations : 8
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 11
% 0.23/1.42 # Positive orientable unit clauses : 4
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 2
% 0.23/1.42 # Non-unit-clauses : 5
% 0.23/1.42 # Current number of unprocessed clauses: 2
% 0.23/1.42 # ...number of literals in the above : 3
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 5
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 8
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 3
% 0.23/1.42 # Non-unit clause-clause subsumptions : 1
% 0.23/1.42 # Unit Clause-clause subsumption calls : 4
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 1
% 0.23/1.42 # BW rewrite match successes : 1
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 801
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.012 s
% 0.23/1.42 # System time : 0.003 s
% 0.23/1.42 # Total time : 0.015 s
% 0.23/1.42 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------