TSTP Solution File: MGT036+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT036+3 : 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:34 EDT 2022
% Result : Theorem 0.18s 0.37s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT036+3 : TPTP v8.1.0. Released v2.0.0.
% 0.03/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 : n025.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 07:44:35 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.36 # No SInE strategy applied
% 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.18/0.36 #
% 0.18/0.36 # Presaturation interreduction done
% 0.18/0.36 # Number of axioms: 9 Number of unprocessed: 9
% 0.18/0.36 # Tableaux proof search.
% 0.18/0.36 # APR header successfully linked.
% 0.18/0.36 # 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 # 9 beginning clauses after preprocessing and clausification
% 0.18/0.37 # Creating start rules for all 1 conjectures.
% 0.18/0.37 # There are 1 start rule candidates:
% 0.18/0.37 # Found 4 unit axioms.
% 0.18/0.37 # 1 start rule tableaux created.
% 0.18/0.37 # 5 extension rule candidate clauses
% 0.18/0.37 # 4 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 1
% 0.18/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.18/0.37 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.37 # We now have 13 tableaux to operate on
% 0.18/0.37 # There were 1 total branch saturation attempts.
% 0.18/0.37 # There were 0 of these attempts blocked.
% 0.18/0.37 # There were 0 deferred branch saturation attempts.
% 0.18/0.37 # There were 0 free duplicated saturations.
% 0.18/0.37 # There were 1 total successful branch saturations.
% 0.18/0.37 # There were 0 successful branch saturations in interreduction.
% 0.18/0.37 # There were 0 successful branch saturations on the branch.
% 0.18/0.37 # There were 1 successful branch saturations after the branch.
% 0.18/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.37 # Begin clausification derivation
% 0.18/0.37
% 0.18/0.37 # End clausification derivation
% 0.18/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.37 cnf(i_0_8, hypothesis, (environment(esk1_0))).
% 0.18/0.37 cnf(i_0_7, hypothesis, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))).
% 0.18/0.37 cnf(i_0_5, hypothesis, (greater(zero,growth_rate(efficient_producers,esk2_0)))).
% 0.18/0.37 cnf(i_0_6, hypothesis, (greater_or_equal(growth_rate(first_movers,esk2_0),zero))).
% 0.18/0.37 cnf(i_0_9, negated_conjecture, (~outcompetes(first_movers,efficient_producers,X1)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))).
% 0.18/0.37 cnf(i_0_2, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))).
% 0.18/0.37 cnf(i_0_1, plain, (subpopulations(X1,X2,X3,X4)|~subpopulations(X2,X1,X3,X4)|~environment(X3))).
% 0.18/0.37 cnf(i_0_3, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))).
% 0.18/0.37 cnf(i_0_4, hypothesis, (outcompetes(X1,X2,X3)|~greater(zero,growth_rate(X2,X3))|~greater_or_equal(growth_rate(X1,X3),zero)|~subpopulations(X2,X1,X4,X3)|~environment(X4))).
% 0.18/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.37 # Begin printing tableau
% 0.18/0.37 # Found 8 steps
% 0.18/0.37 cnf(i_0_8, hypothesis, (environment(esk1_0)), inference(start_rule)).
% 0.18/0.37 cnf(i_0_51, plain, (environment(esk1_0)), inference(extension_rule, [i_0_9])).
% 0.18/0.37 cnf(i_0_91, plain, (~subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(closure_rule, [i_0_7])).
% 0.18/0.37 cnf(i_0_90, plain, (~outcompetes(first_movers,efficient_producers,esk2_0)), inference(extension_rule, [i_0_4])).
% 0.18/0.37 cnf(i_0_105, plain, (~greater(zero,growth_rate(efficient_producers,esk2_0))), inference(closure_rule, [i_0_5])).
% 0.18/0.37 cnf(i_0_106, plain, (~greater_or_equal(growth_rate(first_movers,esk2_0),zero)), inference(closure_rule, [i_0_6])).
% 0.18/0.37 cnf(i_0_108, plain, (~environment(esk1_0)), inference(closure_rule, [i_0_8])).
% 0.18/0.37 cnf(i_0_107, plain, (~subpopulations(efficient_producers,first_movers,esk1_0,esk2_0)), inference(etableau_closure_rule, [i_0_107, ...])).
% 0.18/0.37 # End printing tableau
% 0.18/0.37 # SZS output end
% 0.18/0.37 # Branches closed with saturation will be marked with an "s"
% 0.18/0.37 # Child (12534) has found a proof.
% 0.18/0.37
% 0.18/0.37 # Proof search is over...
% 0.18/0.37 # Freeing feature tree
%------------------------------------------------------------------------------