TSTP Solution File: GRP131-2.002 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP131-2.002 : TPTP v8.1.0. Released v1.2.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 : n018.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 : Sat Jul 16 09:04:55 EDT 2022
% Result : Unsatisfiable 0.14s 0.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP131-2.002 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 13 11:52:57 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.38 # No SInE strategy applied
% 0.14/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.38 #
% 0.14/0.38 # Presaturation interreduction done
% 0.14/0.38 # Number of axioms: 13 Number of unprocessed: 13
% 0.14/0.38 # Tableaux proof search.
% 0.14/0.38 # APR header successfully linked.
% 0.14/0.38 # Hello from C++
% 0.14/0.38 # The folding up rule is enabled...
% 0.14/0.38 # Local unification is enabled...
% 0.14/0.38 # Any saturation attempts will use folding labels...
% 0.14/0.38 # 13 beginning clauses after preprocessing and clausification
% 0.14/0.38 # Creating start rules for all 2 conjectures.
% 0.14/0.38 # There are 2 start rule candidates:
% 0.14/0.38 # Found 6 unit axioms.
% 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.38 # 2 start rule tableaux created.
% 0.14/0.38 # 7 extension rule candidate clauses
% 0.14/0.38 # 6 unit axiom clauses
% 0.14/0.38
% 0.14/0.38 # Requested 8, 32 cores available to the main process.
% 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 2
% 0.14/0.38 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.38 # We now have 8 tableaux to operate on
% 0.14/0.40 # There were 4 total branch saturation attempts.
% 0.14/0.40 # There were 0 of these attempts blocked.
% 0.14/0.40 # There were 0 deferred branch saturation attempts.
% 0.14/0.40 # There were 0 free duplicated saturations.
% 0.14/0.40 # There were 4 total successful branch saturations.
% 0.14/0.40 # There were 0 successful branch saturations in interreduction.
% 0.14/0.40 # There were 0 successful branch saturations on the branch.
% 0.14/0.40 # There were 4 successful branch saturations after the branch.
% 0.14/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.40 # Begin clausification derivation
% 0.14/0.40
% 0.14/0.40 # End clausification derivation
% 0.14/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.40 cnf(i_0_17, plain, (group_element(e_1))).
% 0.14/0.40 cnf(i_0_18, plain, (group_element(e_2))).
% 0.14/0.40 cnf(i_0_14, plain, (next(e_1,e_2))).
% 0.14/0.40 cnf(i_0_15, plain, (greater(e_2,e_1))).
% 0.14/0.40 cnf(i_0_19, plain, (~equalish(e_1,e_2))).
% 0.14/0.40 cnf(i_0_20, plain, (~equalish(e_2,e_1))).
% 0.14/0.40 cnf(i_0_22, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.14/0.40 cnf(i_0_16, plain, (~product(X1,e_1,X2)|~greater(X2,X3)|~next(X1,X3))).
% 0.14/0.40 cnf(i_0_23, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))).
% 0.14/0.40 cnf(i_0_24, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))).
% 0.14/0.40 cnf(i_0_21, plain, (product(X1,X2,e_2)|product(X1,X2,e_1)|~group_element(X2)|~group_element(X1))).
% 0.14/0.40 cnf(i_0_26, negated_conjecture, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X5)|~product(X4,X2,X6)|~product(X5,X1,X6))).
% 0.14/0.40 cnf(i_0_25, negated_conjecture, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X5,X1)|~product(X2,X4,X6)|~product(X1,X5,X6))).
% 0.14/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.40 # Begin printing tableau
% 0.14/0.40 # Found 25 steps
% 0.14/0.40 cnf(i_0_26, negated_conjecture, (equalish(e_1,e_2)|~product(e_1,e_2,e_1)|~product(e_1,e_1,e_2)|~product(e_1,e_2,e_1)|~product(e_2,e_1,e_1)), inference(start_rule)).
% 0.14/0.40 cnf(i_0_32, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_19])).
% 0.14/0.40 cnf(i_0_33, plain, (~product(e_1,e_2,e_1)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_155, plain, (~group_element(e_2)), inference(closure_rule, [i_0_18])).
% 0.14/0.40 cnf(i_0_156, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_153, plain, (product(e_1,e_2,e_2)), inference(extension_rule, [i_0_23])).
% 0.14/0.40 cnf(i_0_225, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_19])).
% 0.14/0.40 cnf(i_0_227, plain, (~product(e_1,e_1,e_2)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_236, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_237, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_34, plain, (~product(e_1,e_1,e_2)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_262, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_263, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_261, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_24])).
% 0.14/0.40 cnf(i_0_319, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_20])).
% 0.14/0.40 cnf(i_0_321, plain, (~product(e_2,e_1,e_1)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_340, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_341, plain, (~group_element(e_2)), inference(closure_rule, [i_0_18])).
% 0.14/0.40 cnf(i_0_35, plain, (~product(e_1,e_2,e_1)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_366, plain, (~group_element(e_2)), inference(closure_rule, [i_0_18])).
% 0.14/0.40 cnf(i_0_367, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_36, plain, (~product(e_2,e_1,e_1)), inference(etableau_closure_rule, [i_0_36, ...])).
% 0.14/0.40 cnf(i_0_235, plain, (product(e_1,e_1,e_1)), inference(etableau_closure_rule, [i_0_235, ...])).
% 0.14/0.40 cnf(i_0_338, plain, (product(e_2,e_1,e_2)), inference(etableau_closure_rule, [i_0_338, ...])).
% 0.14/0.40 cnf(i_0_364, plain, (product(e_1,e_2,e_2)), inference(etableau_closure_rule, [i_0_364, ...])).
% 0.14/0.40 # End printing tableau
% 0.14/0.40 # SZS output end
% 0.14/0.40 # Branches closed with saturation will be marked with an "s"
% 0.14/0.40 # There were 4 total branch saturation attempts.
% 0.14/0.40 # There were 0 of these attempts blocked.
% 0.14/0.40 # There were 0 deferred branch saturation attempts.
% 0.14/0.40 # There were 0 free duplicated saturations.
% 0.14/0.40 # There were 4 total successful branch saturations.
% 0.14/0.40 # There were 0 successful branch saturations in interreduction.
% 0.14/0.40 # There were 0 successful branch saturations on the branch.
% 0.14/0.40 # There were 4 successful branch saturations after the branch.
% 0.14/0.40 # There were 4 total branch saturation attempts.
% 0.14/0.40 # There were 0 of these attempts blocked.
% 0.14/0.40 # There were 0 deferred branch saturation attempts.
% 0.14/0.40 # There were 0 free duplicated saturations.
% 0.14/0.40 # There were 4 total successful branch saturations.
% 0.14/0.40 # There were 0 successful branch saturations in interreduction.
% 0.14/0.40 # There were 0 successful branch saturations on the branch.
% 0.14/0.40 # There were 4 successful branch saturations after the branch.
% 0.14/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.40 # Begin clausification derivation
% 0.14/0.40
% 0.14/0.40 # End clausification derivation
% 0.14/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.40 cnf(i_0_17, plain, (group_element(e_1))).
% 0.14/0.40 cnf(i_0_18, plain, (group_element(e_2))).
% 0.14/0.40 cnf(i_0_14, plain, (next(e_1,e_2))).
% 0.14/0.40 cnf(i_0_15, plain, (greater(e_2,e_1))).
% 0.14/0.40 cnf(i_0_19, plain, (~equalish(e_1,e_2))).
% 0.14/0.40 cnf(i_0_20, plain, (~equalish(e_2,e_1))).
% 0.14/0.40 cnf(i_0_22, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.14/0.40 cnf(i_0_16, plain, (~product(X1,e_1,X2)|~greater(X2,X3)|~next(X1,X3))).
% 0.14/0.40 cnf(i_0_23, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))).
% 0.14/0.40 cnf(i_0_24, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))).
% 0.14/0.40 cnf(i_0_21, plain, (product(X1,X2,e_2)|product(X1,X2,e_1)|~group_element(X2)|~group_element(X1))).
% 0.14/0.40 cnf(i_0_26, negated_conjecture, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X5)|~product(X4,X2,X6)|~product(X5,X1,X6))).
% 0.14/0.40 cnf(i_0_25, negated_conjecture, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X5,X1)|~product(X2,X4,X6)|~product(X1,X5,X6))).
% 0.14/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.40 # Begin printing tableau
% 0.14/0.40 # Found 25 steps
% 0.14/0.40 cnf(i_0_26, negated_conjecture, (equalish(e_1,e_2)|~product(e_1,e_2,e_2)|~product(e_1,e_1,e_2)|~product(e_2,e_2,e_2)|~product(e_2,e_1,e_2)), inference(start_rule)).
% 0.14/0.40 cnf(i_0_32, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_19])).
% 0.14/0.40 cnf(i_0_33, plain, (~product(e_1,e_2,e_2)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_155, plain, (~group_element(e_2)), inference(closure_rule, [i_0_18])).
% 0.14/0.40 cnf(i_0_156, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_154, plain, (product(e_1,e_2,e_1)), inference(extension_rule, [i_0_23])).
% 0.14/0.40 cnf(i_0_225, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_19])).
% 0.14/0.40 cnf(i_0_227, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_236, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_237, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_34, plain, (~product(e_1,e_1,e_2)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_262, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_263, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_261, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_24])).
% 0.14/0.40 cnf(i_0_319, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_20])).
% 0.14/0.40 cnf(i_0_321, plain, (~product(e_2,e_1,e_1)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_340, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_341, plain, (~group_element(e_2)), inference(closure_rule, [i_0_18])).
% 0.14/0.40 cnf(i_0_35, plain, (~product(e_2,e_2,e_2)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_366, plain, (~group_element(e_2)), inference(closure_rule, [i_0_18])).
% 0.14/0.40 cnf(i_0_367, plain, (~group_element(e_2)), inference(closure_rule, [i_0_18])).
% 0.14/0.40 cnf(i_0_36, plain, (~product(e_2,e_1,e_2)), inference(etableau_closure_rule, [i_0_36, ...])).
% 0.14/0.40 cnf(i_0_234, plain, (product(e_1,e_1,e_2)), inference(etableau_closure_rule, [i_0_234, ...])).
% 0.14/0.40 cnf(i_0_338, plain, (product(e_2,e_1,e_2)), inference(etableau_closure_rule, [i_0_338, ...])).
% 0.14/0.40 cnf(i_0_365, plain, (product(e_2,e_2,e_1)), inference(etableau_closure_rule, [i_0_365, ...])).
% 0.14/0.40 # End printing tableau
% 0.14/0.40 # SZS output end
% 0.14/0.40 # Branches closed with saturation will be marked with an "s"
% 0.14/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.40 # Begin clausification derivation
% 0.14/0.40
% 0.14/0.40 # End clausification derivation
% 0.14/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.40 cnf(i_0_17, plain, (group_element(e_1))).
% 0.14/0.40 cnf(i_0_18, plain, (group_element(e_2))).
% 0.14/0.40 cnf(i_0_14, plain, (next(e_1,e_2))).
% 0.14/0.40 cnf(i_0_15, plain, (greater(e_2,e_1))).
% 0.14/0.40 cnf(i_0_19, plain, (~equalish(e_1,e_2))).
% 0.14/0.40 cnf(i_0_20, plain, (~equalish(e_2,e_1))).
% 0.14/0.40 cnf(i_0_22, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.14/0.40 cnf(i_0_16, plain, (~product(X1,e_1,X2)|~greater(X2,X3)|~next(X1,X3))).
% 0.14/0.40 cnf(i_0_23, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))).
% 0.14/0.40 cnf(i_0_24, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))).
% 0.14/0.40 cnf(i_0_21, plain, (product(X1,X2,e_2)|product(X1,X2,e_1)|~group_element(X2)|~group_element(X1))).
% 0.14/0.40 cnf(i_0_26, negated_conjecture, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X5)|~product(X4,X2,X6)|~product(X5,X1,X6))).
% 0.14/0.40 cnf(i_0_25, negated_conjecture, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X5,X1)|~product(X2,X4,X6)|~product(X1,X5,X6))).
% 0.14/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.40 # Begin printing tableau
% 0.14/0.40 # Found 17 steps
% 0.14/0.40 cnf(i_0_25, negated_conjecture, (equalish(e_1,e_2)|~product(e_1,e_1,e_2)|~product(e_1,e_1,e_1)|~product(e_2,e_1,e_2)|~product(e_1,e_1,e_2)), inference(start_rule)).
% 0.14/0.40 cnf(i_0_27, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_19])).
% 0.14/0.40 cnf(i_0_31, plain, (~product(e_1,e_1,e_2)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_129, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_130, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_128, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_23])).
% 0.14/0.40 cnf(i_0_277, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_20])).
% 0.14/0.40 cnf(i_0_279, plain, (~product(e_1,e_2,e_1)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_285, plain, (~group_element(e_2)), inference(closure_rule, [i_0_18])).
% 0.14/0.40 cnf(i_0_286, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_28, plain, (~product(e_1,e_1,e_2)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_311, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_312, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_29, plain, (~product(e_1,e_1,e_1)), inference(etableau_closure_rule, [i_0_29, ...])).
% 0.14/0.40 cnf(i_0_30, plain, (~product(e_2,e_1,e_2)), inference(etableau_closure_rule, [i_0_30, ...])).
% 0.14/0.40 cnf(i_0_283, plain, (product(e_1,e_2,e_2)), inference(etableau_closure_rule, [i_0_283, ...])).
% 0.14/0.40 cnf(i_0_310, plain, (product(e_1,e_1,e_1)), inference(etableau_closure_rule, [i_0_310, ...])).
% 0.14/0.40 # End printing tableau
% 0.14/0.40 # SZS output end
% 0.14/0.40 # Branches closed with saturation will be marked with an "s"
% 0.14/0.40 # There were 4 total branch saturation attempts.
% 0.14/0.40 # There were 0 of these attempts blocked.
% 0.14/0.40 # There were 0 deferred branch saturation attempts.
% 0.14/0.40 # There were 0 free duplicated saturations.
% 0.14/0.40 # There were 4 total successful branch saturations.
% 0.14/0.40 # There were 0 successful branch saturations in interreduction.
% 0.14/0.40 # There were 0 successful branch saturations on the branch.
% 0.14/0.40 # There were 4 successful branch saturations after the branch.
% 0.14/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.40 # Begin clausification derivation
% 0.14/0.40
% 0.14/0.40 # End clausification derivation
% 0.14/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.40 cnf(i_0_17, plain, (group_element(e_1))).
% 0.14/0.40 cnf(i_0_18, plain, (group_element(e_2))).
% 0.14/0.40 cnf(i_0_14, plain, (next(e_1,e_2))).
% 0.14/0.40 cnf(i_0_15, plain, (greater(e_2,e_1))).
% 0.14/0.40 cnf(i_0_19, plain, (~equalish(e_1,e_2))).
% 0.14/0.40 cnf(i_0_20, plain, (~equalish(e_2,e_1))).
% 0.14/0.40 cnf(i_0_22, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.14/0.40 cnf(i_0_16, plain, (~product(X1,e_1,X2)|~greater(X2,X3)|~next(X1,X3))).
% 0.14/0.40 cnf(i_0_23, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))).
% 0.14/0.40 cnf(i_0_24, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))).
% 0.14/0.40 cnf(i_0_21, plain, (product(X1,X2,e_2)|product(X1,X2,e_1)|~group_element(X2)|~group_element(X1))).
% 0.14/0.40 cnf(i_0_26, negated_conjecture, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X5)|~product(X4,X2,X6)|~product(X5,X1,X6))).
% 0.14/0.40 cnf(i_0_25, negated_conjecture, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X5,X1)|~product(X2,X4,X6)|~product(X1,X5,X6))).
% 0.14/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.40 # Begin printing tableau
% 0.14/0.40 # Found 17 steps
% 0.14/0.40 cnf(i_0_25, negated_conjecture, (equalish(e_1,e_2)|~product(e_1,e_1,e_2)|~product(e_1,e_1,e_1)|~product(e_2,e_1,e_1)|~product(e_1,e_1,e_1)), inference(start_rule)).
% 0.14/0.40 cnf(i_0_27, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_19])).
% 0.14/0.40 cnf(i_0_31, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_129, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_130, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_127, plain, (product(e_1,e_1,e_2)), inference(extension_rule, [i_0_23])).
% 0.14/0.40 cnf(i_0_277, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_20])).
% 0.14/0.40 cnf(i_0_279, plain, (~product(e_1,e_2,e_2)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_285, plain, (~group_element(e_2)), inference(closure_rule, [i_0_18])).
% 0.14/0.40 cnf(i_0_286, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_28, plain, (~product(e_1,e_1,e_2)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_311, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_312, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_29, plain, (~product(e_1,e_1,e_1)), inference(etableau_closure_rule, [i_0_29, ...])).
% 0.14/0.40 cnf(i_0_30, plain, (~product(e_2,e_1,e_1)), inference(etableau_closure_rule, [i_0_30, ...])).
% 0.14/0.40 cnf(i_0_284, plain, (product(e_1,e_2,e_1)), inference(etableau_closure_rule, [i_0_284, ...])).
% 0.14/0.40 cnf(i_0_310, plain, (product(e_1,e_1,e_1)), inference(etableau_closure_rule, [i_0_310, ...])).
% 0.14/0.40 # End printing tableau
% 0.14/0.40 # SZS output end
% 0.14/0.40 # Branches closed with saturation will be marked with an "s"
% 0.14/0.40 # There were 4 total branch saturation attempts.
% 0.14/0.40 # There were 0 of these attempts blocked.
% 0.14/0.40 # There were 0 deferred branch saturation attempts.
% 0.14/0.40 # There were 0 free duplicated saturations.
% 0.14/0.40 # There were 4 total successful branch saturations.
% 0.14/0.40 # There were 0 successful branch saturations in interreduction.
% 0.14/0.40 # There were 0 successful branch saturations on the branch.
% 0.14/0.40 # There were 4 successful branch saturations after the branch.
% 0.14/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.40 # Begin clausification derivation
% 0.14/0.40
% 0.14/0.40 # End clausification derivation
% 0.14/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.40 cnf(i_0_17, plain, (group_element(e_1))).
% 0.14/0.40 cnf(i_0_18, plain, (group_element(e_2))).
% 0.14/0.40 cnf(i_0_14, plain, (next(e_1,e_2))).
% 0.14/0.40 cnf(i_0_15, plain, (greater(e_2,e_1))).
% 0.14/0.40 cnf(i_0_19, plain, (~equalish(e_1,e_2))).
% 0.14/0.40 cnf(i_0_20, plain, (~equalish(e_2,e_1))).
% 0.14/0.40 cnf(i_0_22, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.14/0.40 cnf(i_0_16, plain, (~product(X1,e_1,X2)|~greater(X2,X3)|~next(X1,X3))).
% 0.14/0.40 cnf(i_0_23, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))).
% 0.14/0.40 cnf(i_0_24, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))).
% 0.14/0.40 cnf(i_0_21, plain, (product(X1,X2,e_2)|product(X1,X2,e_1)|~group_element(X2)|~group_element(X1))).
% 0.14/0.40 cnf(i_0_26, negated_conjecture, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X5)|~product(X4,X2,X6)|~product(X5,X1,X6))).
% 0.14/0.40 cnf(i_0_25, negated_conjecture, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X5,X1)|~product(X2,X4,X6)|~product(X1,X5,X6))).
% 0.14/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.40 # Begin printing tableau
% 0.14/0.40 # Found 25 steps
% 0.14/0.40 cnf(i_0_25, negated_conjecture, (equalish(e_1,e_2)|~product(e_1,e_1,e_2)|~product(e_1,e_1,e_1)|~product(e_2,e_1,e_1)|~product(e_1,e_1,e_1)), inference(start_rule)).
% 0.14/0.40 cnf(i_0_27, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_19])).
% 0.14/0.40 cnf(i_0_30, plain, (~product(e_2,e_1,e_1)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_103, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_104, plain, (~group_element(e_2)), inference(closure_rule, [i_0_18])).
% 0.14/0.40 cnf(i_0_101, plain, (product(e_2,e_1,e_2)), inference(extension_rule, [i_0_23])).
% 0.14/0.40 cnf(i_0_277, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_20])).
% 0.14/0.40 cnf(i_0_279, plain, (~product(e_2,e_2,e_2)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_285, plain, (~group_element(e_2)), inference(closure_rule, [i_0_18])).
% 0.14/0.40 cnf(i_0_286, plain, (~group_element(e_2)), inference(closure_rule, [i_0_18])).
% 0.14/0.40 cnf(i_0_28, plain, (~product(e_1,e_1,e_2)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_311, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_312, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_310, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_24])).
% 0.14/0.40 cnf(i_0_313, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_20])).
% 0.14/0.40 cnf(i_0_315, plain, (~product(e_2,e_1,e_1)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_337, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_338, plain, (~group_element(e_2)), inference(closure_rule, [i_0_18])).
% 0.14/0.40 cnf(i_0_29, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_21])).
% 0.14/0.40 cnf(i_0_363, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_364, plain, (~group_element(e_1)), inference(closure_rule, [i_0_17])).
% 0.14/0.40 cnf(i_0_31, plain, (~product(e_1,e_1,e_1)), inference(etableau_closure_rule, [i_0_31, ...])).
% 0.14/0.40 cnf(i_0_284, plain, (product(e_2,e_2,e_1)), inference(etableau_closure_rule, [i_0_284, ...])).
% 0.14/0.40 cnf(i_0_335, plain, (product(e_2,e_1,e_2)), inference(etableau_closure_rule, [i_0_335, ...])).
% 0.14/0.40 cnf(i_0_361, plain, (product(e_1,e_1,e_2)), inference(etableau_closure_rule, [i_0_361, ...])).
% 0.14/0.40 # End printing tableau
% 0.14/0.40 # SZS output end
% 0.14/0.40 # Branches closed with saturation will be marked with an "s"
% 0.14/0.40 # Child (32410) has found a proof.
% 0.14/0.40
% 0.14/0.40 # Proof search is over...
% 0.14/0.40 # Freeing feature tree
%------------------------------------------------------------------------------