TSTP Solution File: MGT032+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT032+2 : 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 : 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:10:30 EDT 2022
% Result : Theorem 0.20s 0.37s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT032+2 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 12:11:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.36 # No SInE strategy applied
% 0.20/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.36 #
% 0.20/0.36 # Presaturation interreduction done
% 0.20/0.36 # Number of axioms: 8 Number of unprocessed: 8
% 0.20/0.36 # Tableaux proof search.
% 0.20/0.36 # APR header successfully linked.
% 0.20/0.36 # Hello from C++
% 0.20/0.37 # The folding up rule is enabled...
% 0.20/0.37 # Local unification is enabled...
% 0.20/0.37 # Any saturation attempts will use folding labels...
% 0.20/0.37 # 8 beginning clauses after preprocessing and clausification
% 0.20/0.37 # Creating start rules for all 5 conjectures.
% 0.20/0.37 # There are 5 start rule candidates:
% 0.20/0.37 # Found 2 unit axioms.
% 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.37 # 5 start rule tableaux created.
% 0.20/0.37 # 6 extension rule candidate clauses
% 0.20/0.37 # 2 unit axiom clauses
% 0.20/0.37
% 0.20/0.37 # Requested 8, 32 cores available to the main process.
% 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 5
% 0.20/0.37 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.37 # We now have 10 tableaux to operate on
% 0.20/0.37 # There were 1 total branch saturation attempts.
% 0.20/0.37 # There were 0 of these attempts blocked.
% 0.20/0.37 # There were 0 deferred branch saturation attempts.
% 0.20/0.37 # There were 0 free duplicated saturations.
% 0.20/0.37 # There were 1 total successful branch saturations.
% 0.20/0.37 # There were 0 successful branch saturations in interreduction.
% 0.20/0.37 # There were 0 successful branch saturations on the branch.
% 0.20/0.37 # There were 1 successful branch saturations after the branch.
% 0.20/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.37 # Begin clausification derivation
% 0.20/0.37
% 0.20/0.37 # End clausification derivation
% 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.37 cnf(i_0_8, negated_conjecture, (environment(esk2_0))).
% 0.20/0.37 cnf(i_0_7, negated_conjecture, (stable(esk2_0))).
% 0.20/0.37 cnf(i_0_4, negated_conjecture, (~in_environment(esk2_0,X1)|~selection_favors(efficient_producers,first_movers,esk3_1(X1)))).
% 0.20/0.37 cnf(i_0_6, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk2_0,esk3_1(X1))|~in_environment(esk2_0,X1))).
% 0.20/0.37 cnf(i_0_5, negated_conjecture, (greater_or_equal(esk3_1(X1),X1)|~in_environment(esk2_0,X1))).
% 0.20/0.37 cnf(i_0_3, hypothesis, (in_environment(X1,esk1_1(X1))|~stable(X1)|~environment(X1))).
% 0.20/0.37 cnf(i_0_2, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~greater_or_equal(X1,esk1_1(X2))|~stable(X2)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))).
% 0.20/0.37 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.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.37 # Begin printing tableau
% 0.20/0.37 # Found 5 steps
% 0.20/0.37 cnf(i_0_8, negated_conjecture, (environment(esk2_0)), inference(start_rule)).
% 0.20/0.37 cnf(i_0_16, plain, (environment(esk2_0)), inference(extension_rule, [i_0_3])).
% 0.20/0.37 cnf(i_0_144, plain, (~stable(esk2_0)), inference(closure_rule, [i_0_7])).
% 0.20/0.37 cnf(i_0_143, plain, (in_environment(esk2_0,esk1_1(esk2_0))), inference(extension_rule, [i_0_5])).
% 0.20/0.37 cnf(i_0_155, plain, (greater_or_equal(esk3_1(esk1_1(esk2_0)),esk1_1(esk2_0))), inference(etableau_closure_rule, [i_0_155, ...])).
% 0.20/0.37 # End printing tableau
% 0.20/0.37 # SZS output end
% 0.20/0.37 # Branches closed with saturation will be marked with an "s"
% 0.20/0.37 # There were 1 total branch saturation attempts.
% 0.20/0.37 # There were 0 of these attempts blocked.
% 0.20/0.37 # There were 0 deferred branch saturation attempts.
% 0.20/0.37 # There were 0 free duplicated saturations.
% 0.20/0.37 # There were 1 total successful branch saturations.
% 0.20/0.37 # There were 0 successful branch saturations in interreduction.
% 0.20/0.37 # There were 0 successful branch saturations on the branch.
% 0.20/0.37 # There were 1 successful branch saturations after the branch.
% 0.20/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.37 # Begin clausification derivation
% 0.20/0.37
% 0.20/0.37 # End clausification derivation
% 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.37 cnf(i_0_8, negated_conjecture, (environment(esk2_0))).
% 0.20/0.37 cnf(i_0_7, negated_conjecture, (stable(esk2_0))).
% 0.20/0.37 cnf(i_0_4, negated_conjecture, (~in_environment(esk2_0,X1)|~selection_favors(efficient_producers,first_movers,esk3_1(X1)))).
% 0.20/0.37 cnf(i_0_6, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk2_0,esk3_1(X1))|~in_environment(esk2_0,X1))).
% 0.20/0.37 cnf(i_0_5, negated_conjecture, (greater_or_equal(esk3_1(X1),X1)|~in_environment(esk2_0,X1))).
% 0.20/0.37 cnf(i_0_3, hypothesis, (in_environment(X1,esk1_1(X1))|~stable(X1)|~environment(X1))).
% 0.20/0.37 cnf(i_0_2, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~greater_or_equal(X1,esk1_1(X2))|~stable(X2)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))).
% 0.20/0.37 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.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.37 # Begin printing tableau
% 0.20/0.37 # Found 5 steps
% 0.20/0.37 cnf(i_0_7, negated_conjecture, (stable(esk2_0)), inference(start_rule)).
% 0.20/0.37 cnf(i_0_15, plain, (stable(esk2_0)), inference(extension_rule, [i_0_3])).
% 0.20/0.37 cnf(i_0_127, plain, (~environment(esk2_0)), inference(closure_rule, [i_0_8])).
% 0.20/0.37 cnf(i_0_125, plain, (in_environment(esk2_0,esk1_1(esk2_0))), inference(extension_rule, [i_0_5])).
% 0.20/0.37 cnf(i_0_155, plain, (greater_or_equal(esk3_1(esk1_1(esk2_0)),esk1_1(esk2_0))), inference(etableau_closure_rule, [i_0_155, ...])).
% 0.20/0.37 # End printing tableau
% 0.20/0.37 # SZS output end
% 0.20/0.37 # Branches closed with saturation will be marked with an "s"
% 0.20/0.37 # Child (9764) has found a proof.
% 0.20/0.37
% 0.20/0.37 # Proof search is over...
% 0.20/0.37 # Freeing feature tree
%------------------------------------------------------------------------------