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