TSTP Solution File: GRP135-1.002 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP135-1.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 : n025.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:58 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 : GRP135-1.002 : TPTP v8.1.0. Released v1.2.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.14/0.36 % Computer : n025.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 13 20:57:09 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.38 # No SInE strategy applied
% 0.21/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.21/0.38 #
% 0.21/0.38 # Presaturation interreduction done
% 0.21/0.38 # Number of axioms: 9 Number of unprocessed: 9
% 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.39 # The folding up rule is enabled...
% 0.21/0.39 # Local unification is enabled...
% 0.21/0.39 # Any saturation attempts will use folding labels...
% 0.21/0.39 # 9 beginning clauses after preprocessing and clausification
% 0.21/0.39 # Creating start rules for all 1 conjectures.
% 0.21/0.39 # There are 1 start rule candidates:
% 0.21/0.39 # Found 4 unit axioms.
% 0.21/0.39 # 1 start rule tableaux created.
% 0.21/0.39 # 5 extension rule candidate clauses
% 0.21/0.39 # 4 unit axiom clauses
% 0.21/0.39
% 0.21/0.39 # Requested 8, 32 cores available to the main process.
% 0.21/0.39 # There are not enough tableaux to fork, creating more from the initial 1
% 0.21/0.39 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.39 # We now have 9 tableaux to operate on
% 0.21/0.39 # There were 3 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 3 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 3 successful branch saturations after the branch.
% 0.21/0.39 # There were 3 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 3 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 3 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_10, plain, (group_element(e_1))).
% 0.21/0.39 cnf(i_0_11, plain, (group_element(e_2))).
% 0.21/0.39 cnf(i_0_12, plain, (~equalish(e_1,e_2))).
% 0.21/0.39 cnf(i_0_13, plain, (~equalish(e_2,e_1))).
% 0.21/0.39 cnf(i_0_15, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.21/0.39 cnf(i_0_14, plain, (product(X1,X2,e_2)|product(X1,X2,e_1)|~group_element(X2)|~group_element(X1))).
% 0.21/0.39 cnf(i_0_16, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))).
% 0.21/0.39 cnf(i_0_17, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))).
% 0.21/0.39 cnf(i_0_18, negated_conjecture, (product(X1,X2,X3)|~product(X4,X2,X1)|~product(X2,X3,X4))).
% 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 16 steps
% 0.21/0.39 cnf(i_0_18, negated_conjecture, (product(e_1,e_1,e_2)|~product(e_1,e_1,e_1)|~product(e_1,e_2,e_1)), inference(start_rule)).
% 0.21/0.39 cnf(i_0_20, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_14])).
% 0.21/0.39 cnf(i_0_43, plain, (~group_element(e_1)), inference(closure_rule, [i_0_10])).
% 0.21/0.39 cnf(i_0_44, plain, (~group_element(e_1)), inference(closure_rule, [i_0_10])).
% 0.21/0.39 cnf(i_0_41, plain, (product(e_1,e_1,e_2)), inference(extension_rule, [i_0_16])).
% 0.21/0.39 cnf(i_0_93, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_13])).
% 0.21/0.39 cnf(i_0_95, plain, (~product(e_1,e_2,e_2)), inference(extension_rule, [i_0_14])).
% 0.21/0.39 cnf(i_0_98, plain, (~group_element(e_2)), inference(closure_rule, [i_0_11])).
% 0.21/0.39 cnf(i_0_99, plain, (~group_element(e_1)), inference(closure_rule, [i_0_10])).
% 0.21/0.39 cnf(i_0_19, plain, (product(e_1,e_1,e_2)), inference(extension_rule, [i_0_17])).
% 0.21/0.39 cnf(i_0_100, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_13])).
% 0.21/0.39 cnf(i_0_102, plain, (~product(e_2,e_1,e_2)), inference(extension_rule, [i_0_18])).
% 0.21/0.39 cnf(i_0_104, plain, (~product(e_1,e_1,e_2)), inference(closure_rule, [i_0_19])).
% 0.21/0.39 cnf(i_0_21, plain, (~product(e_1,e_2,e_1)), inference(etableau_closure_rule, [i_0_21, ...])).
% 0.21/0.39 cnf(i_0_97, plain, (product(e_1,e_2,e_1)), inference(etableau_closure_rule, [i_0_97, ...])).
% 0.21/0.39 cnf(i_0_105, plain, (~product(e_1,e_2,e_1)), inference(etableau_closure_rule, [i_0_105, ...])).
% 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 # There were 3 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 3 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 3 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_10, plain, (group_element(e_1))).
% 0.21/0.39 cnf(i_0_11, plain, (group_element(e_2))).
% 0.21/0.39 cnf(i_0_12, plain, (~equalish(e_1,e_2))).
% 0.21/0.39 cnf(i_0_13, plain, (~equalish(e_2,e_1))).
% 0.21/0.39 cnf(i_0_15, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.21/0.39 cnf(i_0_14, plain, (product(X1,X2,e_2)|product(X1,X2,e_1)|~group_element(X2)|~group_element(X1))).
% 0.21/0.39 cnf(i_0_16, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))).
% 0.21/0.39 cnf(i_0_17, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))).
% 0.21/0.39 cnf(i_0_18, negated_conjecture, (product(X1,X2,X3)|~product(X4,X2,X1)|~product(X2,X3,X4))).
% 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 16 steps
% 0.21/0.39 cnf(i_0_18, negated_conjecture, (product(e_1,e_1,e_1)|~product(e_2,e_1,e_1)|~product(e_1,e_1,e_2)), inference(start_rule)).
% 0.21/0.39 cnf(i_0_19, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_15])).
% 0.21/0.39 cnf(i_0_22, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_12])).
% 0.21/0.39 cnf(i_0_23, plain, (~product(e_1,e_1,e_2)), inference(extension_rule, [i_0_18])).
% 0.21/0.39 cnf(i_0_68, plain, (~product(e_1,e_1,e_1)), inference(closure_rule, [i_0_19])).
% 0.21/0.39 cnf(i_0_69, plain, (~product(e_1,e_2,e_1)), inference(extension_rule, [i_0_14])).
% 0.21/0.39 cnf(i_0_75, plain, (~group_element(e_2)), inference(closure_rule, [i_0_11])).
% 0.21/0.39 cnf(i_0_76, plain, (~group_element(e_1)), inference(closure_rule, [i_0_10])).
% 0.21/0.39 cnf(i_0_20, plain, (~product(e_2,e_1,e_1)), inference(extension_rule, [i_0_18])).
% 0.21/0.39 cnf(i_0_87, plain, (~product(e_2,e_1,e_2)), inference(extension_rule, [i_0_14])).
% 0.21/0.39 cnf(i_0_99, plain, (product(e_2,e_1,e_1)), inference(closure_rule, [i_0_20])).
% 0.21/0.39 cnf(i_0_100, plain, (~group_element(e_1)), inference(closure_rule, [i_0_10])).
% 0.21/0.39 cnf(i_0_101, plain, (~group_element(e_2)), inference(closure_rule, [i_0_11])).
% 0.21/0.39 cnf(i_0_21, plain, (~product(e_1,e_1,e_2)), inference(etableau_closure_rule, [i_0_21, ...])).
% 0.21/0.39 cnf(i_0_73, plain, (product(e_1,e_2,e_2)), inference(etableau_closure_rule, [i_0_73, ...])).
% 0.21/0.39 cnf(i_0_88, plain, (~product(e_1,e_1,e_2)), inference(etableau_closure_rule, [i_0_88, ...])).
% 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 # 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_10, plain, (group_element(e_1))).
% 0.21/0.39 cnf(i_0_11, plain, (group_element(e_2))).
% 0.21/0.39 cnf(i_0_12, plain, (~equalish(e_1,e_2))).
% 0.21/0.39 cnf(i_0_13, plain, (~equalish(e_2,e_1))).
% 0.21/0.39 cnf(i_0_15, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.21/0.39 cnf(i_0_14, plain, (product(X1,X2,e_2)|product(X1,X2,e_1)|~group_element(X2)|~group_element(X1))).
% 0.21/0.39 cnf(i_0_16, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))).
% 0.21/0.39 cnf(i_0_17, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))).
% 0.21/0.39 cnf(i_0_18, negated_conjecture, (product(X1,X2,X3)|~product(X4,X2,X1)|~product(X2,X3,X4))).
% 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 16 steps
% 0.21/0.39 cnf(i_0_18, negated_conjecture, (product(e_2,e_1,e_1)|~product(e_1,e_1,e_2)|~product(e_1,e_1,e_1)), inference(start_rule)).
% 0.21/0.39 cnf(i_0_20, plain, (~product(e_1,e_1,e_2)), inference(extension_rule, [i_0_14])).
% 0.21/0.39 cnf(i_0_43, plain, (~group_element(e_1)), inference(closure_rule, [i_0_10])).
% 0.21/0.39 cnf(i_0_44, plain, (~group_element(e_1)), inference(closure_rule, [i_0_10])).
% 0.21/0.39 cnf(i_0_42, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_16])).
% 0.21/0.39 cnf(i_0_93, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_13])).
% 0.21/0.39 cnf(i_0_95, plain, (~product(e_1,e_2,e_1)), inference(extension_rule, [i_0_14])).
% 0.21/0.39 cnf(i_0_98, plain, (~group_element(e_2)), inference(closure_rule, [i_0_11])).
% 0.21/0.39 cnf(i_0_99, plain, (~group_element(e_1)), inference(closure_rule, [i_0_10])).
% 0.21/0.39 cnf(i_0_19, plain, (product(e_2,e_1,e_1)), inference(extension_rule, [i_0_17])).
% 0.21/0.39 cnf(i_0_100, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_12])).
% 0.21/0.39 cnf(i_0_102, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_18])).
% 0.21/0.39 cnf(i_0_104, plain, (~product(e_2,e_1,e_1)), inference(closure_rule, [i_0_19])).
% 0.21/0.39 cnf(i_0_21, plain, (~product(e_1,e_1,e_1)), inference(etableau_closure_rule, [i_0_21, ...])).
% 0.21/0.39 cnf(i_0_96, plain, (product(e_1,e_2,e_2)), inference(etableau_closure_rule, [i_0_96, ...])).
% 0.21/0.39 cnf(i_0_105, plain, (~product(e_1,e_1,e_2)), inference(etableau_closure_rule, [i_0_105, ...])).
% 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 # Child (12697) has found a proof.
% 0.21/0.39
% 0.21/0.39 # Proof search is over...
% 0.21/0.39 # Freeing feature tree
%------------------------------------------------------------------------------