%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : HAL006+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 : n022.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 : Theorem 17.35s 2.54s % Output : CNFRefutation 17.35s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : HAL006+1 : TPTP v8.1.0. Released v2.6.0. % 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n022.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Tue Jun 7 21:04:20 EDT 2022 % 0.13/0.33 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.19/0.36 # and selection function SelectCQIPrecWNTNp. % 0.19/0.36 # % 0.19/0.36 # Presaturation interreduction done % 0.19/0.36 # Number of axioms: 57 Number of unprocessed: 56 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # Hello from C++ % 0.19/0.37 # The folding up rule is enabled... % 0.19/0.37 # Local unification is enabled... % 0.19/0.37 # Any saturation attempts will use folding labels... % 0.19/0.37 # 56 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 2 conjectures. % 0.19/0.37 # There are 2 start rule candidates: % 0.19/0.37 # Found 18 unit axioms. % 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.37 # 2 start rule tableaux created. % 0.19/0.37 # 38 extension rule candidate clauses % 0.19/0.37 # 18 unit axiom clauses % 0.19/0.37 % 0.19/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 2 % 0.19/0.37 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux. % 0.19/0.37 # We now have 16 tableaux to operate on % 11.78/1.91 # Creating equality axioms % 11.78/1.91 # Ran out of tableaux, making start rules for all clauses % 12.44/1.97 # Creating equality axioms % 12.44/1.97 # Ran out of tableaux, making start rules for all clauses % 12.95/1.98 # Creating equality axioms % 12.95/1.98 # Ran out of tableaux, making start rules for all clauses % 13.55/2.06 # Creating equality axioms % 13.55/2.06 # Ran out of tableaux, making start rules for all clauses % 17.35/2.54 # There were 1 total branch saturation attempts. % 17.35/2.54 # There were 0 of these attempts blocked. % 17.35/2.54 # There were 0 deferred branch saturation attempts. % 17.35/2.54 # There were 0 free duplicated saturations. % 17.35/2.54 # There were 1 total successful branch saturations. % 17.35/2.54 # There were 0 successful branch saturations in interreduction. % 17.35/2.54 # There were 0 successful branch saturations on the branch. % 17.35/2.54 # There were 1 successful branch saturations after the branch. % 17.35/2.54 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 17.35/2.54 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 17.35/2.54 # Begin clausification derivation % 17.35/2.54 % 17.35/2.54 # End clausification derivation % 17.35/2.54 # Begin listing active clauses obtained from FOF to CNF conversion % 17.35/2.54 cnf(i_0_57, negated_conjecture, (element(esk14_0,e))). % 17.35/2.54 cnf(i_0_33, plain, (morphism(g,b,e))). % 17.35/2.54 cnf(i_0_35, plain, (injection(alpha))). % 17.35/2.54 cnf(i_0_36, plain, (injection(gamma))). % 17.35/2.54 cnf(i_0_37, plain, (surjection(beta))). % 17.35/2.54 cnf(i_0_38, plain, (surjection(delta))). % 17.35/2.54 cnf(i_0_43, hypothesis, (surjection(f))). % 17.35/2.54 cnf(i_0_44, hypothesis, (surjection(h))). % 17.35/2.54 cnf(i_0_39, plain, (exact(alpha,beta))). % 17.35/2.54 cnf(i_0_40, plain, (exact(gammma,delta))). % 17.35/2.54 cnf(i_0_28, plain, (morphism(alpha,a,b))). % 17.35/2.54 cnf(i_0_29, plain, (morphism(beta,b,c))). % 17.35/2.54 cnf(i_0_30, plain, (morphism(gamma,d,e))). % 17.35/2.54 cnf(i_0_31, plain, (morphism(delta,e,r))). % 17.35/2.54 cnf(i_0_32, plain, (morphism(f,a,d))). % 17.35/2.54 cnf(i_0_34, plain, (morphism(h,c,r))). % 17.35/2.54 cnf(i_0_41, plain, (commute(alpha,g,f,gamma))). % 17.35/2.54 cnf(i_0_42, plain, (commute(beta,h,g,delta))). % 17.35/2.54 cnf(i_0_56, negated_conjecture, (apply(g,subtract(b,X1,X2))!=esk14_0|~element(X2,b)|~element(X1,b))). % 17.35/2.54 cnf(i_0_47, plain, (element(esk10_1(X1),b)|~element(X1,e))). % 17.35/2.54 cnf(i_0_55, plain, (element(esk11_1(X1),b)|~element(X1,e))). % 17.35/2.54 cnf(i_0_54, plain, (element(esk12_1(X1),e)|~element(X1,e))). % 17.35/2.54 cnf(i_0_48, plain, (esk9_1(X1)=apply(delta,X1)|~element(X1,e))). % 17.35/2.54 cnf(i_0_49, plain, (element(esk9_1(X1),r)|~element(X1,e))). % 17.35/2.54 cnf(i_0_52, plain, (element(esk13_1(X1),a)|~element(X1,e))). % 17.35/2.54 cnf(i_0_45, plain, (apply(delta,apply(g,esk10_1(X1)))=esk9_1(X1)|~element(X1,e))). % 17.35/2.54 cnf(i_0_50, plain, (apply(g,apply(alpha,esk13_1(X1)))=esk12_1(X1)|~element(X1,e))). % 17.35/2.54 cnf(i_0_51, plain, (apply(gamma,apply(f,esk13_1(X1)))=esk12_1(X1)|~element(X1,e))). % 17.35/2.54 cnf(i_0_25, plain, (subtract(X1,X2,X2)=zero(X1)|~element(X2,X1))). % 17.35/2.54 cnf(i_0_4, plain, (injection(X1)|esk2_2(X1,X2)!=esk1_2(X1,X2)|~morphism(X1,X2,X3))). % 17.35/2.54 cnf(i_0_10, plain, (surjection(X1)|apply(X1,X2)!=esk4_3(X1,X3,X4)|~element(X2,X3)|~morphism(X1,X3,X4))). % 17.35/2.54 cnf(i_0_24, plain, (element(subtract(X1,X2,X3),X1)|~element(X3,X1)|~element(X2,X1))). % 17.35/2.54 cnf(i_0_7, plain, (injection(X1)|element(esk1_2(X1,X2),X2)|~morphism(X1,X2,X3))). % 17.35/2.54 cnf(i_0_46, plain, (apply(h,apply(beta,esk10_1(X1)))=esk9_1(X1)|~element(X1,e))). % 17.35/2.54 cnf(i_0_53, plain, (subtract(e,apply(g,esk11_1(X1)),X1)=esk12_1(X1)|~element(X1,e))). % 17.35/2.54 cnf(i_0_2, plain, (element(apply(X1,X2),X3)|~element(X2,X4)|~morphism(X1,X4,X3))). % 17.35/2.54 cnf(i_0_26, plain, (subtract(X1,X2,subtract(X1,X2,X3))=X3|~element(X3,X1)|~element(X2,X1))). % 17.35/2.54 cnf(i_0_1, plain, (apply(X1,zero(X2))=zero(X3)|~morphism(X1,X2,X3))). % 17.35/2.54 cnf(i_0_6, plain, (injection(X1)|element(esk2_2(X1,X2),X2)|~morphism(X1,X2,X3))). % 17.35/2.54 cnf(i_0_11, plain, (surjection(X1)|element(esk4_3(X1,X2,X3),X3)|~morphism(X1,X2,X3))). % 17.35/2.54 cnf(i_0_9, plain, (element(esk3_4(X1,X2,X3,X4),X2)|~surjection(X1)|~element(X4,X3)|~morphism(X1,X2,X3))). % 17.35/2.54 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))). % 17.35/2.54 cnf(i_0_8, plain, (apply(X1,esk3_4(X1,X2,X3,X4))=X4|~surjection(X1)|~element(X4,X3)|~morphism(X1,X2,X3))). % 17.35/2.54 cnf(i_0_5, plain, (apply(X1,esk2_2(X1,X2))=apply(X1,esk1_2(X1,X2))|injection(X1)|~morphism(X1,X2,X3))). % 17.35/2.54 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))). % 17.35/2.54 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))). % 17.35/2.54 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))). % 17.35/2.54 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))). % 17.35/2.54 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))). % 17.35/2.54 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))). % 17.35/2.54 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))). % 17.35/2.54 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))). % 17.35/2.54 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))). % 17.35/2.54 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))). % 17.35/2.54 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))). % 17.35/2.54 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))). % 17.35/2.54 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 17.35/2.54 # Begin printing tableau % 17.35/2.54 # Found 4 steps % 17.35/2.54 cnf(i_0_57, negated_conjecture, (element(esk14_0,e)), inference(start_rule)). % 17.35/2.54 cnf(i_0_63, plain, (element(esk14_0,e)), inference(extension_rule, [i_0_47])). % 17.35/2.54 cnf(i_0_340, plain, (element(esk10_1(esk14_0),b)), inference(extension_rule, [i_0_25])). % 17.35/2.54 cnf(i_0_358, plain, (subtract(b,esk10_1(esk14_0),esk10_1(esk14_0))=zero(b)), inference(etableau_closure_rule, [i_0_358, ...])). % 17.35/2.54 # End printing tableau % 17.35/2.54 # SZS output end % 17.35/2.54 # Branches closed with saturation will be marked with an "s" % 17.35/2.56 # Child (1274) has found a proof. % 17.35/2.56 % 17.35/2.56 # Proof search is over... % 17.35/2.56 # Freeing feature tree %------------------------------------------------------------------------------