%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : BOO014-3 : TPTP v8.1.0. Bugfixed v2.2.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 : n023.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:26 EDT 2022 % Result : Unsatisfiable 11.43s 3.68s % Output : CNFRefutation 11.43s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : BOO014-3 : TPTP v8.1.0. Bugfixed v2.2.0. % 0.07/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.34 % Computer : n023.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 : Wed Jun 1 23:01:56 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.12/0.37 # and selection function SelectCQIPrecWNTNp. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 27 Number of unprocessed: 27 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.65/0.84 # The folding up rule is enabled... % 0.65/0.84 # Local unification is enabled... % 0.65/0.84 # Any saturation attempts will use folding labels... % 0.65/0.84 # 27 beginning clauses after preprocessing and clausification % 0.65/0.84 # Creating start rules for all 1 conjectures. % 0.65/0.84 # There are 1 start rule candidates: % 0.65/0.84 # Found 14 unit axioms. % 0.65/0.84 # 1 start rule tableaux created. % 0.65/0.84 # 13 extension rule candidate clauses % 0.65/0.84 # 14 unit axiom clauses % 0.65/0.84 % 0.65/0.84 # Requested 8, 32 cores available to the main process. % 0.65/0.84 # There are not enough tableaux to fork, creating more from the initial 1 % 2.29/2.51 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 2.29/2.51 # We now have 12 tableaux to operate on % 11.43/3.68 # There were 15 total branch saturation attempts. % 11.43/3.68 # There were 4 of these attempts blocked. % 11.43/3.68 # There were 0 deferred branch saturation attempts. % 11.43/3.68 # There were 4 free duplicated saturations. % 11.43/3.68 # There were 7 total successful branch saturations. % 11.43/3.68 # There were 0 successful branch saturations in interreduction. % 11.43/3.68 # There were 0 successful branch saturations on the branch. % 11.43/3.68 # There were 3 successful branch saturations after the branch. % 11.43/3.68 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.43/3.68 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.43/3.68 # Begin clausification derivation % 11.43/3.68 % 11.43/3.68 # End clausification derivation % 11.43/3.68 # Begin listing active clauses obtained from FOF to CNF conversion % 11.43/3.68 cnf(i_0_50, plain, (inverse(inverse(X1))=X1)). % 11.43/3.68 cnf(i_0_52, hypothesis, (sum(x,y,x_plus_y))). % 11.43/3.68 cnf(i_0_53, hypothesis, (product(inverse(x),inverse(y),x_inverse_times_y_inverse))). % 11.43/3.68 cnf(i_0_33, plain, (sum(X1,additive_identity,X1))). % 11.43/3.68 cnf(i_0_35, plain, (product(X1,multiplicative_identity,X1))). % 11.43/3.68 cnf(i_0_32, plain, (sum(additive_identity,X1,X1))). % 11.43/3.68 cnf(i_0_34, plain, (product(multiplicative_identity,X1,X1))). % 11.43/3.68 cnf(i_0_45, plain, (sum(X1,inverse(X1),multiplicative_identity))). % 11.43/3.68 cnf(i_0_47, plain, (product(X1,inverse(X1),additive_identity))). % 11.43/3.68 cnf(i_0_44, plain, (sum(inverse(X1),X1,multiplicative_identity))). % 11.43/3.68 cnf(i_0_46, plain, (product(inverse(X1),X1,additive_identity))). % 11.43/3.68 cnf(i_0_28, plain, (sum(X1,X2,add(X1,X2)))). % 11.43/3.68 cnf(i_0_29, plain, (product(X1,X2,multiply(X1,X2)))). % 11.43/3.68 cnf(i_0_54, negated_conjecture, (inverse(x_plus_y)!=x_inverse_times_y_inverse)). % 11.43/3.68 cnf(i_0_30, plain, (sum(X1,X2,X3)|~sum(X2,X1,X3))). % 11.43/3.68 cnf(i_0_31, plain, (product(X1,X2,X3)|~product(X2,X1,X3))). % 11.43/3.68 cnf(i_0_48, plain, (X1=X2|~sum(X3,X4,X2)|~sum(X3,X4,X1))). % 11.43/3.68 cnf(i_0_49, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))). % 11.43/3.68 cnf(i_0_51, plain, (X1=X2|~product(X3,X2,additive_identity)|~product(X3,X1,additive_identity)|~sum(X3,X2,multiplicative_identity)|~sum(X3,X1,multiplicative_identity))). % 11.43/3.68 cnf(i_0_43, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X7,X1)|~sum(X7,X2,X5)|~sum(X6,X2,X4))). % 11.43/3.68 cnf(i_0_36, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X2)|~product(X4,X7,X1)|~sum(X7,X6,X5))). % 11.43/3.68 cnf(i_0_38, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X7,X5,X1)|~sum(X7,X6,X4))). % 11.43/3.68 cnf(i_0_41, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X7,X2)|~sum(X1,X7,X5)|~sum(X1,X6,X4))). % 11.43/3.68 cnf(i_0_39, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X2,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X1))). % 11.43/3.68 cnf(i_0_42, plain, (product(X1,X2,X3)|~product(X4,X5,X6)|~sum(X6,X7,X3)|~sum(X5,X7,X2)|~sum(X4,X7,X1))). % 11.43/3.68 cnf(i_0_40, plain, (product(X1,X2,X3)|~product(X4,X5,X6)|~sum(X7,X6,X3)|~sum(X7,X5,X2)|~sum(X7,X4,X1))). % 11.43/3.68 cnf(i_0_37, plain, (product(X1,X2,X3)|~product(X1,X4,X5)|~product(X1,X6,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X2))). % 11.43/3.68 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 11.43/3.68 # Begin printing tableau % 11.43/3.68 # Found 12 steps % 11.43/3.68 cnf(i_0_54, negated_conjecture, (inverse(x_plus_y)!=x_inverse_times_y_inverse), inference(start_rule)). % 11.43/3.68 cnf(i_0_55, plain, (inverse(x_plus_y)!=x_inverse_times_y_inverse), inference(extension_rule, [i_0_51])). % 11.43/3.68 cnf(i_0_67, plain, (~product(inverse(x_inverse_times_y_inverse),x_inverse_times_y_inverse,additive_identity)), inference(closure_rule, [i_0_46])). % 11.43/3.68 cnf(i_0_69, plain, (~sum(inverse(x_inverse_times_y_inverse),x_inverse_times_y_inverse,multiplicative_identity)), inference(closure_rule, [i_0_44])). % 11.43/3.68 cnf(i_0_70, plain, (~sum(inverse(x_inverse_times_y_inverse),inverse(x_plus_y),multiplicative_identity)), inference(extension_rule, [i_0_30])). % 11.43/3.68 cnf(i_0_147855, plain, (~sum(inverse(x_plus_y),inverse(x_inverse_times_y_inverse),multiplicative_identity)), inference(extension_rule, [i_0_43])). % 11.43/3.68 cnf(i_0_185234, plain, (~product(multiplicative_identity,multiplicative_identity,multiplicative_identity)), inference(closure_rule, [i_0_35])). % 11.43/3.68 cnf(i_0_185236, plain, (~sum(x_inverse_times_y_inverse,inverse(x_inverse_times_y_inverse),multiplicative_identity)), inference(closure_rule, [i_0_45])). % 11.43/3.68 cnf(i_0_185237, plain, (~sum(x_inverse_times_y_inverse,inverse(x_inverse_times_y_inverse),multiplicative_identity)), inference(closure_rule, [i_0_45])). % 11.43/3.68 cnf(i_0_68, plain, (~product(inverse(x_inverse_times_y_inverse),inverse(x_plus_y),additive_identity)), inference(extension_rule, [i_0_31])). % 11.43/3.68 cnf(i_0_185235, plain, (~product(x_inverse_times_y_inverse,x_inverse_times_y_inverse,inverse(x_plus_y))), inference(etableau_closure_rule, [i_0_185235, ...])). % 11.43/3.68 cnf(i_0_185241, plain, (~product(inverse(x_plus_y),inverse(x_inverse_times_y_inverse),additive_identity)), inference(etableau_closure_rule, [i_0_185241, ...])). % 11.43/3.68 # End printing tableau % 11.43/3.68 # SZS output end % 11.43/3.68 # Branches closed with saturation will be marked with an "s" % 11.61/3.68 # Child (32241) has found a proof. % 11.61/3.68 % 11.61/3.69 # Proof search is over... % 11.61/3.69 # Freeing feature tree %------------------------------------------------------------------------------