0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.12/0.33 % Computer : n021.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1200 0.12/0.33 % WCLimit : 120 0.12/0.33 % DateTime : Tue Jul 13 15:53:11 EDT 2021 0.12/0.33 % CPUTime : 0.19/0.39 # No SInE strategy applied 0.19/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d 0.19/0.39 # and selection function SelectCQIPrecWNTNp. 0.19/0.39 # 0.19/0.39 # Presaturation interreduction done 0.19/0.39 # Number of axioms: 75 Number of unprocessed: 75 0.19/0.39 # Tableaux proof search. 0.19/0.39 # APR header successfully linked. 0.19/0.39 # Hello from C++ 0.19/0.39 # The folding up rule is enabled... 0.19/0.39 # Local unification is enabled... 0.19/0.39 # Any saturation attempts will use folding labels... 0.19/0.39 # 75 beginning clauses after preprocessing and clausification 0.19/0.39 # Creating start rules for all 6 conjectures. 0.19/0.39 # There are 6 start rule candidates: 0.19/0.39 # Found 19 unit axioms. 0.19/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. 0.19/0.39 # 6 start rule tableaux created. 0.19/0.39 # 56 extension rule candidate clauses 0.19/0.39 # 19 unit axiom clauses 0.19/0.39 0.19/0.39 # Requested 8, 32 cores available to the main process. 0.19/0.39 # There are not enough tableaux to fork, creating more from the initial 6 0.19/0.39 # Returning from population with 20 new_tableaux and 0 remaining starting tableaux. 0.19/0.39 # We now have 20 tableaux to operate on 2.74/0.74 # There were 2 total branch saturation attempts. 2.74/0.74 # There were 0 of these attempts blocked. 2.74/0.74 # There were 0 deferred branch saturation attempts. 2.74/0.74 # There were 0 free duplicated saturations. 2.74/0.74 # There were 2 total successful branch saturations. 2.74/0.74 # There were 0 successful branch saturations in interreduction. 2.74/0.74 # There were 0 successful branch saturations on the branch. 2.74/0.74 # There were 2 successful branch saturations after the branch. 2.74/0.74 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 2.74/0.74 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 2.74/0.74 # Begin clausification derivation 2.74/0.74 2.74/0.74 # End clausification derivation 2.74/0.74 # Begin listing active clauses obtained from FOF to CNF conversion 2.74/0.74 cnf(i_0_63, plain, (p(c_2Ebool_2ET))). 2.74/0.74 cnf(i_0_134, negated_conjecture, (mem(esk5_0,ty_2Einteger_2Eint))). 2.74/0.74 cnf(i_0_133, negated_conjecture, (mem(esk6_0,ty_2Einteger_2Eint))). 2.74/0.74 cnf(i_0_132, negated_conjecture, (mem(esk7_0,ty_2Einteger_2Eint))). 2.74/0.74 cnf(i_0_131, negated_conjecture, (p(ap(ap(c_2Einteger_2Eint__divides,esk5_0),esk6_0)))). 2.74/0.74 cnf(i_0_5, plain, (ne(bool))). 2.74/0.74 cnf(i_0_560, plain, (ne(ty_2Einteger_2Eint))). 2.74/0.74 cnf(i_0_8, plain, (ne(ind))). 2.74/0.74 cnf(i_0_570, plain, (mem(c_2Ebool_2ET,bool))). 2.74/0.74 cnf(i_0_137, plain, (mem(c_2Ebool_2EF,bool))). 2.74/0.74 cnf(i_0_574, plain, (mem(c_2Einteger_2Eint__neg,arr(ty_2Einteger_2Eint,ty_2Einteger_2Eint)))). 2.74/0.74 cnf(i_0_593, plain, (mem(c_2Einteger_2Eint__sub,arr(ty_2Einteger_2Eint,arr(ty_2Einteger_2Eint,ty_2Einteger_2Eint))))). 2.74/0.74 cnf(i_0_186, plain, (mem(c_2Ebool_2E_7E,arr(bool,bool)))). 2.74/0.74 cnf(i_0_529, plain, (mem(c_2Einteger_2Eint__divides,arr(ty_2Einteger_2Eint,arr(ty_2Einteger_2Eint,bool))))). 2.74/0.74 cnf(i_0_185, plain, (mem(c_2Einteger_2Eint__add,arr(ty_2Einteger_2Eint,arr(ty_2Einteger_2Eint,ty_2Einteger_2Eint))))). 2.74/0.74 cnf(i_0_64, plain, (mem(c_2Ebool_2E_5C_2F,arr(bool,arr(bool,bool))))). 2.74/0.74 cnf(i_0_118, plain, (mem(c_2Emin_2E_3D_3D_3E,arr(bool,arr(bool,bool))))). 2.74/0.74 cnf(i_0_549, plain, (mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))))). 2.74/0.74 cnf(i_0_530, plain, (~p(c_2Ebool_2EF))). 2.74/0.74 cnf(i_0_576, plain, (epred1_1(X1)|~mem(X1,bool))). 2.74/0.74 cnf(i_0_130, negated_conjecture, (~p(ap(ap(c_2Einteger_2Eint__divides,esk5_0),ap(ap(c_2Einteger_2Eint__sub,esk7_0),esk6_0)))|~p(ap(ap(c_2Einteger_2Eint__divides,esk5_0),esk7_0)))). 2.74/0.74 cnf(i_0_129, negated_conjecture, (p(ap(ap(c_2Einteger_2Eint__divides,esk5_0),ap(ap(c_2Einteger_2Eint__sub,esk7_0),esk6_0)))|p(ap(ap(c_2Einteger_2Eint__divides,esk5_0),esk7_0)))). 2.74/0.74 cnf(i_0_551, plain, (~mem(X1,bool)|~p(ap(c_2Ebool_2E_7E,X1))|~p(X1))). 2.74/0.74 cnf(i_0_6, plain, (ne(arr(X1,X2))|~ne(X2)|~ne(X1))). 2.74/0.74 cnf(i_0_7, plain, (ap(i(X1),X2)=X2|~mem(X2,X1))). 2.74/0.74 cnf(i_0_2, plain, (X1=X2|~mem(X2,bool)|~mem(X1,bool)|~p(X2)|~p(X1))). 2.74/0.74 cnf(i_0_550, plain, (p(ap(c_2Ebool_2E_7E,X1))|p(X1)|~mem(X1,bool))). 2.74/0.74 cnf(i_0_571, plain, (p(X1)|~mem(X2,bool)|~mem(X1,bool)|~p(ap(ap(c_2Ebool_2E_2F_5C,X2),X1)))). 2.74/0.74 cnf(i_0_572, plain, (p(X1)|~mem(X2,bool)|~mem(X1,bool)|~p(ap(ap(c_2Ebool_2E_2F_5C,X1),X2)))). 2.74/0.74 cnf(i_0_589, plain, (p(ap(ap(c_2Einteger_2Eint__divides,X1),X2))|~mem(X2,ty_2Einteger_2Eint)|~mem(X1,ty_2Einteger_2Eint)|~p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(c_2Einteger_2Eint__neg,X2))))). 2.74/0.74 cnf(i_0_1, plain, (X1=X2|p(X1)|p(X2)|~mem(X2,bool)|~mem(X1,bool))). 2.74/0.74 cnf(i_0_10, plain, (ap(k(X1,X2),X3)=X2|~mem(X3,X1))). 2.74/0.74 cnf(i_0_567, plain, (p(X1)|~mem(X1,bool)|~mem(X2,bool)|~p(ap(ap(c_2Emin_2E_3D_3D_3E,X2),X1))|~p(X2))). 2.74/0.74 cnf(i_0_139, plain, (X1=X2|~ne(X3)|~mem(X2,X3)|~mem(X1,X3)|~p(ap(ap(c_2Emin_2E_3D(X3),X1),X2)))). 2.74/0.74 cnf(i_0_595, plain, (p(X1)|p(X2)|~mem(X2,bool)|~mem(X1,bool)|~p(ap(ap(c_2Ebool_2E_5C_2F,X1),X2)))). 2.74/0.74 cnf(i_0_592, plain, (p(ap(ap(c_2Einteger_2Eint__divides,X1),X2))|~mem(X2,ty_2Einteger_2Eint)|~mem(X1,ty_2Einteger_2Eint)|~p(ap(ap(c_2Einteger_2Eint__divides,ap(c_2Einteger_2Eint__neg,X1)),X2)))). 2.74/0.74 cnf(i_0_590, plain, (p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(c_2Einteger_2Eint__neg,X2)))|~mem(X2,ty_2Einteger_2Eint)|~mem(X1,ty_2Einteger_2Eint)|~p(ap(ap(c_2Einteger_2Eint__divides,X1),X2)))). 2.74/0.74 cnf(i_0_591, plain, (p(ap(ap(c_2Einteger_2Eint__divides,ap(c_2Einteger_2Eint__neg,X1)),X2))|~mem(X2,ty_2Einteger_2Eint)|~mem(X1,ty_2Einteger_2Eint)|~p(ap(ap(c_2Einteger_2Eint__divides,X1),X2)))). 2.74/0.74 cnf(i_0_597, plain, (p(ap(ap(c_2Ebool_2E_5C_2F,X1),X2))|~mem(X1,bool)|~mem(X2,bool)|~p(X2))). 2.74/0.74 cnf(i_0_72, plain, (mem(c_2Ebool_2E_3F(X1),arr(arr(X1,bool),bool))|~ne(X1))). 2.74/0.74 cnf(i_0_9, plain, (mem(ap(X1,X2),X3)|~mem(X1,arr(X4,X3))|~mem(X2,X4))). 2.74/0.74 cnf(i_0_533, plain, (p(ap(c_2Ebool_2E_21(X1),X2))|~ne(X1)|~mem(X2,arr(X1,bool))|~p(ap(X2,esk8_2(X1,X2))))). 2.74/0.74 cnf(i_0_594, plain, (mem(c_2Emin_2E_3D(X1),arr(X1,arr(X1,bool)))|~ne(X1))). 2.74/0.74 cnf(i_0_596, plain, (p(ap(ap(c_2Ebool_2E_5C_2F,X1),X2))|~mem(X2,bool)|~mem(X1,bool)|~p(X1))). 2.74/0.74 cnf(i_0_548, plain, (mem(c_2Ebool_2E_21(X1),arr(arr(X1,bool),bool))|~ne(X1))). 2.74/0.74 cnf(i_0_568, plain, (p(ap(ap(c_2Emin_2E_3D_3D_3E,X1),X2))|~mem(X1,bool)|~mem(X2,bool)|~p(X2))). 2.74/0.74 cnf(i_0_569, plain, (p(ap(ap(c_2Emin_2E_3D_3D_3E,X1),X2))|p(X1)|~mem(X2,bool)|~mem(X1,bool))). 2.74/0.74 cnf(i_0_573, plain, (p(ap(ap(c_2Ebool_2E_2F_5C,X1),X2))|~mem(X2,bool)|~mem(X1,bool)|~p(X2)|~p(X1))). 2.74/0.74 cnf(i_0_136, plain, (ap(ap(c_2Einteger_2Eint__add,X1),ap(c_2Einteger_2Eint__neg,X2))=ap(ap(c_2Einteger_2Eint__sub,X1),X2)|~mem(X2,ty_2Einteger_2Eint)|~mem(X1,ty_2Einteger_2Eint))). 2.74/0.74 cnf(i_0_534, plain, (mem(esk8_2(X1,X2),X1)|p(ap(c_2Ebool_2E_21(X1),X2))|~ne(X1)|~mem(X2,arr(X1,bool)))). 2.74/0.74 cnf(i_0_138, plain, (p(ap(ap(c_2Emin_2E_3D(X1),X2),X2))|~ne(X1)|~mem(X2,X1))). 2.74/0.74 cnf(i_0_67, plain, (mem(esk2_2(X1,X2),X1)|~ne(X1)|~mem(X2,arr(X1,bool))|~p(ap(c_2Ebool_2E_3F(X1),X2)))). 2.74/0.74 cnf(i_0_66, plain, (p(ap(X1,esk2_2(X2,X1)))|~ne(X2)|~mem(X1,arr(X2,bool))|~p(ap(c_2Ebool_2E_3F(X2),X1)))). 2.74/0.74 cnf(i_0_532, plain, (p(ap(X1,X2))|~ne(X3)|~mem(X1,arr(X3,bool))|~mem(X2,X3)|~p(ap(c_2Ebool_2E_21(X3),X1)))). 2.74/0.74 cnf(i_0_4, plain, (X1=X2|mem(esk1_4(X3,X4,X1,X2),X3)|~mem(X2,arr(X3,X4))|~mem(X1,arr(X3,X4)))). 2.74/0.74 cnf(i_0_127, plain, (p(ap(ap(c_2Einteger_2Eint__divides,X1),X2))|~mem(X3,ty_2Einteger_2Eint)|~mem(X2,ty_2Einteger_2Eint)|~mem(X1,ty_2Einteger_2Eint)|~p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(ap(c_2Einteger_2Eint__add,X2),X3)))|~p(ap(ap(c_2Einteger_2Eint__divides,X1),X3)))). 2.74/0.74 cnf(i_0_128, plain, (p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(ap(c_2Einteger_2Eint__add,X2),X3)))|~mem(X3,ty_2Einteger_2Eint)|~mem(X2,ty_2Einteger_2Eint)|~mem(X1,ty_2Einteger_2Eint)|~p(ap(ap(c_2Einteger_2Eint__divides,X1),X3))|~p(ap(ap(c_2Einteger_2Eint__divides,X1),X2)))). 2.74/0.74 cnf(i_0_65, plain, (p(ap(c_2Ebool_2E_3F(X1),X2))|~ne(X1)|~mem(X2,arr(X1,bool))|~mem(X3,X1)|~p(ap(X2,X3)))). 2.74/0.74 cnf(i_0_70, plain, (p(ap(X1,X2))|~ne(X3)|~mem(X1,arr(X3,bool))|~mem(X2,X3)|~p(ap(X1,esk3_2(X3,X1))))). 2.74/0.74 cnf(i_0_71, plain, (mem(esk3_2(X1,X2),X1)|p(ap(X2,X3))|~ne(X1)|~mem(X2,arr(X1,bool))|~mem(X3,X1))). 2.74/0.74 cnf(i_0_69, plain, (mem(esk4_2(X1,X2),X1)|p(ap(X2,X3))|~ne(X1)|~mem(X2,arr(X1,bool))|~mem(X3,X1))). 2.74/0.74 cnf(i_0_68, plain, (p(ap(X1,X2))|~ne(X3)|~mem(X1,arr(X3,bool))|~mem(X2,X3)|~p(ap(X1,esk4_2(X3,X1))))). 2.74/0.74 cnf(i_0_3, plain, (X1=X2|ap(X1,esk1_4(X3,X4,X2,X1))!=ap(X2,esk1_4(X3,X4,X2,X1))|~mem(X2,arr(X3,X4))|~mem(X1,arr(X3,X4)))). 2.74/0.74 cnf(i_0_588, plain, (mem(esk9_3(X1,X2,X3),X1)|p(ap(X3,X4))|~ne(X1)|~mem(X2,arr(X1,bool))|~mem(X3,arr(X1,bool))|~mem(X4,X1))). 2.74/0.74 cnf(i_0_587, plain, (mem(esk9_3(X1,X2,X3),X1)|p(ap(X2,X4))|~ne(X1)|~mem(X3,arr(X1,bool))|~mem(X2,arr(X1,bool))|~mem(X4,X1))). 2.74/0.74 cnf(i_0_583, plain, (mem(esk11_3(X1,X2,X3),X1)|mem(esk10_3(X1,X2,X3),X1)|p(ap(X3,X4))|~ne(X1)|~mem(X2,arr(X1,bool))|~mem(X3,arr(X1,bool))|~mem(X4,X1))). 2.74/0.74 cnf(i_0_586, plain, (p(ap(X1,X2))|~ne(X3)|~mem(X4,arr(X3,bool))|~mem(X1,arr(X3,bool))|~mem(X2,X3)|~p(ap(X4,esk9_3(X3,X4,X1)))|~p(ap(X1,esk9_3(X3,X4,X1))))). 2.74/0.74 cnf(i_0_585, plain, (p(ap(X1,X2))|~ne(X3)|~mem(X4,arr(X3,bool))|~mem(X1,arr(X3,bool))|~mem(X2,X3)|~p(ap(X4,esk9_3(X3,X1,X4)))|~p(ap(X1,esk9_3(X3,X1,X4))))). 2.74/0.74 cnf(i_0_578, plain, (p(ap(X1,X2))|~ne(X3)|~mem(X4,arr(X3,bool))|~mem(X1,arr(X3,bool))|~mem(X2,X3)|~p(ap(X4,esk10_3(X3,X1,X4)))|~p(ap(X1,esk11_3(X3,X1,X4))))). 2.74/0.74 cnf(i_0_577, plain, (p(ap(X1,X2))|~ne(X3)|~mem(X4,arr(X3,bool))|~mem(X1,arr(X3,bool))|~mem(X2,X3)|~p(ap(X4,esk11_3(X3,X4,X1)))|~p(ap(X1,esk10_3(X3,X4,X1))))). 2.74/0.74 cnf(i_0_584, plain, (mem(esk11_3(X1,X2,X3),X1)|mem(esk10_3(X1,X2,X3),X1)|p(ap(X2,X4))|~ne(X1)|~mem(X3,arr(X1,bool))|~mem(X2,arr(X1,bool))|~mem(X4,X1))). 2.74/0.74 cnf(i_0_581, plain, (mem(esk10_3(X1,X2,X3),X1)|p(ap(X3,X4))|~ne(X1)|~mem(X2,arr(X1,bool))|~mem(X3,arr(X1,bool))|~mem(X4,X1)|~p(ap(X2,esk11_3(X1,X2,X3))))). 2.74/0.74 cnf(i_0_582, plain, (mem(esk10_3(X1,X2,X3),X1)|p(ap(X2,X4))|~ne(X1)|~mem(X3,arr(X1,bool))|~mem(X2,arr(X1,bool))|~mem(X4,X1)|~p(ap(X2,esk11_3(X1,X2,X3))))). 2.74/0.74 cnf(i_0_579, plain, (mem(esk11_3(X1,X2,X3),X1)|p(ap(X3,X4))|~ne(X1)|~mem(X2,arr(X1,bool))|~mem(X3,arr(X1,bool))|~mem(X4,X1)|~p(ap(X3,esk10_3(X1,X2,X3))))). 2.74/0.74 cnf(i_0_580, plain, (mem(esk11_3(X1,X2,X3),X1)|p(ap(X2,X4))|~ne(X1)|~mem(X3,arr(X1,bool))|~mem(X2,arr(X1,bool))|~mem(X4,X1)|~p(ap(X3,esk10_3(X1,X2,X3))))). 2.74/0.74 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 2.74/0.74 # Begin printing tableau 2.74/0.74 # Found 6 steps 2.74/0.74 cnf(i_0_131, negated_conjecture, (p(ap(ap(c_2Einteger_2Eint__divides,esk5_0),esk6_0))), inference(start_rule)). 2.74/0.74 cnf(i_0_608, plain, (p(ap(ap(c_2Einteger_2Eint__divides,esk5_0),esk6_0))), inference(extension_rule, [i_0_551])). 2.74/0.74 cnf(i_0_866, plain, (~mem(ap(ap(c_2Einteger_2Eint__divides,esk5_0),esk6_0),bool)), inference(extension_rule, [i_0_9])). 2.74/0.74 cnf(i_0_938, plain, (~mem(esk6_0,ty_2Einteger_2Eint)), inference(closure_rule, [i_0_133])). 2.74/0.74 cnf(i_0_867, plain, (~p(ap(c_2Ebool_2E_7E,ap(ap(c_2Einteger_2Eint__divides,esk5_0),esk6_0)))), inference(etableau_closure_rule, [i_0_867, ...])). 2.74/0.74 cnf(i_0_937, plain, (~mem(ap(c_2Einteger_2Eint__divides,esk5_0),arr(ty_2Einteger_2Eint,bool))), inference(etableau_closure_rule, [i_0_937, ...])). 2.74/0.74 # End printing tableau 2.74/0.74 # SZS output end 2.74/0.74 # Branches closed with saturation will be marked with an "s" 2.74/0.74 # Child (11240) has found a proof. 2.74/0.74 2.74/0.74 # Proof search is over... 2.74/0.74 # Freeing feature tree 2.74/0.75 EOF