0.00/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.10/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.10/0.31 % Computer : n032.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 1200 0.10/0.31 % WCLimit : 120 0.10/0.31 % DateTime : Tue Jul 13 15:44:33 EDT 2021 0.10/0.31 % CPUTime : 0.15/0.34 # No SInE strategy applied 0.15/0.34 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN 0.15/0.34 # and selection function SelectComplexExceptUniqMaxHorn. 0.15/0.34 # 0.15/0.34 # Presaturation interreduction done 0.15/0.34 # Number of axioms: 2 Number of unprocessed: 2 0.15/0.34 # Tableaux proof search. 0.15/0.34 # APR header successfully linked. 0.15/0.34 # Hello from C++ 1.03/1.22 # The folding up rule is enabled... 1.03/1.22 # Local unification is enabled... 1.03/1.22 # Any saturation attempts will use folding labels... 1.03/1.22 # 2 beginning clauses after preprocessing and clausification 1.03/1.22 # Creating start rules for all 1 conjectures. 1.03/1.22 # There are 1 start rule candidates: 1.03/1.22 # Found 2 unit axioms. 1.03/1.22 # 1 start rule tableaux created. 1.03/1.22 # 0 extension rule candidate clauses 1.03/1.22 # 2 unit axiom clauses 1.03/1.22 1.03/1.22 # Requested 8, 32 cores available to the main process. 1.03/1.22 # There are not enough tableaux to fork, creating more from the initial 1 1.03/1.22 # Creating equality axioms 1.03/1.22 # Ran out of tableaux, making start rules for all clauses 1.06/1.28 # There were 1 total branch saturation attempts. 1.06/1.28 # There were 0 of these attempts blocked. 1.06/1.28 # There were 0 deferred branch saturation attempts. 1.06/1.28 # There were 0 free duplicated saturations. 1.06/1.28 # There were 1 total successful branch saturations. 1.06/1.28 # There were 0 successful branch saturations in interreduction. 1.06/1.28 # There were 0 successful branch saturations on the branch. 1.06/1.28 # There were 1 successful branch saturations after the branch. 1.06/1.28 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p 1.06/1.28 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 1.06/1.28 # Begin clausification derivation 1.06/1.28 1.06/1.28 # End clausification derivation 1.06/1.28 # Begin listing active clauses obtained from FOF to CNF conversion 1.06/1.28 cnf(i_0_3, plain, (inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(X3)))),inverse(multiply(inverse(X1),X1))))))=X3)). 1.06/1.28 cnf(i_0_4, negated_conjecture, (multiply(multiply(inverse(b2),b2),a2)!=a2)). 1.06/1.28 cnf(i_0_6, plain, (X4=X4)). 1.06/1.28 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 1.06/1.28 # Begin printing tableau 1.06/1.28 # Found 5 steps 1.06/1.28 cnf(i_0_3, plain, (inverse(multiply(X9,inverse(multiply(inverse(multiply(inverse(multiply(X8,X9)),multiply(X8,inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(X3)))),inverse(multiply(inverse(X1),X1))))))))),inverse(multiply(inverse(X9),X9))))))=multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(X3)))),inverse(multiply(inverse(X1),X1)))))), inference(start_rule)). 1.06/1.28 cnf(i_0_12, plain, (inverse(multiply(X9,inverse(multiply(inverse(multiply(inverse(multiply(X8,X9)),multiply(X8,inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(X3)))),inverse(multiply(inverse(X1),X1))))))))),inverse(multiply(inverse(X9),X9))))))=multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(X3)))),inverse(multiply(inverse(X1),X1)))))), inference(extension_rule, [i_0_11])). 1.06/1.28 cnf(i_0_25, plain, (inverse(inverse(multiply(X9,inverse(multiply(inverse(multiply(inverse(multiply(X8,X9)),multiply(X8,inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(X3)))),inverse(multiply(inverse(X1),X1))))))))),inverse(multiply(inverse(X9),X9)))))))=inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(X3)))),inverse(multiply(inverse(X1),X1))))))), inference(extension_rule, [i_0_9])). 1.06/1.28 cnf(i_0_33, plain, (inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(X3)))),inverse(multiply(inverse(X1),X1))))))!=X3), inference(closure_rule, [i_0_3])). 1.06/1.28 cnf(i_0_31, plain, (inverse(inverse(multiply(X9,inverse(multiply(inverse(multiply(inverse(multiply(X8,X9)),multiply(X8,inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(X3)))),inverse(multiply(inverse(X1),X1))))))))),inverse(multiply(inverse(X9),X9)))))))=X3), inference(etableau_closure_rule, [i_0_31, ...])). 1.06/1.28 # End printing tableau 1.06/1.28 # SZS output end 1.06/1.28 # Branches closed with saturation will be marked with an "s" 1.06/1.28 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. 1.06/1.28 # We now have 7 tableaux to operate on 1.06/1.28 # Found closed tableau during pool population. 1.06/1.28 # Proof search is over... 1.06/1.28 # Freeing feature tree 1.06/1.29 EOF