%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COL043-3 : TPTP v8.1.0. Bugfixed v2.3.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 : Fri Jul 15 00:24:40 EDT 2022 % Result : Unsatisfiable 45.64s 6.18s % Output : CNFRefutation 45.64s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : COL043-3 : TPTP v8.1.0. Bugfixed v2.3.0. % 0.11/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 : n024.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 May 31 10:45:36 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_____Z1014__C12_02_nc_F1_AE_CS_SP_S2S % 0.13/0.36 # and selection function SelectNewComplexAHP. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 4 Number of unprocessed: 4 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.36 # The folding up rule is enabled... % 0.13/0.36 # Local unification is enabled... % 0.13/0.36 # Any saturation attempts will use folding labels... % 0.13/0.36 # 4 beginning clauses after preprocessing and clausification % 0.13/0.36 # Creating start rules for all 1 conjectures. % 0.13/0.36 # There are 1 start rule candidates: % 0.13/0.36 # Found 4 unit axioms. % 0.13/0.36 # 1 start rule tableaux created. % 0.13/0.36 # 0 extension rule candidate clauses % 0.13/0.36 # 4 unit axiom clauses % 0.13/0.36 % 0.13/0.36 # Requested 8, 32 cores available to the main process. % 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.36 # Creating equality axioms % 0.13/0.36 # Ran out of tableaux, making start rules for all clauses % 0.13/0.36 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.13/0.36 # We now have 8 tableaux to operate on % 45.64/6.18 # There were 1 total branch saturation attempts. % 45.64/6.18 # There were 0 of these attempts blocked. % 45.64/6.18 # There were 0 deferred branch saturation attempts. % 45.64/6.18 # There were 0 free duplicated saturations. % 45.64/6.18 # There were 1 total successful branch saturations. % 45.64/6.18 # There were 0 successful branch saturations in interreduction. % 45.64/6.18 # There were 0 successful branch saturations on the branch. % 45.64/6.18 # There were 1 successful branch saturations after the branch. % 45.64/6.18 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 45.64/6.18 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 45.64/6.18 # Begin clausification derivation % 45.64/6.18 % 45.64/6.18 # End clausification derivation % 45.64/6.18 # Begin listing active clauses obtained from FOF to CNF conversion % 45.64/6.18 cnf(i_0_5, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3)))). % 45.64/6.18 cnf(i_0_7, plain, (apply(apply(b,apply(apply(b,apply(apply(h,apply(apply(b,apply(apply(b,h),apply(b,b))),apply(h,apply(apply(b,h),apply(b,b))))),h)),b)),b)=strong_fixed_point)). % 45.64/6.18 cnf(i_0_6, plain, (apply(apply(apply(h,X1),X2),X3)=apply(apply(apply(X1,X2),X3),X2))). % 45.64/6.18 cnf(i_0_8, negated_conjecture, (apply(fixed_pt,apply(strong_fixed_point,fixed_pt))!=apply(strong_fixed_point,fixed_pt))). % 45.64/6.18 cnf(i_0_10, plain, (X4=X4)). % 45.64/6.18 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 45.64/6.18 # Begin printing tableau % 45.64/6.18 # Found 8 steps % 45.64/6.18 cnf(i_0_6, plain, (apply(apply(apply(h,b),X9),X8)=apply(apply(apply(b,X9),X8),X9)), inference(start_rule)). % 45.64/6.18 cnf(i_0_17, plain, (apply(apply(apply(h,b),X9),X8)=apply(apply(apply(b,X9),X8),X9)), inference(extension_rule, [i_0_11])). % 45.64/6.18 cnf(i_0_30, plain, (apply(apply(apply(b,X9),X8),X9)=apply(apply(apply(h,b),X9),X8)), inference(extension_rule, [i_0_13])). % 45.64/6.18 cnf(i_0_69, plain, (apply(X9,apply(X8,X9))=apply(apply(apply(h,b),X9),X8)), inference(extension_rule, [i_0_14])). % 45.64/6.18 cnf(i_0_74, plain, (apply(apply(apply(b,X9),apply(X9,apply(X8,X9))),X9)!=apply(X9,apply(apply(X9,apply(X8,X9)),X9))), inference(closure_rule, [i_0_5])). % 45.64/6.18 cnf(i_0_70, plain, (apply(X9,apply(X8,X9))!=apply(apply(apply(b,X9),X8),X9)), inference(extension_rule, [i_0_11])). % 45.64/6.18 cnf(i_0_76, plain, (apply(apply(apply(b,X9),X8),X9)!=apply(X9,apply(X8,X9))), inference(closure_rule, [i_0_5])). % 45.64/6.18 cnf(i_0_72, plain, (apply(apply(X9,apply(X8,X9)),apply(apply(apply(b,X9),apply(X9,apply(X8,X9))),X9))=apply(apply(apply(apply(h,b),X9),X8),apply(X9,apply(apply(X9,apply(X8,X9)),X9)))), inference(etableau_closure_rule, [i_0_72, ...])). % 45.64/6.18 # End printing tableau % 45.64/6.18 # SZS output end % 45.64/6.18 # Branches closed with saturation will be marked with an "s" % 46.44/6.20 # There were 1 total branch saturation attempts. % 46.44/6.20 # There were 0 of these attempts blocked. % 46.44/6.20 # There were 0 deferred branch saturation attempts. % 46.44/6.20 # There were 0 free duplicated saturations. % 46.44/6.20 # There were 1 total successful branch saturations. % 46.44/6.20 # There were 0 successful branch saturations in interreduction. % 46.44/6.20 # There were 0 successful branch saturations on the branch. % 46.44/6.20 # There were 1 successful branch saturations after the branch. % 46.44/6.20 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 46.44/6.20 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 46.44/6.20 # Begin clausification derivation % 46.44/6.20 % 46.44/6.20 # End clausification derivation % 46.44/6.20 # Begin listing active clauses obtained from FOF to CNF conversion % 46.44/6.20 cnf(i_0_5, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3)))). % 46.44/6.20 cnf(i_0_7, plain, (apply(apply(b,apply(apply(b,apply(apply(h,apply(apply(b,apply(apply(b,h),apply(b,b))),apply(h,apply(apply(b,h),apply(b,b))))),h)),b)),b)=strong_fixed_point)). % 46.44/6.20 cnf(i_0_6, plain, (apply(apply(apply(h,X1),X2),X3)=apply(apply(apply(X1,X2),X3),X2))). % 46.44/6.20 cnf(i_0_8, negated_conjecture, (apply(fixed_pt,apply(strong_fixed_point,fixed_pt))!=apply(strong_fixed_point,fixed_pt))). % 46.44/6.20 cnf(i_0_10, plain, (X4=X4)). % 46.44/6.20 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 46.44/6.20 # Begin printing tableau % 46.44/6.20 # Found 6 steps % 46.44/6.20 cnf(i_0_7, plain, (apply(apply(b,apply(apply(b,apply(apply(h,apply(apply(b,apply(apply(b,h),apply(b,b))),apply(h,apply(apply(b,h),apply(b,b))))),h)),b)),b)=strong_fixed_point), inference(start_rule)). % 46.44/6.20 cnf(i_0_16, plain, (apply(apply(b,apply(apply(b,apply(apply(h,apply(apply(b,apply(apply(b,h),apply(b,b))),apply(h,apply(apply(b,h),apply(b,b))))),h)),b)),b)=strong_fixed_point), inference(extension_rule, [i_0_13])). % 46.44/6.20 cnf(i_0_36, plain, (apply(apply(b,apply(apply(b,apply(apply(h,apply(apply(b,apply(apply(b,h),apply(b,b))),apply(h,apply(apply(b,h),apply(b,b))))),h)),b)),b)!=strong_fixed_point), inference(closure_rule, [i_0_7])). % 46.44/6.20 cnf(i_0_34, plain, (apply(apply(b,apply(apply(b,apply(apply(h,apply(apply(b,apply(apply(b,h),apply(b,b))),apply(h,apply(apply(b,h),apply(b,b))))),h)),b)),b)=apply(apply(b,apply(apply(b,apply(apply(h,apply(apply(b,apply(apply(b,h),apply(b,b))),apply(h,apply(apply(b,h),apply(b,b))))),h)),b)),b)), inference(extension_rule, [i_0_14])). % 46.44/6.20 cnf(i_0_43, plain, (apply(apply(b,apply(apply(b,apply(apply(h,apply(apply(b,apply(apply(b,h),apply(b,b))),apply(h,apply(apply(b,h),apply(b,b))))),h)),b)),b)!=strong_fixed_point), inference(closure_rule, [i_0_7])). % 46.44/6.20 cnf(i_0_41, plain, (apply(apply(apply(b,apply(apply(b,apply(apply(h,apply(apply(b,apply(apply(b,h),apply(b,b))),apply(h,apply(apply(b,h),apply(b,b))))),h)),b)),b),apply(apply(b,apply(apply(b,apply(apply(h,apply(apply(b,apply(apply(b,h),apply(b,b))),apply(h,apply(apply(b,h),apply(b,b))))),h)),b)),b))=apply(apply(apply(b,apply(apply(b,apply(apply(h,apply(apply(b,apply(apply(b,h),apply(b,b))),apply(h,apply(apply(b,h),apply(b,b))))),h)),b)),b),strong_fixed_point)), inference(etableau_closure_rule, [i_0_41, ...])). % 46.44/6.20 # End printing tableau % 46.44/6.20 # SZS output end % 46.44/6.20 # Branches closed with saturation will be marked with an "s" % 46.44/6.20 # Child (9821) has found a proof. % 46.44/6.20 % 46.44/6.20 # Proof search is over... % 46.44/6.20 # Freeing feature tree %------------------------------------------------------------------------------