TSTP Solution File: GRP124-4.004 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP124-4.004 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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 : n026.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:36 EDT 2022
% Result : Unsatisfiable 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : GRP124-4.004 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.13/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 : n026.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 : Tue Jun 14 07:43:21 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.39 # No SInE strategy applied
% 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.39 #
% 0.14/0.39 # Presaturation interreduction done
% 0.14/0.39 # Number of axioms: 25 Number of unprocessed: 25
% 0.14/0.39 # Tableaux proof search.
% 0.14/0.39 # APR header successfully linked.
% 0.14/0.39 # Hello from C++
% 0.14/0.39 # The folding up rule is enabled...
% 0.14/0.39 # Local unification is enabled...
% 0.14/0.39 # Any saturation attempts will use folding labels...
% 0.14/0.39 # 25 beginning clauses after preprocessing and clausification
% 0.14/0.39 # Creating start rules for all 2 conjectures.
% 0.14/0.39 # There are 2 start rule candidates:
% 0.14/0.39 # Found 17 unit axioms.
% 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.39 # 2 start rule tableaux created.
% 0.14/0.39 # 8 extension rule candidate clauses
% 0.14/0.39 # 17 unit axiom clauses
% 0.14/0.39
% 0.14/0.39 # Requested 8, 32 cores available to the main process.
% 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 2
% 0.14/0.39 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.39 # We now have 13 tableaux to operate on
% 0.14/0.41 # There were 4 total branch saturation attempts.
% 0.14/0.41 # There were 0 of these attempts blocked.
% 0.14/0.41 # There were 0 deferred branch saturation attempts.
% 0.14/0.41 # There were 0 free duplicated saturations.
% 0.14/0.41 # There were 4 total successful branch saturations.
% 0.14/0.41 # There were 0 successful branch saturations in interreduction.
% 0.14/0.41 # There were 0 successful branch saturations on the branch.
% 0.14/0.41 # There were 4 successful branch saturations after the branch.
% 0.14/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.41 # Begin clausification derivation
% 0.14/0.41
% 0.14/0.41 # End clausification derivation
% 0.14/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.41 cnf(i_0_28, plain, (group_element(e_1))).
% 0.14/0.41 cnf(i_0_29, plain, (group_element(e_2))).
% 0.14/0.41 cnf(i_0_30, plain, (group_element(e_3))).
% 0.14/0.41 cnf(i_0_31, plain, (group_element(e_4))).
% 0.14/0.41 cnf(i_0_48, plain, (product(X1,X1,X1))).
% 0.14/0.41 cnf(i_0_32, plain, (~equalish(e_1,e_2))).
% 0.14/0.41 cnf(i_0_33, plain, (~equalish(e_1,e_3))).
% 0.14/0.41 cnf(i_0_34, plain, (~equalish(e_1,e_4))).
% 0.14/0.41 cnf(i_0_35, plain, (~equalish(e_2,e_1))).
% 0.14/0.41 cnf(i_0_36, plain, (~equalish(e_2,e_3))).
% 0.14/0.41 cnf(i_0_37, plain, (~equalish(e_2,e_4))).
% 0.14/0.41 cnf(i_0_38, plain, (~equalish(e_3,e_1))).
% 0.14/0.41 cnf(i_0_39, plain, (~equalish(e_3,e_2))).
% 0.14/0.41 cnf(i_0_40, plain, (~equalish(e_3,e_4))).
% 0.14/0.41 cnf(i_0_41, plain, (~equalish(e_4,e_1))).
% 0.14/0.41 cnf(i_0_42, plain, (~equalish(e_4,e_2))).
% 0.14/0.41 cnf(i_0_43, plain, (~equalish(e_4,e_3))).
% 0.14/0.41 cnf(i_0_45, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.14/0.41 cnf(i_0_46, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))).
% 0.14/0.41 cnf(i_0_47, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))).
% 0.14/0.41 cnf(i_0_50, negated_conjecture, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X5,X1)|~product(X4,X2,X6)|~product(X5,X1,X6))).
% 0.14/0.41 cnf(i_0_49, negated_conjecture, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X5)|~product(X2,X4,X6)|~product(X1,X5,X6))).
% 0.14/0.41 cnf(i_0_44, plain, (product(X1,X2,e_4)|product(X1,X2,e_3)|product(X1,X2,e_2)|product(X1,X2,e_1)|~group_element(X2)|~group_element(X1))).
% 0.14/0.41 cnf(i_0_27, plain, (product(X1,e_4,X2)|product(X1,e_3,X2)|product(X1,e_2,X2)|product(X1,e_1,X2)|~group_element(X2)|~group_element(X1))).
% 0.14/0.41 cnf(i_0_26, plain, (product(e_4,X1,X2)|product(e_3,X1,X2)|product(e_2,X1,X2)|product(e_1,X1,X2)|~group_element(X2)|~group_element(X1))).
% 0.14/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.41 # Begin printing tableau
% 0.14/0.41 # Found 13 steps
% 0.14/0.41 cnf(i_0_49, negated_conjecture, (equalish(e_1,e_2)|~product(e_2,e_2,e_2)|~product(e_2,e_1,e_3)|~product(e_2,e_2,e_2)|~product(e_1,e_3,e_2)), inference(start_rule)).
% 0.14/0.41 cnf(i_0_51, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_32])).
% 0.14/0.41 cnf(i_0_52, plain, (~product(e_2,e_2,e_2)), inference(closure_rule, [i_0_48])).
% 0.14/0.41 cnf(i_0_54, plain, (~product(e_2,e_2,e_2)), inference(closure_rule, [i_0_48])).
% 0.14/0.41 cnf(i_0_55, plain, (~product(e_1,e_3,e_2)), inference(extension_rule, [i_0_27])).
% 0.14/0.41 cnf(i_0_117, plain, (~group_element(e_2)), inference(closure_rule, [i_0_29])).
% 0.14/0.41 cnf(i_0_118, plain, (~group_element(e_1)), inference(closure_rule, [i_0_28])).
% 0.14/0.41 cnf(i_0_113, plain, (product(e_1,e_4,e_2)), inference(extension_rule, [i_0_45])).
% 0.14/0.41 cnf(i_0_135, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_32])).
% 0.14/0.41 cnf(i_0_53, plain, (~product(e_2,e_1,e_3)), inference(etableau_closure_rule, [i_0_53, ...])).
% 0.14/0.41 cnf(i_0_115, plain, (product(e_1,e_2,e_2)), inference(etableau_closure_rule, [i_0_115, ...])).
% 0.14/0.41 cnf(i_0_116, plain, (product(e_1,e_1,e_2)), inference(etableau_closure_rule, [i_0_116, ...])).
% 0.14/0.41 cnf(i_0_137, plain, (~product(e_1,e_4,e_1)), inference(etableau_closure_rule, [i_0_137, ...])).
% 0.14/0.41 # End printing tableau
% 0.14/0.41 # SZS output end
% 0.14/0.41 # Branches closed with saturation will be marked with an "s"
% 0.14/0.41 # Child (4207) has found a proof.
% 0.14/0.41
% 0.14/0.41 # Proof search is over...
% 0.14/0.41 # Freeing feature tree
%------------------------------------------------------------------------------