TSTP Solution File: GRP123-3.004 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP123-3.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 : n032.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:31 EDT 2022
% Result : Satisfiable 0.15s 0.49s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GRP123-3.004 : TPTP v8.1.0. Released v1.2.0.
% 0.00/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Tue Jun 14 10:53:12 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.15/0.32 # No SInE strategy applied
% 0.15/0.32 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_OS_S1U
% 0.15/0.32 # and selection function SelectComplexAHPExceptRRHorn.
% 0.15/0.32 #
% 0.15/0.32 # Number of axioms: 44 Number of unprocessed: 44
% 0.15/0.32 # Tableaux proof search.
% 0.15/0.32 # APR header successfully linked.
% 0.15/0.32 # Hello from C++
% 0.15/0.49 # The folding up rule is enabled...
% 0.15/0.49 # Local unification is enabled...
% 0.15/0.49 # Any saturation attempts will use folding labels...
% 0.15/0.49 # 44 beginning clauses after preprocessing and clausification
% 0.15/0.49 # Creating start rules for all 2 conjectures.
% 0.15/0.49 # There are 2 start rule candidates:
% 0.15/0.49 # Found 32 unit axioms.
% 0.15/0.49 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.15/0.49 # 2 start rule tableaux created.
% 0.15/0.49 # 12 extension rule candidate clauses
% 0.15/0.49 # 32 unit axiom clauses
% 0.15/0.49
% 0.15/0.49 # Requested 8, 32 cores available to the main process.
% 0.15/0.49 # There are not enough tableaux to fork, creating more from the initial 2
% 0.15/0.49 # 12293 Satisfiable branch
% 0.15/0.49 # Satisfiable branch found.
% 0.15/0.49 # There were 1 total branch saturation attempts.
% 0.15/0.49 # There were 0 of these attempts blocked.
% 0.15/0.49 # There were 0 deferred branch saturation attempts.
% 0.15/0.49 # There were 0 free duplicated saturations.
% 0.15/0.49 # There were 0 total successful branch saturations.
% 0.15/0.49 # There were 0 successful branch saturations in interreduction.
% 0.15/0.49 # There were 0 successful branch saturations on the branch.
% 0.15/0.49 # There were 0 successful branch saturations after the branch.
% 0.15/0.49 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.49 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.49 # Begin clausification derivation
% 0.15/0.49
% 0.15/0.49 # End clausification derivation
% 0.15/0.49 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.49 cnf(i_0_66, plain, (group_element(e_1))).
% 0.15/0.49 cnf(i_0_67, plain, (group_element(e_2))).
% 0.15/0.49 cnf(i_0_68, plain, (group_element(e_3))).
% 0.15/0.49 cnf(i_0_69, plain, (group_element(e_4))).
% 0.15/0.49 cnf(i_0_45, plain, (next(e_0,e_1))).
% 0.15/0.49 cnf(i_0_46, plain, (next(e_1,e_2))).
% 0.15/0.49 cnf(i_0_47, plain, (next(e_2,e_3))).
% 0.15/0.49 cnf(i_0_48, plain, (next(e_3,e_4))).
% 0.15/0.49 cnf(i_0_49, plain, (greater(e_1,e_0))).
% 0.15/0.49 cnf(i_0_50, plain, (greater(e_2,e_0))).
% 0.15/0.49 cnf(i_0_53, plain, (greater(e_2,e_1))).
% 0.15/0.49 cnf(i_0_51, plain, (greater(e_3,e_0))).
% 0.15/0.49 cnf(i_0_54, plain, (greater(e_3,e_1))).
% 0.15/0.49 cnf(i_0_56, plain, (greater(e_3,e_2))).
% 0.15/0.49 cnf(i_0_52, plain, (greater(e_4,e_0))).
% 0.15/0.49 cnf(i_0_55, plain, (greater(e_4,e_1))).
% 0.15/0.49 cnf(i_0_57, plain, (greater(e_4,e_2))).
% 0.15/0.49 cnf(i_0_58, plain, (greater(e_4,e_3))).
% 0.15/0.49 cnf(i_0_61, plain, (cycle(e_4,e_0))).
% 0.15/0.49 cnf(i_0_70, plain, (~equalish(e_1,e_2))).
% 0.15/0.49 cnf(i_0_71, plain, (~equalish(e_1,e_3))).
% 0.15/0.49 cnf(i_0_72, plain, (~equalish(e_1,e_4))).
% 0.15/0.49 cnf(i_0_73, plain, (~equalish(e_2,e_1))).
% 0.15/0.49 cnf(i_0_74, plain, (~equalish(e_2,e_3))).
% 0.15/0.49 cnf(i_0_75, plain, (~equalish(e_2,e_4))).
% 0.15/0.49 cnf(i_0_76, plain, (~equalish(e_3,e_1))).
% 0.15/0.49 cnf(i_0_77, plain, (~equalish(e_3,e_2))).
% 0.15/0.49 cnf(i_0_78, plain, (~equalish(e_3,e_4))).
% 0.15/0.49 cnf(i_0_79, plain, (~equalish(e_4,e_1))).
% 0.15/0.49 cnf(i_0_80, plain, (~equalish(e_4,e_2))).
% 0.15/0.49 cnf(i_0_81, plain, (~equalish(e_4,e_3))).
% 0.15/0.49 cnf(i_0_86, plain, (product(X1,X1,X1))).
% 0.15/0.49 cnf(i_0_60, plain, (cycle(X1,e_0)|cycle(X1,e_1)|cycle(X1,e_2)|cycle(X1,e_3)|~group_element(X1))).
% 0.15/0.49 cnf(i_0_59, plain, (equalish(X2,X3)|~cycle(X1,X3)|~cycle(X1,X2))).
% 0.15/0.49 cnf(i_0_62, plain, (equalish(X2,X5)|~next(X4,X5)|~next(X1,X3)|~cycle(X3,X4)|~cycle(X1,X2)|~greater(X2,e_0))).
% 0.15/0.49 cnf(i_0_64, plain, (~greater(X2,X1)|~cycle(X1,e_0)|~product(X1,e_1,X2))).
% 0.15/0.49 cnf(i_0_63, plain, (~next(X3,X4)|~greater(X3,X1)|~greater(X2,X5)|~cycle(X4,X5)|~cycle(X1,X2)|~cycle(X3,e_0))).
% 0.15/0.49 cnf(i_0_65, plain, (equalish(X3,X4)|~next(X1,X4)|~cycle(X1,X2)|~greater(X2,e_0)|~product(X1,e_1,X3))).
% 0.15/0.49 cnf(i_0_83, plain, (equalish(X3,X4)|~product(X1,X2,X4)|~product(X1,X2,X3))).
% 0.15/0.49 cnf(i_0_84, plain, (equalish(X2,X4)|~product(X1,X4,X3)|~product(X1,X2,X3))).
% 0.15/0.49 cnf(i_0_85, plain, (equalish(X1,X4)|~product(X4,X2,X3)|~product(X1,X2,X3))).
% 0.15/0.49 cnf(i_0_82, plain, (product(X1,X2,e_1)|product(X1,X2,e_2)|product(X1,X2,e_3)|product(X1,X2,e_4)|~group_element(X2)|~group_element(X1))).
% 0.15/0.49 cnf(i_0_88, negated_conjecture, (equalish(X2,X5)|~product(X6,X5,X4)|~product(X6,X2,X1)|~product(X4,X5,X3)|~product(X1,X2,X3))).
% 0.15/0.49 cnf(i_0_87, negated_conjecture, (equalish(X1,X4)|~product(X6,X5,X4)|~product(X6,X2,X1)|~product(X4,X5,X3)|~product(X1,X2,X3))).
% 0.15/0.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.15/0.49 # Begin printing tableau
% 0.15/0.49 # Found 8 steps
% 0.15/0.49 cnf(i_0_88, negated_conjecture, (equalish(e_1,e_2)|~product(e_2,e_2,e_2)|~product(e_2,e_1,e_1)|~product(e_2,e_2,e_2)|~product(e_1,e_1,e_2)), inference(start_rule)).
% 0.15/0.49 cnf(i_0_94, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_70])).
% 0.15/0.49 cnf(i_0_95, plain, (~product(e_2,e_2,e_2)), inference(closure_rule, [i_0_86])).
% 0.15/0.49 cnf(i_0_97, plain, (~product(e_2,e_2,e_2)), inference(closure_rule, [i_0_86])).
% 0.15/0.49 cnf(i_0_98, plain, (~product(e_1,e_1,e_2)), inference(extension_rule, [i_0_82])).
% 0.15/0.49 cnf(i_0_299, plain, (~group_element(e_1)), inference(closure_rule, [i_0_66])).
% 0.15/0.49 cnf(i_0_300, plain, (~group_element(e_1)), inference(closure_rule, [i_0_66])).
% 0.15/0.49 cnf(i_0_295, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_64])).
% 0.15/0.49 # End printing tableau
% 0.15/0.49 # SZS output end
% 0.15/0.49 # Branches closed with saturation will be marked with an "s"
% 0.15/0.49 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
% 0.15/0.49 # We now have 7 tableaux to operate on
% 0.15/0.49 # Found closed tableau during pool population.
% 0.15/0.49 # Proof search is over...
% 0.15/0.49 # Freeing feature tree
%------------------------------------------------------------------------------