TSTP Solution File: GRP128-3.005 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP128-3.005 : 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:48 EDT 2022
% Result : Unsatisfiable 29.47s 4.14s
% Output : CNFRefutation 29.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : GRP128-3.005 : TPTP v8.1.0. Released v1.2.0.
% 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 : 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 15:14:09 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.39 # No SInE strategy applied
% 0.14/0.39 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_OS_S1U
% 0.14/0.39 # and selection function SelectComplexAHPExceptRRHorn.
% 0.14/0.39 #
% 0.14/0.39 # Number of axioms: 57 Number of unprocessed: 57
% 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 # 57 beginning clauses after preprocessing and clausification
% 0.14/0.39 # Creating start rules for all 1 conjectures.
% 0.14/0.39 # There are 1 start rule candidates:
% 0.14/0.39 # Found 46 unit axioms.
% 0.14/0.39 # 1 start rule tableaux created.
% 0.14/0.39 # 11 extension rule candidate clauses
% 0.14/0.39 # 46 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 1
% 0.14/0.39 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.39 # We now have 9 tableaux to operate on
% 29.47/4.14 # There were 11 total branch saturation attempts.
% 29.47/4.14 # There were 0 of these attempts blocked.
% 29.47/4.14 # There were 0 deferred branch saturation attempts.
% 29.47/4.14 # There were 0 free duplicated saturations.
% 29.47/4.14 # There were 11 total successful branch saturations.
% 29.47/4.14 # There were 0 successful branch saturations in interreduction.
% 29.47/4.14 # There were 0 successful branch saturations on the branch.
% 29.47/4.14 # There were 11 successful branch saturations after the branch.
% 29.47/4.14 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 29.47/4.14 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 29.47/4.14 # Begin clausification derivation
% 29.47/4.14
% 29.47/4.14 # End clausification derivation
% 29.47/4.14 # Begin listing active clauses obtained from FOF to CNF conversion
% 29.47/4.14 cnf(i_0_85, plain, (group_element(e_1))).
% 29.47/4.14 cnf(i_0_86, plain, (group_element(e_2))).
% 29.47/4.14 cnf(i_0_87, plain, (group_element(e_3))).
% 29.47/4.14 cnf(i_0_88, plain, (group_element(e_4))).
% 29.47/4.14 cnf(i_0_89, plain, (group_element(e_5))).
% 29.47/4.14 cnf(i_0_58, plain, (next(e_0,e_1))).
% 29.47/4.14 cnf(i_0_59, plain, (next(e_1,e_2))).
% 29.47/4.14 cnf(i_0_60, plain, (next(e_2,e_3))).
% 29.47/4.14 cnf(i_0_61, plain, (next(e_3,e_4))).
% 29.47/4.14 cnf(i_0_62, plain, (next(e_4,e_5))).
% 29.47/4.14 cnf(i_0_63, plain, (greater(e_1,e_0))).
% 29.47/4.14 cnf(i_0_64, plain, (greater(e_2,e_0))).
% 29.47/4.14 cnf(i_0_68, plain, (greater(e_2,e_1))).
% 29.47/4.14 cnf(i_0_65, plain, (greater(e_3,e_0))).
% 29.47/4.14 cnf(i_0_69, plain, (greater(e_3,e_1))).
% 29.47/4.14 cnf(i_0_72, plain, (greater(e_3,e_2))).
% 29.47/4.14 cnf(i_0_66, plain, (greater(e_4,e_0))).
% 29.47/4.14 cnf(i_0_70, plain, (greater(e_4,e_1))).
% 29.47/4.14 cnf(i_0_73, plain, (greater(e_4,e_2))).
% 29.47/4.14 cnf(i_0_75, plain, (greater(e_4,e_3))).
% 29.47/4.14 cnf(i_0_67, plain, (greater(e_5,e_0))).
% 29.47/4.14 cnf(i_0_71, plain, (greater(e_5,e_1))).
% 29.47/4.14 cnf(i_0_74, plain, (greater(e_5,e_2))).
% 29.47/4.14 cnf(i_0_76, plain, (greater(e_5,e_3))).
% 29.47/4.14 cnf(i_0_77, plain, (greater(e_5,e_4))).
% 29.47/4.14 cnf(i_0_80, plain, (cycle(e_5,e_0))).
% 29.47/4.14 cnf(i_0_90, plain, (~equalish(e_1,e_2))).
% 29.47/4.14 cnf(i_0_91, plain, (~equalish(e_1,e_3))).
% 29.47/4.14 cnf(i_0_92, plain, (~equalish(e_1,e_4))).
% 29.47/4.14 cnf(i_0_93, plain, (~equalish(e_1,e_5))).
% 29.47/4.14 cnf(i_0_94, plain, (~equalish(e_2,e_1))).
% 29.47/4.14 cnf(i_0_95, plain, (~equalish(e_2,e_3))).
% 29.47/4.14 cnf(i_0_96, plain, (~equalish(e_2,e_4))).
% 29.47/4.14 cnf(i_0_97, plain, (~equalish(e_2,e_5))).
% 29.47/4.14 cnf(i_0_98, plain, (~equalish(e_3,e_1))).
% 29.47/4.14 cnf(i_0_99, plain, (~equalish(e_3,e_2))).
% 29.47/4.14 cnf(i_0_100, plain, (~equalish(e_3,e_4))).
% 29.47/4.14 cnf(i_0_101, plain, (~equalish(e_3,e_5))).
% 29.47/4.14 cnf(i_0_102, plain, (~equalish(e_4,e_1))).
% 29.47/4.14 cnf(i_0_103, plain, (~equalish(e_4,e_2))).
% 29.47/4.14 cnf(i_0_104, plain, (~equalish(e_4,e_3))).
% 29.47/4.14 cnf(i_0_105, plain, (~equalish(e_4,e_5))).
% 29.47/4.14 cnf(i_0_106, plain, (~equalish(e_5,e_1))).
% 29.47/4.14 cnf(i_0_107, plain, (~equalish(e_5,e_2))).
% 29.47/4.14 cnf(i_0_108, plain, (~equalish(e_5,e_3))).
% 29.47/4.14 cnf(i_0_109, plain, (~equalish(e_5,e_4))).
% 29.47/4.14 cnf(i_0_78, plain, (equalish(X2,X3)|~cycle(X1,X3)|~cycle(X1,X2))).
% 29.47/4.14 cnf(i_0_79, plain, (cycle(X1,e_0)|cycle(X1,e_1)|cycle(X1,e_2)|cycle(X1,e_3)|cycle(X1,e_4)|~group_element(X1))).
% 29.47/4.14 cnf(i_0_81, plain, (equalish(X2,X5)|~next(X4,X5)|~next(X1,X3)|~cycle(X3,X4)|~cycle(X1,X2)|~greater(X2,e_0))).
% 29.47/4.14 cnf(i_0_83, plain, (~greater(X2,X1)|~cycle(X1,e_0)|~product(X1,e_1,X2))).
% 29.47/4.14 cnf(i_0_82, plain, (~next(X3,X4)|~greater(X3,X1)|~greater(X2,X5)|~cycle(X4,X5)|~cycle(X1,X2)|~cycle(X3,e_0))).
% 29.47/4.14 cnf(i_0_84, plain, (equalish(X3,X4)|~next(X1,X4)|~cycle(X1,X2)|~greater(X2,e_0)|~product(X1,e_1,X3))).
% 29.47/4.14 cnf(i_0_111, plain, (equalish(X3,X4)|~product(X1,X2,X4)|~product(X1,X2,X3))).
% 29.47/4.14 cnf(i_0_112, plain, (equalish(X2,X4)|~product(X1,X4,X3)|~product(X1,X2,X3))).
% 29.47/4.14 cnf(i_0_113, plain, (equalish(X1,X4)|~product(X4,X2,X3)|~product(X1,X2,X3))).
% 29.47/4.14 cnf(i_0_114, negated_conjecture, (product(X1,X3,X4)|~product(X3,X2,X4)|~product(X1,X2,X3))).
% 29.47/4.14 cnf(i_0_110, 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)|~group_element(X2)|~group_element(X1))).
% 29.47/4.14 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 29.47/4.14 # Begin printing tableau
% 29.47/4.14 # Found 32 steps
% 29.47/4.14 cnf(i_0_114, negated_conjecture, (product(e_1,e_2,e_1)|~product(e_2,e_2,e_1)|~product(e_1,e_2,e_2)), inference(start_rule)).
% 29.47/4.14 cnf(i_0_115, plain, (product(e_1,e_2,e_1)), inference(extension_rule, [i_0_112])).
% 29.47/4.14 cnf(i_0_150, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_90])).
% 29.47/4.14 cnf(i_0_152, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_110])).
% 29.47/4.14 cnf(i_0_209, plain, (~group_element(e_1)), inference(closure_rule, [i_0_85])).
% 29.47/4.14 cnf(i_0_210, plain, (~group_element(e_1)), inference(closure_rule, [i_0_85])).
% 29.47/4.14 cnf(i_0_205, plain, (product(e_1,e_1,e_2)), inference(extension_rule, [i_0_83])).
% 29.47/4.14 cnf(i_0_226, plain, (~greater(e_2,e_1)), inference(closure_rule, [i_0_68])).
% 29.47/4.14 cnf(i_0_206, plain, (product(e_1,e_1,e_3)), inference(extension_rule, [i_0_84])).
% 29.47/4.14 cnf(i_0_250, plain, (equalish(e_3,e_1)), inference(closure_rule, [i_0_98])).
% 29.47/4.14 cnf(i_0_253, plain, (~greater(e_1,e_0)), inference(closure_rule, [i_0_63])).
% 29.47/4.14 cnf(i_0_207, plain, (product(e_1,e_1,e_4)), inference(extension_rule, [i_0_111])).
% 29.47/4.14 cnf(i_0_278, plain, (~product(e_1,e_1,e_4)), inference(closure_rule, [i_0_207])).
% 29.47/4.14 cnf(i_0_208, plain, (product(e_1,e_1,e_5)), inference(extension_rule, [i_0_112])).
% 29.47/4.14 cnf(i_0_300, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_94])).
% 29.47/4.14 cnf(i_0_116, plain, (~product(e_2,e_2,e_1)), inference(extension_rule, [i_0_114])).
% 29.47/4.14 cnf(i_0_328, plain, (~product(e_2,e_1,e_1)), inference(extension_rule, [i_0_110])).
% 29.47/4.14 cnf(i_0_359, plain, (~group_element(e_1)), inference(closure_rule, [i_0_85])).
% 29.47/4.14 cnf(i_0_355, plain, (product(e_2,e_1,e_2)), inference(extension_rule, [i_0_113])).
% 29.47/4.14 cnf(i_0_382, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_90])).
% 29.47/4.14 cnf(i_0_360, plain, (~group_element(e_2)), inference(closure_rule, [i_0_86])).
% 29.47/4.14 cnf(i_0_117, plain, (~product(e_1,e_2,e_2)), inference(etableau_closure_rule, [i_0_117, ...])).
% 29.47/4.14 cnf(i_0_227, plain, (~cycle(e_1,e_0)), inference(etableau_closure_rule, [i_0_227, ...])).
% 29.47/4.14 cnf(i_0_251, plain, (~next(e_1,e_1)), inference(etableau_closure_rule, [i_0_251, ...])).
% 29.47/4.14 cnf(i_0_252, plain, (~cycle(e_1,e_1)), inference(etableau_closure_rule, [i_0_252, ...])).
% 29.47/4.14 cnf(i_0_276, plain, (equalish(e_4,e_4)), inference(etableau_closure_rule, [i_0_276, ...])).
% 29.47/4.14 cnf(i_0_302, plain, (~product(e_1,e_2,e_5)), inference(etableau_closure_rule, [i_0_302, ...])).
% 29.47/4.14 cnf(i_0_329, plain, (~product(e_2,e_1,e_2)), inference(etableau_closure_rule, [i_0_329, ...])).
% 29.47/4.14 cnf(i_0_356, plain, (product(e_2,e_1,e_3)), inference(etableau_closure_rule, [i_0_356, ...])).
% 29.47/4.14 cnf(i_0_357, plain, (product(e_2,e_1,e_4)), inference(etableau_closure_rule, [i_0_357, ...])).
% 29.47/4.14 cnf(i_0_358, plain, (product(e_2,e_1,e_5)), inference(etableau_closure_rule, [i_0_358, ...])).
% 29.47/4.14 cnf(i_0_384, plain, (~product(e_1,e_1,e_2)), inference(etableau_closure_rule, [i_0_384, ...])).
% 29.47/4.14 # End printing tableau
% 29.47/4.14 # SZS output end
% 29.47/4.14 # Branches closed with saturation will be marked with an "s"
% 30.07/4.14 # Child (28766) has found a proof.
% 30.07/4.14
% 30.07/4.14 # Proof search is over...
% 30.07/4.14 # Freeing feature tree
%------------------------------------------------------------------------------