0.09/0.14 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.09/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.15/0.36 % Computer : n014.cluster.edu 0.15/0.36 % Model : x86_64 x86_64 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.15/0.36 % Memory : 8042.1875MB 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.15/0.36 % CPULimit : 1200 0.15/0.36 % WCLimit : 120 0.15/0.36 % DateTime : Tue Jul 13 10:55:19 EDT 2021 0.15/0.36 % CPUTime : 0.15/0.39 # No SInE strategy applied 0.15/0.39 # Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y 0.15/0.39 # and selection function SelectMaxLComplexAvoidPosPred. 0.15/0.39 # 0.15/0.39 # Presaturation interreduction done 0.15/0.39 # Number of axioms: 21 Number of unprocessed: 17 0.15/0.39 # Tableaux proof search. 0.15/0.39 # APR header successfully linked. 0.15/0.39 # Hello from C++ 0.15/0.39 # The folding up rule is enabled... 0.15/0.39 # Local unification is enabled... 0.15/0.39 # Any saturation attempts will use folding labels... 0.15/0.39 # 17 beginning clauses after preprocessing and clausification 0.15/0.39 # Creating start rules for all 1 conjectures. 0.15/0.39 # There are 1 start rule candidates: 0.15/0.39 # Found 17 unit axioms. 0.15/0.39 # 1 start rule tableaux created. 0.15/0.39 # 0 extension rule candidate clauses 0.15/0.39 # 17 unit axiom clauses 0.15/0.39 0.15/0.39 # Requested 8, 32 cores available to the main process. 0.15/0.39 # There are not enough tableaux to fork, creating more from the initial 1 0.15/0.39 # Creating equality axioms 0.15/0.39 # Ran out of tableaux, making start rules for all clauses 0.15/0.39 # Returning from population with 23 new_tableaux and 0 remaining starting tableaux. 0.15/0.39 # We now have 23 tableaux to operate on 18.87/2.77 # There were 1 total branch saturation attempts. 18.87/2.77 # There were 0 of these attempts blocked. 18.87/2.77 # There were 0 deferred branch saturation attempts. 18.87/2.77 # There were 0 free duplicated saturations. 18.87/2.77 # There were 1 total successful branch saturations. 18.87/2.77 # There were 0 successful branch saturations in interreduction. 18.87/2.77 # There were 0 successful branch saturations on the branch. 18.87/2.77 # There were 1 successful branch saturations after the branch. 18.87/2.77 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p 18.87/2.77 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 18.87/2.77 # Begin clausification derivation 18.87/2.77 18.87/2.77 # End clausification derivation 18.87/2.77 # Begin listing active clauses obtained from FOF to CNF conversion 18.87/2.77 cnf(i_0_28, plain, (additive_inverse(additive_inverse(X1))=X1)). 18.87/2.77 cnf(i_0_31, plain, (multiply(X1,additive_identity)=additive_identity)). 18.87/2.77 cnf(i_0_34, plain, (multiply(additive_identity,X1)=additive_identity)). 18.87/2.77 cnf(i_0_24, plain, (add(X1,additive_identity)=X1)). 18.87/2.77 cnf(i_0_38, plain, (add(additive_identity,X1)=X1)). 18.87/2.77 cnf(i_0_37, plain, (add(X1,additive_inverse(X1))=additive_identity)). 18.87/2.77 cnf(i_0_41, plain, (multiply(additive_inverse(X1),X2)=multiply(X1,additive_inverse(X2)))). 18.87/2.77 cnf(i_0_43, plain, (additive_inverse(multiply(X1,X2))=multiply(X1,additive_inverse(X2)))). 18.87/2.77 cnf(i_0_26, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))). 18.87/2.77 cnf(i_0_33, plain, (multiply(multiply(X1,X2),X2)=multiply(X1,multiply(X2,X2)))). 18.87/2.77 cnf(i_0_25, plain, (multiply(multiply(X1,X1),X2)=multiply(X1,multiply(X1,X2)))). 18.87/2.77 cnf(i_0_35, plain, (add(multiply(X1,X2),multiply(X3,X2))=multiply(add(X1,X3),X2))). 18.87/2.77 cnf(i_0_36, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))). 18.87/2.77 cnf(i_0_42, plain, (add(multiply(X1,X2),multiply(X3,additive_inverse(X2)))=multiply(add(X1,additive_inverse(X3)),X2))). 18.87/2.77 cnf(i_0_40, plain, (multiply(X1,add(additive_inverse(X2),additive_inverse(X3)))=multiply(X1,additive_inverse(add(X2,X3))))). 18.87/2.77 cnf(i_0_30, plain, (add(X1,X2)=add(X2,X1))). 18.87/2.77 cnf(i_0_45, negated_conjecture, (add(multiply(multiply(x,y),x),multiply(x,multiply(y,additive_inverse(x))))!=additive_identity)). 18.87/2.77 cnf(i_0_48, plain, (X4=X4)). 18.87/2.77 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 18.87/2.77 # Begin printing tableau 18.87/2.77 # Found 6 steps 18.87/2.77 cnf(i_0_28, plain, (additive_inverse(additive_inverse(X3))=X3), inference(start_rule)). 18.87/2.77 cnf(i_0_55, plain, (additive_inverse(additive_inverse(X3))=X3), inference(extension_rule, [i_0_52])). 18.87/2.77 cnf(i_0_82, plain, (additive_inverse(additive_inverse(X5))!=X5), inference(closure_rule, [i_0_28])). 18.87/2.77 cnf(i_0_80, plain, (add(additive_inverse(additive_inverse(X3)),additive_inverse(additive_inverse(X5)))=add(X3,X5)), inference(extension_rule, [i_0_51])). 18.87/2.77 cnf(i_0_94, plain, (add(X3,X5)!=additive_inverse(additive_inverse(add(X3,X5)))), inference(closure_rule, [i_0_28])). 18.87/2.77 cnf(i_0_92, plain, (add(additive_inverse(additive_inverse(X3)),additive_inverse(additive_inverse(X5)))=additive_inverse(additive_inverse(add(X3,X5)))), inference(etableau_closure_rule, [i_0_92, ...])). 18.87/2.77 # End printing tableau 18.87/2.77 # SZS output end 18.87/2.77 # Branches closed with saturation will be marked with an "s" 18.87/2.78 # There were 1 total branch saturation attempts. 18.87/2.78 # There were 0 of these attempts blocked. 18.87/2.78 # There were 0 deferred branch saturation attempts. 18.87/2.78 # There were 0 free duplicated saturations. 18.87/2.78 # There were 1 total successful branch saturations. 18.87/2.78 # There were 0 successful branch saturations in interreduction. 18.87/2.78 # There were 0 successful branch saturations on the branch. 18.87/2.78 # There were 1 successful branch saturations after the branch. 18.87/2.78 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p 18.87/2.78 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 18.87/2.78 # Begin clausification derivation 18.87/2.78 18.87/2.78 # End clausification derivation 18.87/2.78 # Begin listing active clauses obtained from FOF to CNF conversion 18.87/2.78 cnf(i_0_28, plain, (additive_inverse(additive_inverse(X1))=X1)). 18.87/2.78 cnf(i_0_31, plain, (multiply(X1,additive_identity)=additive_identity)). 18.87/2.78 cnf(i_0_34, plain, (multiply(additive_identity,X1)=additive_identity)). 18.87/2.78 cnf(i_0_24, plain, (add(X1,additive_identity)=X1)). 18.87/2.78 cnf(i_0_38, plain, (add(additive_identity,X1)=X1)). 18.87/2.78 cnf(i_0_37, plain, (add(X1,additive_inverse(X1))=additive_identity)). 18.87/2.78 cnf(i_0_41, plain, (multiply(additive_inverse(X1),X2)=multiply(X1,additive_inverse(X2)))). 18.87/2.78 cnf(i_0_43, plain, (additive_inverse(multiply(X1,X2))=multiply(X1,additive_inverse(X2)))). 18.87/2.78 cnf(i_0_26, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))). 18.87/2.78 cnf(i_0_33, plain, (multiply(multiply(X1,X2),X2)=multiply(X1,multiply(X2,X2)))). 18.87/2.78 cnf(i_0_25, plain, (multiply(multiply(X1,X1),X2)=multiply(X1,multiply(X1,X2)))). 18.87/2.78 cnf(i_0_35, plain, (add(multiply(X1,X2),multiply(X3,X2))=multiply(add(X1,X3),X2))). 18.87/2.78 cnf(i_0_36, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))). 18.87/2.78 cnf(i_0_42, plain, (add(multiply(X1,X2),multiply(X3,additive_inverse(X2)))=multiply(add(X1,additive_inverse(X3)),X2))). 18.87/2.78 cnf(i_0_40, plain, (multiply(X1,add(additive_inverse(X2),additive_inverse(X3)))=multiply(X1,additive_inverse(add(X2,X3))))). 18.87/2.78 cnf(i_0_30, plain, (add(X1,X2)=add(X2,X1))). 18.87/2.78 cnf(i_0_45, negated_conjecture, (add(multiply(multiply(x,y),x),multiply(x,multiply(y,additive_inverse(x))))!=additive_identity)). 18.87/2.78 cnf(i_0_48, plain, (X4=X4)). 18.87/2.78 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 18.87/2.78 # Begin printing tableau 18.87/2.78 # Found 6 steps 18.87/2.78 cnf(i_0_34, plain, (multiply(additive_identity,additive_identity)=additive_identity), inference(start_rule)). 18.87/2.78 cnf(i_0_57, plain, (multiply(additive_identity,additive_identity)=additive_identity), inference(extension_rule, [i_0_51])). 18.87/2.78 cnf(i_0_94, plain, (additive_inverse(additive_inverse(additive_identity))!=additive_identity), inference(closure_rule, [i_0_28])). 18.87/2.78 cnf(i_0_92, plain, (multiply(additive_identity,additive_identity)=additive_inverse(additive_inverse(additive_identity))), inference(extension_rule, [i_0_52])). 18.87/2.78 cnf(i_0_101, plain, (additive_inverse(additive_inverse(X4))!=X4), inference(closure_rule, [i_0_28])). 18.87/2.78 cnf(i_0_99, plain, (add(multiply(additive_identity,additive_identity),additive_inverse(additive_inverse(X4)))=add(additive_inverse(additive_inverse(additive_identity)),X4)), inference(etableau_closure_rule, [i_0_99, ...])). 18.87/2.78 # End printing tableau 18.87/2.78 # SZS output end 18.87/2.78 # Branches closed with saturation will be marked with an "s" 18.87/2.78 # There were 1 total branch saturation attempts. 18.87/2.78 # There were 0 of these attempts blocked. 18.87/2.78 # There were 0 deferred branch saturation attempts. 18.87/2.78 # There were 0 free duplicated saturations. 18.87/2.78 # There were 1 total successful branch saturations. 18.87/2.78 # There were 0 successful branch saturations in interreduction. 18.87/2.78 # There were 0 successful branch saturations on the branch. 18.87/2.78 # There were 1 successful branch saturations after the branch. 18.87/2.78 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p 18.87/2.78 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 18.87/2.78 # Begin clausification derivation 18.87/2.78 18.87/2.78 # End clausification derivation 18.87/2.78 # Begin listing active clauses obtained from FOF to CNF conversion 18.87/2.78 cnf(i_0_28, plain, (additive_inverse(additive_inverse(X1))=X1)). 18.87/2.78 cnf(i_0_31, plain, (multiply(X1,additive_identity)=additive_identity)). 18.87/2.78 cnf(i_0_34, plain, (multiply(additive_identity,X1)=additive_identity)). 18.87/2.78 cnf(i_0_24, plain, (add(X1,additive_identity)=X1)). 18.87/2.78 cnf(i_0_38, plain, (add(additive_identity,X1)=X1)). 18.87/2.78 cnf(i_0_37, plain, (add(X1,additive_inverse(X1))=additive_identity)). 18.87/2.78 cnf(i_0_41, plain, (multiply(additive_inverse(X1),X2)=multiply(X1,additive_inverse(X2)))). 18.87/2.78 cnf(i_0_43, plain, (additive_inverse(multiply(X1,X2))=multiply(X1,additive_inverse(X2)))). 18.87/2.78 cnf(i_0_26, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))). 18.87/2.78 cnf(i_0_33, plain, (multiply(multiply(X1,X2),X2)=multiply(X1,multiply(X2,X2)))). 18.87/2.78 cnf(i_0_25, plain, (multiply(multiply(X1,X1),X2)=multiply(X1,multiply(X1,X2)))). 18.87/2.78 cnf(i_0_35, plain, (add(multiply(X1,X2),multiply(X3,X2))=multiply(add(X1,X3),X2))). 18.87/2.78 cnf(i_0_36, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))). 18.87/2.78 cnf(i_0_42, plain, (add(multiply(X1,X2),multiply(X3,additive_inverse(X2)))=multiply(add(X1,additive_inverse(X3)),X2))). 18.87/2.78 cnf(i_0_40, plain, (multiply(X1,add(additive_inverse(X2),additive_inverse(X3)))=multiply(X1,additive_inverse(add(X2,X3))))). 18.87/2.78 cnf(i_0_30, plain, (add(X1,X2)=add(X2,X1))). 18.87/2.78 cnf(i_0_45, negated_conjecture, (add(multiply(multiply(x,y),x),multiply(x,multiply(y,additive_inverse(x))))!=additive_identity)). 18.87/2.78 cnf(i_0_48, plain, (X4=X4)). 18.87/2.78 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 18.87/2.78 # Begin printing tableau 18.87/2.78 # Found 5 steps 18.87/2.78 cnf(i_0_28, plain, (additive_inverse(additive_inverse(additive_inverse(X7)))=additive_inverse(X7)), inference(start_rule)). 18.87/2.78 cnf(i_0_55, plain, (additive_inverse(additive_inverse(additive_inverse(X7)))=additive_inverse(X7)), inference(extension_rule, [i_0_54])). 18.87/2.78 cnf(i_0_86, plain, (additive_inverse(additive_inverse(additive_inverse(additive_inverse(X7))))=additive_inverse(additive_inverse(X7))), inference(extension_rule, [i_0_51])). 18.87/2.78 cnf(i_0_94, plain, (additive_inverse(additive_inverse(X7))!=X7), inference(closure_rule, [i_0_28])). 18.87/2.78 cnf(i_0_92, plain, (additive_inverse(additive_inverse(additive_inverse(additive_inverse(X7))))=X7), inference(etableau_closure_rule, [i_0_92, ...])). 18.87/2.78 # End printing tableau 18.87/2.78 # SZS output end 18.87/2.78 # Branches closed with saturation will be marked with an "s" 18.87/2.79 # Child (22674) has found a proof. 18.87/2.79 18.87/2.79 # Proof search is over... 18.87/2.79 # Freeing feature tree 18.87/2.81 EOF