TSTP Solution File: GRP231-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP231-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 : n010.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:05:33 EDT 2022
% Result : Unsatisfiable 15.11s 2.32s
% Output : CNFRefutation 15.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP231-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/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 : n010.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 04:58:40 EDT 2022
% 0.12/0.34 % 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_S5PRR_RG_S04AN
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 34 Number of unprocessed: 34
% 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.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 34 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 31 conjectures.
% 0.12/0.37 # There are 31 start rule candidates:
% 0.12/0.37 # Found 3 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 31 start rule tableaux created.
% 0.12/0.37 # 31 extension rule candidate clauses
% 0.12/0.37 # 3 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 2.79/0.74 # Creating equality axioms
% 2.79/0.74 # Ran out of tableaux, making start rules for all clauses
% 3.23/0.79 # Creating equality axioms
% 3.23/0.79 # Ran out of tableaux, making start rules for all clauses
% 3.23/0.80 # Creating equality axioms
% 3.23/0.80 # Ran out of tableaux, making start rules for all clauses
% 3.23/0.80 # Creating equality axioms
% 3.23/0.80 # Ran out of tableaux, making start rules for all clauses
% 3.23/0.84 # Creating equality axioms
% 3.23/0.84 # Ran out of tableaux, making start rules for all clauses
% 3.23/0.84 # Creating equality axioms
% 3.23/0.84 # Ran out of tableaux, making start rules for all clauses
% 3.23/0.84 # Creating equality axioms
% 3.23/0.84 # Ran out of tableaux, making start rules for all clauses
% 3.23/0.85 # Creating equality axioms
% 3.23/0.85 # Ran out of tableaux, making start rules for all clauses
% 15.11/2.32 # There were 5 total branch saturation attempts.
% 15.11/2.32 # There were 0 of these attempts blocked.
% 15.11/2.32 # There were 0 deferred branch saturation attempts.
% 15.11/2.32 # There were 0 free duplicated saturations.
% 15.11/2.32 # There were 1 total successful branch saturations.
% 15.11/2.32 # There were 0 successful branch saturations in interreduction.
% 15.11/2.32 # There were 0 successful branch saturations on the branch.
% 15.11/2.32 # There were 1 successful branch saturations after the branch.
% 15.11/2.32 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.11/2.32 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.11/2.32 # Begin clausification derivation
% 15.11/2.32
% 15.11/2.32 # End clausification derivation
% 15.11/2.32 # Begin listing active clauses obtained from FOF to CNF conversion
% 15.11/2.32 cnf(i_0_35, plain, (multiply(identity,X1)=X1)).
% 15.11/2.32 cnf(i_0_36, plain, (multiply(inverse(X1),X1)=identity)).
% 15.11/2.32 cnf(i_0_37, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
% 15.11/2.32 cnf(i_0_38, negated_conjecture, (inverse(sk_c4)=sk_c8|inverse(sk_c8)=sk_c7)).
% 15.11/2.32 cnf(i_0_42, negated_conjecture, (inverse(sk_c5)=sk_c8|inverse(sk_c8)=sk_c7)).
% 15.11/2.32 cnf(i_0_48, negated_conjecture, (inverse(sk_c1)=sk_c2|inverse(sk_c4)=sk_c8)).
% 15.11/2.32 cnf(i_0_58, negated_conjecture, (inverse(sk_c3)=sk_c8|inverse(sk_c4)=sk_c8)).
% 15.11/2.32 cnf(i_0_52, negated_conjecture, (inverse(sk_c1)=sk_c2|inverse(sk_c5)=sk_c8)).
% 15.11/2.32 cnf(i_0_62, negated_conjecture, (inverse(sk_c3)=sk_c8|inverse(sk_c5)=sk_c8)).
% 15.11/2.32 cnf(i_0_40, negated_conjecture, (multiply(sk_c8,sk_c6)=sk_c7|inverse(sk_c8)=sk_c7)).
% 15.11/2.32 cnf(i_0_39, negated_conjecture, (multiply(sk_c4,sk_c7)=sk_c8|inverse(sk_c8)=sk_c7)).
% 15.11/2.32 cnf(i_0_41, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c6|inverse(sk_c8)=sk_c7)).
% 15.11/2.32 cnf(i_0_43, negated_conjecture, (multiply(sk_c1,sk_c2)=sk_c8|inverse(sk_c4)=sk_c8)).
% 15.11/2.32 cnf(i_0_53, negated_conjecture, (multiply(sk_c2,sk_c7)=sk_c8|inverse(sk_c4)=sk_c8)).
% 15.11/2.32 cnf(i_0_63, negated_conjecture, (multiply(sk_c3,sk_c7)=sk_c8|inverse(sk_c4)=sk_c8)).
% 15.11/2.32 cnf(i_0_47, negated_conjecture, (multiply(sk_c1,sk_c2)=sk_c8|inverse(sk_c5)=sk_c8)).
% 15.11/2.32 cnf(i_0_57, negated_conjecture, (multiply(sk_c2,sk_c7)=sk_c8|inverse(sk_c5)=sk_c8)).
% 15.11/2.32 cnf(i_0_67, negated_conjecture, (multiply(sk_c3,sk_c7)=sk_c8|inverse(sk_c5)=sk_c8)).
% 15.11/2.32 cnf(i_0_50, negated_conjecture, (multiply(sk_c8,sk_c6)=sk_c7|inverse(sk_c1)=sk_c2)).
% 15.11/2.32 cnf(i_0_49, negated_conjecture, (multiply(sk_c4,sk_c7)=sk_c8|inverse(sk_c1)=sk_c2)).
% 15.11/2.32 cnf(i_0_51, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c6|inverse(sk_c1)=sk_c2)).
% 15.11/2.32 cnf(i_0_60, negated_conjecture, (multiply(sk_c8,sk_c6)=sk_c7|inverse(sk_c3)=sk_c8)).
% 15.11/2.32 cnf(i_0_59, negated_conjecture, (multiply(sk_c4,sk_c7)=sk_c8|inverse(sk_c3)=sk_c8)).
% 15.11/2.32 cnf(i_0_61, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c6|inverse(sk_c3)=sk_c8)).
% 15.11/2.32 cnf(i_0_45, negated_conjecture, (multiply(sk_c1,sk_c2)=sk_c8|multiply(sk_c8,sk_c6)=sk_c7)).
% 15.11/2.32 cnf(i_0_55, negated_conjecture, (multiply(sk_c2,sk_c7)=sk_c8|multiply(sk_c8,sk_c6)=sk_c7)).
% 15.11/2.32 cnf(i_0_65, negated_conjecture, (multiply(sk_c3,sk_c7)=sk_c8|multiply(sk_c8,sk_c6)=sk_c7)).
% 15.11/2.32 cnf(i_0_44, negated_conjecture, (multiply(sk_c1,sk_c2)=sk_c8|multiply(sk_c4,sk_c7)=sk_c8)).
% 15.11/2.32 cnf(i_0_54, negated_conjecture, (multiply(sk_c2,sk_c7)=sk_c8|multiply(sk_c4,sk_c7)=sk_c8)).
% 15.11/2.32 cnf(i_0_64, negated_conjecture, (multiply(sk_c3,sk_c7)=sk_c8|multiply(sk_c4,sk_c7)=sk_c8)).
% 15.11/2.32 cnf(i_0_46, negated_conjecture, (multiply(sk_c1,sk_c2)=sk_c8|multiply(sk_c5,sk_c8)=sk_c6)).
% 15.11/2.32 cnf(i_0_56, negated_conjecture, (multiply(sk_c2,sk_c7)=sk_c8|multiply(sk_c5,sk_c8)=sk_c6)).
% 15.11/2.32 cnf(i_0_66, negated_conjecture, (multiply(sk_c3,sk_c7)=sk_c8|multiply(sk_c5,sk_c8)=sk_c6)).
% 15.11/2.32 cnf(i_0_68, negated_conjecture, (multiply(sk_c8,multiply(X1,sk_c8))!=sk_c7|multiply(inverse(X2),sk_c7)!=sk_c8|multiply(X2,inverse(X2))!=sk_c8|multiply(X3,sk_c7)!=sk_c8|multiply(X4,sk_c7)!=sk_c8|inverse(sk_c8)!=sk_c7|inverse(X1)!=sk_c8|inverse(X3)!=sk_c8|inverse(X4)!=sk_c8)).
% 15.11/2.32 cnf(i_0_3944, plain, (X7=X7)).
% 15.11/2.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 15.11/2.32 # Begin printing tableau
% 15.11/2.32 # Found 5 steps
% 15.11/2.32 cnf(i_0_3944, plain, (X6=X6), inference(start_rule)).
% 15.11/2.32 cnf(i_0_4022, plain, (X6=X6), inference(extension_rule, [i_0_3948])).
% 15.11/2.32 cnf(i_0_4101, plain, (multiply(identity,X5)!=X5), inference(closure_rule, [i_0_35])).
% 15.11/2.32 cnf(i_0_4099, plain, (multiply(X6,X5)=multiply(X6,multiply(identity,X5))), inference(extension_rule, [i_0_3949])).
% 15.11/2.32 cnf(i_0_211036, plain, (inverse(multiply(X6,multiply(identity,X5)))=inverse(multiply(X6,X5))), inference(etableau_closure_rule, [i_0_211036, ...])).
% 15.11/2.32 # End printing tableau
% 15.11/2.32 # SZS output end
% 15.11/2.32 # Branches closed with saturation will be marked with an "s"
% 15.11/2.32 # Child (4008) has found a proof.
% 15.11/2.32
% 15.11/2.32 # Proof search is over...
% 15.11/2.32 # Freeing feature tree
%------------------------------------------------------------------------------