TSTP Solution File: MGT037-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT037-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:34 EDT 2022
% Result : Unsatisfiable 0.21s 0.39s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : MGT037-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.14 % 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 : n019.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:15:25 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.38 # No SInE strategy applied
% 0.21/0.38 # Auto-Mode selected heuristic G_E___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.21/0.38 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.21/0.38 #
% 0.21/0.38 # Presaturation interreduction done
% 0.21/0.38 # Number of axioms: 27 Number of unprocessed: 27
% 0.21/0.38 # Tableaux proof search.
% 0.21/0.38 # APR header successfully linked.
% 0.21/0.38 # Hello from C++
% 0.21/0.38 # The folding up rule is enabled...
% 0.21/0.38 # Local unification is enabled...
% 0.21/0.38 # Any saturation attempts will use folding labels...
% 0.21/0.38 # 27 beginning clauses after preprocessing and clausification
% 0.21/0.38 # Creating start rules for all 4 conjectures.
% 0.21/0.38 # There are 4 start rule candidates:
% 0.21/0.38 # Found 5 unit axioms.
% 0.21/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.21/0.38 # 4 start rule tableaux created.
% 0.21/0.38 # 22 extension rule candidate clauses
% 0.21/0.38 # 5 unit axiom clauses
% 0.21/0.38
% 0.21/0.38 # Requested 8, 32 cores available to the main process.
% 0.21/0.38 # There are not enough tableaux to fork, creating more from the initial 4
% 0.21/0.38 # Returning from population with 21 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.38 # We now have 21 tableaux to operate on
% 0.21/0.39 # There were 1 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_51, negated_conjecture, (environment(sk3))).
% 0.21/0.39 cnf(i_0_52, negated_conjecture, (in_environment(sk3,sk4))).
% 0.21/0.39 cnf(i_0_53, negated_conjecture, (greater_or_equal(sk4,appear(efficient_producers,sk3)))).
% 0.21/0.39 cnf(i_0_49, hypothesis, (greater(resilience(efficient_producers),resilience(first_movers)))).
% 0.21/0.39 cnf(i_0_54, negated_conjecture, (~greater(cardinality_at_time(efficient_producers,sk4),zero))).
% 0.21/0.39 cnf(i_0_38, plain, (subpopulation(efficient_producers,X1,X2)|~in_environment(X1,X2)|~environment(X1))).
% 0.21/0.39 cnf(i_0_37, plain, (subpopulation(first_movers,X1,X2)|~in_environment(X1,X2)|~environment(X1))).
% 0.21/0.39 cnf(i_0_41, plain, (~constant(X1)|~decreases(X1))).
% 0.21/0.39 cnf(i_0_40, plain, (cardinality_at_time(efficient_producers,X1)=zero|greater(cardinality_at_time(efficient_producers,X1),zero)|~in_environment(X2,X1)|~environment(X2))).
% 0.21/0.39 cnf(i_0_39, plain, (cardinality_at_time(X1,X2)!=zero|~greater(zero,growth_rate(X1,X2)))).
% 0.21/0.39 cnf(i_0_32, plain, (number_of_organizations(X1,X2)=zero|~in_environment(X1,X2)|~greater(appear(an_organisation,X1),X2)|~environment(X1))).
% 0.21/0.39 cnf(i_0_47, hypothesis, (constant(number_of_organizations(X1,X2))|~constant(resources(X1,X2))|~in_environment(X1,X2)|~environment(X1))).
% 0.21/0.39 cnf(i_0_46, hypothesis, (~decreases(number_of_organizations(X1,X2))|~decreases(resources(X1,X2))|~in_environment(X1,X2)|~environment(X1))).
% 0.21/0.39 cnf(i_0_42, plain, (greater(appear(an_organisation,X1),X2)|greater_or_equal(X2,appear(an_organisation,X1))|~in_environment(X1,X2)|~environment(X1))).
% 0.21/0.39 cnf(i_0_45, hypothesis, (greater(number_of_organizations(X1,X2),zero)|~in_environment(X1,X2)|~greater_or_equal(X2,appear(an_organisation,X1))|~environment(X1))).
% 0.21/0.39 cnf(i_0_31, plain, (greater(zero,growth_rate(efficient_producers,sk1(X1,X2)))|cardinality_at_time(efficient_producers,X1)!=zero|~greater_or_equal(X1,appear(efficient_producers,X2))|~environment(X2))).
% 0.21/0.39 cnf(i_0_33, plain, (subpopulation(sk2(X1,X2),X2,X1)|decreases(number_of_organizations(X2,X1))|~in_environment(X2,X1)|~environment(X2))).
% 0.21/0.39 cnf(i_0_30, plain, (greater(X1,sk1(X1,X2))|cardinality_at_time(efficient_producers,X1)!=zero|~greater_or_equal(X1,appear(efficient_producers,X2))|~environment(X2))).
% 0.21/0.39 cnf(i_0_28, plain, (greater(sk1(X1,X2),appear(efficient_producers,X2))|cardinality_at_time(efficient_producers,X1)!=zero|~greater_or_equal(X1,appear(efficient_producers,X2))|~environment(X2))).
% 0.21/0.39 cnf(i_0_29, plain, (in_environment(X1,sk1(X2,X1))|cardinality_at_time(efficient_producers,X2)!=zero|~greater_or_equal(X2,appear(efficient_producers,X1))|~environment(X1))).
% 0.21/0.39 cnf(i_0_50, hypothesis, (X1=first_movers|X1=efficient_producers|~subpopulation(X1,X2,X3)|~greater(cardinality_at_time(X1,X3),zero)|~environment(X2))).
% 0.21/0.39 cnf(i_0_34, plain, (decreases(number_of_organizations(X1,X2))|greater(cardinality_at_time(sk2(X2,X1),X2),zero)|~in_environment(X1,X2)|~environment(X1))).
% 0.21/0.39 cnf(i_0_44, hypothesis, (constant(resources(X1,X2))|greater(equilibrium(X1),X2)|~in_environment(X1,X2)|~greater(number_of_organizations(X1,X2),zero)|~environment(X1))).
% 0.21/0.39 cnf(i_0_43, hypothesis, (decreases(resources(X1,X2))|~in_environment(X1,X2)|~greater(number_of_organizations(X1,X2),zero)|~greater(equilibrium(X1),X2)|~environment(X1))).
% 0.21/0.39 cnf(i_0_36, plain, (cardinality_at_time(X1,X2)=zero|number_of_organizations(X3,X2)!=zero|~subpopulation(X1,X3,X2)|~in_environment(X3,X2)|~environment(X3))).
% 0.21/0.39 cnf(i_0_35, plain, (decreases(number_of_organizations(X1,X2))|~in_environment(X1,X2)|~greater(zero,growth_rate(sk2(X2,X1),X2))|~environment(X1))).
% 0.21/0.39 cnf(i_0_48, hypothesis, (greater(zero,growth_rate(X1,X2))|~in_environment(X3,X2)|~greater(zero,growth_rate(X4,X2))|~greater(resilience(X4),resilience(X1))|~environment(X3))).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 6 steps
% 0.21/0.39 cnf(i_0_51, negated_conjecture, (environment(sk3)), inference(start_rule)).
% 0.21/0.39 cnf(i_0_58, plain, (environment(sk3)), inference(extension_rule, [i_0_40])).
% 0.21/0.39 cnf(i_0_677, plain, (greater(cardinality_at_time(efficient_producers,sk4),zero)), inference(closure_rule, [i_0_54])).
% 0.21/0.39 cnf(i_0_678, plain, (~in_environment(sk3,sk4)), inference(closure_rule, [i_0_52])).
% 0.21/0.39 cnf(i_0_676, plain, (cardinality_at_time(efficient_producers,sk4)=zero), inference(extension_rule, [i_0_39])).
% 0.21/0.39 cnf(i_0_683, plain, (~greater(zero,growth_rate(efficient_producers,sk4))), inference(etableau_closure_rule, [i_0_683, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # Creating equality axioms
% 0.21/0.39 # Ran out of tableaux, making start rules for all clauses
% 0.21/0.40 # Child (4513) has found a proof.
% 0.21/0.40
% 0.21/0.40 # Proof search is over...
% 0.21/0.40 # Freeing feature tree
%------------------------------------------------------------------------------