TSTP Solution File: GRP127-1.005 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP127-1.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 : n026.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:44 EDT 2022
% Result : Satisfiable 42.44s 18.43s
% Output : CNFRefutation 42.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP127-1.005 : TPTP v8.1.0. Released v1.2.0.
% 0.08/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.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 12:32:21 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.38 # No SInE strategy applied
% 0.14/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.38 #
% 0.14/0.38 # Presaturation interreduction done
% 0.14/0.38 # Number of axioms: 31 Number of unprocessed: 31
% 0.14/0.38 # Tableaux proof search.
% 0.14/0.38 # APR header successfully linked.
% 0.14/0.38 # Hello from C++
% 1.31/1.49 # The folding up rule is enabled...
% 1.31/1.49 # Local unification is enabled...
% 1.31/1.49 # Any saturation attempts will use folding labels...
% 1.31/1.49 # 31 beginning clauses after preprocessing and clausification
% 1.31/1.49 # Creating start rules for all 1 conjectures.
% 1.31/1.49 # There are 1 start rule candidates:
% 1.31/1.49 # Found 26 unit axioms.
% 1.31/1.49 # 1 start rule tableaux created.
% 1.31/1.49 # 5 extension rule candidate clauses
% 1.31/1.49 # 26 unit axiom clauses
% 1.31/1.49
% 1.31/1.49 # Requested 8, 32 cores available to the main process.
% 1.31/1.49 # There are not enough tableaux to fork, creating more from the initial 1
% 14.68/14.87 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 14.68/14.87 # We now have 13 tableaux to operate on
% 42.44/18.42 # 30515 Satisfiable branch
% 42.44/18.43 # Satisfiable branch found.
% 42.44/18.43 # There were 14 total branch saturation attempts.
% 42.44/18.43 # There were 7 of these attempts blocked.
% 42.44/18.43 # There were 0 deferred branch saturation attempts.
% 42.44/18.43 # There were 0 free duplicated saturations.
% 42.44/18.43 # There were 1 total successful branch saturations.
% 42.44/18.43 # There were 0 successful branch saturations in interreduction.
% 42.44/18.43 # There were 0 successful branch saturations on the branch.
% 42.44/18.43 # There were 1 successful branch saturations after the branch.
% 42.44/18.43 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 42.44/18.43 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 42.44/18.43 # Begin clausification derivation
% 42.44/18.43
% 42.44/18.43 # End clausification derivation
% 42.44/18.43 # Begin listing active clauses obtained from FOF to CNF conversion
% 42.44/18.43 cnf(i_0_32, plain, (group_element(e_1))).
% 42.44/18.43 cnf(i_0_33, plain, (group_element(e_2))).
% 42.44/18.43 cnf(i_0_34, plain, (group_element(e_3))).
% 42.44/18.43 cnf(i_0_35, plain, (group_element(e_4))).
% 42.44/18.43 cnf(i_0_36, plain, (group_element(e_5))).
% 42.44/18.43 cnf(i_0_61, plain, (product(X1,X1,X1))).
% 42.44/18.43 cnf(i_0_37, plain, (~equalish(e_1,e_2))).
% 42.44/18.43 cnf(i_0_38, plain, (~equalish(e_1,e_3))).
% 42.44/18.43 cnf(i_0_39, plain, (~equalish(e_1,e_4))).
% 42.44/18.43 cnf(i_0_40, plain, (~equalish(e_1,e_5))).
% 42.44/18.43 cnf(i_0_41, plain, (~equalish(e_2,e_1))).
% 42.44/18.43 cnf(i_0_42, plain, (~equalish(e_2,e_3))).
% 42.44/18.43 cnf(i_0_43, plain, (~equalish(e_2,e_4))).
% 42.44/18.43 cnf(i_0_44, plain, (~equalish(e_2,e_5))).
% 42.44/18.43 cnf(i_0_45, plain, (~equalish(e_3,e_1))).
% 42.44/18.43 cnf(i_0_46, plain, (~equalish(e_3,e_2))).
% 42.44/18.43 cnf(i_0_47, plain, (~equalish(e_3,e_4))).
% 42.44/18.43 cnf(i_0_48, plain, (~equalish(e_3,e_5))).
% 42.44/18.43 cnf(i_0_49, plain, (~equalish(e_4,e_1))).
% 42.44/18.43 cnf(i_0_50, plain, (~equalish(e_4,e_2))).
% 42.44/18.43 cnf(i_0_51, plain, (~equalish(e_4,e_3))).
% 42.44/18.43 cnf(i_0_52, plain, (~equalish(e_4,e_5))).
% 42.44/18.43 cnf(i_0_53, plain, (~equalish(e_5,e_1))).
% 42.44/18.43 cnf(i_0_54, plain, (~equalish(e_5,e_2))).
% 42.44/18.43 cnf(i_0_55, plain, (~equalish(e_5,e_3))).
% 42.44/18.43 cnf(i_0_56, plain, (~equalish(e_5,e_4))).
% 42.44/18.43 cnf(i_0_58, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 42.44/18.43 cnf(i_0_59, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))).
% 42.44/18.43 cnf(i_0_60, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))).
% 42.44/18.43 cnf(i_0_62, negated_conjecture, (product(X1,X2,X3)|~product(X4,X2,X1)|~product(X2,X3,X4))).
% 42.44/18.43 cnf(i_0_57, plain, (product(X1,X2,e_5)|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))).
% 42.44/18.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 42.44/18.43 # Begin printing tableau
% 42.44/18.43 # Found 15 steps
% 42.44/18.43 cnf(i_0_62, 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)).
% 42.44/18.43 cnf(i_0_64, plain, (~product(e_1,e_1,e_1)), inference(closure_rule, [i_0_61])).
% 42.44/18.43 cnf(i_0_65, plain, (~product(e_1,e_1,e_1)), inference(closure_rule, [i_0_61])).
% 42.44/18.43 cnf(i_0_63, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_60])).
% 42.44/18.43 cnf(i_0_72, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_37])).
% 42.44/18.43 cnf(i_0_73, plain, (~product(e_2,e_1,e_1)), inference(extension_rule, [i_0_57])).
% 42.44/18.43 cnf(i_0_99, plain, (~group_element(e_1)), inference(closure_rule, [i_0_32])).
% 42.44/18.43 cnf(i_0_100, plain, (~group_element(e_2)), inference(closure_rule, [i_0_33])).
% 42.44/18.43 cnf(i_0_94, plain, (product(e_2,e_1,e_5)), inference(extension_rule, [i_0_58])).
% 42.44/18.43 cnf(i_0_615348, plain, (~product(e_2,e_1,e_5)), inference(closure_rule, [i_0_94])).
% 42.44/18.43 cnf(i_0_95, plain, (product(e_2,e_1,e_4)), inference(extension_rule, [i_0_58])).
% 42.44/18.43 cnf(i_0_678669, plain, (~product(e_2,e_1,e_4)), inference(closure_rule, [i_0_95])).
% 42.44/18.43 cnf(i_0_96, plain, (product(e_2,e_1,e_3)), inference(extension_rule, [i_0_59])).
% 42.44/18.43 cnf(i_0_745395, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_41])).
% 42.44/18.43 cnf(i_0_97, plain, (product(e_2,e_1,e_2)), inference(etableau_closure_rule, [i_0_97, ...])).
% 42.44/18.43 # End printing tableau
% 42.44/18.43 # SZS output end
% 42.44/18.43 # Branches closed with saturation will be marked with an "s"
% 42.44/18.46 # Child (30515) has found a proof.
% 42.44/18.46
% 42.44/18.46 # Proof search is over...
% 42.44/18.46 # Freeing feature tree
%------------------------------------------------------------------------------