TSTP Solution File: GRP128-1.004 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : GRP128-1.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 : n015.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:47 EDT 2022

% Result   : Satisfiable 3.44s 0.85s
% Output   : CNFRefutation 3.44s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP128-1.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.14/0.34  % Computer : n015.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 : Mon Jun 13 09:53:07 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___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.37  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.37  #
% 0.14/0.37  # Presaturation interreduction done
% 0.14/0.37  # Number of axioms: 21 Number of unprocessed: 21
% 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  # 21 beginning clauses after preprocessing and clausification
% 0.14/0.37  # Creating start rules for all 1 conjectures.
% 0.14/0.37  # There are 1 start rule candidates:
% 0.14/0.37  # Found 16 unit axioms.
% 0.14/0.37  # 1 start rule tableaux created.
% 0.14/0.37  # 5 extension rule candidate clauses
% 0.14/0.37  # 16 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 1
% 0.14/0.37  # Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.37  # We now have 11 tableaux to operate on
% 3.44/0.85  # 18096 Satisfiable branch
% 3.44/0.85  # Satisfiable branch found.
% 3.44/0.85  # There were 21 total branch saturation attempts.
% 3.44/0.85  # There were 0 of these attempts blocked.
% 3.44/0.85  # There were 0 deferred branch saturation attempts.
% 3.44/0.85  # There were 0 free duplicated saturations.
% 3.44/0.85  # There were 20 total successful branch saturations.
% 3.44/0.85  # There were 0 successful branch saturations in interreduction.
% 3.44/0.85  # There were 0 successful branch saturations on the branch.
% 3.44/0.85  # There were 20 successful branch saturations after the branch.
% 3.44/0.85  # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.44/0.85  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.44/0.85  # Begin clausification derivation
% 3.44/0.85  
% 3.44/0.85  # End clausification derivation
% 3.44/0.85  # Begin listing active clauses obtained from FOF to CNF conversion
% 3.44/0.85  cnf(i_0_22, plain, (group_element(e_1))).
% 3.44/0.85  cnf(i_0_23, plain, (group_element(e_2))).
% 3.44/0.85  cnf(i_0_24, plain, (group_element(e_3))).
% 3.44/0.85  cnf(i_0_25, plain, (group_element(e_4))).
% 3.44/0.85  cnf(i_0_26, plain, (~equalish(e_1,e_2))).
% 3.44/0.85  cnf(i_0_27, plain, (~equalish(e_1,e_3))).
% 3.44/0.85  cnf(i_0_28, plain, (~equalish(e_1,e_4))).
% 3.44/0.85  cnf(i_0_29, plain, (~equalish(e_2,e_1))).
% 3.44/0.85  cnf(i_0_30, plain, (~equalish(e_2,e_3))).
% 3.44/0.85  cnf(i_0_31, plain, (~equalish(e_2,e_4))).
% 3.44/0.85  cnf(i_0_32, plain, (~equalish(e_3,e_1))).
% 3.44/0.85  cnf(i_0_33, plain, (~equalish(e_3,e_2))).
% 3.44/0.85  cnf(i_0_34, plain, (~equalish(e_3,e_4))).
% 3.44/0.85  cnf(i_0_35, plain, (~equalish(e_4,e_1))).
% 3.44/0.85  cnf(i_0_36, plain, (~equalish(e_4,e_2))).
% 3.44/0.85  cnf(i_0_37, plain, (~equalish(e_4,e_3))).
% 3.44/0.85  cnf(i_0_39, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 3.44/0.85  cnf(i_0_40, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))).
% 3.44/0.85  cnf(i_0_41, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))).
% 3.44/0.85  cnf(i_0_42, negated_conjecture, (product(X1,X2,X3)|~product(X2,X4,X3)|~product(X1,X4,X2))).
% 3.44/0.85  cnf(i_0_38, 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))).
% 3.44/0.85  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 3.44/0.85  # Begin printing tableau
% 3.44/0.85  # Found 79 steps
% 3.44/0.85  cnf(i_0_42, negated_conjecture, (product(e_1,e_1,e_2)|~product(e_1,e_1,e_2)|~product(e_1,e_1,e_1)), inference(start_rule)).
% 3.44/0.85  cnf(i_0_44, plain, (~product(e_1,e_1,e_2)), inference(extension_rule, [i_0_38])).
% 3.44/0.85  cnf(i_0_77, plain, (~group_element(e_1)), inference(closure_rule, [i_0_22])).
% 3.44/0.85  cnf(i_0_78, plain, (~group_element(e_1)), inference(closure_rule, [i_0_22])).
% 3.44/0.85  cnf(i_0_73, plain, (product(e_1,e_1,e_4)), inference(extension_rule, [i_0_39])).
% 3.44/0.85  cnf(i_0_82, plain, (equalish(e_1,e_4)), inference(closure_rule, [i_0_28])).
% 3.44/0.85  cnf(i_0_84, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_42])).
% 3.44/0.85  cnf(i_0_74, plain, (product(e_1,e_1,e_3)), inference(extension_rule, [i_0_40])).
% 3.44/0.85  cnf(i_0_100, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_29])).
% 3.44/0.85  cnf(i_0_102, plain, (~product(e_1,e_2,e_3)), inference(extension_rule, [i_0_38])).
% 3.44/0.85  cnf(i_0_110, plain, (~group_element(e_2)), inference(closure_rule, [i_0_23])).
% 3.44/0.85  cnf(i_0_111, plain, (~group_element(e_1)), inference(closure_rule, [i_0_22])).
% 3.44/0.85  cnf(i_0_76, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_41])).
% 3.44/0.85  cnf(i_0_112, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_29])).
% 3.44/0.85  cnf(i_0_114, plain, (~product(e_2,e_1,e_1)), inference(extension_rule, [i_0_42])).
% 3.44/0.85  cnf(i_0_43, plain, (product(e_1,e_1,e_2)), inference(extension_rule, [i_0_39])).
% 3.44/0.85  cnf(i_0_121, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_26])).
% 3.44/0.85  cnf(i_0_123, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_42])).
% 3.44/0.85  cnf(i_0_137, plain, (~product(e_1,e_2,e_1)), inference(extension_rule, [i_0_38])).
% 3.44/0.85  cnf(i_0_147, plain, (~group_element(e_1)), inference(closure_rule, [i_0_22])).
% 3.44/0.85  cnf(i_0_138, plain, (~product(e_1,e_2,e_1)), inference(extension_rule, [i_0_42])).
% 3.44/0.85  cnf(i_0_159, plain, (~product(e_1,e_1,e_2)), inference(closure_rule, [i_0_43])).
% 3.44/0.85  cnf(i_0_146, plain, (~group_element(e_2)), inference(closure_rule, [i_0_23])).
% 3.44/0.85  cnf(i_0_45, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_42])).
% 3.44/0.85  cnf(i_0_176, plain, (~product(e_1,e_2,e_1)), inference(extension_rule, [i_0_38])).
% 3.44/0.85  cnf(i_0_192, plain, (~group_element(e_1)), inference(closure_rule, [i_0_22])).
% 3.44/0.85  cnf(i_0_187, plain, (product(e_1,e_2,e_4)), inference(extension_rule, [i_0_40])).
% 3.44/0.85  cnf(i_0_193, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_26])).
% 3.44/0.85  cnf(i_0_191, plain, (~group_element(e_2)), inference(closure_rule, [i_0_23])).
% 3.44/0.85  cnf(i_0_188, plain, (product(e_1,e_2,e_3)), inference(extension_rule, [i_0_41])).
% 3.44/0.85  cnf(i_0_196, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_29])).
% 3.44/0.85  cnf(i_0_189, plain, (product(e_1,e_2,e_2)), inference(extension_rule, [i_0_39])).
% 3.44/0.85  cnf(i_0_201, plain, (~product(e_1,e_2,e_2)), inference(closure_rule, [i_0_189])).
% 3.44/0.85  cnf(i_0_177, plain, (~product(e_1,e_2,e_1)), inference(extension_rule, [i_0_42])).
% 3.44/0.85  cnf(i_0_203, plain, (~product(e_2,e_1,e_1)), inference(extension_rule, [i_0_38])).
% 3.44/0.85  cnf(i_0_209, plain, (~group_element(e_1)), inference(closure_rule, [i_0_22])).
% 3.44/0.85  cnf(i_0_210, plain, (~group_element(e_2)), inference(closure_rule, [i_0_23])).
% 3.44/0.85  cnf(i_0_204, plain, (~product(e_1,e_1,e_2)), inference(extension_rule, [i_0_38])).
% 3.44/0.85  cnf(i_0_235, plain, (product(e_1,e_1,e_1)), inference(closure_rule, [i_0_45])).
% 3.44/0.85  cnf(i_0_236, plain, (~group_element(e_1)), inference(closure_rule, [i_0_22])).
% 3.44/0.85  cnf(i_0_237, plain, (~group_element(e_1)), inference(closure_rule, [i_0_22])).
% 3.44/0.85  cnf(i_0_106, plain, (product(e_1,e_2,e_4)), inference(etableau_closure_rule, [i_0_106, ...])).
% 3.44/0.85  cnf(i_0_108, plain, (product(e_1,e_2,e_2)), inference(etableau_closure_rule, [i_0_108, ...])).
% 3.44/0.85  cnf(i_0_109, plain, (product(e_1,e_2,e_1)), inference(etableau_closure_rule, [i_0_109, ...])).
% 3.44/0.85  cnf(i_0_142, plain, (product(e_1,e_2,e_4)), inference(etableau_closure_rule, [i_0_142, ...])).
% 3.44/0.85  cnf(i_0_143, plain, (product(e_1,e_2,e_3)), inference(etableau_closure_rule, [i_0_143, ...])).
% 3.44/0.85  cnf(i_0_144, plain, (product(e_1,e_2,e_2)), inference(etableau_closure_rule, [i_0_144, ...])).
% 3.44/0.85  cnf(i_0_158, plain, (~product(e_2,e_1,e_1)), inference(etableau_closure_rule, [i_0_158, ...])).
% 3.44/0.85  cnf(i_0_195, plain, (~product(e_1,e_1,e_4)), inference(etableau_closure_rule, [i_0_195, ...])).
% 3.44/0.85  cnf(i_0_198, plain, (~product(e_2,e_2,e_3)), inference(etableau_closure_rule, [i_0_198, ...])).
% 3.44/0.85  cnf(i_0_199, plain, (equalish(e_2,e_2)), inference(etableau_closure_rule, [i_0_199, ...])).
% 3.44/0.85  cnf(i_0_205, plain, (product(e_2,e_1,e_4)), inference(etableau_closure_rule, [i_0_205, ...])).
% 3.44/0.85  cnf(i_0_206, plain, (product(e_2,e_1,e_3)), inference(etableau_closure_rule, [i_0_206, ...])).
% 3.44/0.85  cnf(i_0_207, plain, (product(e_2,e_1,e_2)), inference(etableau_closure_rule, [i_0_207, ...])).
% 3.44/0.85  cnf(i_0_232, plain, (product(e_1,e_1,e_4)), inference(etableau_closure_rule, [i_0_232, ...])).
% 3.44/0.85  cnf(i_0_233, plain, (product(e_1,e_1,e_3)), inference(etableau_closure_rule, [i_0_233, ...])).
% 3.44/0.85  cnf(i_0_98, plain, (~product(e_1,e_2,e_1)), inference(extension_rule, [i_0_38])).
% 3.44/0.85  cnf(i_0_7810, plain, (~group_element(e_1)), inference(closure_rule, [i_0_22])).
% 3.44/0.85  cnf(i_0_7806, plain, (product(e_1,e_2,e_3)), inference(extension_rule, [i_0_40])).
% 3.44/0.85  cnf(i_0_7850, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_26])).
% 3.44/0.85  cnf(i_0_7809, plain, (~group_element(e_2)), inference(closure_rule, [i_0_23])).
% 3.44/0.85  cnf(i_0_7852, plain, (~product(e_1,e_1,e_3)), inference(extension_rule, [i_0_42])).
% 3.44/0.85  cnf(i_0_99, plain, (~product(e_1,e_2,e_1)), inference(etableau_closure_rule, [i_0_99, ...])).
% 3.44/0.85  cnf(i_0_7807, plain, (product(e_1,e_2,e_2)), inference(etableau_closure_rule, [i_0_7807, ...])).
% 3.44/0.85  cnf(i_0_7805, plain, (product(e_1,e_2,e_4)), inference(etableau_closure_rule, [i_0_7805, ...])).
% 3.44/0.85  cnf(i_0_7858, plain, (~product(e_1,e_3,e_1)), inference(extension_rule, [i_0_42])).
% 3.44/0.85  cnf(i_0_8402, plain, (~product(e_1,e_2,e_3)), inference(closure_rule, [i_0_7806])).
% 3.44/0.85  cnf(i_0_7857, plain, (~product(e_1,e_3,e_3)), inference(etableau_closure_rule, [i_0_7857, ...])).
% 3.44/0.85  cnf(i_0_8401, plain, (~product(e_3,e_2,e_1)), inference(etableau_closure_rule, [i_0_8401, ...])).
% 3.44/0.85  cnf(i_0_119, plain, (~product(e_1,e_4,e_1)), inference(extension_rule, [i_0_38])).
% 3.44/0.85  cnf(i_0_8687, plain, (~group_element(e_1)), inference(closure_rule, [i_0_22])).
% 3.44/0.85  cnf(i_0_8682, plain, (product(e_1,e_4,e_4)), inference(extension_rule, [i_0_41])).
% 3.44/0.85  cnf(i_0_8688, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_29])).
% 3.44/0.85  cnf(i_0_8690, plain, (~product(e_2,e_4,e_4)), inference(extension_rule, [i_0_42])).
% 3.44/0.85  cnf(i_0_8699, plain, (~product(e_2,e_1,e_4)), inference(extension_rule, [i_0_38])).
% 3.44/0.85  cnf(i_0_8686, plain, (~group_element(e_4)), inference(closure_rule, [i_0_25])).
% 3.44/0.85  cnf(i_0_8709, plain, (product(e_2,e_1,e_1)), inference(closure_rule, [i_0_114])).
% 3.44/0.85  cnf(i_0_8710, plain, (~group_element(e_1)), inference(closure_rule, [i_0_22])).
% 3.44/0.85  cnf(i_0_8711, plain, (~group_element(e_2)), inference(closure_rule, [i_0_23])).
% 3.44/0.85  # End printing tableau
% 3.44/0.85  # SZS output end
% 3.44/0.85  # Branches closed with saturation will be marked with an "s"
% 3.44/0.85  # Child (18096) has found a proof.
% 3.44/0.85  
% 3.44/0.85  # Proof search is over...
% 3.44/0.85  # Freeing feature tree
%------------------------------------------------------------------------------