TSTP Solution File: GRP389-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP389-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 : n021.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:15 EDT 2022
% Result : Unsatisfiable 32.09s 4.45s
% Output : CNFRefutation 32.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP389-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.12/0.33 % Computer : n021.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 19:20:42 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 58 Number of unprocessed: 58
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 58 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 55 conjectures.
% 0.19/0.37 # There are 55 start rule candidates:
% 0.19/0.37 # Found 3 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 55 start rule tableaux created.
% 0.19/0.37 # 55 extension rule candidate clauses
% 0.19/0.37 # 3 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 4.71/0.95 # Creating equality axioms
% 4.71/0.95 # Ran out of tableaux, making start rules for all clauses
% 4.71/0.95 # Creating equality axioms
% 4.71/0.95 # Ran out of tableaux, making start rules for all clauses
% 4.71/0.96 # Creating equality axioms
% 4.71/0.96 # Ran out of tableaux, making start rules for all clauses
% 4.71/0.96 # Creating equality axioms
% 4.71/0.96 # Ran out of tableaux, making start rules for all clauses
% 4.71/0.96 # Creating equality axioms
% 4.71/0.96 # Ran out of tableaux, making start rules for all clauses
% 4.71/0.97 # Creating equality axioms
% 4.71/0.97 # Ran out of tableaux, making start rules for all clauses
% 4.71/0.97 # Creating equality axioms
% 4.71/0.97 # Ran out of tableaux, making start rules for all clauses
% 4.71/0.97 # Creating equality axioms
% 4.71/0.97 # Ran out of tableaux, making start rules for all clauses
% 32.09/4.45 # There were 5 total branch saturation attempts.
% 32.09/4.45 # There were 0 of these attempts blocked.
% 32.09/4.45 # There were 0 deferred branch saturation attempts.
% 32.09/4.45 # There were 0 free duplicated saturations.
% 32.09/4.45 # There were 1 total successful branch saturations.
% 32.09/4.45 # There were 0 successful branch saturations in interreduction.
% 32.09/4.45 # There were 0 successful branch saturations on the branch.
% 32.09/4.45 # There were 1 successful branch saturations after the branch.
% 32.09/4.45 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 32.09/4.45 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 32.09/4.45 # Begin clausification derivation
% 32.09/4.45
% 32.09/4.45 # End clausification derivation
% 32.09/4.45 # Begin listing active clauses obtained from FOF to CNF conversion
% 32.09/4.45 cnf(i_0_59, plain, (multiply(identity,X1)=X1)).
% 32.09/4.45 cnf(i_0_60, plain, (multiply(inverse(X1),X1)=identity)).
% 32.09/4.45 cnf(i_0_61, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
% 32.09/4.45 cnf(i_0_63, negated_conjecture, (inverse(sk_c4)=sk_c11|inverse(sk_c10)=sk_c9)).
% 32.09/4.45 cnf(i_0_65, negated_conjecture, (inverse(sk_c5)=sk_c10|inverse(sk_c10)=sk_c9)).
% 32.09/4.45 cnf(i_0_66, negated_conjecture, (inverse(sk_c6)=sk_c11|inverse(sk_c10)=sk_c9)).
% 32.09/4.45 cnf(i_0_69, negated_conjecture, (inverse(sk_c7)=sk_c8|inverse(sk_c10)=sk_c9)).
% 32.09/4.45 cnf(i_0_72, negated_conjecture, (inverse(sk_c1)=sk_c11|inverse(sk_c4)=sk_c11)).
% 32.09/4.45 cnf(i_0_99, negated_conjecture, (inverse(sk_c2)=sk_c3|inverse(sk_c4)=sk_c11)).
% 32.09/4.45 cnf(i_0_74, negated_conjecture, (inverse(sk_c1)=sk_c11|inverse(sk_c5)=sk_c10)).
% 32.09/4.45 cnf(i_0_101, negated_conjecture, (inverse(sk_c2)=sk_c3|inverse(sk_c5)=sk_c10)).
% 32.09/4.45 cnf(i_0_75, negated_conjecture, (inverse(sk_c1)=sk_c11|inverse(sk_c6)=sk_c11)).
% 32.09/4.45 cnf(i_0_102, negated_conjecture, (inverse(sk_c2)=sk_c3|inverse(sk_c6)=sk_c11)).
% 32.09/4.45 cnf(i_0_78, negated_conjecture, (inverse(sk_c1)=sk_c11|inverse(sk_c7)=sk_c8)).
% 32.09/4.45 cnf(i_0_105, negated_conjecture, (inverse(sk_c2)=sk_c3|inverse(sk_c7)=sk_c8)).
% 32.09/4.45 cnf(i_0_62, negated_conjecture, (multiply(sk_c4,sk_c11)=sk_c10|inverse(sk_c10)=sk_c9)).
% 32.09/4.45 cnf(i_0_64, negated_conjecture, (multiply(sk_c5,sk_c10)=sk_c9|inverse(sk_c10)=sk_c9)).
% 32.09/4.45 cnf(i_0_67, negated_conjecture, (multiply(sk_c6,sk_c10)=sk_c11|inverse(sk_c10)=sk_c9)).
% 32.09/4.45 cnf(i_0_68, negated_conjecture, (multiply(sk_c7,sk_c8)=sk_c10|inverse(sk_c10)=sk_c9)).
% 32.09/4.45 cnf(i_0_70, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c10|inverse(sk_c10)=sk_c9)).
% 32.09/4.45 cnf(i_0_81, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c11|inverse(sk_c4)=sk_c11)).
% 32.09/4.45 cnf(i_0_90, negated_conjecture, (multiply(sk_c2,sk_c3)=sk_c10|inverse(sk_c4)=sk_c11)).
% 32.09/4.45 cnf(i_0_108, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c10|inverse(sk_c4)=sk_c11)).
% 32.09/4.45 cnf(i_0_83, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c11|inverse(sk_c5)=sk_c10)).
% 32.09/4.45 cnf(i_0_92, negated_conjecture, (multiply(sk_c2,sk_c3)=sk_c10|inverse(sk_c5)=sk_c10)).
% 32.09/4.45 cnf(i_0_110, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c10|inverse(sk_c5)=sk_c10)).
% 32.09/4.45 cnf(i_0_84, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c11|inverse(sk_c6)=sk_c11)).
% 32.09/4.45 cnf(i_0_93, negated_conjecture, (multiply(sk_c2,sk_c3)=sk_c10|inverse(sk_c6)=sk_c11)).
% 32.09/4.45 cnf(i_0_111, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c10|inverse(sk_c6)=sk_c11)).
% 32.09/4.45 cnf(i_0_87, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c11|inverse(sk_c7)=sk_c8)).
% 32.09/4.45 cnf(i_0_96, negated_conjecture, (multiply(sk_c2,sk_c3)=sk_c10|inverse(sk_c7)=sk_c8)).
% 32.09/4.45 cnf(i_0_114, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c10|inverse(sk_c7)=sk_c8)).
% 32.09/4.45 cnf(i_0_71, negated_conjecture, (multiply(sk_c4,sk_c11)=sk_c10|inverse(sk_c1)=sk_c11)).
% 32.09/4.45 cnf(i_0_73, negated_conjecture, (multiply(sk_c5,sk_c10)=sk_c9|inverse(sk_c1)=sk_c11)).
% 32.09/4.45 cnf(i_0_76, negated_conjecture, (multiply(sk_c6,sk_c10)=sk_c11|inverse(sk_c1)=sk_c11)).
% 32.09/4.45 cnf(i_0_77, negated_conjecture, (multiply(sk_c7,sk_c8)=sk_c10|inverse(sk_c1)=sk_c11)).
% 32.09/4.45 cnf(i_0_79, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c10|inverse(sk_c1)=sk_c11)).
% 32.09/4.45 cnf(i_0_98, negated_conjecture, (multiply(sk_c4,sk_c11)=sk_c10|inverse(sk_c2)=sk_c3)).
% 32.09/4.45 cnf(i_0_100, negated_conjecture, (multiply(sk_c5,sk_c10)=sk_c9|inverse(sk_c2)=sk_c3)).
% 32.09/4.45 cnf(i_0_103, negated_conjecture, (multiply(sk_c6,sk_c10)=sk_c11|inverse(sk_c2)=sk_c3)).
% 32.09/4.45 cnf(i_0_104, negated_conjecture, (multiply(sk_c7,sk_c8)=sk_c10|inverse(sk_c2)=sk_c3)).
% 32.09/4.45 cnf(i_0_106, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c10|inverse(sk_c2)=sk_c3)).
% 32.09/4.45 cnf(i_0_80, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c11|multiply(sk_c4,sk_c11)=sk_c10)).
% 32.09/4.45 cnf(i_0_89, negated_conjecture, (multiply(sk_c2,sk_c3)=sk_c10|multiply(sk_c4,sk_c11)=sk_c10)).
% 32.09/4.45 cnf(i_0_107, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c10|multiply(sk_c4,sk_c11)=sk_c10)).
% 32.09/4.45 cnf(i_0_82, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c11|multiply(sk_c5,sk_c10)=sk_c9)).
% 32.09/4.45 cnf(i_0_91, negated_conjecture, (multiply(sk_c2,sk_c3)=sk_c10|multiply(sk_c5,sk_c10)=sk_c9)).
% 32.09/4.45 cnf(i_0_109, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c10|multiply(sk_c5,sk_c10)=sk_c9)).
% 32.09/4.45 cnf(i_0_85, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c11|multiply(sk_c6,sk_c10)=sk_c11)).
% 32.09/4.45 cnf(i_0_94, negated_conjecture, (multiply(sk_c2,sk_c3)=sk_c10|multiply(sk_c6,sk_c10)=sk_c11)).
% 32.09/4.45 cnf(i_0_112, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c10|multiply(sk_c6,sk_c10)=sk_c11)).
% 32.09/4.45 cnf(i_0_86, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c11|multiply(sk_c7,sk_c8)=sk_c10)).
% 32.09/4.45 cnf(i_0_95, negated_conjecture, (multiply(sk_c2,sk_c3)=sk_c10|multiply(sk_c7,sk_c8)=sk_c10)).
% 32.09/4.45 cnf(i_0_113, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c10|multiply(sk_c7,sk_c8)=sk_c10)).
% 32.09/4.45 cnf(i_0_88, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c11|multiply(sk_c8,sk_c9)=sk_c10)).
% 32.09/4.45 cnf(i_0_97, negated_conjecture, (multiply(sk_c2,sk_c3)=sk_c10|multiply(sk_c8,sk_c9)=sk_c10)).
% 32.09/4.45 cnf(i_0_115, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c10|multiply(sk_c8,sk_c9)=sk_c10)).
% 32.09/4.45 cnf(i_0_116, negated_conjecture, (multiply(inverse(X1),sk_c9)!=sk_c10|multiply(inverse(X2),sk_c9)!=sk_c10|multiply(X1,inverse(X1))!=sk_c10|multiply(X2,inverse(X2))!=sk_c10|multiply(X3,sk_c10)!=sk_c11|multiply(X4,sk_c10)!=sk_c9|multiply(X5,sk_c11)!=sk_c10|multiply(X6,sk_c10)!=sk_c11|inverse(sk_c10)!=sk_c9|inverse(X3)!=sk_c11|inverse(X4)!=sk_c10|inverse(X5)!=sk_c11|inverse(X6)!=sk_c11)).
% 32.09/4.45 cnf(i_0_1584, plain, (X9=X9)).
% 32.09/4.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 32.09/4.45 # Begin printing tableau
% 32.09/4.45 # Found 8 steps
% 32.09/4.45 cnf(i_0_1584, plain, (identity=identity), inference(start_rule)).
% 32.09/4.45 cnf(i_0_1714, plain, (identity=identity), inference(extension_rule, [i_0_1588])).
% 32.09/4.45 cnf(i_0_1845, plain, (multiply(identity,X4)!=X4), inference(closure_rule, [i_0_59])).
% 32.09/4.45 cnf(i_0_1843, plain, (multiply(identity,multiply(identity,X4))=multiply(identity,X4)), inference(extension_rule, [i_0_1587])).
% 32.09/4.45 cnf(i_0_1973, plain, (multiply(identity,X4)!=X4), inference(closure_rule, [i_0_59])).
% 32.09/4.45 cnf(i_0_1971, plain, (multiply(identity,multiply(identity,X4))=X4), inference(extension_rule, [i_0_1588])).
% 32.09/4.45 cnf(i_0_379789, plain, (X1!=multiply(identity,X1)), inference(closure_rule, [i_0_59])).
% 32.09/4.45 cnf(i_0_379788, plain, (multiply(X1,multiply(identity,multiply(identity,X4)))=multiply(multiply(identity,X1),X4)), inference(etableau_closure_rule, [i_0_379788, ...])).
% 32.09/4.45 # End printing tableau
% 32.09/4.45 # SZS output end
% 32.09/4.45 # Branches closed with saturation will be marked with an "s"
% 32.72/4.46 # Child (28451) has found a proof.
% 32.72/4.46
% 32.72/4.46 # Proof search is over...
% 32.72/4.46 # Freeing feature tree
%------------------------------------------------------------------------------