0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.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 : n026.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 : 1200 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Jul 13 13:51:14 EDT 2021 0.13/0.34 % CPUTime : 0.19/0.36 # No SInE strategy applied 0.19/0.36 # Auto-Mode selected heuristic G_____Z1014__C12_02_nc_F1_AE_CS_SP_S2S 0.19/0.36 # and selection function SelectNewComplexAHP. 0.19/0.36 # 0.19/0.36 # Presaturation interreduction done 0.19/0.36 # Number of axioms: 4 Number of unprocessed: 4 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.36 # The folding up rule is enabled... 0.19/0.36 # Local unification is enabled... 0.19/0.36 # Any saturation attempts will use folding labels... 0.19/0.36 # 4 beginning clauses after preprocessing and clausification 0.19/0.36 # Creating start rules for all 1 conjectures. 0.19/0.36 # There are 1 start rule candidates: 0.19/0.36 # Found 4 unit axioms. 0.19/0.36 # 1 start rule tableaux created. 0.19/0.36 # 0 extension rule candidate clauses 0.19/0.36 # 4 unit axiom clauses 0.19/0.36 0.19/0.36 # Requested 8, 32 cores available to the main process. 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 1 0.19/0.36 # Creating equality axioms 0.19/0.36 # Ran out of tableaux, making start rules for all clauses 0.19/0.36 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. 0.19/0.36 # We now have 8 tableaux to operate on 7.63/1.32 # There were 1 total branch saturation attempts. 7.63/1.32 # There were 0 of these attempts blocked. 7.63/1.32 # There were 0 deferred branch saturation attempts. 7.63/1.32 # There were 0 free duplicated saturations. 7.63/1.32 # There were 1 total successful branch saturations. 7.63/1.32 # There were 0 successful branch saturations in interreduction. 7.63/1.32 # There were 0 successful branch saturations on the branch. 7.63/1.32 # There were 1 successful branch saturations after the branch. 7.63/1.32 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p 7.63/1.32 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 7.63/1.32 # Begin clausification derivation 7.63/1.32 7.63/1.32 # End clausification derivation 7.63/1.32 # Begin listing active clauses obtained from FOF to CNF conversion 7.63/1.32 cnf(i_0_8, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3)))). 7.63/1.32 cnf(i_0_7, plain, (apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n)),b)),b)=strong_fixed_point)). 7.63/1.32 cnf(i_0_5, plain, (apply(apply(apply(X1,X2),X3),X2)=apply(apply(apply(n,X1),X3),X2))). 7.63/1.32 cnf(i_0_6, negated_conjecture, (apply(fixed_pt,apply(strong_fixed_point,fixed_pt))!=apply(strong_fixed_point,fixed_pt))). 7.63/1.32 cnf(i_0_10, plain, (X4=X4)). 7.63/1.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 7.63/1.32 # Begin printing tableau 7.63/1.32 # Found 6 steps 7.63/1.32 cnf(i_0_8, plain, (apply(apply(apply(b,apply(apply(b,X1),X2)),X11),X10)=apply(apply(apply(b,X1),X2),apply(X11,X10))), inference(start_rule)). 7.63/1.32 cnf(i_0_15, plain, (apply(apply(apply(b,apply(apply(b,X1),X2)),X11),X10)=apply(apply(apply(b,X1),X2),apply(X11,X10))), inference(extension_rule, [i_0_13])). 7.63/1.32 cnf(i_0_26, plain, (apply(apply(apply(b,X1),X2),apply(X11,X10))!=apply(X1,apply(X2,apply(X11,X10)))), inference(closure_rule, [i_0_8])). 7.63/1.32 cnf(i_0_24, plain, (apply(apply(apply(b,apply(apply(b,X1),X2)),X11),X10)=apply(X1,apply(X2,apply(X11,X10)))), inference(extension_rule, [i_0_14])). 7.63/1.32 cnf(i_0_109, plain, (apply(apply(apply(b,X1),X2),X3)!=apply(X1,apply(X2,X3))), inference(closure_rule, [i_0_8])). 7.63/1.32 cnf(i_0_107, plain, (apply(apply(apply(apply(b,apply(apply(b,X1),X2)),X11),X10),apply(apply(apply(b,X1),X2),X3))=apply(apply(X1,apply(X2,apply(X11,X10))),apply(X1,apply(X2,X3)))), inference(etableau_closure_rule, [i_0_107, ...])). 7.63/1.32 # End printing tableau 7.63/1.32 # SZS output end 7.63/1.32 # Branches closed with saturation will be marked with an "s" 7.63/1.32 # There were 1 total branch saturation attempts. 7.63/1.32 # There were 0 of these attempts blocked. 7.63/1.32 # There were 0 deferred branch saturation attempts. 7.63/1.32 # There were 0 free duplicated saturations. 7.63/1.32 # There were 1 total successful branch saturations. 7.63/1.32 # There were 0 successful branch saturations in interreduction. 7.63/1.32 # There were 0 successful branch saturations on the branch. 7.63/1.32 # There were 1 successful branch saturations after the branch. 7.63/1.32 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p 7.63/1.32 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 7.63/1.32 # Begin clausification derivation 7.63/1.32 7.63/1.32 # End clausification derivation 7.63/1.32 # Begin listing active clauses obtained from FOF to CNF conversion 7.63/1.32 cnf(i_0_8, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3)))). 7.63/1.32 cnf(i_0_7, plain, (apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n)),b)),b)=strong_fixed_point)). 7.63/1.32 cnf(i_0_5, plain, (apply(apply(apply(X1,X2),X3),X2)=apply(apply(apply(n,X1),X3),X2))). 7.63/1.32 cnf(i_0_6, negated_conjecture, (apply(fixed_pt,apply(strong_fixed_point,fixed_pt))!=apply(strong_fixed_point,fixed_pt))). 7.63/1.32 cnf(i_0_10, plain, (X4=X4)). 7.63/1.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 7.63/1.32 # Begin printing tableau 7.63/1.32 # Found 6 steps 7.63/1.32 cnf(i_0_7, plain, (apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n)),b)),b)=strong_fixed_point), inference(start_rule)). 7.63/1.32 cnf(i_0_16, plain, (apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n)),b)),b)=strong_fixed_point), inference(extension_rule, [i_0_13])). 7.63/1.32 cnf(i_0_36, plain, (apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n)),b)),b)!=strong_fixed_point), inference(closure_rule, [i_0_7])). 7.63/1.32 cnf(i_0_34, plain, (apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n)),b)),b)=apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n)),b)),b)), inference(extension_rule, [i_0_14])). 7.63/1.32 cnf(i_0_43, plain, (apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n)),b)),b)!=strong_fixed_point), inference(closure_rule, [i_0_7])). 7.63/1.32 cnf(i_0_41, plain, (apply(apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n)),b)),b),apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n)),b)),b))=apply(apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n)),b)),b),strong_fixed_point)), inference(etableau_closure_rule, [i_0_41, ...])). 7.63/1.32 # End printing tableau 7.63/1.32 # SZS output end 7.63/1.32 # Branches closed with saturation will be marked with an "s" 7.63/1.32 # There were 1 total branch saturation attempts. 7.63/1.32 # There were 0 of these attempts blocked. 7.63/1.32 # There were 0 deferred branch saturation attempts. 7.63/1.32 # There were 0 free duplicated saturations. 7.63/1.32 # There were 1 total successful branch saturations. 7.63/1.32 # There were 0 successful branch saturations in interreduction. 7.63/1.32 # There were 0 successful branch saturations on the branch. 7.63/1.32 # There were 1 successful branch saturations after the branch. 7.63/1.32 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p 7.63/1.32 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 7.63/1.32 # Begin clausification derivation 7.63/1.32 7.63/1.32 # End clausification derivation 7.63/1.32 # Begin listing active clauses obtained from FOF to CNF conversion 7.63/1.32 cnf(i_0_8, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3)))). 7.63/1.32 cnf(i_0_7, plain, (apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n)),b)),b)=strong_fixed_point)). 7.63/1.32 cnf(i_0_5, plain, (apply(apply(apply(X1,X2),X3),X2)=apply(apply(apply(n,X1),X3),X2))). 7.63/1.32 cnf(i_0_6, negated_conjecture, (apply(fixed_pt,apply(strong_fixed_point,fixed_pt))!=apply(strong_fixed_point,fixed_pt))). 7.63/1.32 cnf(i_0_10, plain, (X4=X4)). 7.63/1.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 7.63/1.32 # Begin printing tableau 7.63/1.32 # Found 6 steps 7.63/1.32 cnf(i_0_10, plain, (X2=X2), inference(start_rule)). 7.63/1.32 cnf(i_0_19, plain, (X2=X2), inference(extension_rule, [i_0_14])). 7.63/1.32 cnf(i_0_39, plain, (apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n)),b)),b)!=strong_fixed_point), inference(closure_rule, [i_0_7])). 7.63/1.32 cnf(i_0_37, plain, (apply(X2,apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n)),b)),b))=apply(X2,strong_fixed_point)), inference(extension_rule, [i_0_14])). 7.63/1.32 cnf(i_0_119, plain, (apply(apply(apply(b,X1),X2),X3)!=apply(X1,apply(X2,X3))), inference(closure_rule, [i_0_8])). 7.63/1.32 cnf(i_0_117, plain, (apply(apply(X2,apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n)),b)),b)),apply(apply(apply(b,X1),X2),X3))=apply(apply(X2,strong_fixed_point),apply(X1,apply(X2,X3)))), inference(etableau_closure_rule, [i_0_117, ...])). 7.63/1.32 # End printing tableau 7.63/1.32 # SZS output end 7.63/1.32 # Branches closed with saturation will be marked with an "s" 7.63/1.33 # Child (10899) has found a proof. 7.63/1.33 7.63/1.33 # Proof search is over... 7.63/1.33 # Freeing feature tree 7.63/1.34 EOF