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