TSTP Solution File: MGT035-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT035-1 : TPTP v8.1.0. Released v2.4.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 : n027.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:31 EDT 2022
% Result : Unsatisfiable 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : MGT035-1 : TPTP v8.1.0. Released v2.4.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 : n027.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:27:27 EDT 2022
% 0.12/0.33 % 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_S04AI
% 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: 25 Number of unprocessed: 25
% 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.36 # The folding up rule is enabled...
% 0.18/0.36 # Local unification is enabled...
% 0.18/0.36 # Any saturation attempts will use folding labels...
% 0.18/0.36 # 25 beginning clauses after preprocessing and clausification
% 0.18/0.36 # Creating start rules for all 5 conjectures.
% 0.18/0.36 # There are 5 start rule candidates:
% 0.18/0.36 # Found 3 unit axioms.
% 0.18/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.36 # 5 start rule tableaux created.
% 0.18/0.36 # 22 extension rule candidate clauses
% 0.18/0.36 # 3 unit axiom clauses
% 0.18/0.36
% 0.18/0.36 # Requested 8, 32 cores available to the main process.
% 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 5
% 0.18/0.36 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.36 # We now have 14 tableaux to operate on
% 0.18/0.39 # Creating equality axioms
% 0.18/0.39 # Ran out of tableaux, making start rules for all clauses
% 0.18/0.39 # Creating equality axioms
% 0.18/0.39 # Ran out of tableaux, making start rules for all clauses
% 0.18/0.42 # Creating equality axioms
% 0.18/0.42 # Ran out of tableaux, making start rules for all clauses
% 0.18/0.46 # There were 6 total branch saturation attempts.
% 0.18/0.46 # There were 0 of these attempts blocked.
% 0.18/0.46 # There were 0 deferred branch saturation attempts.
% 0.18/0.46 # There were 0 free duplicated saturations.
% 0.18/0.46 # There were 6 total successful branch saturations.
% 0.18/0.46 # There were 0 successful branch saturations in interreduction.
% 0.18/0.46 # There were 0 successful branch saturations on the branch.
% 0.18/0.46 # There were 6 successful branch saturations after the branch.
% 0.18/0.46 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.46 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.46 # Begin clausification derivation
% 0.18/0.46
% 0.18/0.46 # End clausification derivation
% 0.18/0.46 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.46 cnf(i_0_46, negated_conjecture, (environment(sk3))).
% 0.18/0.46 cnf(i_0_47, negated_conjecture, (stable(sk3))).
% 0.18/0.46 cnf(i_0_30, plain, (greater_or_equal(X1,X1))).
% 0.18/0.46 cnf(i_0_50, negated_conjecture, (~outcompetes(efficient_producers,first_movers,sk4(X1))|~in_environment(sk3,X1))).
% 0.18/0.46 cnf(i_0_48, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk3,sk4(X1))|~in_environment(sk3,X1))).
% 0.18/0.46 cnf(i_0_49, negated_conjecture, (greater_or_equal(sk4(X1),X1)|~in_environment(sk3,X1))).
% 0.18/0.46 cnf(i_0_29, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 0.18/0.46 cnf(i_0_42, hypothesis, (in_environment(X1,sk1(X1))|~stable(X1)|~environment(X1))).
% 0.18/0.46 cnf(i_0_44, hypothesis, (in_environment(X1,sk2(X1))|~stable(X1)|~environment(X1))).
% 0.18/0.46 cnf(i_0_28, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.18/0.46 cnf(i_0_45, hypothesis, (greater_or_equal(sk2(X1),equilibrium(X1))|~stable(X1)|~environment(X1))).
% 0.18/0.46 cnf(i_0_26, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.18/0.46 cnf(i_0_32, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))).
% 0.18/0.46 cnf(i_0_43, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~stable(X2)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,sk1(X2)))).
% 0.18/0.46 cnf(i_0_33, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))).
% 0.18/0.46 cnf(i_0_27, plain, (X1=X2|greater(X1,X2)|greater(X2,X1)|~in_environment(X3,X2)|~in_environment(X3,X1))).
% 0.18/0.46 cnf(i_0_31, hypothesis, (outcompetes(X1,X2,X3)|~subpopulations(X2,X1,X4,X3)|~environment(X4)|~greater_or_equal(growth_rate(X1,X3),zero)|~greater(zero,growth_rate(X2,X3)))).
% 0.18/0.46 cnf(i_0_37, hypothesis, (growth_rate(first_movers,X1)=zero|greater(zero,growth_rate(efficient_producers,X1))|greater(zero,growth_rate(first_movers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))).
% 0.18/0.46 cnf(i_0_41, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(zero,growth_rate(efficient_producers,X1))|greater(zero,growth_rate(first_movers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))).
% 0.18/0.46 cnf(i_0_35, hypothesis, (growth_rate(first_movers,X1)=zero|greater(growth_rate(first_movers,X1),zero)|greater(zero,growth_rate(first_movers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))).
% 0.18/0.46 cnf(i_0_36, hypothesis, (growth_rate(first_movers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(zero,growth_rate(efficient_producers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))).
% 0.18/0.46 cnf(i_0_39, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(growth_rate(first_movers,X1),zero)|greater(zero,growth_rate(first_movers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))).
% 0.18/0.46 cnf(i_0_40, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(zero,growth_rate(efficient_producers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))).
% 0.18/0.46 cnf(i_0_34, hypothesis, (growth_rate(first_movers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(growth_rate(first_movers,X1),zero)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))).
% 0.18/0.46 cnf(i_0_38, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(growth_rate(first_movers,X1),zero)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))).
% 0.18/0.46 cnf(i_0_342, plain, (X5=X5)).
% 0.18/0.46 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.46 # Begin printing tableau
% 0.18/0.46 # Found 18 steps
% 0.18/0.46 cnf(i_0_342, plain, (sk2(sk3)=sk2(sk3)), inference(start_rule)).
% 0.18/0.46 cnf(i_0_455, plain, (sk2(sk3)=sk2(sk3)), inference(extension_rule, [i_0_346])).
% 0.18/0.46 cnf(i_0_559, plain, ($false), inference(closure_rule, [i_0_342])).
% 0.18/0.46 cnf(i_0_557, plain, (greater(sk2(sk3),sk1(sk3))), inference(extension_rule, [i_0_29])).
% 0.18/0.46 cnf(i_0_561, plain, (greater_or_equal(sk2(sk3),sk1(sk3))), inference(extension_rule, [i_0_43])).
% 0.18/0.46 cnf(i_0_583, plain, (~stable(sk3)), inference(closure_rule, [i_0_47])).
% 0.18/0.46 cnf(i_0_585, plain, (~environment(sk3)), inference(closure_rule, [i_0_46])).
% 0.18/0.46 cnf(i_0_560, plain, (~greater(sk2(sk3),sk1(sk3))), inference(extension_rule, [i_0_27])).
% 0.18/0.46 cnf(i_0_2478, plain, (sk2(sk3)=sk1(sk3)), inference(extension_rule, [i_0_349])).
% 0.18/0.46 cnf(i_0_2481, plain, (~in_environment(sk3,sk2(sk3))), inference(extension_rule, [i_0_44])).
% 0.18/0.46 cnf(i_0_2566, plain, (~stable(sk3)), inference(closure_rule, [i_0_47])).
% 0.18/0.46 cnf(i_0_2567, plain, (~environment(sk3)), inference(closure_rule, [i_0_46])).
% 0.18/0.46 cnf(i_0_582, plain, (greater(growth_rate(efficient_producers,sk2(sk3)),growth_rate(first_movers,sk2(sk3)))), inference(etableau_closure_rule, [i_0_582, ...])).
% 0.18/0.46 cnf(i_0_584, plain, (~subpopulations(first_movers,efficient_producers,sk3,sk2(sk3))), inference(etableau_closure_rule, [i_0_584, ...])).
% 0.18/0.46 cnf(i_0_2482, plain, (~in_environment(sk3,sk1(sk3))), inference(etableau_closure_rule, [i_0_2482, ...])).
% 0.18/0.46 cnf(i_0_2479, plain, (greater(sk1(sk3),sk2(sk3))), inference(etableau_closure_rule, [i_0_2479, ...])).
% 0.18/0.46 cnf(i_0_2562, plain, (environment(sk2(sk3))), inference(etableau_closure_rule, [i_0_2562, ...])).
% 0.18/0.46 cnf(i_0_2564, plain, (~environment(sk1(sk3))), inference(etableau_closure_rule, [i_0_2564, ...])).
% 0.18/0.46 # End printing tableau
% 0.18/0.46 # SZS output end
% 0.18/0.46 # Branches closed with saturation will be marked with an "s"
% 0.18/0.46 # Child (17290) has found a proof.
% 0.18/0.46
% 0.18/0.46 # Proof search is over...
% 0.18/0.46 # Freeing feature tree
%------------------------------------------------------------------------------