TSTP Solution File: GRP128-2.006 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP128-2.006 : 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:47 EDT 2022
% Result : Unsatisfiable 12.95s 2.01s
% Output : CNFRefutation 12.95s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP128-2.006 : 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.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 03:25:13 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_OS_S1U
% 0.13/0.38 # and selection function SelectComplexAHPExceptRRHorn.
% 0.13/0.38 #
% 0.13/0.38 # Number of axioms: 62 Number of unprocessed: 62
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 62 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 1 conjectures.
% 0.13/0.38 # There are 1 start rule candidates:
% 0.13/0.38 # Found 56 unit axioms.
% 0.13/0.38 # 1 start rule tableaux created.
% 0.13/0.38 # 6 extension rule candidate clauses
% 0.13/0.38 # 56 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.38 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 8 tableaux to operate on
% 12.95/2.01 # There were 16 total branch saturation attempts.
% 12.95/2.01 # There were 0 of these attempts blocked.
% 12.95/2.01 # There were 0 deferred branch saturation attempts.
% 12.95/2.01 # There were 0 free duplicated saturations.
% 12.95/2.01 # There were 16 total successful branch saturations.
% 12.95/2.01 # There were 0 successful branch saturations in interreduction.
% 12.95/2.01 # There were 0 successful branch saturations on the branch.
% 12.95/2.01 # There were 16 successful branch saturations after the branch.
% 12.95/2.01 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.95/2.01 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.95/2.01 # Begin clausification derivation
% 12.95/2.01
% 12.95/2.01 # End clausification derivation
% 12.95/2.01 # Begin listing active clauses obtained from FOF to CNF conversion
% 12.95/2.01 cnf(i_0_84, plain, (group_element(e_1))).
% 12.95/2.01 cnf(i_0_85, plain, (group_element(e_2))).
% 12.95/2.01 cnf(i_0_86, plain, (group_element(e_3))).
% 12.95/2.01 cnf(i_0_87, plain, (group_element(e_4))).
% 12.95/2.01 cnf(i_0_88, plain, (group_element(e_5))).
% 12.95/2.01 cnf(i_0_89, plain, (group_element(e_6))).
% 12.95/2.01 cnf(i_0_63, plain, (next(e_1,e_2))).
% 12.95/2.01 cnf(i_0_64, plain, (next(e_2,e_3))).
% 12.95/2.01 cnf(i_0_65, plain, (next(e_3,e_4))).
% 12.95/2.01 cnf(i_0_66, plain, (next(e_4,e_5))).
% 12.95/2.01 cnf(i_0_67, plain, (next(e_5,e_6))).
% 12.95/2.01 cnf(i_0_68, plain, (greater(e_2,e_1))).
% 12.95/2.01 cnf(i_0_69, plain, (greater(e_3,e_1))).
% 12.95/2.01 cnf(i_0_73, plain, (greater(e_3,e_2))).
% 12.95/2.01 cnf(i_0_70, plain, (greater(e_4,e_1))).
% 12.95/2.01 cnf(i_0_74, plain, (greater(e_4,e_2))).
% 12.95/2.01 cnf(i_0_77, plain, (greater(e_4,e_3))).
% 12.95/2.01 cnf(i_0_71, plain, (greater(e_5,e_1))).
% 12.95/2.01 cnf(i_0_75, plain, (greater(e_5,e_2))).
% 12.95/2.01 cnf(i_0_78, plain, (greater(e_5,e_3))).
% 12.95/2.01 cnf(i_0_80, plain, (greater(e_5,e_4))).
% 12.95/2.01 cnf(i_0_72, plain, (greater(e_6,e_1))).
% 12.95/2.01 cnf(i_0_76, plain, (greater(e_6,e_2))).
% 12.95/2.01 cnf(i_0_79, plain, (greater(e_6,e_3))).
% 12.95/2.01 cnf(i_0_81, plain, (greater(e_6,e_4))).
% 12.95/2.01 cnf(i_0_82, plain, (greater(e_6,e_5))).
% 12.95/2.01 cnf(i_0_90, plain, (~equalish(e_1,e_2))).
% 12.95/2.01 cnf(i_0_91, plain, (~equalish(e_1,e_3))).
% 12.95/2.01 cnf(i_0_92, plain, (~equalish(e_1,e_4))).
% 12.95/2.01 cnf(i_0_93, plain, (~equalish(e_1,e_5))).
% 12.95/2.01 cnf(i_0_94, plain, (~equalish(e_1,e_6))).
% 12.95/2.01 cnf(i_0_95, plain, (~equalish(e_2,e_1))).
% 12.95/2.01 cnf(i_0_96, plain, (~equalish(e_2,e_3))).
% 12.95/2.01 cnf(i_0_97, plain, (~equalish(e_2,e_4))).
% 12.95/2.01 cnf(i_0_98, plain, (~equalish(e_2,e_5))).
% 12.95/2.01 cnf(i_0_99, plain, (~equalish(e_2,e_6))).
% 12.95/2.01 cnf(i_0_100, plain, (~equalish(e_3,e_1))).
% 12.95/2.01 cnf(i_0_101, plain, (~equalish(e_3,e_2))).
% 12.95/2.01 cnf(i_0_102, plain, (~equalish(e_3,e_4))).
% 12.95/2.01 cnf(i_0_103, plain, (~equalish(e_3,e_5))).
% 12.95/2.01 cnf(i_0_104, plain, (~equalish(e_3,e_6))).
% 12.95/2.01 cnf(i_0_105, plain, (~equalish(e_4,e_1))).
% 12.95/2.01 cnf(i_0_106, plain, (~equalish(e_4,e_2))).
% 12.95/2.01 cnf(i_0_107, plain, (~equalish(e_4,e_3))).
% 12.95/2.01 cnf(i_0_108, plain, (~equalish(e_4,e_5))).
% 12.95/2.01 cnf(i_0_109, plain, (~equalish(e_4,e_6))).
% 12.95/2.01 cnf(i_0_110, plain, (~equalish(e_5,e_1))).
% 12.95/2.01 cnf(i_0_111, plain, (~equalish(e_5,e_2))).
% 12.95/2.01 cnf(i_0_112, plain, (~equalish(e_5,e_3))).
% 12.95/2.01 cnf(i_0_113, plain, (~equalish(e_5,e_4))).
% 12.95/2.01 cnf(i_0_114, plain, (~equalish(e_5,e_6))).
% 12.95/2.01 cnf(i_0_115, plain, (~equalish(e_6,e_1))).
% 12.95/2.01 cnf(i_0_116, plain, (~equalish(e_6,e_2))).
% 12.95/2.01 cnf(i_0_117, plain, (~equalish(e_6,e_3))).
% 12.95/2.01 cnf(i_0_118, plain, (~equalish(e_6,e_4))).
% 12.95/2.01 cnf(i_0_119, plain, (~equalish(e_6,e_5))).
% 12.95/2.01 cnf(i_0_83, plain, (~next(X1,X3)|~greater(X2,X3)|~product(X1,e_1,X2))).
% 12.95/2.01 cnf(i_0_121, plain, (equalish(X3,X4)|~product(X1,X2,X4)|~product(X1,X2,X3))).
% 12.95/2.01 cnf(i_0_122, plain, (equalish(X2,X4)|~product(X1,X4,X3)|~product(X1,X2,X3))).
% 12.95/2.01 cnf(i_0_123, plain, (equalish(X1,X4)|~product(X4,X2,X3)|~product(X1,X2,X3))).
% 12.95/2.01 cnf(i_0_124, negated_conjecture, (product(X1,X3,X4)|~product(X3,X2,X4)|~product(X1,X2,X3))).
% 12.95/2.01 cnf(i_0_120, plain, (product(X1,X2,e_1)|product(X1,X2,e_2)|product(X1,X2,e_3)|product(X1,X2,e_4)|product(X1,X2,e_5)|product(X1,X2,e_6)|~group_element(X2)|~group_element(X1))).
% 12.95/2.01 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 12.95/2.01 # Begin printing tableau
% 12.95/2.01 # Found 41 steps
% 12.95/2.01 cnf(i_0_124, negated_conjecture, (product(e_1,e_1,e_1)|~product(e_1,e_1,e_1)|~product(e_1,e_1,e_1)), inference(start_rule)).
% 12.95/2.01 cnf(i_0_125, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_123])).
% 12.95/2.01 cnf(i_0_137, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_90])).
% 12.95/2.01 cnf(i_0_138, plain, (~product(e_2,e_1,e_1)), inference(extension_rule, [i_0_120])).
% 12.95/2.01 cnf(i_0_169, plain, (~group_element(e_1)), inference(closure_rule, [i_0_84])).
% 12.95/2.01 cnf(i_0_170, plain, (~group_element(e_2)), inference(closure_rule, [i_0_85])).
% 12.95/2.01 cnf(i_0_164, plain, (product(e_2,e_1,e_2)), inference(extension_rule, [i_0_83])).
% 12.95/2.01 cnf(i_0_171, plain, (~next(e_2,e_3)), inference(closure_rule, [i_0_64])).
% 12.95/2.01 cnf(i_0_165, plain, (product(e_2,e_1,e_3)), inference(extension_rule, [i_0_121])).
% 12.95/2.01 cnf(i_0_176, plain, (~product(e_2,e_1,e_3)), inference(closure_rule, [i_0_165])).
% 12.95/2.01 cnf(i_0_166, plain, (product(e_2,e_1,e_4)), inference(extension_rule, [i_0_122])).
% 12.95/2.01 cnf(i_0_177, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_95])).
% 12.95/2.01 cnf(i_0_167, plain, (product(e_2,e_1,e_5)), inference(extension_rule, [i_0_123])).
% 12.95/2.01 cnf(i_0_180, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_90])).
% 12.95/2.01 cnf(i_0_168, plain, (product(e_2,e_1,e_6)), inference(extension_rule, [i_0_124])).
% 12.95/2.01 cnf(i_0_126, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_120])).
% 12.95/2.01 cnf(i_0_192, plain, (~group_element(e_1)), inference(closure_rule, [i_0_84])).
% 12.95/2.01 cnf(i_0_193, plain, (~group_element(e_1)), inference(closure_rule, [i_0_84])).
% 12.95/2.01 cnf(i_0_127, plain, (~product(e_1,e_1,e_1)), inference(etableau_closure_rule, [i_0_127, ...])).
% 12.95/2.01 cnf(i_0_172, plain, (~greater(e_2,e_3)), inference(etableau_closure_rule, [i_0_172, ...])).
% 12.95/2.01 cnf(i_0_174, plain, (equalish(e_3,e_3)), inference(etableau_closure_rule, [i_0_174, ...])).
% 12.95/2.01 cnf(i_0_179, plain, (~product(e_2,e_2,e_4)), inference(etableau_closure_rule, [i_0_179, ...])).
% 12.95/2.01 cnf(i_0_182, plain, (~product(e_1,e_1,e_5)), inference(etableau_closure_rule, [i_0_182, ...])).
% 12.95/2.01 cnf(i_0_187, plain, (product(e_1,e_1,e_2)), inference(etableau_closure_rule, [i_0_187, ...])).
% 12.95/2.01 cnf(i_0_188, plain, (product(e_1,e_1,e_3)), inference(etableau_closure_rule, [i_0_188, ...])).
% 12.95/2.01 cnf(i_0_189, plain, (product(e_1,e_1,e_4)), inference(etableau_closure_rule, [i_0_189, ...])).
% 12.95/2.01 cnf(i_0_190, plain, (product(e_1,e_1,e_5)), inference(etableau_closure_rule, [i_0_190, ...])).
% 12.95/2.01 cnf(i_0_191, plain, (product(e_1,e_1,e_6)), inference(etableau_closure_rule, [i_0_191, ...])).
% 12.95/2.01 cnf(i_0_183, plain, (product(e_2,e_2,e_6)), inference(extension_rule, [i_0_123])).
% 12.95/2.01 cnf(i_0_88810, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_90])).
% 12.95/2.01 cnf(i_0_88812, plain, (~product(e_1,e_2,e_6)), inference(extension_rule, [i_0_120])).
% 12.95/2.01 cnf(i_0_88819, plain, (~group_element(e_2)), inference(closure_rule, [i_0_85])).
% 12.95/2.01 cnf(i_0_88820, plain, (~group_element(e_1)), inference(closure_rule, [i_0_84])).
% 12.95/2.01 cnf(i_0_88813, plain, (product(e_1,e_2,e_1)), inference(extension_rule, [i_0_124])).
% 12.95/2.01 cnf(i_0_88824, plain, (product(e_2,e_1,e_1)), inference(closure_rule, [i_0_138])).
% 12.95/2.01 cnf(i_0_185, plain, (~product(e_2,e_1,e_2)), inference(etableau_closure_rule, [i_0_185, ...])).
% 12.95/2.01 cnf(i_0_88814, plain, (product(e_1,e_2,e_2)), inference(etableau_closure_rule, [i_0_88814, ...])).
% 12.95/2.01 cnf(i_0_88815, plain, (product(e_1,e_2,e_3)), inference(etableau_closure_rule, [i_0_88815, ...])).
% 12.95/2.01 cnf(i_0_88816, plain, (product(e_1,e_2,e_4)), inference(etableau_closure_rule, [i_0_88816, ...])).
% 12.95/2.01 cnf(i_0_88817, plain, (product(e_1,e_2,e_5)), inference(etableau_closure_rule, [i_0_88817, ...])).
% 12.95/2.01 cnf(i_0_88826, plain, (~product(e_2,e_2,e_1)), inference(etableau_closure_rule, [i_0_88826, ...])).
% 12.95/2.01 # End printing tableau
% 12.95/2.01 # SZS output end
% 12.95/2.01 # Branches closed with saturation will be marked with an "s"
% 12.95/2.02 # Child (29852) has found a proof.
% 12.95/2.02
% 12.95/2.02 # Proof search is over...
% 12.95/2.02 # Freeing feature tree
%------------------------------------------------------------------------------