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