TSTP Solution File: GRP133-2.003 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP133-2.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 : n029.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:57 EDT 2022
% Result : Unsatisfiable 0.20s 0.44s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP133-2.003 : TPTP v8.1.0. Released v1.2.0.
% 0.03/0.14 % 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 : n029.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 : Mon Jun 13 06:54:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.38 # No SInE strategy applied
% 0.20/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b
% 0.20/0.38 # and selection function SelectCQIPrecW.
% 0.20/0.38 #
% 0.20/0.38 # Presaturation interreduction done
% 0.20/0.38 # Number of axioms: 20 Number of unprocessed: 20
% 0.20/0.38 # Tableaux proof search.
% 0.20/0.38 # APR header successfully linked.
% 0.20/0.38 # Hello from C++
% 0.20/0.38 # The folding up rule is enabled...
% 0.20/0.38 # Local unification is enabled...
% 0.20/0.38 # Any saturation attempts will use folding labels...
% 0.20/0.38 # 20 beginning clauses after preprocessing and clausification
% 0.20/0.38 # Creating start rules for all 1 conjectures.
% 0.20/0.38 # There are 1 start rule candidates:
% 0.20/0.38 # Found 14 unit axioms.
% 0.20/0.38 # 1 start rule tableaux created.
% 0.20/0.38 # 6 extension rule candidate clauses
% 0.20/0.38 # 14 unit axiom clauses
% 0.20/0.38
% 0.20/0.38 # Requested 8, 32 cores available to the main process.
% 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.20/0.38 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.38 # We now have 10 tableaux to operate on
% 0.20/0.44 # There were 10 total branch saturation attempts.
% 0.20/0.44 # There were 0 of these attempts blocked.
% 0.20/0.44 # There were 0 deferred branch saturation attempts.
% 0.20/0.44 # There were 2 free duplicated saturations.
% 0.20/0.44 # There were 10 total successful branch saturations.
% 0.20/0.44 # There were 1 successful branch saturations in interreduction.
% 0.20/0.44 # There were 0 successful branch saturations on the branch.
% 0.20/0.44 # There were 7 successful branch saturations after the branch.
% 0.20/0.44 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.44 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.44 # Begin clausification derivation
% 0.20/0.44
% 0.20/0.44 # End clausification derivation
% 0.20/0.44 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.44 cnf(i_0_27, plain, (group_element(e_1))).
% 0.20/0.44 cnf(i_0_28, plain, (group_element(e_2))).
% 0.20/0.44 cnf(i_0_29, plain, (group_element(e_3))).
% 0.20/0.44 cnf(i_0_21, plain, (next(e_1,e_2))).
% 0.20/0.44 cnf(i_0_22, plain, (next(e_2,e_3))).
% 0.20/0.44 cnf(i_0_23, plain, (greater(e_2,e_1))).
% 0.20/0.44 cnf(i_0_24, plain, (greater(e_3,e_1))).
% 0.20/0.44 cnf(i_0_25, plain, (greater(e_3,e_2))).
% 0.20/0.44 cnf(i_0_30, plain, (~equalish(e_1,e_2))).
% 0.20/0.44 cnf(i_0_31, plain, (~equalish(e_1,e_3))).
% 0.20/0.44 cnf(i_0_32, plain, (~equalish(e_2,e_1))).
% 0.20/0.44 cnf(i_0_33, plain, (~equalish(e_2,e_3))).
% 0.20/0.44 cnf(i_0_34, plain, (~equalish(e_3,e_1))).
% 0.20/0.44 cnf(i_0_35, plain, (~equalish(e_3,e_2))).
% 0.20/0.44 cnf(i_0_26, plain, (~product(X1,e_1,X2)|~greater(X2,X3)|~next(X1,X3))).
% 0.20/0.44 cnf(i_0_37, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.20/0.44 cnf(i_0_36, plain, (product(X1,X2,e_3)|product(X1,X2,e_2)|product(X1,X2,e_1)|~group_element(X2)|~group_element(X1))).
% 0.20/0.44 cnf(i_0_38, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))).
% 0.20/0.44 cnf(i_0_39, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))).
% 0.20/0.44 cnf(i_0_40, negated_conjecture, (product(X1,X2,X3)|~product(X4,X3,X2)|~product(X3,X4,X1))).
% 0.20/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.44 # Begin printing tableau
% 0.20/0.44 # Found 34 steps
% 0.20/0.44 cnf(i_0_40, negated_conjecture, (product(e_1,e_1,e_3)|~product(e_1,e_3,e_1)|~product(e_3,e_1,e_1)), inference(start_rule)).
% 0.20/0.44 cnf(i_0_41, plain, (product(e_1,e_1,e_3)), inference(extension_rule, [i_0_39])).
% 0.20/0.44 cnf(i_0_58, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_30])).
% 0.20/0.44 cnf(i_0_59, plain, (~product(e_2,e_1,e_3)), inference(extension_rule, [i_0_36])).
% 0.20/0.44 cnf(i_0_93, plain, (~group_element(e_1)), inference(closure_rule, [i_0_27])).
% 0.20/0.44 cnf(i_0_94, plain, (~group_element(e_2)), inference(closure_rule, [i_0_28])).
% 0.20/0.44 cnf(i_0_91, plain, (product(e_2,e_1,e_2)), inference(extension_rule, [i_0_26])).
% 0.20/0.44 cnf(i_0_96, plain, (~greater(e_2,e_1)), inference(closure_rule, [i_0_23])).
% 0.20/0.44 cnf(i_0_92, plain, (product(e_2,e_1,e_1)), inference(extension_rule, [i_0_37])).
% 0.20/0.44 cnf(i_0_98, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_32])).
% 0.20/0.44 cnf(i_0_42, plain, (~product(e_1,e_3,e_1)), inference(extension_rule, [i_0_40])).
% 0.20/0.44 cnf(i_0_108, plain, (~product(e_1,e_1,e_3)), inference(extension_rule, [i_0_36])).
% 0.20/0.44 cnf(i_0_119, plain, (~group_element(e_1)), inference(closure_rule, [i_0_27])).
% 0.20/0.44 cnf(i_0_120, plain, (~group_element(e_1)), inference(closure_rule, [i_0_27])).
% 0.20/0.44 cnf(i_0_117, plain, (product(e_1,e_1,e_2)), inference(extension_rule, [i_0_38])).
% 0.20/0.44 cnf(i_0_121, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_32])).
% 0.20/0.44 cnf(i_0_118, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_39])).
% 0.20/0.44 cnf(i_0_124, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_32])).
% 0.20/0.44 cnf(i_0_109, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_40])).
% 0.20/0.44 cnf(i_0_134, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_36])).
% 0.20/0.44 cnf(i_0_145, plain, (~group_element(e_1)), inference(closure_rule, [i_0_27])).
% 0.20/0.44 cnf(i_0_43, plain, (~product(e_3,e_1,e_1)), inference(etableau_closure_rule, [i_0_43, ...])).
% 0.20/0.44 cnf(i_0_97, plain, (~next(e_2,e_1)), inference(etableau_closure_rule, [i_0_97, ...])).
% 0.20/0.44 cnf(i_0_100, plain, (~product(e_2,e_1,e_2)), inference(etableau_closure_rule, [i_0_100, ...])).
% 0.20/0.44 cnf(i_0_123, plain, (~product(e_1,e_2,e_2)), inference(etableau_closure_rule, [i_0_123, ...])).
% 0.20/0.44 cnf(i_0_126, plain, (~product(e_2,e_1,e_1)), inference(etableau_closure_rule, [i_0_126, ...])).
% 0.20/0.44 cnf(i_0_135, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_36])).
% 0.20/0.44 cnf(i_0_1369, plain, (~group_element(e_1)), inference(closure_rule, [i_0_27])).
% 0.20/0.44 cnf(i_0_1370, plain, (~group_element(e_1)), inference(closure_rule, [i_0_27])).
% 0.20/0.44 cnf(i_0_142, plain, (product(e_1,e_1,e_3)), inference(etableau_closure_rule, [i_0_142, ...])).
% 0.20/0.44 cnf(i_0_143, plain, (product(e_1,e_1,e_2)), inference(etableau_closure_rule, [i_0_143, ...])).
% 0.20/0.44 cnf(i_0_146, plain, (~group_element(e_1)), inference(etableau_closure_rule, [i_0_146, ...])).
% 0.20/0.44 cnf(i_0_1366, plain, (product(e_1,e_1,e_3)), inference(etableau_closure_rule, [i_0_1366, ...])).
% 0.20/0.44 cnf(i_0_1367, plain, (product(e_1,e_1,e_2)), inference(etableau_closure_rule, [i_0_1367, ...])).
% 0.20/0.44 # End printing tableau
% 0.20/0.44 # SZS output end
% 0.20/0.44 # Branches closed with saturation will be marked with an "s"
% 0.20/0.44 # Child (29464) has found a proof.
% 0.20/0.44
% 0.20/0.44 # Proof search is over...
% 0.20/0.44 # Freeing feature tree
%------------------------------------------------------------------------------