TSTP Solution File: GRP355-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP355-1 : TPTP v8.1.0. Released v2.5.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:06:06 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.12 % Problem : GRP355-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.33 % Computer : n026.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Mon Jun 13 06:05:50 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.36 # No SInE strategy applied
% 0.20/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.36 #
% 0.20/0.36 # Presaturation interreduction done
% 0.20/0.36 # Number of axioms: 25 Number of unprocessed: 25
% 0.20/0.36 # Tableaux proof search.
% 0.20/0.36 # APR header successfully linked.
% 0.20/0.36 # Hello from C++
% 0.20/0.36 # The folding up rule is enabled...
% 0.20/0.36 # Local unification is enabled...
% 0.20/0.36 # Any saturation attempts will use folding labels...
% 0.20/0.36 # 25 beginning clauses after preprocessing and clausification
% 0.20/0.36 # Creating start rules for all 22 conjectures.
% 0.20/0.36 # There are 22 start rule candidates:
% 0.20/0.36 # Found 3 unit axioms.
% 0.20/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.36 # 22 start rule tableaux created.
% 0.20/0.36 # 22 extension rule candidate clauses
% 0.20/0.36 # 3 unit axiom clauses
% 0.20/0.36
% 0.20/0.36 # Requested 8, 32 cores available to the main process.
% 0.20/0.44 # Creating equality axioms
% 0.20/0.44 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.44 # Creating equality axioms
% 0.20/0.44 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.44 # Creating equality axioms
% 0.20/0.44 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.44 # There were 1 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 0 free duplicated saturations.
% 0.20/0.44 # There were 1 total successful branch saturations.
% 0.20/0.44 # There were 0 successful branch saturations in interreduction.
% 0.20/0.44 # There were 0 successful branch saturations on the branch.
% 0.20/0.44 # There were 1 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_26, plain, (multiply(identity,X1)=X1)).
% 0.20/0.44 cnf(i_0_27, plain, (multiply(inverse(X1),X1)=identity)).
% 0.20/0.44 cnf(i_0_28, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
% 0.20/0.44 cnf(i_0_44, negated_conjecture, (inverse(sk_c1)=sk_c8|inverse(sk_c2)=sk_c8)).
% 0.20/0.44 cnf(i_0_46, negated_conjecture, (inverse(sk_c1)=sk_c8|inverse(sk_c3)=sk_c6)).
% 0.20/0.44 cnf(i_0_49, negated_conjecture, (inverse(sk_c1)=sk_c8|inverse(sk_c4)=sk_c8)).
% 0.20/0.44 cnf(i_0_30, negated_conjecture, (multiply(sk_c7,sk_c6)=sk_c8|inverse(sk_c2)=sk_c8)).
% 0.20/0.44 cnf(i_0_37, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c7|inverse(sk_c2)=sk_c8)).
% 0.20/0.44 cnf(i_0_32, negated_conjecture, (multiply(sk_c7,sk_c6)=sk_c8|inverse(sk_c3)=sk_c6)).
% 0.20/0.44 cnf(i_0_39, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c7|inverse(sk_c3)=sk_c6)).
% 0.20/0.44 cnf(i_0_35, negated_conjecture, (multiply(sk_c7,sk_c6)=sk_c8|inverse(sk_c4)=sk_c8)).
% 0.20/0.44 cnf(i_0_42, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c7|inverse(sk_c4)=sk_c8)).
% 0.20/0.44 cnf(i_0_47, negated_conjecture, (multiply(sk_c8,sk_c5)=sk_c6|inverse(sk_c1)=sk_c8)).
% 0.20/0.44 cnf(i_0_43, negated_conjecture, (multiply(sk_c2,sk_c8)=sk_c7|inverse(sk_c1)=sk_c8)).
% 0.20/0.44 cnf(i_0_45, negated_conjecture, (multiply(sk_c3,sk_c6)=sk_c7|inverse(sk_c1)=sk_c8)).
% 0.20/0.44 cnf(i_0_48, negated_conjecture, (multiply(sk_c4,sk_c8)=sk_c5|inverse(sk_c1)=sk_c8)).
% 0.20/0.44 cnf(i_0_33, negated_conjecture, (multiply(sk_c8,sk_c5)=sk_c6|multiply(sk_c7,sk_c6)=sk_c8)).
% 0.20/0.44 cnf(i_0_29, negated_conjecture, (multiply(sk_c2,sk_c8)=sk_c7|multiply(sk_c7,sk_c6)=sk_c8)).
% 0.20/0.44 cnf(i_0_31, negated_conjecture, (multiply(sk_c3,sk_c6)=sk_c7|multiply(sk_c7,sk_c6)=sk_c8)).
% 0.20/0.44 cnf(i_0_34, negated_conjecture, (multiply(sk_c4,sk_c8)=sk_c5|multiply(sk_c7,sk_c6)=sk_c8)).
% 0.20/0.44 cnf(i_0_40, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c7|multiply(sk_c8,sk_c5)=sk_c6)).
% 0.20/0.44 cnf(i_0_36, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c7|multiply(sk_c2,sk_c8)=sk_c7)).
% 0.20/0.44 cnf(i_0_38, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c7|multiply(sk_c3,sk_c6)=sk_c7)).
% 0.20/0.44 cnf(i_0_41, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c7|multiply(sk_c4,sk_c8)=sk_c5)).
% 0.20/0.44 cnf(i_0_50, negated_conjecture, (multiply(sk_c8,multiply(X1,sk_c8))!=sk_c6|multiply(sk_c7,sk_c6)!=sk_c8|multiply(X2,sk_c6)!=sk_c7|multiply(X3,sk_c8)!=sk_c7|multiply(X4,sk_c8)!=sk_c7|inverse(X1)!=sk_c8|inverse(X2)!=sk_c6|inverse(X3)!=sk_c8|inverse(X4)!=sk_c8)).
% 0.20/0.44 cnf(i_0_265, plain, (X6=X6)).
% 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 6 steps
% 0.20/0.44 cnf(i_0_265, plain, (identity=identity), inference(start_rule)).
% 0.20/0.44 cnf(i_0_325, plain, (identity=identity), inference(extension_rule, [i_0_269])).
% 0.20/0.44 cnf(i_0_386, plain, (multiply(identity,X5)!=X5), inference(closure_rule, [i_0_26])).
% 0.20/0.44 cnf(i_0_384, plain, (multiply(identity,multiply(identity,X5))=multiply(identity,X5)), inference(extension_rule, [i_0_268])).
% 0.20/0.44 cnf(i_0_444, plain, (multiply(identity,X5)!=X5), inference(closure_rule, [i_0_26])).
% 0.20/0.44 cnf(i_0_442, plain, (multiply(identity,multiply(identity,X5))=X5), inference(etableau_closure_rule, [i_0_442, ...])).
% 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 # There were 1 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 0 free duplicated saturations.
% 0.20/0.44 # There were 1 total successful branch saturations.
% 0.20/0.44 # There were 0 successful branch saturations in interreduction.
% 0.20/0.44 # There were 0 successful branch saturations on the branch.
% 0.20/0.44 # There were 1 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_26, plain, (multiply(identity,X1)=X1)).
% 0.20/0.44 cnf(i_0_27, plain, (multiply(inverse(X1),X1)=identity)).
% 0.20/0.44 cnf(i_0_28, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
% 0.20/0.44 cnf(i_0_44, negated_conjecture, (inverse(sk_c1)=sk_c8|inverse(sk_c2)=sk_c8)).
% 0.20/0.44 cnf(i_0_46, negated_conjecture, (inverse(sk_c1)=sk_c8|inverse(sk_c3)=sk_c6)).
% 0.20/0.44 cnf(i_0_49, negated_conjecture, (inverse(sk_c1)=sk_c8|inverse(sk_c4)=sk_c8)).
% 0.20/0.44 cnf(i_0_30, negated_conjecture, (multiply(sk_c7,sk_c6)=sk_c8|inverse(sk_c2)=sk_c8)).
% 0.20/0.44 cnf(i_0_37, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c7|inverse(sk_c2)=sk_c8)).
% 0.20/0.44 cnf(i_0_32, negated_conjecture, (multiply(sk_c7,sk_c6)=sk_c8|inverse(sk_c3)=sk_c6)).
% 0.20/0.44 cnf(i_0_39, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c7|inverse(sk_c3)=sk_c6)).
% 0.20/0.44 cnf(i_0_35, negated_conjecture, (multiply(sk_c7,sk_c6)=sk_c8|inverse(sk_c4)=sk_c8)).
% 0.20/0.44 cnf(i_0_42, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c7|inverse(sk_c4)=sk_c8)).
% 0.20/0.44 cnf(i_0_47, negated_conjecture, (multiply(sk_c8,sk_c5)=sk_c6|inverse(sk_c1)=sk_c8)).
% 0.20/0.44 cnf(i_0_43, negated_conjecture, (multiply(sk_c2,sk_c8)=sk_c7|inverse(sk_c1)=sk_c8)).
% 0.20/0.44 cnf(i_0_45, negated_conjecture, (multiply(sk_c3,sk_c6)=sk_c7|inverse(sk_c1)=sk_c8)).
% 0.20/0.44 cnf(i_0_48, negated_conjecture, (multiply(sk_c4,sk_c8)=sk_c5|inverse(sk_c1)=sk_c8)).
% 0.20/0.44 cnf(i_0_33, negated_conjecture, (multiply(sk_c8,sk_c5)=sk_c6|multiply(sk_c7,sk_c6)=sk_c8)).
% 0.20/0.44 cnf(i_0_29, negated_conjecture, (multiply(sk_c2,sk_c8)=sk_c7|multiply(sk_c7,sk_c6)=sk_c8)).
% 0.20/0.44 cnf(i_0_31, negated_conjecture, (multiply(sk_c3,sk_c6)=sk_c7|multiply(sk_c7,sk_c6)=sk_c8)).
% 0.20/0.44 cnf(i_0_34, negated_conjecture, (multiply(sk_c4,sk_c8)=sk_c5|multiply(sk_c7,sk_c6)=sk_c8)).
% 0.20/0.44 cnf(i_0_40, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c7|multiply(sk_c8,sk_c5)=sk_c6)).
% 0.20/0.44 cnf(i_0_36, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c7|multiply(sk_c2,sk_c8)=sk_c7)).
% 0.20/0.44 cnf(i_0_38, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c7|multiply(sk_c3,sk_c6)=sk_c7)).
% 0.20/0.44 cnf(i_0_41, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c7|multiply(sk_c4,sk_c8)=sk_c5)).
% 0.20/0.44 cnf(i_0_50, negated_conjecture, (multiply(sk_c8,multiply(X1,sk_c8))!=sk_c6|multiply(sk_c7,sk_c6)!=sk_c8|multiply(X2,sk_c6)!=sk_c7|multiply(X3,sk_c8)!=sk_c7|multiply(X4,sk_c8)!=sk_c7|inverse(X1)!=sk_c8|inverse(X2)!=sk_c6|inverse(X3)!=sk_c8|inverse(X4)!=sk_c8)).
% 0.20/0.44 cnf(i_0_1081, plain, (X6=X6)).
% 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 6 steps
% 0.20/0.44 cnf(i_0_1081, plain, (identity=identity), inference(start_rule)).
% 0.20/0.44 cnf(i_0_1141, plain, (identity=identity), inference(extension_rule, [i_0_1085])).
% 0.20/0.44 cnf(i_0_1202, plain, (multiply(identity,X5)!=X5), inference(closure_rule, [i_0_26])).
% 0.20/0.44 cnf(i_0_1200, plain, (multiply(identity,multiply(identity,X5))=multiply(identity,X5)), inference(extension_rule, [i_0_1084])).
% 0.20/0.44 cnf(i_0_1260, plain, (multiply(identity,X5)!=X5), inference(closure_rule, [i_0_26])).
% 0.20/0.44 cnf(i_0_1258, plain, (multiply(identity,multiply(identity,X5))=X5), inference(etableau_closure_rule, [i_0_1258, ...])).
% 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 (21524) has found a proof.
% 0.20/0.44
% 0.20/0.44 # Proof search is over...
% 0.20/0.44 # Freeing feature tree
%------------------------------------------------------------------------------