%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP413-1 : TPTP v8.1.0. Released v2.6.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:06:22 EDT 2022 % Result : Unsatisfiable 175.33s 175.63s % Output : CNFRefutation 175.33s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GRP413-1 : TPTP v8.1.0. Released v2.6.0. % 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n010.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % 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 20:33:24 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.36 # % 0.19/0.36 # Presaturation interreduction done % 0.19/0.36 # Number of axioms: 2 Number of unprocessed: 2 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # Hello from C++ % 45.72/45.96 # The folding up rule is enabled... % 45.72/45.96 # Local unification is enabled... % 45.72/45.96 # Any saturation attempts will use folding labels... % 45.72/45.96 # 2 beginning clauses after preprocessing and clausification % 45.72/45.96 # Creating start rules for all 1 conjectures. % 45.72/45.96 # There are 1 start rule candidates: % 45.72/45.96 # Found 2 unit axioms. % 45.72/45.96 # 1 start rule tableaux created. % 45.72/45.96 # 0 extension rule candidate clauses % 45.72/45.96 # 2 unit axiom clauses % 45.72/45.96 % 45.72/45.96 # Requested 8, 32 cores available to the main process. % 45.72/45.96 # There are not enough tableaux to fork, creating more from the initial 1 % 45.72/45.96 # Creating equality axioms % 45.72/45.96 # Ran out of tableaux, making start rules for all clauses % 175.33/175.63 # There were 2 total branch saturation attempts. % 175.33/175.63 # There were 0 of these attempts blocked. % 175.33/175.63 # There were 0 deferred branch saturation attempts. % 175.33/175.63 # There were 0 free duplicated saturations. % 175.33/175.63 # There were 2 total successful branch saturations. % 175.33/175.63 # There were 0 successful branch saturations in interreduction. % 175.33/175.63 # There were 0 successful branch saturations on the branch. % 175.33/175.63 # There were 2 successful branch saturations after the branch. % 175.33/175.63 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 175.33/175.63 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 175.33/175.63 # Begin clausification derivation % 175.33/175.63 % 175.33/175.63 # End clausification derivation % 175.33/175.63 # Begin listing active clauses obtained from FOF to CNF conversion % 175.33/175.63 cnf(i_0_3, plain, (multiply(X1,inverse(multiply(multiply(multiply(inverse(X2),X2),inverse(multiply(inverse(multiply(X1,inverse(X2))),X3))),X2)))=X3)). % 175.33/175.63 cnf(i_0_4, negated_conjecture, (multiply(multiply(inverse(b2),b2),a2)!=a2)). % 175.33/175.63 cnf(i_0_6, plain, (X4=X4)). % 175.33/175.63 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 175.33/175.63 # Begin printing tableau % 175.33/175.63 # Found 6 steps % 175.33/175.63 cnf(i_0_3, plain, (multiply(X19,inverse(multiply(multiply(multiply(inverse(X18),X18),inverse(multiply(inverse(multiply(X19,inverse(X18))),a2))),X18)))=a2), inference(start_rule)). % 175.33/175.63 cnf(i_0_12, plain, (multiply(X19,inverse(multiply(multiply(multiply(inverse(X18),X18),inverse(multiply(inverse(multiply(X19,inverse(X18))),a2))),X18)))=a2), inference(extension_rule, [i_0_11])). % 175.33/175.63 cnf(i_0_25, plain, (multiply(X23,inverse(multiply(multiply(multiply(inverse(X22),X22),inverse(multiply(inverse(multiply(X23,inverse(X22))),multiply(inverse(b2),b2)))),X22)))!=multiply(inverse(b2),b2)), inference(closure_rule, [i_0_3])). % 175.33/175.63 cnf(i_0_24, plain, (multiply(multiply(X23,inverse(multiply(multiply(multiply(inverse(X22),X22),inverse(multiply(inverse(multiply(X23,inverse(X22))),multiply(inverse(b2),b2)))),X22))),multiply(X19,inverse(multiply(multiply(multiply(inverse(X18),X18),inverse(multiply(inverse(multiply(X19,inverse(X18))),a2))),X18))))=multiply(multiply(inverse(b2),b2),a2)), inference(extension_rule, [i_0_9])). % 175.33/175.63 cnf(i_0_31, plain, (a2=multiply(multiply(inverse(b2),b2),a2)), inference(closure_rule, [i_0_4])). % 175.33/175.63 cnf(i_0_32, plain, (a2!=multiply(multiply(X23,inverse(multiply(multiply(multiply(inverse(X22),X22),inverse(multiply(inverse(multiply(X23,inverse(X22))),multiply(inverse(b2),b2)))),X22))),multiply(X19,inverse(multiply(multiply(multiply(inverse(X18),X18),inverse(multiply(inverse(multiply(X19,inverse(X18))),a2))),X18))))), inference(etableau_closure_rule, [i_0_32, ...])). % 175.33/175.63 # End printing tableau % 175.33/175.63 # SZS output end % 175.33/175.63 # Branches closed with saturation will be marked with an "s" % 175.33/175.63 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. % 175.33/175.63 # We now have 7 tableaux to operate on % 175.33/175.63 # Found closed tableau during pool population. % 175.33/175.63 # Proof search is over... % 175.33/175.63 # Freeing feature tree %------------------------------------------------------------------------------