%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP447-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 : 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 : Sat Jul 16 09:06:31 EDT 2022 % Result : Unsatisfiable 0.07s 0.31s % Output : CNFRefutation 0.07s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.05/0.08 % Problem : GRP447-1 : TPTP v8.1.0. Released v2.6.0. % 0.05/0.08 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.07/0.27 % Computer : n032.cluster.edu % 0.07/0.27 % Model : x86_64 x86_64 % 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.27 % Memory : 8042.1875MB % 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64 % 0.07/0.27 % CPULimit : 300 % 0.07/0.27 % WCLimit : 600 % 0.07/0.27 % DateTime : Tue Jun 14 08:46:12 EDT 2022 % 0.07/0.27 % CPUTime : % 0.07/0.29 # No SInE strategy applied % 0.07/0.29 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S04AN % 0.07/0.29 # and selection function SelectComplexExceptUniqMaxHorn. % 0.07/0.29 # % 0.07/0.29 # Presaturation interreduction done % 0.07/0.29 # Number of axioms: 4 Number of unprocessed: 4 % 0.07/0.29 # Tableaux proof search. % 0.07/0.29 # APR header successfully linked. % 0.07/0.29 # Hello from C++ % 0.07/0.29 # The folding up rule is enabled... % 0.07/0.29 # Local unification is enabled... % 0.07/0.29 # Any saturation attempts will use folding labels... % 0.07/0.29 # 4 beginning clauses after preprocessing and clausification % 0.07/0.29 # Creating start rules for all 1 conjectures. % 0.07/0.29 # There are 1 start rule candidates: % 0.07/0.29 # Found 4 unit axioms. % 0.07/0.29 # 1 start rule tableaux created. % 0.07/0.29 # 0 extension rule candidate clauses % 0.07/0.29 # 4 unit axiom clauses % 0.07/0.29 % 0.07/0.29 # Requested 8, 32 cores available to the main process. % 0.07/0.29 # There are not enough tableaux to fork, creating more from the initial 1 % 0.07/0.29 # Creating equality axioms % 0.07/0.29 # Ran out of tableaux, making start rules for all clauses % 0.07/0.29 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.07/0.29 # We now have 11 tableaux to operate on % 0.07/0.31 # There were 1 total branch saturation attempts. % 0.07/0.31 # There were 0 of these attempts blocked. % 0.07/0.31 # There were 0 deferred branch saturation attempts. % 0.07/0.31 # There were 0 free duplicated saturations. % 0.07/0.31 # There were 1 total successful branch saturations. % 0.07/0.31 # There were 0 successful branch saturations in interreduction. % 0.07/0.31 # There were 0 successful branch saturations on the branch. % 0.07/0.31 # There were 1 successful branch saturations after the branch. % 0.07/0.31 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.07/0.31 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.07/0.31 # Begin clausification derivation % 0.07/0.31 % 0.07/0.31 # End clausification derivation % 0.07/0.31 # Begin listing active clauses obtained from FOF to CNF conversion % 0.07/0.31 cnf(i_0_6, plain, (divide(X1,divide(divide(X2,X2),X3))=multiply(X1,X3))). % 0.07/0.31 cnf(i_0_5, plain, (divide(X1,divide(divide(divide(divide(X1,X1),X2),X3),divide(divide(divide(X1,X1),X1),X3)))=X2)). % 0.07/0.31 cnf(i_0_7, plain, (inverse(X1)=divide(divide(X2,X2),X1))). % 0.07/0.31 cnf(i_0_8, negated_conjecture, (multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)))). % 0.07/0.31 cnf(i_0_10, plain, (X4=X4)). % 0.07/0.31 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.07/0.31 # Begin printing tableau % 0.07/0.31 # Found 6 steps % 0.07/0.31 cnf(i_0_6, plain, (divide(X14,divide(divide(X13,X13),X12))=multiply(X14,X12)), inference(start_rule)). % 0.07/0.31 cnf(i_0_17, plain, (divide(X14,divide(divide(X13,X13),X12))=multiply(X14,X12)), inference(extension_rule, [i_0_14])). % 0.07/0.31 cnf(i_0_31, plain, (divide(X1,divide(divide(divide(multiply(X14,X12),multiply(X1,X3)),divide(multiply(X14,X12),multiply(X1,X3))),X3))!=multiply(X1,X3)), inference(closure_rule, [i_0_6])). % 0.07/0.31 cnf(i_0_29, plain, (divide(divide(X14,divide(divide(X13,X13),X12)),divide(X1,divide(divide(divide(multiply(X14,X12),multiply(X1,X3)),divide(multiply(X14,X12),multiply(X1,X3))),X3)))=divide(multiply(X14,X12),multiply(X1,X3))), inference(extension_rule, [i_0_13])). % 0.07/0.31 cnf(i_0_43, plain, (divide(multiply(X14,X12),multiply(X1,X3))!=divide(X1,divide(divide(divide(divide(X1,X1),divide(multiply(X14,X12),multiply(X1,X3))),X3),divide(divide(divide(X1,X1),X1),X3)))), inference(closure_rule, [i_0_5])). % 0.07/0.31 cnf(i_0_41, plain, (divide(divide(X14,divide(divide(X13,X13),X12)),divide(X1,divide(divide(divide(multiply(X14,X12),multiply(X1,X3)),divide(multiply(X14,X12),multiply(X1,X3))),X3)))=divide(X1,divide(divide(divide(divide(X1,X1),divide(multiply(X14,X12),multiply(X1,X3))),X3),divide(divide(divide(X1,X1),X1),X3)))), inference(etableau_closure_rule, [i_0_41, ...])). % 0.07/0.31 # End printing tableau % 0.07/0.31 # SZS output end % 0.07/0.31 # Branches closed with saturation will be marked with an "s" % 0.07/0.31 # Child (15115) has found a proof. % 0.07/0.31 % 0.07/0.31 # Proof search is over... % 0.07/0.31 # Freeing feature tree %------------------------------------------------------------------------------