%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : HAL001+2 : 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 : 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:12 EDT 2022 % Result : Theorem 269.45s 45.70s % Output : CNFRefutation 269.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : HAL001+2 : TPTP v8.1.0. Released v2.6.0. % 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n024.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Tue Jun 7 20:58:34 EDT 2022 % 0.13/0.34 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S4c % 0.19/0.37 # and selection function SelectCQPrecWNTNp. % 0.19/0.37 # % 0.19/0.37 # Number of axioms: 49 Number of unprocessed: 49 % 0.19/0.37 # Tableaux proof search. % 0.19/0.37 # APR header successfully linked. % 0.19/0.37 # Hello from C++ % 2.58/2.81 # The folding up rule is enabled... % 2.58/2.81 # Local unification is enabled... % 2.58/2.81 # Any saturation attempts will use folding labels... % 2.58/2.81 # 49 beginning clauses after preprocessing and clausification % 2.58/2.81 # Creating start rules for all 1 conjectures. % 2.58/2.81 # There are 1 start rule candidates: % 2.58/2.81 # Found 18 unit axioms. % 2.58/2.81 # 1 start rule tableaux created. % 2.58/2.81 # 31 extension rule candidate clauses % 2.58/2.81 # 18 unit axiom clauses % 2.58/2.81 % 2.58/2.81 # Requested 8, 32 cores available to the main process. % 2.58/2.81 # There are not enough tableaux to fork, creating more from the initial 1 % 13.07/13.29 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 13.07/13.29 # We now have 10 tableaux to operate on % 131.99/28.33 # Creating equality axioms % 131.99/28.33 # Ran out of tableaux, making start rules for all clauses % 269.45/45.70 # There were 12 total branch saturation attempts. % 269.45/45.70 # There were 0 of these attempts blocked. % 269.45/45.70 # There were 0 deferred branch saturation attempts. % 269.45/45.70 # There were 0 free duplicated saturations. % 269.45/45.70 # There were 4 total successful branch saturations. % 269.45/45.70 # There were 0 successful branch saturations in interreduction. % 269.45/45.70 # There were 0 successful branch saturations on the branch. % 269.45/45.70 # There were 4 successful branch saturations after the branch. % 269.45/45.70 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 269.45/45.70 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 269.45/45.70 # Begin clausification derivation % 269.45/45.70 % 269.45/45.70 # End clausification derivation % 269.45/45.70 # Begin listing active clauses obtained from FOF to CNF conversion % 269.45/45.70 cnf(i_0_39, plain, (injection(alpha))). % 269.45/45.70 cnf(i_0_40, plain, (injection(gamma))). % 269.45/45.70 cnf(i_0_47, hypothesis, (injection(f))). % 269.45/45.70 cnf(i_0_48, hypothesis, (injection(h))). % 269.45/45.70 cnf(i_0_41, plain, (surjection(beta))). % 269.45/45.70 cnf(i_0_42, plain, (surjection(delta))). % 269.45/45.70 cnf(i_0_49, negated_conjecture, (~injection(g))). % 269.45/45.70 cnf(i_0_43, plain, (exact(alpha,beta))). % 269.45/45.70 cnf(i_0_44, plain, (exact(gammma,delta))). % 269.45/45.70 cnf(i_0_32, plain, (morphism(alpha,a,b))). % 269.45/45.70 cnf(i_0_33, plain, (morphism(beta,b,c))). % 269.45/45.70 cnf(i_0_34, plain, (morphism(gamma,d,e))). % 269.45/45.70 cnf(i_0_35, plain, (morphism(delta,e,r))). % 269.45/45.70 cnf(i_0_36, plain, (morphism(f,a,d))). % 269.45/45.70 cnf(i_0_37, plain, (morphism(g,b,e))). % 269.45/45.70 cnf(i_0_38, plain, (morphism(h,c,r))). % 269.45/45.70 cnf(i_0_25, plain, (subtract(X2,X1,X1)=zero(X2)|~element(X1,X2))). % 269.45/45.70 cnf(i_0_1, plain, (apply(X1,zero(X2))=zero(X3)|~morphism(X1,X2,X3))). % 269.45/45.70 cnf(i_0_7, plain, (injection(X1)|element(esk1_2(X1,X2),X2)|~morphism(X1,X2,X3))). % 269.45/45.70 cnf(i_0_6, plain, (injection(X1)|element(esk2_2(X1,X2),X2)|~morphism(X1,X2,X3))). % 269.45/45.70 cnf(i_0_4, plain, (injection(X1)|esk2_2(X1,X2)!=esk1_2(X1,X2)|~morphism(X1,X2,X3))). % 269.45/45.70 cnf(i_0_2, plain, (element(apply(X3,X1),X4)|~element(X1,X2)|~morphism(X3,X2,X4))). % 269.45/45.70 cnf(i_0_28, plain, (X4=zero(X2)|apply(X1,X4)!=zero(X3)|~injection(X1)|~element(X4,X2)|~morphism(X1,X2,X3))). % 269.45/45.70 cnf(i_0_24, plain, (element(subtract(X2,X1,X3),X2)|~element(X3,X2)|~element(X1,X2))). % 269.45/45.70 cnf(i_0_5, plain, (apply(X1,esk2_2(X1,X2))=apply(X1,esk1_2(X1,X2))|injection(X1)|~morphism(X1,X2,X3))). % 269.45/45.70 cnf(i_0_29, plain, (injection(X1)|esk9_3(X1,X2,X3)!=zero(X2)|~morphism(X1,X2,X3))). % 269.45/45.70 cnf(i_0_3, plain, (X4=X5|apply(X1,X4)!=apply(X1,X5)|~injection(X1)|~element(X5,X2)|~element(X4,X2)|~morphism(X1,X2,X3))). % 269.45/45.70 cnf(i_0_26, plain, (subtract(X2,X1,subtract(X2,X1,X3))=X3|~element(X3,X2)|~element(X1,X2))). % 269.45/45.70 cnf(i_0_31, plain, (injection(X1)|element(esk9_3(X1,X2,X3),X2)|~morphism(X1,X2,X3))). % 269.45/45.70 cnf(i_0_11, plain, (surjection(X1)|element(esk4_3(X1,X2,X3),X3)|~morphism(X1,X2,X3))). % 269.45/45.70 cnf(i_0_30, plain, (apply(X1,esk9_3(X1,X2,X3))=zero(X3)|injection(X1)|~morphism(X1,X2,X3))). % 269.45/45.70 cnf(i_0_10, plain, (surjection(X3)|apply(X3,X1)!=esk4_3(X3,X2,X4)|~element(X1,X2)|~morphism(X3,X2,X4))). % 269.45/45.70 cnf(i_0_45, plain, (commute(alpha,g,f,gamma))). % 269.45/45.70 cnf(i_0_46, plain, (commute(beta,h,g,delta))). % 269.45/45.70 cnf(i_0_13, plain, (element(X1,X2)|apply(X5,X3)!=X1|~element(X3,X4)|~exact(X5,X6)|~morphism(X6,X2,X7)|~morphism(X5,X4,X2))). % 269.45/45.70 cnf(i_0_12, plain, (apply(X1,X2)=zero(X3)|apply(X6,X4)!=X2|~element(X4,X5)|~exact(X6,X1)|~morphism(X6,X5,X7)|~morphism(X1,X7,X3))). % 269.45/45.70 cnf(i_0_27, plain, (apply(X1,subtract(X2,X4,X5))=subtract(X3,apply(X1,X4),apply(X1,X5))|~element(X5,X2)|~element(X4,X2)|~morphism(X1,X2,X3))). % 269.45/45.70 cnf(i_0_9, plain, (element(esk3_4(X1,X2,X3,X4),X2)|~surjection(X1)|~element(X4,X3)|~morphism(X1,X2,X3))). % 269.45/45.70 cnf(i_0_8, plain, (apply(X1,esk3_4(X1,X2,X3,X4))=X4|~surjection(X1)|~element(X4,X3)|~morphism(X1,X2,X3))). % 269.45/45.70 cnf(i_0_21, plain, (apply(X2,apply(X1,X9))=apply(X4,apply(X3,X9))|~element(X9,X5)|~morphism(X4,X8,X7)|~morphism(X3,X5,X8)|~morphism(X2,X6,X7)|~morphism(X1,X5,X6)|~commute(X1,X2,X3,X4))). % 269.45/45.70 cnf(i_0_23, plain, (commute(X1,X2,X3,X4)|element(esk8_5(X1,X2,X3,X4,X5),X5)|~morphism(X4,X8,X7)|~morphism(X3,X5,X8)|~morphism(X2,X6,X7)|~morphism(X1,X5,X6))). % 269.45/45.70 cnf(i_0_19, plain, (exact(X1,X2)|element(esk6_5(X1,X2,X3,X4,X5),X4)|element(esk7_5(X1,X2,X3,X4,X5),X3)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))). % 269.45/45.70 cnf(i_0_17, plain, (apply(X2,esk6_5(X1,X2,X3,X4,X5))=zero(X5)|exact(X1,X2)|element(esk7_5(X1,X2,X3,X4,X5),X3)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))). % 269.45/45.70 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))). % 269.45/45.70 cnf(i_0_16, plain, (apply(X2,esk6_5(X1,X2,X3,X4,X5))=zero(X5)|apply(X1,esk7_5(X1,X2,X3,X4,X5))=esk6_5(X1,X2,X3,X4,X5)|exact(X1,X2)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))). % 269.45/45.70 cnf(i_0_20, plain, (exact(X1,X2)|apply(X1,X6)!=esk6_5(X1,X2,X3,X4,X5)|apply(X2,esk6_5(X1,X2,X3,X4,X5))!=zero(X5)|~element(X6,X3)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4)|~element(esk6_5(X1,X2,X3,X4,X5),X4))). % 269.45/45.70 cnf(i_0_15, plain, (element(esk5_6(X1,X2,X3,X4,X5,X6),X3)|apply(X2,X6)!=zero(X5)|~element(X6,X4)|~exact(X1,X2)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))). % 269.45/45.70 cnf(i_0_14, plain, (apply(X1,esk5_6(X1,X2,X3,X4,X5,X6))=X6|apply(X2,X6)!=zero(X5)|~element(X6,X4)|~exact(X1,X2)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))). % 269.45/45.70 cnf(i_0_22, plain, (commute(X2,X1,X3,X4)|apply(X1,apply(X2,esk8_5(X2,X1,X3,X4,X5)))!=apply(X4,apply(X3,esk8_5(X2,X1,X3,X4,X5)))|~morphism(X4,X8,X7)|~morphism(X3,X5,X8)|~morphism(X2,X5,X6)|~morphism(X1,X6,X7))). % 269.45/45.70 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 269.45/45.70 # Begin printing tableau % 269.45/45.70 # Found 13 steps % 269.45/45.70 cnf(i_0_49, negated_conjecture, (~injection(g)), inference(start_rule)). % 269.45/45.70 cnf(i_0_50, plain, (~injection(g)), inference(extension_rule, [i_0_5])). % 269.45/45.70 cnf(i_0_77, plain, (~morphism(g,b,e)), inference(closure_rule, [i_0_37])). % 269.45/45.70 cnf(i_0_75, plain, (apply(g,esk2_2(g,b))=apply(g,esk1_2(g,b))), inference(extension_rule, [i_0_12])). % 269.45/45.70 cnf(i_0_1222314, plain, (~morphism(g,b,e)), inference(closure_rule, [i_0_37])). % 269.45/45.70 cnf(i_0_1222315, plain, (~morphism(delta,e,r)), inference(closure_rule, [i_0_35])). % 269.45/45.70 cnf(i_0_1222310, plain, (apply(delta,apply(g,esk1_2(g,b)))=zero(r)), inference(extension_rule, [i_0_28])). % 269.45/45.70 cnf(i_0_1384758, plain, (~element(apply(g,esk1_2(g,b)),e)), inference(closure_rule, [i_0_1222579])). % 269.45/45.70 cnf(i_0_1384759, plain, (~morphism(delta,e,r)), inference(closure_rule, [i_0_35])). % 269.45/45.70 cnf(i_0_1222312, plain, (~element(esk2_2(g,b),b)), inference(etableau_closure_rule, [i_0_1222312, ...])). % 269.45/45.70 cnf(i_0_1222313, plain, (~exact(g,delta)), inference(etableau_closure_rule, [i_0_1222313, ...])). % 269.45/45.70 cnf(i_0_1384755, plain, (apply(g,esk1_2(g,b))=zero(e)), inference(etableau_closure_rule, [i_0_1384755, ...])). % 269.45/45.70 cnf(i_0_1384757, plain, (~injection(delta)), inference(etableau_closure_rule, [i_0_1384757, ...])). % 269.45/45.70 # End printing tableau % 269.45/45.70 # SZS output end % 269.45/45.70 # Branches closed with saturation will be marked with an "s" % 269.45/45.72 # Child (4126) has found a proof. % 269.45/45.72 % 269.45/45.73 # Proof search is over... % 269.45/45.73 # Freeing feature tree %------------------------------------------------------------------------------