TSTP Solution File: MGT025+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT025+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 : n024.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.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT025+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.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 9 08:53:34 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 26 Number of unprocessed: 26
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 26 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 6 conjectures.
% 0.13/0.38 # There are 6 start rule candidates:
% 0.13/0.38 # Found 3 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 6 start rule tableaux created.
% 0.13/0.38 # 23 extension rule candidate clauses
% 0.13/0.38 # 3 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 6
% 0.13/0.38 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 11 tableaux to operate on
% 0.13/0.39 # Creating equality axioms
% 0.13/0.39 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.39 # There were 1 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 1 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 1 successful branch saturations after the branch.
% 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.39 # Begin clausification derivation
% 0.13/0.39
% 0.13/0.39 # End clausification derivation
% 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.39 cnf(i_0_26, negated_conjecture, (environment(esk1_0))).
% 0.13/0.39 cnf(i_0_24, negated_conjecture, (constant(number_of_organizations(esk1_0,esk2_0)))).
% 0.13/0.39 cnf(i_0_25, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))).
% 0.13/0.39 cnf(i_0_23, negated_conjecture, (growth_rate(efficient_producers,esk2_0)!=zero|growth_rate(first_movers,esk2_0)!=zero)).
% 0.13/0.39 cnf(i_0_22, negated_conjecture, (~greater(zero,growth_rate(efficient_producers,esk2_0))|~greater(growth_rate(first_movers,esk2_0),zero))).
% 0.13/0.39 cnf(i_0_4, plain, (subpopulation(efficient_producers,X1,X2)|~in_environment(X1,X2)|~environment(X1))).
% 0.13/0.39 cnf(i_0_5, plain, (subpopulation(first_movers,X1,X2)|~in_environment(X1,X2)|~environment(X1))).
% 0.13/0.39 cnf(i_0_21, negated_conjecture, (~greater(zero,growth_rate(first_movers,esk2_0))|~greater(growth_rate(efficient_producers,esk2_0),zero))).
% 0.13/0.39 cnf(i_0_19, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))).
% 0.13/0.39 cnf(i_0_12, plain, (increases(X1)|increases(X2)|constant(X1)|~constant(sum(X1,X2)))).
% 0.13/0.39 cnf(i_0_17, plain, (greater(cardinality_at_time(efficient_producers,X1),zero)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))).
% 0.13/0.39 cnf(i_0_18, plain, (greater(cardinality_at_time(first_movers,X1),zero)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))).
% 0.13/0.39 cnf(i_0_20, hypothesis, (X1=first_movers|X1=efficient_producers|~greater(cardinality_at_time(X1,X2),zero)|~subpopulation(X1,X3,X2)|~environment(X3))).
% 0.13/0.39 cnf(i_0_10, plain, (decreases(X1)|increases(X1)|constant(X2)|~constant(sum(X2,X1)))).
% 0.13/0.39 cnf(i_0_9, plain, (decreases(X1)|increases(X1)|constant(X2)|~constant(sum(X1,X2)))).
% 0.13/0.39 cnf(i_0_6, plain, (decreases(X1)|increases(X1)|constant(X1)|~constant(sum(X2,X1)))).
% 0.13/0.39 cnf(i_0_13, plain, (decreases(X1)|increases(X1)|constant(X1)|~constant(sum(X1,X2)))).
% 0.13/0.39 cnf(i_0_7, plain, (decreases(X1)|decreases(X2)|constant(X1)|~constant(sum(X2,X1)))).
% 0.13/0.39 cnf(i_0_8, plain, (increases(X1)|increases(X2)|constant(X2)|~constant(sum(X1,X2)))).
% 0.13/0.39 cnf(i_0_11, plain, (decreases(X1)|decreases(X2)|constant(X2)|~constant(sum(X2,X1)))).
% 0.13/0.39 cnf(i_0_16, plain, (growth_rate(X1,X2)=zero|~constant(cardinality_at_time(X1,X2))|~in_environment(X3,X2)|~greater(cardinality_at_time(X1,X2),zero)|~subpopulation(X1,X3,X2)|~environment(X3))).
% 0.13/0.39 cnf(i_0_14, plain, (greater(zero,growth_rate(X1,X2))|~decreases(cardinality_at_time(X1,X2))|~in_environment(X3,X2)|~greater(cardinality_at_time(X1,X2),zero)|~subpopulation(X1,X3,X2)|~environment(X3))).
% 0.13/0.39 cnf(i_0_15, plain, (greater(growth_rate(X1,X2),zero)|~increases(cardinality_at_time(X1,X2))|~in_environment(X3,X2)|~greater(cardinality_at_time(X1,X2),zero)|~subpopulation(X1,X3,X2)|~environment(X3))).
% 0.13/0.39 cnf(i_0_2, plain, (number_of_organizations(X1,X2)=sum(cardinality_at_time(first_movers,X2),cardinality_at_time(efficient_producers,X2))|~subpopulation(efficient_producers,X1,X2)|~environment(X1))).
% 0.13/0.39 cnf(i_0_1, plain, (number_of_organizations(X1,X2)=sum(cardinality_at_time(first_movers,X2),cardinality_at_time(efficient_producers,X2))|~subpopulation(first_movers,X1,X2)|~environment(X1))).
% 0.13/0.39 cnf(i_0_3, plain, (number_of_organizations(X1,X2)=sum(cardinality_at_time(first_movers,X2),cardinality_at_time(efficient_producers,X2))|greater(cardinality_at_time(X3,X2),zero)|~subpopulation(X3,X1,X2)|~environment(X1))).
% 0.13/0.39 cnf(i_0_734, plain, (X27=X27)).
% 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.39 # Begin printing tableau
% 0.13/0.39 # Found 6 steps
% 0.13/0.39 cnf(i_0_734, plain, (esk1_0=esk1_0), inference(start_rule)).
% 0.13/0.39 cnf(i_0_839, plain, (esk1_0=esk1_0), inference(extension_rule, [i_0_738])).
% 0.13/0.39 cnf(i_0_935, plain, (~environment(esk1_0)), inference(closure_rule, [i_0_26])).
% 0.13/0.39 cnf(i_0_933, plain, (environment(esk1_0)), inference(extension_rule, [i_0_19])).
% 0.13/0.39 cnf(i_0_2490, plain, (~subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(closure_rule, [i_0_25])).
% 0.13/0.39 cnf(i_0_2489, plain, (in_environment(esk1_0,esk2_0)), inference(etableau_closure_rule, [i_0_2489, ...])).
% 0.13/0.39 # End printing tableau
% 0.13/0.39 # SZS output end
% 0.13/0.39 # Branches closed with saturation will be marked with an "s"
% 0.13/0.39 # Child (25414) has found a proof.
% 0.13/0.39
% 0.13/0.39 # Proof search is over...
% 0.13/0.39 # Freeing feature tree
%------------------------------------------------------------------------------