0.13/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.13/0.14 % 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 : n002.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.36 % DateTime : Tue Jul 13 13:37:18 EDT 2021 0.14/0.36 % CPUTime : 0.14/0.39 # No SInE strategy applied 0.14/0.39 # Auto-Mode selected heuristic G_E___110_C45_F1_PI_SE_CS_SP_PS_S4S 0.14/0.39 # and selection function SelectNewComplexAHPNS. 0.14/0.39 # 0.14/0.39 # Presaturation interreduction done 0.14/0.39 # Number of axioms: 43 Number of unprocessed: 43 0.14/0.39 # Tableaux proof search. 0.14/0.39 # APR header successfully linked. 0.14/0.39 # Hello from C++ 1.67/1.86 # The folding up rule is enabled... 1.67/1.86 # Local unification is enabled... 1.67/1.86 # Any saturation attempts will use folding labels... 1.67/1.86 # 43 beginning clauses after preprocessing and clausification 1.67/1.86 # Creating start rules for all 1 conjectures. 1.67/1.86 # There are 1 start rule candidates: 1.67/1.86 # Found 18 unit axioms. 1.67/1.86 # 1 start rule tableaux created. 1.67/1.86 # 25 extension rule candidate clauses 1.67/1.86 # 18 unit axiom clauses 1.67/1.86 1.67/1.86 # Requested 8, 32 cores available to the main process. 1.67/1.86 # There are not enough tableaux to fork, creating more from the initial 1 9.65/9.86 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. 9.65/9.86 # We now have 13 tableaux to operate on 22.03/11.46 # There were 6 total branch saturation attempts. 22.03/11.46 # There were 0 of these attempts blocked. 22.03/11.46 # There were 0 deferred branch saturation attempts. 22.03/11.46 # There were 0 free duplicated saturations. 22.03/11.46 # There were 1 total successful branch saturations. 22.03/11.46 # There were 0 successful branch saturations in interreduction. 22.03/11.46 # There were 0 successful branch saturations on the branch. 22.03/11.46 # There were 1 successful branch saturations after the branch. 22.03/11.46 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 22.03/11.46 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 22.03/11.46 # Begin clausification derivation 22.03/11.46 22.03/11.46 # End clausification derivation 22.03/11.46 # Begin listing active clauses obtained from FOF to CNF conversion 22.03/11.46 cnf(i_0_10, plain, (id(X1,X1))). 22.03/11.46 cnf(i_0_11, plain, (id(esk5_1(X1),X1))). 22.03/11.46 cnf(i_0_13, plain, (r1(esk6_1(X1)))). 22.03/11.46 cnf(i_0_52, plain, (r1(esk15_1(X1)))). 22.03/11.46 cnf(i_0_49, plain, (r1(esk16_1(X1)))). 22.03/11.46 cnf(i_0_53, plain, (r3(X1,X2,esk20_2(X1,X2)))). 22.03/11.46 cnf(i_0_5, plain, (r4(X1,X2,esk4_2(X1,X2)))). 22.03/11.46 cnf(i_0_50, plain, (id(esk14_1(X1),esk16_1(X1)))). 22.03/11.46 cnf(i_0_8, plain, (r2(X1,esk3_2(X2,X1)))). 22.03/11.46 cnf(i_0_57, plain, (r2(X1,esk19_2(X2,X1)))). 22.03/11.46 cnf(i_0_12, plain, (r3(X1,esk6_1(X1),esk5_1(X1)))). 22.03/11.46 cnf(i_0_51, plain, (r4(X1,esk15_1(X1),esk14_1(X1)))). 22.03/11.46 cnf(i_0_7, plain, (id(esk2_2(X1,X2),esk1_2(X1,X2)))). 22.03/11.46 cnf(i_0_55, plain, (id(esk18_2(X1,X2),esk17_2(X1,X2)))). 22.03/11.46 cnf(i_0_56, plain, (r3(X1,esk19_2(X1,X2),esk18_2(X1,X2)))). 22.03/11.46 cnf(i_0_9, plain, (r4(X1,esk3_2(X1,X2),esk2_2(X1,X2)))). 22.03/11.46 cnf(i_0_6, plain, (r3(esk4_2(X1,X2),X1,esk1_2(X1,X2)))). 22.03/11.46 cnf(i_0_54, plain, (r2(esk20_2(X1,X2),esk17_2(X1,X2)))). 22.03/11.46 cnf(i_0_31, plain, (~r1(X1)|~r2(X2,X3)|~id(X1,X3))). 22.03/11.46 cnf(i_0_59, negated_conjecture, (~r4(X1,X1,X2)|~r4(X3,X3,X4)|~r4(X5,X5,X6)|~r3(X6,X4,X7)|~id(X7,X2))). 22.03/11.46 cnf(i_0_48, plain, (id(X1,esk13_0)|~r1(X1))). 22.03/11.46 cnf(i_0_45, plain, (r1(X1)|~id(X1,esk13_0))). 22.03/11.46 cnf(i_0_40, plain, (id(X1,X2)|~id(X2,X1))). 22.03/11.46 cnf(i_0_17, plain, (id(X1,esk7_1(X2))|~r2(X2,X1))). 22.03/11.46 cnf(i_0_26, plain, (r1(esk11_1(X1))|id(X1,esk10_1(X1)))). 22.03/11.46 cnf(i_0_14, plain, (r2(X1,X2)|~id(X2,esk7_1(X1)))). 22.03/11.46 cnf(i_0_27, plain, (id(X1,esk11_1(X1))|id(X1,esk10_1(X1)))). 22.03/11.46 cnf(i_0_36, plain, (r3(X1,X2,X3)|~id(X3,esk12_2(X1,X2)))). 22.03/11.46 cnf(i_0_24, plain, (r4(X1,X2,X3)|~id(X3,esk8_2(X1,X2)))). 22.03/11.46 cnf(i_0_39, plain, (id(X1,esk12_2(X2,X3))|~r3(X2,X3,X1))). 22.03/11.46 cnf(i_0_23, plain, (id(X1,esk8_2(X2,X3))|~r4(X2,X3,X1))). 22.03/11.46 cnf(i_0_20, plain, (r1(X1)|~r1(X2)|~id(X2,X1))). 22.03/11.46 cnf(i_0_19, plain, (r1(X1)|~r1(X2)|~id(X1,X2))). 22.03/11.46 cnf(i_0_30, plain, (id(X1,X2)|~id(X1,X3)|~id(X3,X2))). 22.03/11.46 cnf(i_0_28, plain, (r1(esk11_1(X1))|r2(esk9_1(X1),esk10_1(X1)))). 22.03/11.46 cnf(i_0_29, plain, (r2(esk9_1(X1),esk10_1(X1))|id(X1,esk11_1(X1)))). 22.03/11.46 cnf(i_0_58, plain, (id(X1,X2)|~r2(X2,X3)|~r2(X1,X4)|~id(X4,X3))). 22.03/11.46 cnf(i_0_34, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X2,X4)|~id(X1,X3))). 22.03/11.46 cnf(i_0_33, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X4,X2)|~id(X3,X1))). 22.03/11.46 cnf(i_0_1, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). 22.03/11.46 cnf(i_0_4, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). 22.03/11.46 cnf(i_0_41, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). 22.03/11.46 cnf(i_0_44, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). 22.03/11.46 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 22.03/11.46 # Begin printing tableau 22.03/11.46 # Found 13 steps 22.03/11.46 cnf(i_0_59, negated_conjecture, (~r4(X16,X16,esk4_2(X16,X16))|~r4(X15,X15,esk4_2(X15,X15))|~r4(X14,X14,esk4_2(X14,X14))|~r3(esk4_2(X14,X14),esk4_2(X15,X15),esk20_2(esk4_2(X14,X14),esk4_2(X15,X15)))|~id(esk20_2(esk4_2(X14,X14),esk4_2(X15,X15)),esk4_2(X16,X16))), inference(start_rule)). 22.03/11.46 cnf(i_0_60, plain, (~r4(X16,X16,esk4_2(X16,X16))), inference(closure_rule, [i_0_5])). 22.03/11.46 cnf(i_0_61, plain, (~r4(X15,X15,esk4_2(X15,X15))), inference(closure_rule, [i_0_5])). 22.03/11.46 cnf(i_0_62, plain, (~r4(X14,X14,esk4_2(X14,X14))), inference(closure_rule, [i_0_5])). 22.03/11.46 cnf(i_0_63, plain, (~r3(esk4_2(X14,X14),esk4_2(X15,X15),esk20_2(esk4_2(X14,X14),esk4_2(X15,X15)))), inference(closure_rule, [i_0_53])). 22.03/11.46 cnf(i_0_64, plain, (~id(esk20_2(esk4_2(X14,X14),esk4_2(X15,X15)),esk4_2(X16,X16))), inference(extension_rule, [i_0_58])). 22.03/11.46 cnf(i_0_104, plain, (~r2(esk4_2(X16,X16),esk3_2(X18,esk4_2(X16,X16)))), inference(closure_rule, [i_0_8])). 22.03/11.46 cnf(i_0_105, plain, (~r2(esk20_2(esk4_2(X14,X14),esk4_2(X15,X15)),esk3_2(X17,esk20_2(esk4_2(X14,X14),esk4_2(X15,X15))))), inference(closure_rule, [i_0_8])). 22.03/11.46 cnf(i_0_106, plain, (~id(esk3_2(X17,esk20_2(esk4_2(X14,X14),esk4_2(X15,X15))),esk3_2(X18,esk4_2(X16,X16)))), inference(extension_rule, [i_0_40])). 22.03/11.46 cnf(i_0_148, plain, (~id(esk3_2(X18,esk4_2(X16,X16)),esk3_2(X17,esk20_2(esk4_2(X14,X14),esk4_2(X15,X15))))), inference(extension_rule, [i_0_58])). 22.03/11.46 cnf(i_0_1464315, plain, (~r2(esk3_2(X17,esk20_2(esk4_2(X14,X14),esk4_2(X15,X15))),esk3_2(X2,esk3_2(X17,esk20_2(esk4_2(X14,X14),esk4_2(X15,X15)))))), inference(closure_rule, [i_0_8])). 22.03/11.46 cnf(i_0_1464316, plain, (~r2(esk3_2(X18,esk4_2(X16,X16)),esk3_2(X3,esk3_2(X18,esk4_2(X16,X16))))), inference(closure_rule, [i_0_8])). 22.03/11.46 cnf(i_0_1464317, plain, (~id(esk3_2(X3,esk3_2(X18,esk4_2(X16,X16))),esk3_2(X2,esk3_2(X17,esk20_2(esk4_2(X14,X14),esk4_2(X15,X15)))))), inference(etableau_closure_rule, [i_0_1464317, ...])). 22.03/11.46 # End printing tableau 22.03/11.46 # SZS output end 22.03/11.46 # Branches closed with saturation will be marked with an "s" 22.30/11.49 # Child (6731) has found a proof. 22.30/11.49 22.30/11.49 # Proof search is over... 22.30/11.49 # Freeing feature tree 22.30/11.51 EOF