TSTP Solution File: GRP129-2.004 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP129-2.004 : 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 : n005.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:49 EDT 2022
% Result : Unsatisfiable 1.45s 0.59s
% Output : CNFRefutation 1.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP129-2.004 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 14 08:34:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 # No SInE strategy applied
% 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b
% 0.13/0.36 # and selection function SelectCQIPrecW.
% 0.13/0.36 #
% 0.13/0.36 # Presaturation interreduction done
% 0.13/0.36 # Number of axioms: 31 Number of unprocessed: 31
% 0.13/0.36 # Tableaux proof search.
% 0.13/0.36 # APR header successfully linked.
% 0.13/0.36 # Hello from C++
% 0.13/0.36 # The folding up rule is enabled...
% 0.13/0.36 # Local unification is enabled...
% 0.13/0.36 # Any saturation attempts will use folding labels...
% 0.13/0.36 # 31 beginning clauses after preprocessing and clausification
% 0.13/0.36 # Creating start rules for all 1 conjectures.
% 0.13/0.36 # There are 1 start rule candidates:
% 0.13/0.36 # Found 25 unit axioms.
% 0.13/0.36 # 1 start rule tableaux created.
% 0.13/0.36 # 6 extension rule candidate clauses
% 0.13/0.36 # 25 unit axiom clauses
% 0.13/0.36
% 0.13/0.36 # Requested 8, 32 cores available to the main process.
% 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.36 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.36 # We now have 9 tableaux to operate on
% 0.20/0.40 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.42 # Ran out of tableaux, making start rules for all clauses
% 1.45/0.59 # There were 8 total branch saturation attempts.
% 1.45/0.59 # There were 0 of these attempts blocked.
% 1.45/0.59 # There were 0 deferred branch saturation attempts.
% 1.45/0.59 # There were 0 free duplicated saturations.
% 1.45/0.59 # There were 8 total successful branch saturations.
% 1.45/0.59 # There were 0 successful branch saturations in interreduction.
% 1.45/0.59 # There were 0 successful branch saturations on the branch.
% 1.45/0.59 # There were 8 successful branch saturations after the branch.
% 1.45/0.59 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.45/0.59 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.45/0.59 # Begin clausification derivation
% 1.45/0.59
% 1.45/0.59 # End clausification derivation
% 1.45/0.59 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.45/0.59 cnf(i_0_42, plain, (group_element(e_1))).
% 1.45/0.59 cnf(i_0_43, plain, (group_element(e_2))).
% 1.45/0.59 cnf(i_0_44, plain, (group_element(e_3))).
% 1.45/0.59 cnf(i_0_45, plain, (group_element(e_4))).
% 1.45/0.59 cnf(i_0_32, plain, (next(e_1,e_2))).
% 1.45/0.59 cnf(i_0_33, plain, (next(e_2,e_3))).
% 1.45/0.59 cnf(i_0_34, plain, (next(e_3,e_4))).
% 1.45/0.59 cnf(i_0_35, plain, (greater(e_2,e_1))).
% 1.45/0.59 cnf(i_0_36, plain, (greater(e_3,e_1))).
% 1.45/0.59 cnf(i_0_38, plain, (greater(e_3,e_2))).
% 1.45/0.59 cnf(i_0_37, plain, (greater(e_4,e_1))).
% 1.45/0.59 cnf(i_0_39, plain, (greater(e_4,e_2))).
% 1.45/0.59 cnf(i_0_40, plain, (greater(e_4,e_3))).
% 1.45/0.59 cnf(i_0_46, plain, (~equalish(e_1,e_2))).
% 1.45/0.59 cnf(i_0_47, plain, (~equalish(e_1,e_3))).
% 1.45/0.59 cnf(i_0_48, plain, (~equalish(e_1,e_4))).
% 1.45/0.59 cnf(i_0_49, plain, (~equalish(e_2,e_1))).
% 1.45/0.59 cnf(i_0_50, plain, (~equalish(e_2,e_3))).
% 1.45/0.59 cnf(i_0_51, plain, (~equalish(e_2,e_4))).
% 1.45/0.59 cnf(i_0_52, plain, (~equalish(e_3,e_1))).
% 1.45/0.59 cnf(i_0_53, plain, (~equalish(e_3,e_2))).
% 1.45/0.59 cnf(i_0_54, plain, (~equalish(e_3,e_4))).
% 1.45/0.59 cnf(i_0_55, plain, (~equalish(e_4,e_1))).
% 1.45/0.59 cnf(i_0_56, plain, (~equalish(e_4,e_2))).
% 1.45/0.59 cnf(i_0_57, plain, (~equalish(e_4,e_3))).
% 1.45/0.59 cnf(i_0_41, plain, (~product(X1,e_1,X2)|~greater(X2,X3)|~next(X1,X3))).
% 1.45/0.59 cnf(i_0_59, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 1.45/0.59 cnf(i_0_60, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))).
% 1.45/0.59 cnf(i_0_61, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))).
% 1.45/0.59 cnf(i_0_62, negated_conjecture, (product(X1,X2,X3)|~product(X4,X1,X3)|~product(X2,X4,X1))).
% 1.45/0.59 cnf(i_0_58, 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))).
% 1.45/0.59 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.45/0.59 # Begin printing tableau
% 1.45/0.59 # Found 26 steps
% 1.45/0.59 cnf(i_0_62, negated_conjecture, (product(e_1,e_4,e_1)|~product(e_1,e_1,e_1)|~product(e_4,e_1,e_1)), inference(start_rule)).
% 1.45/0.59 cnf(i_0_63, plain, (product(e_1,e_4,e_1)), inference(extension_rule, [i_0_62])).
% 1.45/0.59 cnf(i_0_86, plain, (~product(e_1,e_1,e_4)), inference(extension_rule, [i_0_58])).
% 1.45/0.59 cnf(i_0_166, plain, (~group_element(e_1)), inference(closure_rule, [i_0_42])).
% 1.45/0.59 cnf(i_0_167, plain, (~group_element(e_1)), inference(closure_rule, [i_0_42])).
% 1.45/0.59 cnf(i_0_163, plain, (product(e_1,e_1,e_3)), inference(extension_rule, [i_0_59])).
% 1.45/0.59 cnf(i_0_168, plain, (equalish(e_1,e_3)), inference(closure_rule, [i_0_47])).
% 1.45/0.59 cnf(i_0_164, plain, (product(e_1,e_1,e_2)), inference(extension_rule, [i_0_60])).
% 1.45/0.59 cnf(i_0_171, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_49])).
% 1.45/0.59 cnf(i_0_165, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_61])).
% 1.45/0.59 cnf(i_0_174, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_49])).
% 1.45/0.59 cnf(i_0_84, plain, (product(e_4,e_1,e_1)), inference(extension_rule, [i_0_62])).
% 1.45/0.59 cnf(i_0_179, plain, (~product(e_1,e_4,e_1)), inference(closure_rule, [i_0_63])).
% 1.45/0.59 cnf(i_0_177, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_41])).
% 1.45/0.59 cnf(i_0_182, plain, (~next(e_1,e_2)), inference(closure_rule, [i_0_32])).
% 1.45/0.59 cnf(i_0_64, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_58])).
% 1.45/0.59 cnf(i_0_187, plain, (~group_element(e_1)), inference(closure_rule, [i_0_42])).
% 1.45/0.59 cnf(i_0_188, plain, (~group_element(e_1)), inference(closure_rule, [i_0_42])).
% 1.45/0.59 cnf(i_0_65, plain, (~product(e_4,e_1,e_1)), inference(etableau_closure_rule, [i_0_65, ...])).
% 1.45/0.59 cnf(i_0_170, plain, (~product(e_1,e_1,e_1)), inference(etableau_closure_rule, [i_0_170, ...])).
% 1.45/0.59 cnf(i_0_173, plain, (~product(e_1,e_2,e_2)), inference(etableau_closure_rule, [i_0_173, ...])).
% 1.45/0.59 cnf(i_0_176, plain, (~product(e_2,e_1,e_1)), inference(etableau_closure_rule, [i_0_176, ...])).
% 1.45/0.59 cnf(i_0_181, plain, (~greater(e_1,e_2)), inference(etableau_closure_rule, [i_0_181, ...])).
% 1.45/0.59 cnf(i_0_183, plain, (product(e_1,e_1,e_4)), inference(etableau_closure_rule, [i_0_183, ...])).
% 1.45/0.59 cnf(i_0_184, plain, (product(e_1,e_1,e_3)), inference(etableau_closure_rule, [i_0_184, ...])).
% 1.45/0.59 cnf(i_0_185, plain, (product(e_1,e_1,e_2)), inference(etableau_closure_rule, [i_0_185, ...])).
% 1.45/0.59 # End printing tableau
% 1.45/0.59 # SZS output end
% 1.45/0.59 # Branches closed with saturation will be marked with an "s"
% 1.45/0.59 # Child (21200) has found a proof.
% 1.45/0.59
% 1.45/0.59 # Proof search is over...
% 1.45/0.59 # Freeing feature tree
%------------------------------------------------------------------------------