TSTP Solution File: MGT040+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT040+2 : 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:36 EDT 2022
% Result : CounterSatisfiable 0.14s 0.38s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT040+2 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.34 % Computer : n024.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 9 10:43:04 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.37 # No SInE strategy applied
% 0.14/0.37 # Auto-Mode selected heuristic G_E___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.14/0.37 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.14/0.37 #
% 0.14/0.37 # Presaturation interreduction done
% 0.14/0.37 # Number of axioms: 20 Number of unprocessed: 19
% 0.14/0.37 # Tableaux proof search.
% 0.14/0.37 # APR header successfully linked.
% 0.14/0.37 # Hello from C++
% 0.14/0.37 # The folding up rule is enabled...
% 0.14/0.37 # Local unification is enabled...
% 0.14/0.37 # Any saturation attempts will use folding labels...
% 0.14/0.37 # 19 beginning clauses after preprocessing and clausification
% 0.14/0.37 # Creating start rules for all 4 conjectures.
% 0.14/0.37 # There are 4 start rule candidates:
% 0.14/0.37 # Found 6 unit axioms.
% 0.14/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.37 # 4 start rule tableaux created.
% 0.14/0.37 # 13 extension rule candidate clauses
% 0.14/0.37 # 6 unit axiom clauses
% 0.14/0.37
% 0.14/0.37 # Requested 8, 32 cores available to the main process.
% 0.14/0.37 # There are not enough tableaux to fork, creating more from the initial 4
% 0.14/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.37 # We now have 9 tableaux to operate on
% 0.14/0.38 # Creating equality axioms
% 0.14/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.38 # 14155 Satisfiable branch
% 0.14/0.38 # Creating equality axioms
% 0.14/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.38 # 14156 Satisfiable branch
% 0.14/0.38 # Creating equality axioms
% 0.14/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.38 # 14157 Satisfiable branch
% 0.14/0.38 # Creating equality axioms
% 0.14/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.38 # 14158 Satisfiable branch
% 0.14/0.38 # Creating equality axioms
% 0.14/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.38 # 14159 Satisfiable branch
% 0.14/0.38 # Satisfiable branch found.
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 0 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 0 successful branch saturations after the branch.
% 0.14/0.38 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_20, negated_conjecture, (observational_period(esk2_0))).
% 0.14/0.38 cnf(i_0_19, negated_conjecture, (rapid_change(esk2_0))).
% 0.14/0.38 cnf(i_0_6, plain, (propagation_strategy(first_movers))).
% 0.14/0.38 cnf(i_0_7, plain, (propagation_strategy(efficient_producers))).
% 0.14/0.38 cnf(i_0_18, negated_conjecture, (~extreme(esk2_0))).
% 0.14/0.38 cnf(i_0_17, negated_conjecture, (~selection_favors(first_movers,efficient_producers,esk2_0))).
% 0.14/0.38 cnf(i_0_8, plain, (in_environment(X1,end_time(X1))|~environment(X1))).
% 0.14/0.38 cnf(i_0_13, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.14/0.38 cnf(i_0_5, plain, (extreme(X1)|~empty(X2)|~in_environment(X1,X2)|~environment(X2)|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_3, plain, (selection_favors(efficient_producers,first_movers,X1)|environment(esk1_1(X1))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_2, plain, (selection_favors(efficient_producers,first_movers,X1)|in_environment(X1,esk1_1(X1))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_14, plain, (greater_or_equal(X1,appear(efficient_producers,X2))|greater(appear(efficient_producers,X2),X1)|~in_environment(X2,X1))).
% 0.14/0.38 cnf(i_0_9, plain, (greater(critical_point(X1),end_time(X1))|in_environment(X1,critical_point(X1))|~environment(X1))).
% 0.14/0.38 cnf(i_0_1, plain, (selection_favors(efficient_producers,first_movers,X1)|~selection_favors(efficient_producers,first_movers,end_time(esk1_1(X1)))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_10, plain, (greater_or_equal(end_time(X1),appear(an_organisation,X1))|empty(X1)|~environment(X1))).
% 0.14/0.38 cnf(i_0_15, hypothesis, (selection_favors(first_movers,efficient_producers,X1)|~greater_or_equal(X1,appear(first_movers,X2))|~greater(appear(efficient_producers,X2),X1)|~in_environment(X2,X1)|~environment(X2))).
% 0.14/0.38 cnf(i_0_4, plain, (~rapid_change(X1)|~in_environment(X2,critical_point(X2))|~in_environment(X1,X2)|~environment(X2)|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_12, plain, (selection_favors(first_movers,efficient_producers,end_time(X1))|in_environment(X1,critical_point(X1))|~greater_or_equal(X2,appear(efficient_producers,X1))|~greater(critical_point(X1),X2)|~environment(X1))).
% 0.14/0.38 cnf(i_0_16, hypothesis, (selection_favors(first_movers,efficient_producers,X1)|~greater_or_equal(X1,appear(efficient_producers,X2))|~greater(critical_point(X2),X1)|~in_environment(X2,critical_point(X2))|~environment(X2))).
% 0.14/0.38 cnf(i_0_313, plain, (X26=X26)).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 6 steps
% 0.14/0.38 cnf(i_0_313, plain, (esk2_0=esk2_0), inference(start_rule)).
% 0.14/0.38 cnf(i_0_448, plain, (extreme(esk2_0)), inference(closure_rule, [i_0_0])).
% 0.14/0.38 cnf(i_0_384, plain, (esk2_0=esk2_0), inference(extension_rule, [i_0_317])).
% 0.14/0.38 cnf(i_0_442, plain, (~observational_period(esk2_0)), inference(closure_rule, [i_0_20])).
% 0.14/0.38 cnf(i_0_440, plain, (observational_period(esk2_0)), inference(extension_rule, [i_0_5])).
% 0.14/0.38 cnf(i_0_450, plain, (~in_environment(esk2_0,end_time(esk2_0))), inference(extension_rule, [i_0_8])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # Creating equality axioms
% 0.14/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.38 # 14161 Satisfiable branch
% 0.14/0.38 # Satisfiable branch found.
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 0 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 0 successful branch saturations after the branch.
% 0.14/0.38 # Satisfiable branch found.
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 0 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 0 successful branch saturations after the branch.
% 0.14/0.38 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_20, negated_conjecture, (observational_period(esk2_0))).
% 0.14/0.38 cnf(i_0_19, negated_conjecture, (rapid_change(esk2_0))).
% 0.14/0.38 cnf(i_0_6, plain, (propagation_strategy(first_movers))).
% 0.14/0.38 cnf(i_0_7, plain, (propagation_strategy(efficient_producers))).
% 0.14/0.38 cnf(i_0_18, negated_conjecture, (~extreme(esk2_0))).
% 0.14/0.38 cnf(i_0_17, negated_conjecture, (~selection_favors(first_movers,efficient_producers,esk2_0))).
% 0.14/0.38 cnf(i_0_8, plain, (in_environment(X1,end_time(X1))|~environment(X1))).
% 0.14/0.38 cnf(i_0_13, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.14/0.38 cnf(i_0_5, plain, (extreme(X1)|~empty(X2)|~in_environment(X1,X2)|~environment(X2)|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_3, plain, (selection_favors(efficient_producers,first_movers,X1)|environment(esk1_1(X1))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_2, plain, (selection_favors(efficient_producers,first_movers,X1)|in_environment(X1,esk1_1(X1))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_14, plain, (greater_or_equal(X1,appear(efficient_producers,X2))|greater(appear(efficient_producers,X2),X1)|~in_environment(X2,X1))).
% 0.14/0.38 cnf(i_0_9, plain, (greater(critical_point(X1),end_time(X1))|in_environment(X1,critical_point(X1))|~environment(X1))).
% 0.14/0.38 cnf(i_0_1, plain, (selection_favors(efficient_producers,first_movers,X1)|~selection_favors(efficient_producers,first_movers,end_time(esk1_1(X1)))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_10, plain, (greater_or_equal(end_time(X1),appear(an_organisation,X1))|empty(X1)|~environment(X1))).
% 0.14/0.38 cnf(i_0_15, hypothesis, (selection_favors(first_movers,efficient_producers,X1)|~greater_or_equal(X1,appear(first_movers,X2))|~greater(appear(efficient_producers,X2),X1)|~in_environment(X2,X1)|~environment(X2))).
% 0.14/0.38 cnf(i_0_4, plain, (~rapid_change(X1)|~in_environment(X2,critical_point(X2))|~in_environment(X1,X2)|~environment(X2)|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_12, plain, (selection_favors(first_movers,efficient_producers,end_time(X1))|in_environment(X1,critical_point(X1))|~greater_or_equal(X2,appear(efficient_producers,X1))|~greater(critical_point(X1),X2)|~environment(X1))).
% 0.14/0.38 cnf(i_0_16, hypothesis, (selection_favors(first_movers,efficient_producers,X1)|~greater_or_equal(X1,appear(efficient_producers,X2))|~greater(critical_point(X2),X1)|~in_environment(X2,critical_point(X2))|~environment(X2))).
% 0.14/0.38 cnf(i_0_265, plain, (X26=X26)).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 6 steps
% 0.14/0.38 cnf(i_0_265, plain, (esk2_0=esk2_0), inference(start_rule)).
% 0.14/0.38 cnf(i_0_400, plain, (extreme(esk2_0)), inference(closure_rule, [i_0_0])).
% 0.14/0.38 cnf(i_0_336, plain, (esk2_0=esk2_0), inference(extension_rule, [i_0_269])).
% 0.14/0.38 cnf(i_0_394, plain, (~observational_period(esk2_0)), inference(closure_rule, [i_0_20])).
% 0.14/0.38 cnf(i_0_392, plain, (observational_period(esk2_0)), inference(extension_rule, [i_0_5])).
% 0.14/0.38 cnf(i_0_402, plain, (~in_environment(esk2_0,end_time(esk2_0))), inference(extension_rule, [i_0_8])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_20, negated_conjecture, (observational_period(esk2_0))).
% 0.14/0.38 cnf(i_0_19, negated_conjecture, (rapid_change(esk2_0))).
% 0.14/0.38 cnf(i_0_6, plain, (propagation_strategy(first_movers))).
% 0.14/0.38 cnf(i_0_7, plain, (propagation_strategy(efficient_producers))).
% 0.14/0.38 cnf(i_0_18, negated_conjecture, (~extreme(esk2_0))).
% 0.14/0.38 cnf(i_0_17, negated_conjecture, (~selection_favors(first_movers,efficient_producers,esk2_0))).
% 0.14/0.38 cnf(i_0_8, plain, (in_environment(X1,end_time(X1))|~environment(X1))).
% 0.14/0.38 cnf(i_0_13, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.14/0.38 cnf(i_0_5, plain, (extreme(X1)|~empty(X2)|~in_environment(X1,X2)|~environment(X2)|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_3, plain, (selection_favors(efficient_producers,first_movers,X1)|environment(esk1_1(X1))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_2, plain, (selection_favors(efficient_producers,first_movers,X1)|in_environment(X1,esk1_1(X1))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_14, plain, (greater_or_equal(X1,appear(efficient_producers,X2))|greater(appear(efficient_producers,X2),X1)|~in_environment(X2,X1))).
% 0.14/0.38 cnf(i_0_9, plain, (greater(critical_point(X1),end_time(X1))|in_environment(X1,critical_point(X1))|~environment(X1))).
% 0.14/0.38 cnf(i_0_1, plain, (selection_favors(efficient_producers,first_movers,X1)|~selection_favors(efficient_producers,first_movers,end_time(esk1_1(X1)))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_10, plain, (greater_or_equal(end_time(X1),appear(an_organisation,X1))|empty(X1)|~environment(X1))).
% 0.14/0.38 cnf(i_0_15, hypothesis, (selection_favors(first_movers,efficient_producers,X1)|~greater_or_equal(X1,appear(first_movers,X2))|~greater(appear(efficient_producers,X2),X1)|~in_environment(X2,X1)|~environment(X2))).
% 0.14/0.38 cnf(i_0_4, plain, (~rapid_change(X1)|~in_environment(X2,critical_point(X2))|~in_environment(X1,X2)|~environment(X2)|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_12, plain, (selection_favors(first_movers,efficient_producers,end_time(X1))|in_environment(X1,critical_point(X1))|~greater_or_equal(X2,appear(efficient_producers,X1))|~greater(critical_point(X1),X2)|~environment(X1))).
% 0.14/0.38 cnf(i_0_16, hypothesis, (selection_favors(first_movers,efficient_producers,X1)|~greater_or_equal(X1,appear(efficient_producers,X2))|~greater(critical_point(X2),X1)|~in_environment(X2,critical_point(X2))|~environment(X2))).
% 0.14/0.38 cnf(i_0_265, plain, (X26=X26)).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 6 steps
% 0.14/0.38 cnf(i_0_265, plain, (esk2_0=esk2_0), inference(start_rule)).
% 0.14/0.38 cnf(i_0_400, plain, (extreme(esk2_0)), inference(closure_rule, [i_0_0])).
% 0.14/0.38 cnf(i_0_336, plain, (esk2_0=esk2_0), inference(extension_rule, [i_0_269])).
% 0.14/0.38 cnf(i_0_394, plain, (~observational_period(esk2_0)), inference(closure_rule, [i_0_20])).
% 0.14/0.38 cnf(i_0_392, plain, (observational_period(esk2_0)), inference(extension_rule, [i_0_5])).
% 0.14/0.38 cnf(i_0_402, plain, (~in_environment(esk2_0,end_time(esk2_0))), inference(extension_rule, [i_0_8])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # Creating equality axioms
% 0.14/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.38 # 14162 Satisfiable branch
% 0.14/0.38 # Satisfiable branch found.
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 0 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 0 successful branch saturations after the branch.
% 0.14/0.38 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_20, negated_conjecture, (observational_period(esk2_0))).
% 0.14/0.38 cnf(i_0_19, negated_conjecture, (rapid_change(esk2_0))).
% 0.14/0.38 cnf(i_0_6, plain, (propagation_strategy(first_movers))).
% 0.14/0.38 cnf(i_0_7, plain, (propagation_strategy(efficient_producers))).
% 0.14/0.38 cnf(i_0_18, negated_conjecture, (~extreme(esk2_0))).
% 0.14/0.38 cnf(i_0_17, negated_conjecture, (~selection_favors(first_movers,efficient_producers,esk2_0))).
% 0.14/0.38 cnf(i_0_8, plain, (in_environment(X1,end_time(X1))|~environment(X1))).
% 0.14/0.38 cnf(i_0_13, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.14/0.38 cnf(i_0_5, plain, (extreme(X1)|~empty(X2)|~in_environment(X1,X2)|~environment(X2)|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_3, plain, (selection_favors(efficient_producers,first_movers,X1)|environment(esk1_1(X1))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_2, plain, (selection_favors(efficient_producers,first_movers,X1)|in_environment(X1,esk1_1(X1))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_14, plain, (greater_or_equal(X1,appear(efficient_producers,X2))|greater(appear(efficient_producers,X2),X1)|~in_environment(X2,X1))).
% 0.14/0.38 cnf(i_0_9, plain, (greater(critical_point(X1),end_time(X1))|in_environment(X1,critical_point(X1))|~environment(X1))).
% 0.14/0.38 cnf(i_0_1, plain, (selection_favors(efficient_producers,first_movers,X1)|~selection_favors(efficient_producers,first_movers,end_time(esk1_1(X1)))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_10, plain, (greater_or_equal(end_time(X1),appear(an_organisation,X1))|empty(X1)|~environment(X1))).
% 0.14/0.38 cnf(i_0_15, hypothesis, (selection_favors(first_movers,efficient_producers,X1)|~greater_or_equal(X1,appear(first_movers,X2))|~greater(appear(efficient_producers,X2),X1)|~in_environment(X2,X1)|~environment(X2))).
% 0.14/0.38 cnf(i_0_4, plain, (~rapid_change(X1)|~in_environment(X2,critical_point(X2))|~in_environment(X1,X2)|~environment(X2)|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_12, plain, (selection_favors(first_movers,efficient_producers,end_time(X1))|in_environment(X1,critical_point(X1))|~greater_or_equal(X2,appear(efficient_producers,X1))|~greater(critical_point(X1),X2)|~environment(X1))).
% 0.14/0.38 cnf(i_0_16, hypothesis, (selection_favors(first_movers,efficient_producers,X1)|~greater_or_equal(X1,appear(efficient_producers,X2))|~greater(critical_point(X2),X1)|~in_environment(X2,critical_point(X2))|~environment(X2))).
% 0.14/0.38 cnf(i_0_265, plain, (X26=X26)).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 6 steps
% 0.14/0.38 cnf(i_0_265, plain, (esk2_0=esk2_0), inference(start_rule)).
% 0.14/0.38 cnf(i_0_400, plain, (extreme(esk2_0)), inference(closure_rule, [i_0_0])).
% 0.14/0.38 cnf(i_0_336, plain, (esk2_0=esk2_0), inference(extension_rule, [i_0_269])).
% 0.14/0.38 cnf(i_0_394, plain, (~observational_period(esk2_0)), inference(closure_rule, [i_0_20])).
% 0.14/0.38 cnf(i_0_392, plain, (observational_period(esk2_0)), inference(extension_rule, [i_0_5])).
% 0.14/0.38 cnf(i_0_402, plain, (~in_environment(esk2_0,end_time(esk2_0))), inference(extension_rule, [i_0_8])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # Satisfiable branch found.
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 0 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 0 successful branch saturations after the branch.
% 0.14/0.38 # Satisfiable branch found.
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 0 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 0 successful branch saturations after the branch.
% 0.14/0.38 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_20, negated_conjecture, (observational_period(esk2_0))).
% 0.14/0.38 cnf(i_0_19, negated_conjecture, (rapid_change(esk2_0))).
% 0.14/0.38 cnf(i_0_6, plain, (propagation_strategy(first_movers))).
% 0.14/0.38 cnf(i_0_7, plain, (propagation_strategy(efficient_producers))).
% 0.14/0.38 cnf(i_0_18, negated_conjecture, (~extreme(esk2_0))).
% 0.14/0.38 cnf(i_0_17, negated_conjecture, (~selection_favors(first_movers,efficient_producers,esk2_0))).
% 0.14/0.38 cnf(i_0_8, plain, (in_environment(X1,end_time(X1))|~environment(X1))).
% 0.14/0.38 cnf(i_0_13, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.14/0.38 cnf(i_0_5, plain, (extreme(X1)|~empty(X2)|~in_environment(X1,X2)|~environment(X2)|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_3, plain, (selection_favors(efficient_producers,first_movers,X1)|environment(esk1_1(X1))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_2, plain, (selection_favors(efficient_producers,first_movers,X1)|in_environment(X1,esk1_1(X1))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_14, plain, (greater_or_equal(X1,appear(efficient_producers,X2))|greater(appear(efficient_producers,X2),X1)|~in_environment(X2,X1))).
% 0.14/0.38 cnf(i_0_9, plain, (greater(critical_point(X1),end_time(X1))|in_environment(X1,critical_point(X1))|~environment(X1))).
% 0.14/0.38 cnf(i_0_1, plain, (selection_favors(efficient_producers,first_movers,X1)|~selection_favors(efficient_producers,first_movers,end_time(esk1_1(X1)))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_10, plain, (greater_or_equal(end_time(X1),appear(an_organisation,X1))|empty(X1)|~environment(X1))).
% 0.14/0.38 cnf(i_0_15, hypothesis, (selection_favors(first_movers,efficient_producers,X1)|~greater_or_equal(X1,appear(first_movers,X2))|~greater(appear(efficient_producers,X2),X1)|~in_environment(X2,X1)|~environment(X2))).
% 0.14/0.38 cnf(i_0_4, plain, (~rapid_change(X1)|~in_environment(X2,critical_point(X2))|~in_environment(X1,X2)|~environment(X2)|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_12, plain, (selection_favors(first_movers,efficient_producers,end_time(X1))|in_environment(X1,critical_point(X1))|~greater_or_equal(X2,appear(efficient_producers,X1))|~greater(critical_point(X1),X2)|~environment(X1))).
% 0.14/0.38 cnf(i_0_16, hypothesis, (selection_favors(first_movers,efficient_producers,X1)|~greater_or_equal(X1,appear(efficient_producers,X2))|~greater(critical_point(X2),X1)|~in_environment(X2,critical_point(X2))|~environment(X2))).
% 0.14/0.38 cnf(i_0_265, plain, (X26=X26)).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 6 steps
% 0.14/0.38 cnf(i_0_265, plain, (esk2_0=esk2_0), inference(start_rule)).
% 0.14/0.38 cnf(i_0_400, plain, (extreme(esk2_0)), inference(closure_rule, [i_0_0])).
% 0.14/0.38 cnf(i_0_336, plain, (esk2_0=esk2_0), inference(extension_rule, [i_0_269])).
% 0.14/0.38 cnf(i_0_394, plain, (~observational_period(esk2_0)), inference(closure_rule, [i_0_20])).
% 0.14/0.38 cnf(i_0_392, plain, (observational_period(esk2_0)), inference(extension_rule, [i_0_5])).
% 0.14/0.38 cnf(i_0_402, plain, (~in_environment(esk2_0,end_time(esk2_0))), inference(extension_rule, [i_0_8])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_20, negated_conjecture, (observational_period(esk2_0))).
% 0.14/0.38 cnf(i_0_19, negated_conjecture, (rapid_change(esk2_0))).
% 0.14/0.38 cnf(i_0_6, plain, (propagation_strategy(first_movers))).
% 0.14/0.38 cnf(i_0_7, plain, (propagation_strategy(efficient_producers))).
% 0.14/0.38 cnf(i_0_18, negated_conjecture, (~extreme(esk2_0))).
% 0.14/0.38 cnf(i_0_17, negated_conjecture, (~selection_favors(first_movers,efficient_producers,esk2_0))).
% 0.14/0.38 cnf(i_0_8, plain, (in_environment(X1,end_time(X1))|~environment(X1))).
% 0.14/0.38 cnf(i_0_13, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.14/0.38 cnf(i_0_5, plain, (extreme(X1)|~empty(X2)|~in_environment(X1,X2)|~environment(X2)|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_3, plain, (selection_favors(efficient_producers,first_movers,X1)|environment(esk1_1(X1))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_2, plain, (selection_favors(efficient_producers,first_movers,X1)|in_environment(X1,esk1_1(X1))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_14, plain, (greater_or_equal(X1,appear(efficient_producers,X2))|greater(appear(efficient_producers,X2),X1)|~in_environment(X2,X1))).
% 0.14/0.38 cnf(i_0_9, plain, (greater(critical_point(X1),end_time(X1))|in_environment(X1,critical_point(X1))|~environment(X1))).
% 0.14/0.38 cnf(i_0_1, plain, (selection_favors(efficient_producers,first_movers,X1)|~selection_favors(efficient_producers,first_movers,end_time(esk1_1(X1)))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_10, plain, (greater_or_equal(end_time(X1),appear(an_organisation,X1))|empty(X1)|~environment(X1))).
% 0.14/0.38 cnf(i_0_15, hypothesis, (selection_favors(first_movers,efficient_producers,X1)|~greater_or_equal(X1,appear(first_movers,X2))|~greater(appear(efficient_producers,X2),X1)|~in_environment(X2,X1)|~environment(X2))).
% 0.14/0.38 cnf(i_0_4, plain, (~rapid_change(X1)|~in_environment(X2,critical_point(X2))|~in_environment(X1,X2)|~environment(X2)|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_12, plain, (selection_favors(first_movers,efficient_producers,end_time(X1))|in_environment(X1,critical_point(X1))|~greater_or_equal(X2,appear(efficient_producers,X1))|~greater(critical_point(X1),X2)|~environment(X1))).
% 0.14/0.38 cnf(i_0_16, hypothesis, (selection_favors(first_movers,efficient_producers,X1)|~greater_or_equal(X1,appear(efficient_producers,X2))|~greater(critical_point(X2),X1)|~in_environment(X2,critical_point(X2))|~environment(X2))).
% 0.14/0.38 cnf(i_0_265, plain, (X26=X26)).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 6 steps
% 0.14/0.38 cnf(i_0_265, plain, (esk2_0=esk2_0), inference(start_rule)).
% 0.14/0.38 cnf(i_0_400, plain, (extreme(esk2_0)), inference(closure_rule, [i_0_0])).
% 0.14/0.38 cnf(i_0_336, plain, (esk2_0=esk2_0), inference(extension_rule, [i_0_269])).
% 0.14/0.38 cnf(i_0_394, plain, (~observational_period(esk2_0)), inference(closure_rule, [i_0_20])).
% 0.14/0.38 cnf(i_0_392, plain, (observational_period(esk2_0)), inference(extension_rule, [i_0_5])).
% 0.14/0.38 cnf(i_0_402, plain, (~in_environment(esk2_0,end_time(esk2_0))), inference(extension_rule, [i_0_8])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # Creating equality axioms
% 0.14/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.38 # 14163 Satisfiable branch
% 0.14/0.38 # Satisfiable branch found.
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 0 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 0 successful branch saturations after the branch.
% 0.14/0.38 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_20, negated_conjecture, (observational_period(esk2_0))).
% 0.14/0.38 cnf(i_0_19, negated_conjecture, (rapid_change(esk2_0))).
% 0.14/0.38 cnf(i_0_6, plain, (propagation_strategy(first_movers))).
% 0.14/0.38 cnf(i_0_7, plain, (propagation_strategy(efficient_producers))).
% 0.14/0.38 cnf(i_0_18, negated_conjecture, (~extreme(esk2_0))).
% 0.14/0.38 cnf(i_0_17, negated_conjecture, (~selection_favors(first_movers,efficient_producers,esk2_0))).
% 0.14/0.38 cnf(i_0_8, plain, (in_environment(X1,end_time(X1))|~environment(X1))).
% 0.14/0.38 cnf(i_0_13, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.14/0.38 cnf(i_0_5, plain, (extreme(X1)|~empty(X2)|~in_environment(X1,X2)|~environment(X2)|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_3, plain, (selection_favors(efficient_producers,first_movers,X1)|environment(esk1_1(X1))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_2, plain, (selection_favors(efficient_producers,first_movers,X1)|in_environment(X1,esk1_1(X1))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_14, plain, (greater_or_equal(X1,appear(efficient_producers,X2))|greater(appear(efficient_producers,X2),X1)|~in_environment(X2,X1))).
% 0.14/0.38 cnf(i_0_9, plain, (greater(critical_point(X1),end_time(X1))|in_environment(X1,critical_point(X1))|~environment(X1))).
% 0.14/0.38 cnf(i_0_1, plain, (selection_favors(efficient_producers,first_movers,X1)|~selection_favors(efficient_producers,first_movers,end_time(esk1_1(X1)))|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_10, plain, (greater_or_equal(end_time(X1),appear(an_organisation,X1))|empty(X1)|~environment(X1))).
% 0.14/0.38 cnf(i_0_15, hypothesis, (selection_favors(first_movers,efficient_producers,X1)|~greater_or_equal(X1,appear(first_movers,X2))|~greater(appear(efficient_producers,X2),X1)|~in_environment(X2,X1)|~environment(X2))).
% 0.14/0.38 cnf(i_0_4, plain, (~rapid_change(X1)|~in_environment(X2,critical_point(X2))|~in_environment(X1,X2)|~environment(X2)|~observational_period(X1))).
% 0.14/0.38 cnf(i_0_12, plain, (selection_favors(first_movers,efficient_producers,end_time(X1))|in_environment(X1,critical_point(X1))|~greater_or_equal(X2,appear(efficient_producers,X1))|~greater(critical_point(X1),X2)|~environment(X1))).
% 0.14/0.38 cnf(i_0_16, hypothesis, (selection_favors(first_movers,efficient_producers,X1)|~greater_or_equal(X1,appear(efficient_producers,X2))|~greater(critical_point(X2),X1)|~in_environment(X2,critical_point(X2))|~environment(X2))).
% 0.14/0.38 cnf(i_0_265, plain, (X26=X26)).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 6 steps
% 0.14/0.38 cnf(i_0_265, plain, (esk2_0=esk2_0), inference(start_rule)).
% 0.14/0.38 cnf(i_0_400, plain, (extreme(esk2_0)), inference(closure_rule, [i_0_0])).
% 0.14/0.38 cnf(i_0_336, plain, (esk2_0=esk2_0), inference(extension_rule, [i_0_269])).
% 0.14/0.38 cnf(i_0_394, plain, (~observational_period(esk2_0)), inference(closure_rule, [i_0_20])).
% 0.14/0.38 cnf(i_0_392, plain, (observational_period(esk2_0)), inference(extension_rule, [i_0_5])).
% 0.14/0.38 cnf(i_0_402, plain, (~in_environment(esk2_0,end_time(esk2_0))), inference(extension_rule, [i_0_8])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # Child (14156) has found a proof.
% 0.14/0.38
% 0.14/0.38 # Proof search is over...
% 0.14/0.38 # Freeing feature tree
%------------------------------------------------------------------------------