TSTP Solution File: MGT036+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT036+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 : n025.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:33 EDT 2022
% Result : Theorem 0.14s 0.38s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT036+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 9 09:54:05 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.38 # No SInE strategy applied
% 0.14/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.38 #
% 0.14/0.38 # Presaturation interreduction done
% 0.14/0.38 # Number of axioms: 14 Number of unprocessed: 14
% 0.14/0.38 # Tableaux proof search.
% 0.14/0.38 # APR header successfully linked.
% 0.14/0.38 # Hello from C++
% 0.14/0.38 # The folding up rule is enabled...
% 0.14/0.38 # Local unification is enabled...
% 0.14/0.38 # Any saturation attempts will use folding labels...
% 0.14/0.38 # 14 beginning clauses after preprocessing and clausification
% 0.14/0.38 # Creating start rules for all 3 conjectures.
% 0.14/0.38 # There are 3 start rule candidates:
% 0.14/0.38 # Found 4 unit axioms.
% 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.38 # 3 start rule tableaux created.
% 0.14/0.38 # 10 extension rule candidate clauses
% 0.14/0.38 # 4 unit axiom clauses
% 0.14/0.38
% 0.14/0.38 # Requested 8, 32 cores available to the main process.
% 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 3
% 0.14/0.38 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.38 # We now have 12 tableaux to operate on
% 0.14/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.38 # There were 2 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 2 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 2 successful branch saturations after the branch.
% 0.14/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_14, negated_conjecture, (environment(esk1_0))).
% 0.14/0.38 cnf(i_0_12, negated_conjecture, (outcompetes(first_movers,efficient_producers,esk2_0))).
% 0.14/0.38 cnf(i_0_13, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))).
% 0.14/0.38 cnf(i_0_11, hypothesis, (greater(resilience(efficient_producers),resilience(first_movers)))).
% 0.14/0.38 cnf(i_0_1, plain, (subpopulations(efficient_producers,first_movers,X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))).
% 0.14/0.38 cnf(i_0_6, plain, (environment(X1)|~greater(zero,growth_rate(X2,X3)))).
% 0.14/0.38 cnf(i_0_2, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))).
% 0.14/0.38 cnf(i_0_4, plain, (~greater(zero,growth_rate(X1,X2))|~greater_or_equal(growth_rate(X1,X2),zero))).
% 0.14/0.38 cnf(i_0_5, plain, (subpopulations(X1,X2,X3,X4)|~greater(zero,growth_rate(X1,X4)))).
% 0.14/0.38 cnf(i_0_7, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))).
% 0.14/0.38 cnf(i_0_8, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))).
% 0.14/0.38 cnf(i_0_3, plain, (greater(zero,growth_rate(X1,X2))|greater_or_equal(growth_rate(X1,X2),zero)|~subpopulations(X1,X3,X4,X2)|~environment(X4))).
% 0.14/0.38 cnf(i_0_9, hypothesis, (outcompetes(X1,X2,X3)|~greater(zero,growth_rate(X2,X3))|~greater_or_equal(growth_rate(X1,X3),zero))).
% 0.14/0.38 cnf(i_0_10, hypothesis, (greater(zero,growth_rate(X1,X2))|~greater(zero,growth_rate(X3,X2))|~greater(resilience(X3),resilience(X1))|~in_environment(X4,X2))).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 6 steps
% 0.14/0.38 cnf(i_0_12, negated_conjecture, (outcompetes(first_movers,efficient_producers,esk2_0)), inference(start_rule)).
% 0.14/0.38 cnf(i_0_16, plain, (outcompetes(first_movers,efficient_producers,esk2_0)), inference(extension_rule, [i_0_7])).
% 0.14/0.38 cnf(i_0_64, plain, (~environment(esk1_0)), inference(closure_rule, [i_0_14])).
% 0.14/0.38 cnf(i_0_61, plain, (greater(zero,growth_rate(efficient_producers,esk2_0))), inference(extension_rule, [i_0_6])).
% 0.14/0.38 cnf(i_0_63, plain, (~subpopulations(efficient_producers,first_movers,esk1_0,esk2_0)), inference(etableau_closure_rule, [i_0_63, ...])).
% 0.14/0.38 cnf(i_0_114, plain, (environment(X4)), inference(etableau_closure_rule, [i_0_114, ...])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # There were 2 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 2 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 2 successful branch saturations after the branch.
% 0.14/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_14, negated_conjecture, (environment(esk1_0))).
% 0.14/0.38 cnf(i_0_12, negated_conjecture, (outcompetes(first_movers,efficient_producers,esk2_0))).
% 0.14/0.38 cnf(i_0_13, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))).
% 0.14/0.38 cnf(i_0_11, hypothesis, (greater(resilience(efficient_producers),resilience(first_movers)))).
% 0.14/0.38 cnf(i_0_1, plain, (subpopulations(efficient_producers,first_movers,X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))).
% 0.14/0.38 cnf(i_0_6, plain, (environment(X1)|~greater(zero,growth_rate(X2,X3)))).
% 0.14/0.38 cnf(i_0_2, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))).
% 0.14/0.38 cnf(i_0_4, plain, (~greater(zero,growth_rate(X1,X2))|~greater_or_equal(growth_rate(X1,X2),zero))).
% 0.14/0.38 cnf(i_0_5, plain, (subpopulations(X1,X2,X3,X4)|~greater(zero,growth_rate(X1,X4)))).
% 0.14/0.38 cnf(i_0_7, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))).
% 0.14/0.38 cnf(i_0_8, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))).
% 0.14/0.38 cnf(i_0_3, plain, (greater(zero,growth_rate(X1,X2))|greater_or_equal(growth_rate(X1,X2),zero)|~subpopulations(X1,X3,X4,X2)|~environment(X4))).
% 0.14/0.38 cnf(i_0_9, hypothesis, (outcompetes(X1,X2,X3)|~greater(zero,growth_rate(X2,X3))|~greater_or_equal(growth_rate(X1,X3),zero))).
% 0.14/0.38 cnf(i_0_10, hypothesis, (greater(zero,growth_rate(X1,X2))|~greater(zero,growth_rate(X3,X2))|~greater(resilience(X3),resilience(X1))|~in_environment(X4,X2))).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 7 steps
% 0.14/0.38 cnf(i_0_14, negated_conjecture, (environment(esk1_0)), inference(start_rule)).
% 0.14/0.38 cnf(i_0_17, plain, (environment(esk1_0)), inference(extension_rule, [i_0_2])).
% 0.14/0.38 cnf(i_0_86, plain, (~subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(closure_rule, [i_0_13])).
% 0.14/0.38 cnf(i_0_85, plain, (in_environment(esk1_0,esk2_0)), inference(extension_rule, [i_0_10])).
% 0.14/0.38 cnf(i_0_140, plain, (~greater(resilience(efficient_producers),resilience(first_movers))), inference(closure_rule, [i_0_11])).
% 0.14/0.38 cnf(i_0_138, plain, (greater(zero,growth_rate(first_movers,esk2_0))), inference(etableau_closure_rule, [i_0_138, ...])).
% 0.14/0.38 cnf(i_0_139, plain, (~greater(zero,growth_rate(efficient_producers,esk2_0))), inference(etableau_closure_rule, [i_0_139, ...])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # There were 2 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 2 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 2 successful branch saturations after the branch.
% 0.14/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_14, negated_conjecture, (environment(esk1_0))).
% 0.14/0.38 cnf(i_0_12, negated_conjecture, (outcompetes(first_movers,efficient_producers,esk2_0))).
% 0.14/0.38 cnf(i_0_13, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))).
% 0.14/0.38 cnf(i_0_11, hypothesis, (greater(resilience(efficient_producers),resilience(first_movers)))).
% 0.14/0.38 cnf(i_0_1, plain, (subpopulations(efficient_producers,first_movers,X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))).
% 0.14/0.38 cnf(i_0_6, plain, (environment(X1)|~greater(zero,growth_rate(X2,X3)))).
% 0.14/0.38 cnf(i_0_2, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))).
% 0.14/0.38 cnf(i_0_4, plain, (~greater(zero,growth_rate(X1,X2))|~greater_or_equal(growth_rate(X1,X2),zero))).
% 0.14/0.38 cnf(i_0_5, plain, (subpopulations(X1,X2,X3,X4)|~greater(zero,growth_rate(X1,X4)))).
% 0.14/0.38 cnf(i_0_7, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))).
% 0.14/0.38 cnf(i_0_8, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))).
% 0.14/0.38 cnf(i_0_3, plain, (greater(zero,growth_rate(X1,X2))|greater_or_equal(growth_rate(X1,X2),zero)|~subpopulations(X1,X3,X4,X2)|~environment(X4))).
% 0.14/0.38 cnf(i_0_9, hypothesis, (outcompetes(X1,X2,X3)|~greater(zero,growth_rate(X2,X3))|~greater_or_equal(growth_rate(X1,X3),zero))).
% 0.14/0.38 cnf(i_0_10, hypothesis, (greater(zero,growth_rate(X1,X2))|~greater(zero,growth_rate(X3,X2))|~greater(resilience(X3),resilience(X1))|~in_environment(X4,X2))).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 6 steps
% 0.14/0.38 cnf(i_0_14, negated_conjecture, (environment(esk1_0)), inference(start_rule)).
% 0.14/0.38 cnf(i_0_17, plain, (environment(esk1_0)), inference(extension_rule, [i_0_8])).
% 0.14/0.38 cnf(i_0_97, plain, (~outcompetes(first_movers,efficient_producers,esk2_0)), inference(closure_rule, [i_0_12])).
% 0.14/0.38 cnf(i_0_96, plain, (greater_or_equal(growth_rate(first_movers,esk2_0),zero)), inference(extension_rule, [i_0_4])).
% 0.14/0.38 cnf(i_0_98, plain, (~subpopulations(efficient_producers,first_movers,esk1_0,esk2_0)), inference(etableau_closure_rule, [i_0_98, ...])).
% 0.14/0.38 cnf(i_0_119, plain, (~greater(zero,growth_rate(first_movers,esk2_0))), inference(etableau_closure_rule, [i_0_119, ...])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # Child (1440) has found a proof.
% 0.14/0.38
% 0.14/0.38 # Proof search is over...
% 0.14/0.38 # Freeing feature tree
%------------------------------------------------------------------------------