%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : BOO001-1 : TPTP v8.1.0. Released v1.0.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 : n032.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 : Thu Jul 14 23:38:20 EDT 2022 % Result : Unsatisfiable 0.12s 0.31s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.09 % Problem : BOO001-1 : TPTP v8.1.0. Released v1.0.0. % 0.00/0.09 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.08/0.28 % Computer : n032.cluster.edu % 0.08/0.28 % Model : x86_64 x86_64 % 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.28 % Memory : 8042.1875MB % 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.28 % CPULimit : 300 % 0.12/0.28 % WCLimit : 600 % 0.12/0.28 % DateTime : Wed Jun 1 20:04:45 EDT 2022 % 0.12/0.28 % CPUTime : % 0.12/0.30 # No SInE strategy applied % 0.12/0.30 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.30 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.30 # % 0.12/0.30 # Presaturation interreduction done % 0.12/0.30 # Number of axioms: 6 Number of unprocessed: 6 % 0.12/0.30 # Tableaux proof search. % 0.12/0.30 # APR header successfully linked. % 0.12/0.30 # Hello from C++ % 0.12/0.30 # The folding up rule is enabled... % 0.12/0.30 # Local unification is enabled... % 0.12/0.30 # Any saturation attempts will use folding labels... % 0.12/0.30 # 6 beginning clauses after preprocessing and clausification % 0.12/0.30 # Creating start rules for all 1 conjectures. % 0.12/0.30 # There are 1 start rule candidates: % 0.12/0.30 # Found 6 unit axioms. % 0.12/0.30 # 1 start rule tableaux created. % 0.12/0.30 # 0 extension rule candidate clauses % 0.12/0.30 # 6 unit axiom clauses % 0.12/0.30 % 0.12/0.30 # Requested 8, 32 cores available to the main process. % 0.12/0.30 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.30 # Creating equality axioms % 0.12/0.30 # Ran out of tableaux, making start rules for all clauses % 0.12/0.30 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.12/0.30 # We now have 11 tableaux to operate on % 0.12/0.31 # There were 1 total branch saturation attempts. % 0.12/0.31 # There were 0 of these attempts blocked. % 0.12/0.31 # There were 0 deferred branch saturation attempts. % 0.12/0.31 # There were 0 free duplicated saturations. % 0.12/0.31 # There were 1 total successful branch saturations. % 0.12/0.31 # There were 0 successful branch saturations in interreduction. % 0.12/0.31 # There were 0 successful branch saturations on the branch. % 0.12/0.31 # There were 1 successful branch saturations after the branch. % 0.12/0.31 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.31 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.31 # Begin clausification derivation % 0.12/0.31 % 0.12/0.31 # End clausification derivation % 0.12/0.31 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.31 cnf(i_0_8, plain, (multiply(X1,X2,X2)=X2)). % 0.12/0.31 cnf(i_0_9, plain, (multiply(X1,X1,X2)=X1)). % 0.12/0.31 cnf(i_0_11, plain, (multiply(X1,X2,inverse(X2))=X1)). % 0.12/0.31 cnf(i_0_10, plain, (multiply(inverse(X1),X1,X2)=X2)). % 0.12/0.31 cnf(i_0_7, plain, (multiply(multiply(X1,X2,X3),X4,multiply(X1,X2,X5))=multiply(X1,X2,multiply(X3,X4,X5)))). % 0.12/0.31 cnf(i_0_12, negated_conjecture, (inverse(inverse(a))!=a)). % 0.12/0.31 cnf(i_0_14, plain, (X6=X6)). % 0.12/0.31 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.31 # Begin printing tableau % 0.12/0.31 # Found 7 steps % 0.12/0.31 cnf(i_0_8, plain, (multiply(X19,X5,X5)=X5), inference(start_rule)). % 0.12/0.31 cnf(i_0_20, plain, (multiply(X19,X5,X5)=X5), inference(extension_rule, [i_0_18])). % 0.12/0.31 cnf(i_0_35, plain, (multiply(X4,X4,X4)!=X4), inference(closure_rule, [i_0_8])). % 0.12/0.31 cnf(i_0_36, plain, (multiply(X4,X5,X5)!=X5), inference(closure_rule, [i_0_8])). % 0.12/0.31 cnf(i_0_34, plain, (multiply(multiply(X4,X4,X4),multiply(X4,X5,X5),multiply(X19,X5,X5))=multiply(X4,X5,X5)), inference(extension_rule, [i_0_17])). % 0.12/0.31 cnf(i_0_46, plain, (multiply(X4,X5,X5)!=X5), inference(closure_rule, [i_0_8])). % 0.12/0.31 cnf(i_0_44, plain, (multiply(multiply(X4,X4,X4),multiply(X4,X5,X5),multiply(X19,X5,X5))=X5), inference(etableau_closure_rule, [i_0_44, ...])). % 0.12/0.31 # End printing tableau % 0.12/0.31 # SZS output end % 0.12/0.31 # Branches closed with saturation will be marked with an "s" % 0.12/0.31 # There were 1 total branch saturation attempts. % 0.12/0.31 # There were 0 of these attempts blocked. % 0.12/0.31 # There were 0 deferred branch saturation attempts. % 0.12/0.31 # There were 0 free duplicated saturations. % 0.12/0.31 # There were 1 total successful branch saturations. % 0.12/0.31 # There were 0 successful branch saturations in interreduction. % 0.12/0.31 # There were 0 successful branch saturations on the branch. % 0.12/0.31 # There were 1 successful branch saturations after the branch. % 0.12/0.31 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.31 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.31 # Begin clausification derivation % 0.12/0.31 % 0.12/0.31 # End clausification derivation % 0.12/0.31 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.31 cnf(i_0_8, plain, (multiply(X1,X2,X2)=X2)). % 0.12/0.31 cnf(i_0_9, plain, (multiply(X1,X1,X2)=X1)). % 0.12/0.31 cnf(i_0_11, plain, (multiply(X1,X2,inverse(X2))=X1)). % 0.12/0.31 cnf(i_0_10, plain, (multiply(inverse(X1),X1,X2)=X2)). % 0.12/0.31 cnf(i_0_7, plain, (multiply(multiply(X1,X2,X3),X4,multiply(X1,X2,X5))=multiply(X1,X2,multiply(X3,X4,X5)))). % 0.12/0.31 cnf(i_0_12, negated_conjecture, (inverse(inverse(a))!=a)). % 0.12/0.31 cnf(i_0_14, plain, (X6=X6)). % 0.12/0.31 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.31 # Begin printing tableau % 0.12/0.31 # Found 6 steps % 0.12/0.31 cnf(i_0_8, plain, (multiply(X11,a,a)=a), inference(start_rule)). % 0.12/0.31 cnf(i_0_20, plain, (multiply(X11,a,a)=a), inference(extension_rule, [i_0_17])). % 0.12/0.31 cnf(i_0_31, plain, (inverse(inverse(a))=a), inference(closure_rule, [i_0_12])). % 0.12/0.31 cnf(i_0_32, plain, (inverse(inverse(a))!=multiply(X11,a,a)), inference(extension_rule, [i_0_17])). % 0.12/0.31 cnf(i_0_46, plain, (a!=multiply(X11,a,a)), inference(closure_rule, [i_0_8])). % 0.12/0.31 cnf(i_0_45, plain, (inverse(inverse(a))!=a), inference(etableau_closure_rule, [i_0_45, ...])). % 0.12/0.31 # End printing tableau % 0.12/0.31 # SZS output end % 0.12/0.31 # Branches closed with saturation will be marked with an "s" % 0.12/0.31 # Child (3171) has found a proof. % 0.12/0.31 % 0.12/0.31 # Proof search is over... % 0.12/0.31 # Freeing feature tree %------------------------------------------------------------------------------