0.11/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/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 : n010.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 12:07:21 EDT 2021 0.13/0.34 % CPUTime : 0.20/0.37 # No SInE strategy applied 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn. 0.20/0.37 # 0.20/0.37 # Presaturation interreduction done 0.20/0.37 # Number of axioms: 2 Number of unprocessed: 2 0.20/0.37 # Tableaux proof search. 0.20/0.37 # APR header successfully linked. 0.20/0.37 # Hello from C++ 0.92/1.14 # The folding up rule is enabled... 0.92/1.14 # Local unification is enabled... 0.92/1.14 # Any saturation attempts will use folding labels... 0.92/1.14 # 2 beginning clauses after preprocessing and clausification 0.92/1.14 # Creating start rules for all 1 conjectures. 0.92/1.14 # There are 1 start rule candidates: 0.92/1.14 # Found 2 unit axioms. 0.92/1.14 # 1 start rule tableaux created. 0.92/1.14 # 0 extension rule candidate clauses 0.92/1.14 # 2 unit axiom clauses 0.92/1.14 0.92/1.14 # Requested 8, 32 cores available to the main process. 0.92/1.14 # There are not enough tableaux to fork, creating more from the initial 1 0.92/1.14 # Creating equality axioms 0.92/1.14 # Ran out of tableaux, making start rules for all clauses 1.02/1.19 # There were 1 total branch saturation attempts. 1.02/1.19 # There were 0 of these attempts blocked. 1.02/1.19 # There were 0 deferred branch saturation attempts. 1.02/1.19 # There were 0 free duplicated saturations. 1.02/1.19 # There were 1 total successful branch saturations. 1.02/1.19 # There were 0 successful branch saturations in interreduction. 1.02/1.19 # There were 0 successful branch saturations on the branch. 1.02/1.19 # There were 1 successful branch saturations after the branch. 1.02/1.19 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p 1.02/1.19 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 1.02/1.19 # Begin clausification derivation 1.02/1.19 1.02/1.19 # End clausification derivation 1.02/1.19 # Begin listing active clauses obtained from FOF to CNF conversion 1.02/1.19 cnf(i_0_4, plain, (inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),multiply(inverse(X3),inverse(multiply(inverse(X3),X3))))))),multiply(X1,X3)))=X2)). 1.02/1.19 cnf(i_0_3, negated_conjecture, (multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)))). 1.02/1.19 cnf(i_0_6, plain, (X4=X4)). 1.02/1.19 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 1.02/1.19 # Begin printing tableau 1.02/1.19 # Found 5 steps 1.02/1.19 cnf(i_0_4, plain, (inverse(multiply(inverse(multiply(X7,inverse(multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X3),multiply(inverse(X3),inverse(multiply(inverse(X3),X3))))))),multiply(X1,X3))),multiply(inverse(X9),inverse(multiply(inverse(X9),X9))))))),multiply(X7,X9)))=multiply(inverse(multiply(X1,inverse(multiply(inverse(X3),multiply(inverse(X3),inverse(multiply(inverse(X3),X3))))))),multiply(X1,X3))), inference(start_rule)). 1.02/1.19 cnf(i_0_12, plain, (inverse(multiply(inverse(multiply(X7,inverse(multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X3),multiply(inverse(X3),inverse(multiply(inverse(X3),X3))))))),multiply(X1,X3))),multiply(inverse(X9),inverse(multiply(inverse(X9),X9))))))),multiply(X7,X9)))=multiply(inverse(multiply(X1,inverse(multiply(inverse(X3),multiply(inverse(X3),inverse(multiply(inverse(X3),X3))))))),multiply(X1,X3))), inference(extension_rule, [i_0_11])). 1.02/1.19 cnf(i_0_25, plain, (inverse(inverse(multiply(inverse(multiply(X7,inverse(multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X3),multiply(inverse(X3),inverse(multiply(inverse(X3),X3))))))),multiply(X1,X3))),multiply(inverse(X9),inverse(multiply(inverse(X9),X9))))))),multiply(X7,X9))))=inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X3),multiply(inverse(X3),inverse(multiply(inverse(X3),X3))))))),multiply(X1,X3)))), inference(extension_rule, [i_0_9])). 1.02/1.19 cnf(i_0_33, plain, (inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X3),multiply(inverse(X3),inverse(multiply(inverse(X3),X3))))))),multiply(X1,X3)))!=X3), inference(closure_rule, [i_0_4])). 1.02/1.19 cnf(i_0_31, plain, (inverse(inverse(multiply(inverse(multiply(X7,inverse(multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X3),multiply(inverse(X3),inverse(multiply(inverse(X3),X3))))))),multiply(X1,X3))),multiply(inverse(X9),inverse(multiply(inverse(X9),X9))))))),multiply(X7,X9))))=X3), inference(etableau_closure_rule, [i_0_31, ...])). 1.02/1.19 # End printing tableau 1.02/1.19 # SZS output end 1.02/1.19 # Branches closed with saturation will be marked with an "s" 1.02/1.19 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. 1.02/1.19 # We now have 7 tableaux to operate on 1.02/1.19 # Found closed tableau during pool population. 1.02/1.19 # Proof search is over... 1.02/1.19 # Freeing feature tree 1.02/1.19 EOF