TSTP Solution File: MGT021+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MGT021+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 6 unt; 0 def)
% Number of atoms : 100 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 121 ( 51 ~; 46 |; 13 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(a3,hypothesis,
! [X1,X2] :
( ( environment(X1)
& in_environment(X1,X2)
& greater(number_of_organizations(X1,X2),zero) )
=> ( ( greater(equilibrium(X1),X2)
=> decreases(resources(X1,X2)) )
& ( ~ greater(equilibrium(X1),X2)
=> constant(resources(X1,X2)) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',a3) ).
fof(mp_environment_not_empty,axiom,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> greater(number_of_organizations(X1,X2),zero) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_environment_not_empty) ).
fof(mp_time_point_in_environment,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_in_environment) ).
fof(prove_l3,conjecture,
! [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',prove_l3) ).
fof(l4,hypothesis,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> ( ( decreases(resources(X1,X2))
=> increases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) )
& ( constant(resources(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',l4) ).
fof(mp_increase_not_decrease,axiom,
! [X3] :
( increases(X3)
=> ~ decreases(X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_increase_not_decrease) ).
fof(c_0_6,hypothesis,
! [X3,X4] :
( ( ~ greater(equilibrium(X3),X4)
| decreases(resources(X3,X4))
| ~ environment(X3)
| ~ in_environment(X3,X4)
| ~ greater(number_of_organizations(X3,X4),zero) )
& ( greater(equilibrium(X3),X4)
| constant(resources(X3,X4))
| ~ environment(X3)
| ~ in_environment(X3,X4)
| ~ greater(number_of_organizations(X3,X4),zero) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[a3])])])]) ).
fof(c_0_7,plain,
! [X3,X4] :
( ~ environment(X3)
| ~ subpopulations(first_movers,efficient_producers,X3,X4)
| greater(number_of_organizations(X3,X4),zero) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_environment_not_empty])]) ).
fof(c_0_8,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_in_environment])]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
inference(assume_negation,[status(cth)],[prove_l3]) ).
cnf(c_0_10,hypothesis,
( constant(resources(X1,X2))
| greater(equilibrium(X1),X2)
| ~ greater(number_of_organizations(X1,X2),zero)
| ~ in_environment(X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( greater(number_of_organizations(X1,X2),zero)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,negated_conjecture,
( environment(esk1_0)
& subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)
& decreases(difference(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)],[inference(fof_simplification,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_14,hypothesis,
( decreases(resources(X1,X2))
| ~ greater(number_of_organizations(X1,X2),zero)
| ~ in_environment(X1,X2)
| ~ environment(X1)
| ~ greater(equilibrium(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,hypothesis,
( constant(resources(X1,X2))
| greater(equilibrium(X1),X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_16,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,hypothesis,
! [X3,X4] :
( ( ~ decreases(resources(X3,X4))
| increases(difference(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4)))
| ~ environment(X3)
| ~ subpopulations(first_movers,efficient_producers,X3,X4) )
& ( ~ constant(resources(X3,X4))
| ~ decreases(difference(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4)))
| ~ environment(X3)
| ~ subpopulations(first_movers,efficient_producers,X3,X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[l4])])])]) ).
cnf(c_0_19,hypothesis,
( decreases(resources(X1,X2))
| ~ greater(equilibrium(X1),X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_11]),c_0_12]) ).
cnf(c_0_20,negated_conjecture,
( constant(resources(esk1_0,esk2_0))
| greater(equilibrium(esk1_0),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_21,hypothesis,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
| ~ constant(resources(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,hypothesis,
( constant(resources(esk1_0,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_19,c_0_20]),c_0_16]),c_0_17])]) ).
cnf(c_0_23,negated_conjecture,
decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_24,plain,
! [X4] :
( ~ increases(X4)
| ~ decreases(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[mp_increase_not_decrease])])]) ).
cnf(c_0_25,hypothesis,
( increases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| ~ decreases(resources(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,hypothesis,
decreases(resources(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_16]),c_0_17])]) ).
cnf(c_0_27,plain,
( ~ decreases(X1)
| ~ increases(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,hypothesis,
increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_16]),c_0_17])]) ).
cnf(c_0_29,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT021+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n029.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 10:21:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.015 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 30
% 0.24/1.41 # Proof object clause steps : 17
% 0.24/1.41 # Proof object formula steps : 13
% 0.24/1.41 # Proof object conjectures : 7
% 0.24/1.41 # Proof object clause conjectures : 4
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 10
% 0.24/1.41 # Proof object initial formulas used : 6
% 0.24/1.41 # Proof object generating inferences : 7
% 0.24/1.41 # Proof object simplifying inferences : 16
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 7
% 0.24/1.41 # Removed by relevancy pruning/SinE : 1
% 0.24/1.41 # Initial clauses : 10
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 10
% 0.24/1.41 # Processed clauses : 16
% 0.24/1.41 # ...of these trivial : 0
% 0.24/1.41 # ...subsumed : 0
% 0.24/1.41 # ...remaining for further processing : 16
% 0.24/1.41 # Other redundant clauses eliminated : 0
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 1
% 0.24/1.41 # Generated clauses : 7
% 0.24/1.41 # ...of the previous two non-trivial : 6
% 0.24/1.41 # Contextual simplify-reflections : 2
% 0.24/1.41 # Paramodulations : 7
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 0
% 0.24/1.41 # Current number of processed clauses : 15
% 0.24/1.41 # Positive orientable unit clauses : 5
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 0
% 0.24/1.41 # Non-unit-clauses : 10
% 0.24/1.41 # Current number of unprocessed clauses: 0
% 0.24/1.41 # ...number of literals in the above : 0
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 1
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 27
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 11
% 0.24/1.41 # Non-unit clause-clause subsumptions : 2
% 0.24/1.41 # Unit Clause-clause subsumption calls : 0
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 2
% 0.24/1.41 # BW rewrite match successes : 1
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 1046
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.014 s
% 0.24/1.41 # System time : 0.002 s
% 0.24/1.41 # Total time : 0.016 s
% 0.24/1.41 # Maximum resident set size: 2656 pages
%------------------------------------------------------------------------------