TSTP Solution File: GRP130-3.003 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP130-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 : n016.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:53 EDT 2022
% Result : Unsatisfiable 0.19s 0.41s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP130-3.003 : TPTP v8.1.0. Released v1.2.0.
% 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 18:31:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b
% 0.12/0.36 # and selection function SelectCQIPrecW.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 30 Number of unprocessed: 30
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 30 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 1 conjectures.
% 0.12/0.36 # There are 1 start rule candidates:
% 0.12/0.36 # Found 19 unit axioms.
% 0.12/0.36 # 1 start rule tableaux created.
% 0.12/0.36 # 11 extension rule candidate clauses
% 0.12/0.36 # 19 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.36 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 8 tableaux to operate on
% 0.19/0.41 # There were 7 total branch saturation attempts.
% 0.19/0.41 # There were 0 of these attempts blocked.
% 0.19/0.41 # There were 0 deferred branch saturation attempts.
% 0.19/0.41 # There were 0 free duplicated saturations.
% 0.19/0.41 # There were 7 total successful branch saturations.
% 0.19/0.41 # There were 0 successful branch saturations in interreduction.
% 0.19/0.41 # There were 0 successful branch saturations on the branch.
% 0.19/0.41 # There were 7 successful branch saturations after the branch.
% 0.19/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.41 # Begin clausification derivation
% 0.19/0.41
% 0.19/0.41 # End clausification derivation
% 0.19/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.41 cnf(i_0_47, plain, (group_element(e_1))).
% 0.19/0.41 cnf(i_0_48, plain, (group_element(e_2))).
% 0.19/0.41 cnf(i_0_49, plain, (group_element(e_3))).
% 0.19/0.41 cnf(i_0_31, plain, (next(e_0,e_1))).
% 0.19/0.41 cnf(i_0_32, plain, (next(e_1,e_2))).
% 0.19/0.41 cnf(i_0_33, plain, (next(e_2,e_3))).
% 0.19/0.41 cnf(i_0_34, plain, (greater(e_1,e_0))).
% 0.19/0.41 cnf(i_0_35, plain, (greater(e_2,e_0))).
% 0.19/0.41 cnf(i_0_37, plain, (greater(e_2,e_1))).
% 0.19/0.41 cnf(i_0_36, plain, (greater(e_3,e_0))).
% 0.19/0.41 cnf(i_0_38, plain, (greater(e_3,e_1))).
% 0.19/0.41 cnf(i_0_39, plain, (greater(e_3,e_2))).
% 0.19/0.41 cnf(i_0_42, plain, (cycle(e_3,e_0))).
% 0.19/0.41 cnf(i_0_50, plain, (~equalish(e_1,e_2))).
% 0.19/0.41 cnf(i_0_51, plain, (~equalish(e_1,e_3))).
% 0.19/0.41 cnf(i_0_52, plain, (~equalish(e_2,e_1))).
% 0.19/0.41 cnf(i_0_53, plain, (~equalish(e_2,e_3))).
% 0.19/0.41 cnf(i_0_54, plain, (~equalish(e_3,e_1))).
% 0.19/0.41 cnf(i_0_55, plain, (~equalish(e_3,e_2))).
% 0.19/0.41 cnf(i_0_45, plain, (~product(X1,e_1,X2)|~cycle(X1,e_0)|~greater(X2,X1))).
% 0.19/0.41 cnf(i_0_40, plain, (equalish(X1,X2)|~cycle(X3,X2)|~cycle(X3,X1))).
% 0.19/0.41 cnf(i_0_57, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.19/0.41 cnf(i_0_41, plain, (cycle(X1,e_2)|cycle(X1,e_1)|cycle(X1,e_0)|~group_element(X1))).
% 0.19/0.41 cnf(i_0_58, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))).
% 0.19/0.41 cnf(i_0_59, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))).
% 0.19/0.41 cnf(i_0_60, negated_conjecture, (product(X1,X2,X3)|~product(X3,X4,X1)|~product(X3,X2,X4))).
% 0.19/0.41 cnf(i_0_56, plain, (product(X1,X2,e_3)|product(X1,X2,e_2)|product(X1,X2,e_1)|~group_element(X2)|~group_element(X1))).
% 0.19/0.41 cnf(i_0_43, plain, (equalish(X1,X2)|~cycle(X3,X4)|~cycle(X5,X1)|~greater(X1,e_0)|~next(X4,X2)|~next(X5,X3))).
% 0.19/0.41 cnf(i_0_46, plain, (equalish(X1,X2)|~product(X3,e_1,X1)|~cycle(X3,X4)|~greater(X4,e_0)|~next(X3,X2))).
% 0.19/0.41 cnf(i_0_44, plain, (~cycle(X1,e_0)|~cycle(X2,X3)|~cycle(X4,X5)|~greater(X1,X4)|~greater(X5,X3)|~next(X1,X2))).
% 0.19/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.41 # Begin printing tableau
% 0.19/0.41 # Found 28 steps
% 0.19/0.41 cnf(i_0_60, negated_conjecture, (product(e_1,e_1,e_3)|~product(e_3,e_1,e_1)|~product(e_3,e_1,e_1)), inference(start_rule)).
% 0.19/0.41 cnf(i_0_61, plain, (product(e_1,e_1,e_3)), inference(extension_rule, [i_0_58])).
% 0.19/0.41 cnf(i_0_77, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_50])).
% 0.19/0.41 cnf(i_0_78, plain, (~product(e_1,e_2,e_3)), inference(extension_rule, [i_0_56])).
% 0.19/0.41 cnf(i_0_130, plain, (~group_element(e_2)), inference(closure_rule, [i_0_48])).
% 0.19/0.41 cnf(i_0_131, plain, (~group_element(e_1)), inference(closure_rule, [i_0_47])).
% 0.19/0.41 cnf(i_0_128, plain, (product(e_1,e_2,e_2)), inference(extension_rule, [i_0_57])).
% 0.19/0.41 cnf(i_0_138, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_50])).
% 0.19/0.41 cnf(i_0_129, plain, (product(e_1,e_2,e_1)), inference(extension_rule, [i_0_58])).
% 0.19/0.41 cnf(i_0_151, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_50])).
% 0.19/0.41 cnf(i_0_62, plain, (~product(e_3,e_1,e_1)), inference(extension_rule, [i_0_60])).
% 0.19/0.41 cnf(i_0_185, plain, (~product(e_1,e_1,e_3)), inference(extension_rule, [i_0_56])).
% 0.19/0.41 cnf(i_0_220, plain, (~group_element(e_1)), inference(closure_rule, [i_0_47])).
% 0.19/0.41 cnf(i_0_221, plain, (~group_element(e_1)), inference(closure_rule, [i_0_47])).
% 0.19/0.41 cnf(i_0_218, plain, (product(e_1,e_1,e_2)), inference(extension_rule, [i_0_45])).
% 0.19/0.41 cnf(i_0_224, plain, (~greater(e_2,e_1)), inference(closure_rule, [i_0_37])).
% 0.19/0.41 cnf(i_0_219, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_59])).
% 0.19/0.41 cnf(i_0_232, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_52])).
% 0.19/0.41 cnf(i_0_186, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_56])).
% 0.19/0.41 cnf(i_0_271, plain, (~group_element(e_1)), inference(closure_rule, [i_0_47])).
% 0.19/0.41 cnf(i_0_272, plain, (~group_element(e_1)), inference(closure_rule, [i_0_47])).
% 0.19/0.41 cnf(i_0_63, plain, (~product(e_3,e_1,e_1)), inference(etableau_closure_rule, [i_0_63, ...])).
% 0.19/0.41 cnf(i_0_140, plain, (~product(e_1,e_2,e_1)), inference(etableau_closure_rule, [i_0_140, ...])# Ran out of tableaux, making start rules for all clauses
% 0.19/0.41 ).
% 0.19/0.41 cnf(i_0_153, plain, (~product(e_1,e_1,e_1)), inference(etableau_closure_rule, [i_0_153, ...])).
% 0.19/0.41 cnf(i_0_223, plain, (~cycle(e_1,e_0)), inference(etableau_closure_rule, [i_0_223, ...])).
% 0.19/0.41 cnf(i_0_234, plain, (~product(e_2,e_1,e_1)), inference(etableau_closure_rule, [i_0_234, ...])).
% 0.19/0.41 cnf(i_0_268, plain, (product(e_1,e_1,e_3)), inference(etableau_closure_rule, [i_0_268, ...])).
% 0.19/0.41 cnf(i_0_269, plain, (product(e_1,e_1,e_2)), inference(etableau_closure_rule, [i_0_269, ...])).
% 0.19/0.41 # End printing tableau
% 0.19/0.41 # SZS output end
% 0.19/0.41 # Branches closed with saturation will be marked with an "s"
% 0.19/0.41 # Child (21566) has found a proof.
% 0.19/0.41
% 0.19/0.41 # Proof search is over...
% 0.19/0.41 # Freeing feature tree
%------------------------------------------------------------------------------