TSTP Solution File: GRP123-3.003 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP123-3.003 : 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 : n017.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 : Unsatisfiable 0.21s 0.39s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP123-3.003 : 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 : n017.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 16:06:23 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.37 # No SInE strategy applied
% 0.14/0.37 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_OS_S1U
% 0.14/0.37 # and selection function SelectComplexAHPExceptRRHorn.
% 0.14/0.37 #
% 0.14/0.37 # Number of axioms: 32 Number of unprocessed: 32
% 0.14/0.37 # Tableaux proof search.
% 0.14/0.37 # APR header successfully linked.
% 0.14/0.37 # Hello from C++
% 0.21/0.38 # The folding up rule is enabled...
% 0.21/0.38 # Local unification is enabled...
% 0.21/0.38 # Any saturation attempts will use folding labels...
% 0.21/0.38 # 32 beginning clauses after preprocessing and clausification
% 0.21/0.38 # Creating start rules for all 2 conjectures.
% 0.21/0.38 # There are 2 start rule candidates:
% 0.21/0.38 # Found 20 unit axioms.
% 0.21/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.21/0.38 # 2 start rule tableaux created.
% 0.21/0.38 # 12 extension rule candidate clauses
% 0.21/0.38 # 20 unit axiom clauses
% 0.21/0.38
% 0.21/0.38 # Requested 8, 32 cores available to the main process.
% 0.21/0.38 # There are not enough tableaux to fork, creating more from the initial 2
% 0.21/0.39 # There were 4 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 4 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 4 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_49, plain, (group_element(e_1))).
% 0.21/0.39 cnf(i_0_50, plain, (group_element(e_2))).
% 0.21/0.39 cnf(i_0_51, plain, (group_element(e_3))).
% 0.21/0.39 cnf(i_0_33, plain, (next(e_0,e_1))).
% 0.21/0.39 cnf(i_0_34, plain, (next(e_1,e_2))).
% 0.21/0.39 cnf(i_0_35, plain, (next(e_2,e_3))).
% 0.21/0.39 cnf(i_0_36, plain, (greater(e_1,e_0))).
% 0.21/0.39 cnf(i_0_37, plain, (greater(e_2,e_0))).
% 0.21/0.39 cnf(i_0_39, plain, (greater(e_2,e_1))).
% 0.21/0.39 cnf(i_0_38, plain, (greater(e_3,e_0))).
% 0.21/0.39 cnf(i_0_40, plain, (greater(e_3,e_1))).
% 0.21/0.39 cnf(i_0_41, plain, (greater(e_3,e_2))).
% 0.21/0.39 cnf(i_0_44, plain, (cycle(e_3,e_0))).
% 0.21/0.39 cnf(i_0_52, plain, (~equalish(e_1,e_2))).
% 0.21/0.39 cnf(i_0_53, plain, (~equalish(e_1,e_3))).
% 0.21/0.39 cnf(i_0_54, plain, (~equalish(e_2,e_1))).
% 0.21/0.39 cnf(i_0_55, plain, (~equalish(e_2,e_3))).
% 0.21/0.39 cnf(i_0_56, plain, (~equalish(e_3,e_1))).
% 0.21/0.39 cnf(i_0_57, plain, (~equalish(e_3,e_2))).
% 0.21/0.39 cnf(i_0_43, plain, (cycle(X1,e_0)|cycle(X1,e_1)|cycle(X1,e_2)|~group_element(X1))).
% 0.21/0.39 cnf(i_0_62, plain, (product(X1,X1,X1))).
% 0.21/0.39 cnf(i_0_42, plain, (equalish(X2,X3)|~cycle(X1,X3)|~cycle(X1,X2))).
% 0.21/0.39 cnf(i_0_45, plain, (equalish(X2,X5)|~next(X4,X5)|~next(X1,X3)|~cycle(X3,X4)|~cycle(X1,X2)|~greater(X2,e_0))).
% 0.21/0.39 cnf(i_0_47, plain, (~greater(X2,X1)|~cycle(X1,e_0)|~product(X1,e_1,X2))).
% 0.21/0.39 cnf(i_0_46, plain, (~next(X3,X4)|~greater(X3,X1)|~greater(X2,X5)|~cycle(X4,X5)|~cycle(X1,X2)|~cycle(X3,e_0))).
% 0.21/0.39 cnf(i_0_48, plain, (equalish(X3,X4)|~next(X1,X4)|~cycle(X1,X2)|~greater(X2,e_0)|~product(X1,e_1,X3))).
% 0.21/0.39 cnf(i_0_58, plain, (product(X1,X2,e_1)|product(X1,X2,e_2)|product(X1,X2,e_3)|~group_element(X2)|~group_element(X1))).
% 0.21/0.39 cnf(i_0_59, plain, (equalish(X3,X4)|~product(X1,X2,X4)|~product(X1,X2,X3))).
% 0.21/0.39 cnf(i_0_60, plain, (equalish(X2,X4)|~product(X1,X4,X3)|~product(X1,X2,X3))).
% 0.21/0.39 cnf(i_0_61, plain, (equalish(X1,X4)|~product(X4,X2,X3)|~product(X1,X2,X3))).
% 0.21/0.39 cnf(i_0_64, negated_conjecture, (equalish(X2,X5)|~product(X6,X5,X4)|~product(X6,X2,X1)|~product(X4,X5,X3)|~product(X1,X2,X3))).
% 0.21/0.39 cnf(i_0_63, negated_conjecture, (equalish(X1,X4)|~product(X6,X5,X4)|~product(X6,X2,X1)|~product(X4,X5,X3)|~product(X1,X2,X3))).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 12 steps
% 0.21/0.39 cnf(i_0_64, 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.21/0.39 cnf(i_0_70, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_52])).
% 0.21/0.39 cnf(i_0_71, plain, (~product(e_2,e_2,e_2)), inference(closure_rule, [i_0_62])).
% 0.21/0.39 cnf(i_0_73, plain, (~product(e_2,e_2,e_2)), inference(closure_rule, [i_0_62])).
% 0.21/0.39 cnf(i_0_74, plain, (~product(e_1,e_1,e_2)), inference(extension_rule, [i_0_58])).
% 0.21/0.39 cnf(i_0_258, plain, (~group_element(e_1)), inference(closure_rule, [i_0_49])).
% 0.21/0.39 cnf(i_0_259, plain, (~group_element(e_1)), inference(closure_rule, [i_0_49])).
% 0.21/0.39 cnf(i_0_255, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_47])).
% 0.21/0.39 cnf(i_0_72, plain, (~product(e_2,e_1,e_1)), inference(etableau_closure_rule, [i_0_72, ...])).
% 0.21/0.39 cnf(i_0_257, plain, (product(e_1,e_1,e_3)), inference(etableau_closure_rule, [i_0_257, ...])).
% 0.21/0.39 cnf(i_0_292, plain, (~greater(e_1,e_1)), inference(etableau_closure_rule, [i_0_292, ...])).
% 0.21/0.39 cnf(i_0_293, plain, (~cycle(e_1,e_0)), inference(etableau_closure_rule, [i_0_293, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # Returning from population with 6 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.39 # We now have 6 tableaux to operate on
% 0.21/0.39 # Found closed tableau during pool population.
% 0.21/0.39 # Proof search is over...
% 0.21/0.39 # Freeing feature tree
%------------------------------------------------------------------------------