%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : HAL007+1 : TPTP v8.1.0. Released v6.4.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 : n024.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 12:45:13 EDT 2022 % Result : Satisfiable 0.18s 0.41s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : HAL007+1 : TPTP v8.1.0. Released v6.4.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.33 % Computer : n024.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue Jun 7 21:02:49 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 27 Number of unprocessed: 26 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 26 beginning clauses after preprocessing and clausification % 0.12/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.12/0.37 # No conjectures. % 0.12/0.37 # There are 26 start rule candidates: % 0.12/0.37 # Found 0 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 26 start rule tableaux created. % 0.12/0.37 # 26 extension rule candidate clauses % 0.12/0.37 # 0 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.18/0.41 # Creating equality axioms % 0.18/0.41 # Ran out of tableaux, making start rules for all clauses % 0.18/0.41 # 8403 Satisfiable branch % 0.18/0.41 # Satisfiable branch found. % 0.18/0.41 # There were 1 total branch saturation attempts. % 0.18/0.41 # There were 0 of these attempts blocked. % 0.18/0.41 # There were 0 deferred branch saturation attempts. % 0.18/0.41 # There were 0 free duplicated saturations. % 0.18/0.41 # There were 0 total successful branch saturations. % 0.18/0.41 # There were 0 successful branch saturations in interreduction. % 0.18/0.41 # There were 0 successful branch saturations on the branch. % 0.18/0.41 # There were 0 successful branch saturations after the branch. % 0.18/0.41 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.41 # Begin clausification derivation % 0.18/0.41 % 0.18/0.41 # End clausification derivation % 0.18/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.41 cnf(i_0_25, plain, (subtract(X1,X2,X2)=zero(X1)|~element(X2,X1))). % 0.18/0.41 cnf(i_0_4, plain, (injection(X1)|esk2_2(X1,X2)!=esk1_2(X1,X2)|~morphism(X1,X2,X3))). % 0.18/0.41 cnf(i_0_1, plain, (apply(X1,zero(X2))=zero(X3)|~morphism(X1,X2,X3))). % 0.18/0.41 cnf(i_0_24, plain, (element(subtract(X1,X2,X3),X1)|~element(X3,X1)|~element(X2,X1))). % 0.18/0.41 cnf(i_0_11, plain, (surjection(X1)|element(esk4_3(X1,X2,X3),X3)|~morphism(X1,X2,X3))). % 0.18/0.41 cnf(i_0_7, plain, (injection(X1)|element(esk1_2(X1,X2),X2)|~morphism(X1,X2,X3))). % 0.18/0.41 cnf(i_0_6, plain, (injection(X1)|element(esk2_2(X1,X2),X2)|~morphism(X1,X2,X3))). % 0.18/0.41 cnf(i_0_10, plain, (surjection(X1)|apply(X1,X2)!=esk4_3(X1,X3,X4)|~element(X2,X3)|~morphism(X1,X3,X4))). % 0.18/0.41 cnf(i_0_2, plain, (element(apply(X1,X2),X3)|~element(X2,X4)|~morphism(X1,X4,X3))). % 0.18/0.41 cnf(i_0_9, plain, (element(esk3_4(X1,X2,X3,X4),X2)|~surjection(X1)|~element(X4,X3)|~morphism(X1,X2,X3))). % 0.18/0.41 cnf(i_0_26, plain, (subtract(X1,X2,subtract(X1,X2,X3))=X3|~element(X3,X1)|~element(X2,X1))). % 0.18/0.41 cnf(i_0_5, plain, (apply(X1,esk2_2(X1,X2))=apply(X1,esk1_2(X1,X2))|injection(X1)|~morphism(X1,X2,X3))). % 0.18/0.41 cnf(i_0_8, plain, (apply(X1,esk3_4(X1,X2,X3,X4))=X4|~surjection(X1)|~element(X4,X3)|~morphism(X1,X2,X3))). % 0.18/0.41 cnf(i_0_3, plain, (X1=X2|apply(X3,X1)!=apply(X3,X2)|~injection(X3)|~element(X2,X4)|~element(X1,X4)|~morphism(X3,X4,X5))). % 0.18/0.41 cnf(i_0_12, plain, (apply(X1,apply(X2,X3))=zero(X4)|~exact(X2,X1)|~element(X3,X5)|~morphism(X2,X5,X6)|~morphism(X1,X6,X4))). % 0.18/0.41 cnf(i_0_15, plain, (element(esk5_6(X1,X2,X3,X4,X5,X6),X3)|apply(X2,X6)!=zero(X5)|~exact(X1,X2)|~element(X6,X4)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))). % 0.18/0.41 cnf(i_0_14, plain, (apply(X1,esk5_6(X1,X2,X3,X4,X5,X6))=X6|apply(X2,X6)!=zero(X5)|~exact(X1,X2)|~element(X6,X4)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))). % 0.18/0.41 cnf(i_0_23, plain, (commute(X1,X2,X3,X4)|element(esk8_5(X1,X2,X3,X4,X5),X5)|~morphism(X4,X6,X7)|~morphism(X3,X5,X6)|~morphism(X2,X8,X7)|~morphism(X1,X5,X8))). % 0.18/0.41 cnf(i_0_27, plain, (apply(X1,subtract(X2,X3,X4))=subtract(X5,apply(X1,X3),apply(X1,X4))|~element(X4,X2)|~element(X3,X2)|~morphism(X1,X2,X5))). % 0.18/0.41 cnf(i_0_19, plain, (exact(X1,X2)|element(esk7_5(X1,X2,X3,X4,X5),X3)|element(esk6_5(X1,X2,X3,X4,X5),X4)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))). % 0.18/0.41 cnf(i_0_17, plain, (apply(X1,esk6_5(X2,X1,X3,X4,X5))=zero(X5)|exact(X2,X1)|element(esk7_5(X2,X1,X3,X4,X5),X3)|~morphism(X1,X4,X5)|~morphism(X2,X3,X4))). % 0.18/0.41 cnf(i_0_20, plain, (exact(X1,X2)|apply(X2,esk6_5(X1,X2,X3,X4,X5))!=zero(X5)|apply(X1,X6)!=esk6_5(X1,X2,X3,X4,X5)|~element(esk6_5(X1,X2,X3,X4,X5),X4)|~element(X6,X3)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))). % 0.18/0.41 cnf(i_0_18, plain, (apply(X1,esk7_5(X1,X2,X3,X4,X5))=esk6_5(X1,X2,X3,X4,X5)|exact(X1,X2)|element(esk6_5(X1,X2,X3,X4,X5),X4)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))). % 0.18/0.41 cnf(i_0_16, plain, (apply(X1,esk7_5(X1,X2,X3,X4,X5))=esk6_5(X1,X2,X3,X4,X5)|apply(X2,esk6_5(X1,X2,X3,X4,X5))=zero(X5)|exact(X1,X2)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))). % 0.18/0.41 cnf(i_0_21, plain, (apply(X1,apply(X2,X3))=apply(X4,apply(X5,X3))|~commute(X2,X1,X5,X4)|~element(X3,X6)|~morphism(X4,X7,X8)|~morphism(X5,X6,X7)|~morphism(X1,X9,X8)|~morphism(X2,X6,X9))). % 0.18/0.41 cnf(i_0_22, plain, (commute(X1,X2,X3,X4)|apply(X2,apply(X1,esk8_5(X1,X2,X3,X4,X5)))!=apply(X4,apply(X3,esk8_5(X1,X2,X3,X4,X5)))|~morphism(X4,X6,X7)|~morphism(X3,X5,X6)|~morphism(X1,X5,X8)|~morphism(X2,X8,X7))). % 0.18/0.41 cnf(i_0_1315, plain, (X91=X91)). % 0.18/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.41 # Begin printing tableau % 0.18/0.41 # Found 4 steps % 0.18/0.41 cnf(i_0_1315, plain, (X6=X6), inference(start_rule)). % 0.18/0.41 cnf(i_0_1441, plain, (X6=X6), inference(extension_rule, [i_0_1322])). % 0.18/0.41 cnf(i_0_16377, plain, (zero(X6)=zero(X6)), inference(extension_rule, [i_0_1321])). % 0.18/0.41 cnf(i_0_18809, plain, ($false), inference(closure_rule, [i_0_1315])). % 0.18/0.41 # End printing tableau % 0.18/0.41 # SZS output end % 0.18/0.41 # Branches closed with saturation will be marked with an "s" % 0.18/0.41 # Child (8403) has found a proof. % 0.18/0.41 % 0.18/0.41 # Proof search is over... % 0.18/0.41 # Freeing feature tree %------------------------------------------------------------------------------