TSTP Solution File: GRP129-1.003 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP129-1.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 : n028.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:49 EDT 2022
% Result : Unsatisfiable 0.13s 0.40s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP129-1.003 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 14 07:36:38 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.36 # No SInE strategy applied
% 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.36 #
% 0.13/0.36 # Presaturation interreduction done
% 0.13/0.36 # Number of axioms: 14 Number of unprocessed: 14
% 0.13/0.36 # Tableaux proof search.
% 0.13/0.36 # APR header successfully linked.
% 0.13/0.36 # Hello from C++
% 0.13/0.36 # The folding up rule is enabled...
% 0.13/0.36 # Local unification is enabled...
% 0.13/0.36 # Any saturation attempts will use folding labels...
% 0.13/0.36 # 14 beginning clauses after preprocessing and clausification
% 0.13/0.36 # Creating start rules for all 1 conjectures.
% 0.13/0.36 # There are 1 start rule candidates:
% 0.13/0.36 # Found 9 unit axioms.
% 0.13/0.36 # 1 start rule tableaux created.
% 0.13/0.36 # 5 extension rule candidate clauses
% 0.13/0.36 # 9 unit axiom clauses
% 0.13/0.36
% 0.13/0.36 # Requested 8, 32 cores available to the main process.
% 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.36 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.36 # We now have 8 tableaux to operate on
% 0.13/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.40 # There were 6 total branch saturation attempts.
% 0.13/0.40 # There were 0 of these attempts blocked.
% 0.13/0.40 # There were 0 deferred branch saturation attempts.
% 0.13/0.40 # There were 0 free duplicated saturations.
% 0.13/0.40 # There were 6 total successful branch saturations.
% 0.13/0.40 # There were 0 successful branch saturations in interreduction.
% 0.13/0.40 # There were 0 successful branch saturations on the branch.
% 0.13/0.40 # There were 6 successful branch saturations after the branch.
% 0.13/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.40 # Begin clausification derivation
% 0.13/0.40
% 0.13/0.40 # End clausification derivation
% 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.40 cnf(i_0_15, plain, (group_element(e_1))).
% 0.13/0.40 cnf(i_0_16, plain, (group_element(e_2))).
% 0.13/0.40 cnf(i_0_17, plain, (group_element(e_3))).
% 0.13/0.40 cnf(i_0_18, plain, (~equalish(e_1,e_2))).
% 0.13/0.40 cnf(i_0_19, plain, (~equalish(e_1,e_3))).
% 0.13/0.40 cnf(i_0_20, plain, (~equalish(e_2,e_1))).
% 0.13/0.40 cnf(i_0_21, plain, (~equalish(e_2,e_3))).
% 0.13/0.40 cnf(i_0_22, plain, (~equalish(e_3,e_1))).
% 0.13/0.40 cnf(i_0_23, plain, (~equalish(e_3,e_2))).
% 0.13/0.40 cnf(i_0_25, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.13/0.40 cnf(i_0_26, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))).
% 0.13/0.40 cnf(i_0_27, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))).
% 0.13/0.40 cnf(i_0_28, negated_conjecture, (product(X1,X2,X3)|~product(X4,X1,X3)|~product(X2,X4,X1))).
% 0.13/0.40 cnf(i_0_24, plain, (product(X1,X2,e_3)|product(X1,X2,e_2)|product(X1,X2,e_1)|~group_element(X2)|~group_element(X1))).
% 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.40 # Begin printing tableau
% 0.13/0.40 # Found 16 steps
% 0.13/0.40 cnf(i_0_24, plain, (product(e_1,e_1,e_3)|product(e_1,e_1,e_2)|product(e_1,e_1,e_1)|~group_element(e_1)|~group_element(e_1)), inference(start_rule)).
% 0.13/0.40 cnf(i_0_90, plain, (~group_element(e_1)), inference(closure_rule, [i_0_15])).
% 0.13/0.40 cnf(i_0_91, plain, (~group_element(e_1)), inference(closure_rule, [i_0_15])).
% 0.13/0.40 cnf(i_0_89, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_26])).
% 0.13/0.40 cnf(i_0_926, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_20])).
% 0.13/0.40 cnf(i_0_928, plain, (~product(e_1,e_2,e_1)), inference(extension_rule, [i_0_28])).
% 0.13/0.40 cnf(i_0_936, plain, (~product(e_1,e_1,e_1)), inference(closure_rule, [i_0_89])).
% 0.13/0.40 cnf(i_0_937, plain, (~product(e_2,e_1,e_1)), inference(extension_rule, [i_0_24])).
% 0.13/0.40 cnf(i_0_947, plain, (~group_element(e_1)), inference(closure_rule, [i_0_15])).
% 0.13/0.40 cnf(i_0_948, plain, (~group_element(e_2)), inference(closure_rule, [i_0_16])).
% 0.13/0.40 cnf(i_0_88, plain, (product(e_1,e_1,e_2)), inference(extension_rule, [i_0_27])).
% 0.13/0.40 cnf(i_0_949, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_20])).
% 0.13/0.40 cnf(i_0_87, plain, (product(e_1,e_1,e_3)), inference(etableau_closure_rule, [i_0_87, ...])).
% 0.13/0.40 cnf(i_0_944, plain, (product(e_2,e_1,e_3)), inference(etableau_closure_rule, [i_0_944, ...])).
% 0.13/0.40 cnf(i_0_945, plain, (product(e_2,e_1,e_2)), inference(etableau_closure_rule, [i_0_945, ...])).
% 0.13/0.40 cnf(i_0_951, plain, (~product(e_2,e_1,e_2)), inference(etableau_closure_rule, [i_0_951, ...])).
% 0.13/0.40 # End printing tableau
% 0.13/0.40 # SZS output end
% 0.13/0.40 # Branches closed with saturation will be marked with an "s"
% 0.13/0.40 # Child (19523) has found a proof.
% 0.13/0.40
% 0.13/0.40 # Proof search is over...
% 0.13/0.40 # Freeing feature tree
%------------------------------------------------------------------------------