TSTP Solution File: MGT035+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT035+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n032.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:32 EDT 2022
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : MGT035+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.09 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 600
% 0.08/0.27 % DateTime : Thu Jun 9 11:06:52 EDT 2022
% 0.08/0.28 % CPUTime :
% 0.08/0.30 # No SInE strategy applied
% 0.08/0.30 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.08/0.30 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.08/0.30 #
% 0.08/0.30 # Presaturation interreduction done
% 0.08/0.30 # Number of axioms: 25 Number of unprocessed: 25
% 0.08/0.30 # Tableaux proof search.
% 0.08/0.30 # APR header successfully linked.
% 0.08/0.30 # Hello from C++
% 0.08/0.31 # The folding up rule is enabled...
% 0.08/0.31 # Local unification is enabled...
% 0.08/0.31 # Any saturation attempts will use folding labels...
% 0.08/0.31 # 25 beginning clauses after preprocessing and clausification
% 0.08/0.31 # Creating start rules for all 5 conjectures.
% 0.08/0.31 # There are 5 start rule candidates:
% 0.08/0.31 # Found 3 unit axioms.
% 0.08/0.31 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.08/0.31 # 5 start rule tableaux created.
% 0.08/0.31 # 22 extension rule candidate clauses
% 0.08/0.31 # 3 unit axiom clauses
% 0.08/0.31
% 0.08/0.31 # Requested 8, 32 cores available to the main process.
% 0.08/0.31 # There are not enough tableaux to fork, creating more from the initial 5
% 0.08/0.31 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux.
% 0.08/0.31 # We now have 14 tableaux to operate on
% 0.12/0.32 # Creating equality axioms
% 0.12/0.32 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.33 # Creating equality axioms
% 0.12/0.33 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.33 # Creating equality axioms
% 0.12/0.33 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.37 # There were 6 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 6 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 6 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_25, negated_conjecture, (environment(esk3_0))).
% 0.12/0.37 cnf(i_0_24, negated_conjecture, (stable(esk3_0))).
% 0.12/0.37 cnf(i_0_3, plain, (greater_or_equal(X1,X1))).
% 0.12/0.37 cnf(i_0_21, negated_conjecture, (~outcompetes(efficient_producers,first_movers,esk4_1(X1))|~in_environment(esk3_0,X1))).
% 0.12/0.37 cnf(i_0_23, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk3_0,esk4_1(X1))|~in_environment(esk3_0,X1))).
% 0.12/0.37 cnf(i_0_22, negated_conjecture, (greater_or_equal(esk4_1(X1),X1)|~in_environment(esk3_0,X1))).
% 0.12/0.37 cnf(i_0_4, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 0.12/0.37 cnf(i_0_18, hypothesis, (in_environment(X1,esk1_1(X1))|~stable(X1)|~environment(X1))).
% 0.12/0.37 cnf(i_0_20, hypothesis, (in_environment(X1,esk2_1(X1))|~stable(X1)|~environment(X1))).
% 0.12/0.37 cnf(i_0_5, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.12/0.37 cnf(i_0_19, hypothesis, (greater_or_equal(esk2_1(X1),equilibrium(X1))|~stable(X1)|~environment(X1))).
% 0.12/0.37 cnf(i_0_1, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.12/0.37 cnf(i_0_7, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))).
% 0.12/0.37 cnf(i_0_17, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~stable(X2)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,esk1_1(X2)))).
% 0.12/0.37 cnf(i_0_6, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))).
% 0.12/0.37 cnf(i_0_2, plain, (X1=X2|greater(X1,X2)|greater(X2,X1)|~in_environment(X3,X2)|~in_environment(X3,X1))).
% 0.12/0.37 cnf(i_0_8, hypothesis, (outcompetes(X1,X2,X3)|~subpopulations(X2,X1,X4,X3)|~environment(X4)|~greater_or_equal(growth_rate(X1,X3),zero)|~greater(zero,growth_rate(X2,X3)))).
% 0.12/0.37 cnf(i_0_13, hypothesis, (growth_rate(first_movers,X1)=zero|greater(zero,growth_rate(efficient_producers,X1))|greater(zero,growth_rate(first_movers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))).
% 0.12/0.37 cnf(i_0_9, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(zero,growth_rate(efficient_producers,X1))|greater(zero,growth_rate(first_movers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))).
% 0.12/0.37 cnf(i_0_15, hypothesis, (growth_rate(first_movers,X1)=zero|greater(growth_rate(first_movers,X1),zero)|greater(zero,growth_rate(first_movers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))).
% 0.12/0.37 cnf(i_0_14, hypothesis, (growth_rate(first_movers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(zero,growth_rate(efficient_producers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))).
% 0.12/0.37 cnf(i_0_11, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(growth_rate(first_movers,X1),zero)|greater(zero,growth_rate(first_movers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))).
% 0.12/0.37 cnf(i_0_10, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(zero,growth_rate(efficient_producers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))).
% 0.12/0.37 cnf(i_0_16, hypothesis, (growth_rate(first_movers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(growth_rate(first_movers,X1),zero)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))).
% 0.12/0.37 cnf(i_0_12, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(growth_rate(first_movers,X1),zero)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))).
% 0.12/0.37 cnf(i_0_317, plain, (X33=X33)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 18 steps
% 0.12/0.37 cnf(i_0_317, plain, (esk2_1(esk3_0)=esk2_1(esk3_0)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_427, plain, (esk2_1(esk3_0)=esk2_1(esk3_0)), inference(extension_rule, [i_0_321])).
% 0.12/0.37 cnf(i_0_531, plain, ($false), inference(closure_rule, [i_0_317])).
% 0.12/0.37 cnf(i_0_529, plain, (greater(esk2_1(esk3_0),esk1_1(esk3_0))), inference(extension_rule, [i_0_4])).
% 0.12/0.37 cnf(i_0_533, plain, (greater_or_equal(esk2_1(esk3_0),esk1_1(esk3_0))), inference(extension_rule, [i_0_17])).
% 0.12/0.37 cnf(i_0_555, plain, (~stable(esk3_0)), inference(closure_rule, [i_0_24])).
% 0.12/0.37 cnf(i_0_557, plain, (~environment(esk3_0)), inference(closure_rule, [i_0_25])).
% 0.12/0.37 cnf(i_0_532, plain, (~greater(esk2_1(esk3_0),esk1_1(esk3_0))), inference(extension_rule, [i_0_2])).
% 0.12/0.37 cnf(i_0_2384, plain, (esk2_1(esk3_0)=esk1_1(esk3_0)), inference(extension_rule, [i_0_324])).
% 0.12/0.37 cnf(i_0_2387, plain, (~in_environment(esk3_0,esk2_1(esk3_0))), inference(extension_rule, [i_0_20])).
% 0.12/0.37 cnf(i_0_2472, plain, (~stable(esk3_0)), inference(closure_rule, [i_0_24])).
% 0.12/0.37 cnf(i_0_2473, plain, (~environment(esk3_0)), inference(closure_rule, [i_0_25])).
% 0.12/0.37 cnf(i_0_554, plain, (greater(growth_rate(efficient_producers,esk2_1(esk3_0)),growth_rate(first_movers,esk2_1(esk3_0)))), inference(etableau_closure_rule, [i_0_554, ...])).
% 0.12/0.37 cnf(i_0_556, plain, (~subpopulations(first_movers,efficient_producers,esk3_0,esk2_1(esk3_0))), inference(etableau_closure_rule, [i_0_556, ...])).
% 0.12/0.37 cnf(i_0_2388, plain, (~in_environment(esk3_0,esk1_1(esk3_0))), inference(etableau_closure_rule, [i_0_2388, ...])).
% 0.12/0.37 cnf(i_0_2385, plain, (greater(esk1_1(esk3_0),esk2_1(esk3_0))), inference(etableau_closure_rule, [i_0_2385, ...])).
% 0.12/0.37 cnf(i_0_2468, plain, (environment(esk2_1(esk3_0))), inference(etableau_closure_rule, [i_0_2468, ...])).
% 0.12/0.37 cnf(i_0_2470, plain, (~environment(esk1_1(esk3_0))), inference(etableau_closure_rule, [i_0_2470, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Child (2708) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------