0.10/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.10/0.10 % 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 : n010.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:31:06 EDT 2021 0.10/0.31 % CPUTime : 0.10/0.33 # No SInE strategy applied 0.10/0.33 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S04AN 0.10/0.33 # and selection function SelectComplexExceptUniqMaxHorn. 0.10/0.33 # 0.10/0.33 # Presaturation interreduction done 0.10/0.33 # Number of axioms: 2 Number of unprocessed: 2 0.10/0.33 # Tableaux proof search. 0.10/0.33 # APR header successfully linked. 0.10/0.33 # Hello from C++ 3.95/4.11 # The folding up rule is enabled... 3.95/4.11 # Local unification is enabled... 3.95/4.11 # Any saturation attempts will use folding labels... 3.95/4.11 # 2 beginning clauses after preprocessing and clausification 3.95/4.11 # Creating start rules for all 1 conjectures. 3.95/4.11 # There are 1 start rule candidates: 3.95/4.11 # Found 2 unit axioms. 3.95/4.11 # 1 start rule tableaux created. 3.95/4.11 # 0 extension rule candidate clauses 3.95/4.11 # 2 unit axiom clauses 3.95/4.11 3.95/4.11 # Requested 8, 32 cores available to the main process. 3.95/4.11 # There are not enough tableaux to fork, creating more from the initial 1 3.95/4.11 # Creating equality axioms 3.95/4.11 # Ran out of tableaux, making start rules for all clauses 4.25/4.43 # There were 1 total branch saturation attempts. 4.25/4.43 # There were 0 of these attempts blocked. 4.25/4.43 # There were 0 deferred branch saturation attempts. 4.25/4.43 # There were 0 free duplicated saturations. 4.25/4.43 # There were 1 total successful branch saturations. 4.25/4.43 # There were 0 successful branch saturations in interreduction. 4.25/4.43 # There were 0 successful branch saturations on the branch. 4.25/4.43 # There were 1 successful branch saturations after the branch. 4.25/4.43 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p 4.25/4.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 4.25/4.43 # Begin clausification derivation 4.25/4.43 4.25/4.43 # End clausification derivation 4.25/4.43 # Begin listing active clauses obtained from FOF to CNF conversion 4.25/4.43 cnf(i_0_5, plain, (double_divide(double_divide(X1,inverse(double_divide(X2,X3))),double_divide(inverse(X2),inverse(double_divide(X4,double_divide(X1,X4)))))=X3)). 4.25/4.43 cnf(i_0_4, negated_conjecture, (inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2)))))!=a2)). 4.25/4.43 cnf(i_0_8, plain, (X5=X5)). 4.25/4.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 4.25/4.43 # Begin printing tableau 4.25/4.43 # Found 6 steps 4.25/4.43 cnf(i_0_5, plain, (double_divide(double_divide(X11,inverse(double_divide(X12,double_divide(inverse(X2),inverse(double_divide(X4,double_divide(X1,X4))))))),double_divide(inverse(X12),inverse(double_divide(X13,double_divide(X11,X13)))))=double_divide(inverse(X2),inverse(double_divide(X4,double_divide(X1,X4))))), inference(start_rule)). 4.25/4.43 cnf(i_0_14, plain, (double_divide(double_divide(X11,inverse(double_divide(X12,double_divide(inverse(X2),inverse(double_divide(X4,double_divide(X1,X4))))))),double_divide(inverse(X12),inverse(double_divide(X13,double_divide(X11,X13)))))=double_divide(inverse(X2),inverse(double_divide(X4,double_divide(X1,X4))))), inference(extension_rule, [i_0_13])). 4.25/4.43 cnf(i_0_27, plain, (double_divide(double_divide(X21,inverse(double_divide(X18,double_divide(X1,inverse(double_divide(X2,X10)))))),double_divide(inverse(X18),inverse(double_divide(X16,double_divide(X21,X16)))))!=double_divide(X1,inverse(double_divide(X2,X10)))), inference(closure_rule, [i_0_5])). 4.25/4.43 cnf(i_0_26, plain, (double_divide(double_divide(double_divide(X21,inverse(double_divide(X18,double_divide(X1,inverse(double_divide(X2,X10)))))),double_divide(inverse(X18),inverse(double_divide(X16,double_divide(X21,X16))))),double_divide(double_divide(X11,inverse(double_divide(X12,double_divide(inverse(X2),inverse(double_divide(X4,double_divide(X1,X4))))))),double_divide(inverse(X12),inverse(double_divide(X13,double_divide(X11,X13))))))=double_divide(double_divide(X1,inverse(double_divide(X2,X10))),double_divide(inverse(X2),inverse(double_divide(X4,double_divide(X1,X4)))))), inference(extension_rule, [i_0_11])). 4.25/4.43 cnf(i_0_35, plain, (double_divide(double_divide(X1,inverse(double_divide(X2,X10))),double_divide(inverse(X2),inverse(double_divide(X4,double_divide(X1,X4)))))!=X10), inference(closure_rule, [i_0_5])). 4.25/4.43 cnf(i_0_33, plain, (double_divide(double_divide(double_divide(X21,inverse(double_divide(X18,double_divide(X1,inverse(double_divide(X2,X10)))))),double_divide(inverse(X18),inverse(double_divide(X16,double_divide(X21,X16))))),double_divide(double_divide(X11,inverse(double_divide(X12,double_divide(inverse(X2),inverse(double_divide(X4,double_divide(X1,X4))))))),double_divide(inverse(X12),inverse(double_divide(X13,double_divide(X11,X13))))))=X10), inference(etableau_closure_rule, [i_0_33, ...])). 4.25/4.43 # End printing tableau 4.25/4.43 # SZS output end 4.25/4.43 # Branches closed with saturation will be marked with an "s" 4.25/4.43 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. 4.25/4.43 # We now have 7 tableaux to operate on 4.25/4.43 # Found closed tableau during pool population. 4.25/4.43 # Proof search is over... 4.25/4.43 # Freeing feature tree 4.25/4.45 EOF