%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP380-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 : n012.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:13 EDT 2022 % Result : Unsatisfiable 30.75s 4.25s % Output : CNFRefutation 30.75s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GRP380-1 : TPTP v8.1.0. Released v2.5.0. % 0.13/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n012.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Mon Jun 13 17:19:25 EDT 2022 % 0.13/0.34 % CPUTime : % 0.21/0.37 # No SInE strategy applied % 0.21/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.21/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.21/0.37 # % 0.21/0.37 # Presaturation interreduction done % 0.21/0.37 # Number of axioms: 54 Number of unprocessed: 54 % 0.21/0.37 # Tableaux proof search. % 0.21/0.37 # APR header successfully linked. % 0.21/0.37 # Hello from C++ % 0.21/0.37 # The folding up rule is enabled... % 0.21/0.37 # Local unification is enabled... % 0.21/0.37 # Any saturation attempts will use folding labels... % 0.21/0.37 # 54 beginning clauses after preprocessing and clausification % 0.21/0.37 # Creating start rules for all 51 conjectures. % 0.21/0.37 # There are 51 start rule candidates: % 0.21/0.37 # Found 3 unit axioms. % 0.21/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.21/0.37 # 51 start rule tableaux created. % 0.21/0.37 # 51 extension rule candidate clauses % 0.21/0.37 # 3 unit axiom clauses % 0.21/0.37 % 0.21/0.37 # Requested 8, 32 cores available to the main process. % 3.84/0.87 # Creating equality axioms % 3.84/0.87 # Ran out of tableaux, making start rules for all clauses % 4.01/0.91 # Creating equality axioms % 4.01/0.91 # Ran out of tableaux, making start rules for all clauses % 4.01/0.91 # Creating equality axioms % 4.01/0.91 # Ran out of tableaux, making start rules for all clauses % 4.01/0.92 # Creating equality axioms % 4.01/0.92 # Ran out of tableaux, making start rules for all clauses % 4.56/0.96 # Creating equality axioms % 4.56/0.96 # Ran out of tableaux, making start rules for all clauses % 4.56/0.98 # Creating equality axioms % 4.56/0.98 # Ran out of tableaux, making start rules for all clauses % 4.56/0.98 # Creating equality axioms % 4.56/0.98 # Ran out of tableaux, making start rules for all clauses % 4.56/0.99 # Creating equality axioms % 4.56/0.99 # Ran out of tableaux, making start rules for all clauses % 30.75/4.25 # There were 7 total branch saturation attempts. % 30.75/4.25 # There were 0 of these attempts blocked. % 30.75/4.25 # There were 0 deferred branch saturation attempts. % 30.75/4.25 # There were 0 free duplicated saturations. % 30.75/4.25 # There were 1 total successful branch saturations. % 30.75/4.25 # There were 0 successful branch saturations in interreduction. % 30.75/4.25 # There were 0 successful branch saturations on the branch. % 30.75/4.25 # There were 1 successful branch saturations after the branch. % 30.75/4.25 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 30.75/4.25 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 30.75/4.25 # Begin clausification derivation % 30.75/4.25 % 30.75/4.25 # End clausification derivation % 30.75/4.25 # Begin listing active clauses obtained from FOF to CNF conversion % 30.75/4.25 cnf(i_0_55, plain, (multiply(identity,X1)=X1)). % 30.75/4.25 cnf(i_0_56, plain, (multiply(inverse(X1),X1)=identity)). % 30.75/4.25 cnf(i_0_57, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 30.75/4.25 cnf(i_0_59, negated_conjecture, (inverse(sk_c3)=sk_c11|inverse(sk_c11)=sk_c10)). % 30.75/4.25 cnf(i_0_61, negated_conjecture, (inverse(sk_c4)=sk_c10|inverse(sk_c11)=sk_c10)). % 30.75/4.25 cnf(i_0_63, negated_conjecture, (inverse(sk_c5)=sk_c8|inverse(sk_c11)=sk_c10)). % 30.75/4.25 cnf(i_0_65, negated_conjecture, (inverse(sk_c7)=sk_c6|inverse(sk_c11)=sk_c10)). % 30.75/4.25 cnf(i_0_66, negated_conjecture, (inverse(sk_c6)=sk_c8|inverse(sk_c11)=sk_c10)). % 30.75/4.25 cnf(i_0_89, negated_conjecture, (inverse(sk_c1)=sk_c2|inverse(sk_c3)=sk_c11)). % 30.75/4.25 cnf(i_0_91, negated_conjecture, (inverse(sk_c1)=sk_c2|inverse(sk_c4)=sk_c10)). % 30.75/4.25 cnf(i_0_93, negated_conjecture, (inverse(sk_c1)=sk_c2|inverse(sk_c5)=sk_c8)). % 30.75/4.25 cnf(i_0_95, negated_conjecture, (inverse(sk_c1)=sk_c2|inverse(sk_c7)=sk_c6)). % 30.75/4.25 cnf(i_0_96, negated_conjecture, (inverse(sk_c1)=sk_c2|inverse(sk_c6)=sk_c8)). % 30.75/4.25 cnf(i_0_58, negated_conjecture, (multiply(sk_c3,sk_c11)=sk_c10|inverse(sk_c11)=sk_c10)). % 30.75/4.25 cnf(i_0_60, negated_conjecture, (multiply(sk_c4,sk_c10)=sk_c9|inverse(sk_c11)=sk_c10)). % 30.75/4.25 cnf(i_0_62, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c11|inverse(sk_c11)=sk_c10)). % 30.75/4.25 cnf(i_0_64, negated_conjecture, (multiply(sk_c8,sk_c10)=sk_c11|inverse(sk_c11)=sk_c10)). % 30.75/4.25 cnf(i_0_67, negated_conjecture, (multiply(sk_c7,sk_c8)=sk_c6|inverse(sk_c11)=sk_c10)). % 30.75/4.25 cnf(i_0_69, negated_conjecture, (multiply(sk_c10,sk_c9)=sk_c11|inverse(sk_c3)=sk_c11)). % 30.75/4.25 cnf(i_0_79, negated_conjecture, (multiply(sk_c1,sk_c2)=sk_c10|inverse(sk_c3)=sk_c11)). % 30.75/4.25 cnf(i_0_99, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c10|inverse(sk_c3)=sk_c11)). % 30.75/4.25 cnf(i_0_71, negated_conjecture, (multiply(sk_c10,sk_c9)=sk_c11|inverse(sk_c4)=sk_c10)). % 30.75/4.25 cnf(i_0_81, negated_conjecture, (multiply(sk_c1,sk_c2)=sk_c10|inverse(sk_c4)=sk_c10)). % 30.75/4.25 cnf(i_0_101, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c10|inverse(sk_c4)=sk_c10)). % 30.75/4.25 cnf(i_0_73, negated_conjecture, (multiply(sk_c10,sk_c9)=sk_c11|inverse(sk_c5)=sk_c8)). % 30.75/4.25 cnf(i_0_83, negated_conjecture, (multiply(sk_c1,sk_c2)=sk_c10|inverse(sk_c5)=sk_c8)). % 30.75/4.25 cnf(i_0_103, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c10|inverse(sk_c5)=sk_c8)). % 30.75/4.25 cnf(i_0_75, negated_conjecture, (multiply(sk_c10,sk_c9)=sk_c11|inverse(sk_c7)=sk_c6)). % 30.75/4.25 cnf(i_0_85, negated_conjecture, (multiply(sk_c1,sk_c2)=sk_c10|inverse(sk_c7)=sk_c6)). % 30.75/4.25 cnf(i_0_105, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c10|inverse(sk_c7)=sk_c6)). % 30.75/4.25 cnf(i_0_76, negated_conjecture, (multiply(sk_c10,sk_c9)=sk_c11|inverse(sk_c6)=sk_c8)). % 30.75/4.25 cnf(i_0_86, negated_conjecture, (multiply(sk_c1,sk_c2)=sk_c10|inverse(sk_c6)=sk_c8)). % 30.75/4.25 cnf(i_0_106, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c10|inverse(sk_c6)=sk_c8)). % 30.75/4.25 cnf(i_0_88, negated_conjecture, (multiply(sk_c3,sk_c11)=sk_c10|inverse(sk_c1)=sk_c2)). % 30.75/4.25 cnf(i_0_90, negated_conjecture, (multiply(sk_c4,sk_c10)=sk_c9|inverse(sk_c1)=sk_c2)). % 30.75/4.25 cnf(i_0_92, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c11|inverse(sk_c1)=sk_c2)). % 30.75/4.25 cnf(i_0_94, negated_conjecture, (multiply(sk_c8,sk_c10)=sk_c11|inverse(sk_c1)=sk_c2)). % 30.75/4.25 cnf(i_0_97, negated_conjecture, (multiply(sk_c7,sk_c8)=sk_c6|inverse(sk_c1)=sk_c2)). % 30.75/4.25 cnf(i_0_68, negated_conjecture, (multiply(sk_c3,sk_c11)=sk_c10|multiply(sk_c10,sk_c9)=sk_c11)). % 30.75/4.25 cnf(i_0_70, negated_conjecture, (multiply(sk_c4,sk_c10)=sk_c9|multiply(sk_c10,sk_c9)=sk_c11)). % 30.75/4.25 cnf(i_0_72, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c11|multiply(sk_c10,sk_c9)=sk_c11)). % 30.75/4.25 cnf(i_0_74, negated_conjecture, (multiply(sk_c8,sk_c10)=sk_c11|multiply(sk_c10,sk_c9)=sk_c11)). % 30.75/4.25 cnf(i_0_77, negated_conjecture, (multiply(sk_c7,sk_c8)=sk_c6|multiply(sk_c10,sk_c9)=sk_c11)). % 30.75/4.25 cnf(i_0_78, negated_conjecture, (multiply(sk_c1,sk_c2)=sk_c10|multiply(sk_c3,sk_c11)=sk_c10)). % 30.75/4.25 cnf(i_0_98, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c10|multiply(sk_c3,sk_c11)=sk_c10)). % 30.75/4.25 cnf(i_0_80, negated_conjecture, (multiply(sk_c1,sk_c2)=sk_c10|multiply(sk_c4,sk_c10)=sk_c9)). % 30.75/4.25 cnf(i_0_100, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c10|multiply(sk_c4,sk_c10)=sk_c9)). % 30.75/4.25 cnf(i_0_82, negated_conjecture, (multiply(sk_c1,sk_c2)=sk_c10|multiply(sk_c5,sk_c8)=sk_c11)). % 30.75/4.25 cnf(i_0_102, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c10|multiply(sk_c5,sk_c8)=sk_c11)). % 30.75/4.25 cnf(i_0_84, negated_conjecture, (multiply(sk_c1,sk_c2)=sk_c10|multiply(sk_c8,sk_c10)=sk_c11)). % 30.75/4.25 cnf(i_0_104, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c10|multiply(sk_c8,sk_c10)=sk_c11)). % 30.75/4.25 cnf(i_0_87, negated_conjecture, (multiply(sk_c1,sk_c2)=sk_c10|multiply(sk_c7,sk_c8)=sk_c6)). % 30.75/4.25 cnf(i_0_107, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c10|multiply(sk_c7,sk_c8)=sk_c6)). % 30.75/4.25 cnf(i_0_108, negated_conjecture, (inverse(multiply(X1,inverse(X2)))!=inverse(X2)|multiply(inverse(X2),sk_c10)!=sk_c11|multiply(inverse(X3),sk_c9)!=sk_c10|multiply(X1,inverse(X2))!=inverse(X1)|multiply(sk_c10,sk_c9)!=sk_c11|multiply(X2,inverse(X2))!=sk_c11|multiply(X3,inverse(X3))!=sk_c10|multiply(X4,sk_c10)!=sk_c9|multiply(X5,sk_c11)!=sk_c10|inverse(sk_c11)!=sk_c10|inverse(X4)!=sk_c10|inverse(X5)!=sk_c11)). % 30.75/4.25 cnf(i_0_1132, plain, (X9=X9)). % 30.75/4.25 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 30.75/4.25 # Begin printing tableau % 30.75/4.25 # Found 7 steps % 30.75/4.25 cnf(i_0_1132, plain, (X6=X6), inference(start_rule)). % 30.75/4.25 cnf(i_0_1253, plain, (X6=X6), inference(extension_rule, [i_0_1136])). % 30.75/4.25 cnf(i_0_1375, plain, (multiply(identity,X5)!=X5), inference(closure_rule, [i_0_55])). % 30.75/4.25 cnf(i_0_1373, plain, (multiply(X6,multiply(identity,X5))=multiply(X6,X5)), inference(extension_rule, [i_0_1137])). % 30.75/4.25 cnf(i_0_270257, plain, (inverse(multiply(X6,multiply(identity,X5)))=inverse(multiply(X6,X5))), inference(extension_rule, [i_0_1135])). % 30.75/4.25 cnf(i_0_315664, plain, (inverse(multiply(X6,X5))!=multiply(identity,inverse(multiply(X6,X5)))), inference(closure_rule, [i_0_55])). % 30.75/4.25 cnf(i_0_315662, plain, (inverse(multiply(X6,multiply(identity,X5)))=multiply(identity,inverse(multiply(X6,X5)))), inference(etableau_closure_rule, [i_0_315662, ...])). % 30.75/4.25 # End printing tableau % 30.75/4.25 # SZS output end % 30.75/4.25 # Branches closed with saturation will be marked with an "s" % 30.75/4.25 # Child (9907) has found a proof. % 30.75/4.25 % 30.75/4.25 # Proof search is over... % 30.75/4.25 # Freeing feature tree %------------------------------------------------------------------------------