TSTP Solution File: MGT039+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT039+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 : n017.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:36 EDT 2022
% Result : Theorem 5.01s 1.02s
% Output : CNFRefutation 5.01s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT039+2 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 11:30:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 28 Number of unprocessed: 28
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 28 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 3 conjectures.
% 0.12/0.37 # There are 3 start rule candidates:
% 0.12/0.37 # Found 6 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 3 start rule tableaux created.
% 0.12/0.37 # 22 extension rule candidate clauses
% 0.12/0.37 # 6 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 3
% 0.12/0.37 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 12 tableaux to operate on
% 5.01/1.02 # There were 2 total branch saturation attempts.
% 5.01/1.02 # There were 0 of these attempts blocked.
% 5.01/1.02 # There were 0 deferred branch saturation attempts.
% 5.01/1.02 # There were 0 free duplicated saturations.
% 5.01/1.02 # There were 2 total successful branch saturations.
% 5.01/1.02 # There were 0 successful branch saturations in interreduction.
% 5.01/1.02 # There were 0 successful branch saturations on the branch.
% 5.01/1.02 # There were 2 successful branch saturations after the branch.
% 5.01/1.02 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.01/1.02 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.01/1.02 # Begin clausification derivation
% 5.01/1.02
% 5.01/1.02 # End clausification derivation
% 5.01/1.02 # Begin listing active clauses obtained from FOF to CNF conversion
% 5.01/1.02 cnf(i_0_28, negated_conjecture, (observational_period(esk3_0))).
% 5.01/1.02 cnf(i_0_27, negated_conjecture, (slow_change(esk3_0))).
% 5.01/1.02 cnf(i_0_8, plain, (propagation_strategy(first_movers))).
% 5.01/1.02 cnf(i_0_9, plain, (propagation_strategy(efficient_producers))).
% 5.01/1.02 cnf(i_0_20, plain, (greater_or_equal(X1,X1))).
% 5.01/1.02 cnf(i_0_26, negated_conjecture, (~selection_favors(efficient_producers,first_movers,esk3_0))).
% 5.01/1.02 cnf(i_0_21, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 5.01/1.02 cnf(i_0_22, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 5.01/1.02 cnf(i_0_17, plain, (greater_or_equal(critical_point(X1),start_time(X1))|~environment(X1))).
% 5.01/1.02 cnf(i_0_15, plain, (subpopulation(first_movers,X1,X2)|~in_environment(X1,X2)|~environment(X1))).
% 5.01/1.02 cnf(i_0_14, plain, (subpopulation(efficient_producers,X1,X2)|~in_environment(X1,X2)|~environment(X1))).
% 5.01/1.02 cnf(i_0_16, plain, (greater_or_equal(critical_point(X1),appear(efficient_producers,X1))|~environment(X1))).
% 5.01/1.02 cnf(i_0_11, plain, (greater_or_equal(end_time(X1),X2)|~in_environment(X1,X2)|~environment(X1))).
% 5.01/1.02 cnf(i_0_5, plain, (selection_favors(efficient_producers,first_movers,X1)|environment(esk1_1(X1))|~observational_period(X1))).
% 5.01/1.02 cnf(i_0_4, plain, (in_environment(X1,esk1_1(X1))|selection_favors(efficient_producers,first_movers,X1)|~observational_period(X1))).
% 5.01/1.02 cnf(i_0_3, plain, (selection_favors(efficient_producers,first_movers,X1)|~observational_period(X1)|~selection_favors(efficient_producers,first_movers,end_time(esk1_1(X1))))).
% 5.01/1.02 cnf(i_0_18, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 5.01/1.02 cnf(i_0_13, plain, (greater_or_equal(cardinality_at_time(first_movers,X1),zero)|~in_environment(X2,X1)|~environment(X2))).
% 5.01/1.02 cnf(i_0_7, plain, (in_environment(X1,esk2_2(X2,X1))|~slow_change(X2)|~in_environment(X2,X1)|~observational_period(X2)|~environment(X1))).
% 5.01/1.02 cnf(i_0_24, hypothesis, (X1!=critical_point(X2)|~greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~environment(X2))).
% 5.01/1.02 cnf(i_0_6, plain, (greater(esk2_2(X1,X2),critical_point(X2))|~slow_change(X1)|~in_environment(X1,X2)|~observational_period(X1)|~environment(X2))).
% 5.01/1.02 cnf(i_0_10, plain, (in_environment(X1,X2)|~greater_or_equal(X2,start_time(X1))|~greater_or_equal(end_time(X1),X2)|~environment(X1))).
% 5.01/1.02 cnf(i_0_25, hypothesis, (greater(cardinality_at_time(efficient_producers,X1),zero)|~greater_or_equal(X1,appear(efficient_producers,X2))|~in_environment(X2,X1)|~environment(X2))).
% 5.01/1.02 cnf(i_0_19, plain, (greater_or_equal(end_time(X1),X2)|greater(X2,end_time(X1))|~greater(X2,start_time(X1))|~environment(X1))).
% 5.01/1.02 cnf(i_0_12, 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))).
% 5.01/1.02 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))).
% 5.01/1.02 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))).
% 5.01/1.02 cnf(i_0_23, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|X2!=critical_point(X3)|~greater(X1,X2)|~subpopulations(first_movers,efficient_producers,X3,X1)|~environment(X3))).
% 5.01/1.02 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 5.01/1.02 # Begin printing tableau
% 5.01/1.02 # Found 6 steps
% 5.01/1.02 cnf(i_0_28, negated_conjecture, (observational_period(esk3_0)), inference(start_rule)).
% 5.01/1.02 cnf(i_0_32, plain, (observational_period(esk3_0)), inference(extension_rule, [i_0_4])).
% 5.01/1.02 cnf(i_0_211, plain, (selection_favors(efficient_producers,first_movers,esk3_0)), inference(closure_rule, [i_0_26])).
% 5.01/1.02 cnf(i_0_210, plain, (in_environment(esk3_0,esk1_1(esk3_0))), inference(extension_rule, [i_0_15])).
% 5.01/1.02 cnf(i_0_274, plain, (subpopulation(first_movers,esk3_0,esk1_1(esk3_0))), inference(etableau_closure_rule, [i_0_274, ...])).
% 5.01/1.02 cnf(i_0_276, plain, (~environment(esk3_0)), inference(etableau_closure_rule, [i_0_276, ...])).
% 5.01/1.02 # End printing tableau
% 5.01/1.02 # SZS output end
% 5.01/1.02 # Branches closed with saturation will be marked with an "s"
% 5.01/1.02 # Child (20144) has found a proof.
% 5.01/1.02
% 5.01/1.02 # Proof search is over...
% 5.01/1.02 # Freeing feature tree
%------------------------------------------------------------------------------