TSTP Solution File: MGT029-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT029-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 : n019.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:29 EDT 2022
% Result : Unsatisfiable 0.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT029-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/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.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 09:59:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 22 Number of unprocessed: 22
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 22 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 5 conjectures.
% 0.13/0.37 # There are 5 start rule candidates:
% 0.13/0.37 # Found 3 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 5 start rule tableaux created.
% 0.13/0.37 # 19 extension rule candidate clauses
% 0.13/0.37 # 3 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 5
% 0.13/0.37 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 14 tableaux to operate on
% 0.13/0.40 # Creating equality axioms
% 0.13/0.40 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.40 # Creating equality axioms
% 0.13/0.40 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.42 # Creating equality axioms
% 0.13/0.42 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.47 # There were 6 total branch saturation attempts.
% 0.19/0.47 # There were 0 of these attempts blocked.
% 0.19/0.47 # There were 0 deferred branch saturation attempts.
% 0.19/0.47 # There were 0 free duplicated saturations.
% 0.19/0.47 # There were 6 total successful branch saturations.
% 0.19/0.47 # There were 0 successful branch saturations in interreduction.
% 0.19/0.47 # There were 0 successful branch saturations on the branch.
% 0.19/0.47 # There were 6 successful branch saturations after the branch.
% 0.19/0.47 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 # Begin clausification derivation
% 0.19/0.47
% 0.19/0.47 # End clausification derivation
% 0.19/0.47 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.47 cnf(i_0_40, negated_conjecture, (environment(sk3))).
% 0.19/0.47 cnf(i_0_41, negated_conjecture, (stable(sk3))).
% 0.19/0.47 cnf(i_0_27, plain, (greater_or_equal(X1,X1))).
% 0.19/0.47 cnf(i_0_42, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk3,sk4(X1))|~in_environment(sk3,X1))).
% 0.19/0.47 cnf(i_0_44, negated_conjecture, (~in_environment(sk3,X1)|~greater(zero,growth_rate(first_movers,sk4(X1)))|~greater(growth_rate(efficient_producers,sk4(X1)),zero))).
% 0.19/0.47 cnf(i_0_43, negated_conjecture, (greater_or_equal(sk4(X1),X1)|~in_environment(sk3,X1))).
% 0.19/0.47 cnf(i_0_26, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 0.19/0.47 cnf(i_0_36, hypothesis, (in_environment(X1,sk1(X1))|~stable(X1)|~environment(X1))).
% 0.19/0.47 cnf(i_0_38, hypothesis, (in_environment(X1,sk2(X1))|~stable(X1)|~environment(X1))).
% 0.19/0.47 cnf(i_0_25, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.19/0.47 cnf(i_0_39, hypothesis, (greater_or_equal(sk2(X1),equilibrium(X1))|~stable(X1)|~environment(X1))).
% 0.19/0.47 cnf(i_0_23, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.19/0.47 cnf(i_0_37, 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.19/0.47 cnf(i_0_31, 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.19/0.47 cnf(i_0_35, 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.19/0.47 cnf(i_0_24, plain, (X1=X2|greater(X1,X2)|greater(X2,X1)|~in_environment(X3,X2)|~in_environment(X3,X1))).
% 0.19/0.47 cnf(i_0_29, 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.19/0.47 cnf(i_0_30, 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.19/0.47 cnf(i_0_33, 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.19/0.47 cnf(i_0_34, 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.19/0.47 cnf(i_0_28, 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.19/0.47 cnf(i_0_32, 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.19/0.47 cnf(i_0_219, plain, (X4=X4)).
% 0.19/0.47 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.47 # Begin printing tableau
% 0.19/0.47 # Found 18 steps
% 0.19/0.47 cnf(i_0_219, plain, (sk2(sk3)=sk2(sk3)), inference(start_rule)).
% 0.19/0.47 cnf(i_0_319, plain, (sk2(sk3)=sk2(sk3)), inference(extension_rule, [i_0_223])).
% 0.19/0.47 cnf(i_0_411, plain, ($false), inference(closure_rule, [i_0_219])).
% 0.19/0.47 cnf(i_0_409, plain, (greater(sk2(sk3),sk1(sk3))), inference(extension_rule, [i_0_26])).
% 0.19/0.47 cnf(i_0_413, plain, (greater_or_equal(sk2(sk3),sk1(sk3))), inference(extension_rule, [i_0_37])).
% 0.19/0.47 cnf(i_0_431, plain, (~stable(sk3)), inference(closure_rule, [i_0_41])).
% 0.19/0.47 cnf(i_0_433, plain, (~environment(sk3)), inference(closure_rule, [i_0_40])).
% 0.19/0.47 cnf(i_0_412, plain, (~greater(sk2(sk3),sk1(sk3))), inference(extension_rule, [i_0_24])).
% 0.19/0.47 cnf(i_0_2095, plain, (sk2(sk3)=sk1(sk3)), inference(extension_rule, [i_0_226])).
% 0.19/0.47 cnf(i_0_2098, plain, (~in_environment(sk3,sk2(sk3))), inference(extension_rule, [i_0_38])).
% 0.19/0.47 cnf(i_0_2171, plain, (~stable(sk3)), inference(closure_rule, [i_0_41])).
% 0.19/0.47 cnf(i_0_2172, plain, (~environment(sk3)), inference(closure_rule, [i_0_40])).
% 0.19/0.47 cnf(i_0_430, plain, (greater(growth_rate(efficient_producers,sk2(sk3)),growth_rate(first_movers,sk2(sk3)))), inference(etableau_closure_rule, [i_0_430, ...])).
% 0.19/0.47 cnf(i_0_432, plain, (~subpopulations(first_movers,efficient_producers,sk3,sk2(sk3))), inference(etableau_closure_rule, [i_0_432, ...])).
% 0.19/0.47 cnf(i_0_2099, plain, (~in_environment(sk3,sk1(sk3))), inference(etableau_closure_rule, [i_0_2099, ...])).
% 0.19/0.47 cnf(i_0_2096, plain, (greater(sk1(sk3),sk2(sk3))), inference(etableau_closure_rule, [i_0_2096, ...])).
% 0.19/0.47 cnf(i_0_2167, plain, (environment(sk2(sk3))), inference(etableau_closure_rule, [i_0_2167, ...])).
% 0.19/0.47 cnf(i_0_2169, plain, (~environment(sk1(sk3))), inference(etableau_closure_rule, [i_0_2169, ...])).
% 0.19/0.47 # End printing tableau
% 0.19/0.47 # SZS output end
% 0.19/0.47 # Branches closed with saturation will be marked with an "s"
% 0.19/0.47 # Child (20687) has found a proof.
% 0.19/0.47
% 0.19/0.47 # Proof search is over...
% 0.19/0.47 # Freeing feature tree
%------------------------------------------------------------------------------