0.00/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.09 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.08/0.28 Computer : n012.cluster.edu 0.08/0.28 Model : x86_64 x86_64 0.08/0.28 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.08/0.28 RAMPerCPU : 8042.1875MB 0.08/0.28 OS : Linux 3.10.0-693.el7.x86_64 0.08/0.28 % CPULimit : 960 0.08/0.28 % WCLimit : 120 0.08/0.28 % DateTime : Tue Aug 9 02:27:59 EDT 2022 0.08/0.29 % CPUTime : 0.13/0.31 # No SInE strategy applied 0.13/0.31 # Auto-Mode selected heuristic G_E___110_C45_F1_PI_SE_CS_SP_PS_S4S 0.13/0.31 # and selection function SelectNewComplexAHPNS. 0.13/0.31 # 0.13/0.31 # Presaturation interreduction done 0.13/0.31 # Number of axioms: 44 Number of unprocessed: 44 0.13/0.31 # Tableaux proof search. 0.13/0.31 # APR header successfully linked. 0.13/0.31 # Hello from C++ 0.13/0.32 # The folding up rule is enabled... 0.13/0.32 # Local unification is enabled... 0.13/0.32 # Any saturation attempts will use folding labels... 0.13/0.32 # 44 beginning clauses after preprocessing and clausification 0.13/0.32 # Creating start rules for all 2 conjectures. 0.13/0.32 # There are 2 start rule candidates: 0.13/0.32 # Found 18 unit axioms. 0.13/0.32 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. 0.13/0.32 # 2 start rule tableaux created. 0.13/0.32 # 26 extension rule candidate clauses 0.13/0.32 # 18 unit axiom clauses 0.13/0.32 0.13/0.32 # Requested 8, 32 cores available to the main process. 0.13/0.32 # There are not enough tableaux to fork, creating more from the initial 2 0.13/0.32 # Returning from population with 25 new_tableaux and 0 remaining starting tableaux. 0.13/0.32 # We now have 25 tableaux to operate on 0.13/0.34 # There were 1 total branch saturation attempts. 0.13/0.34 # There were 0 of these attempts blocked. 0.13/0.34 # There were 0 deferred branch saturation attempts. 0.13/0.34 # There were 0 free duplicated saturations. 0.13/0.34 # There were 1 total successful branch saturations. 0.13/0.34 # There were 0 successful branch saturations in interreduction. 0.13/0.34 # There were 0 successful branch saturations on the branch. 0.13/0.34 # There were 1 successful branch saturations after the branch. 0.13/0.34 # There were 1 total branch saturation attempts. 0.13/0.34 # There were 0 of these attempts blocked. 0.13/0.34 # There were 0 deferred branch saturation attempts. 0.13/0.34 # There were 0 free duplicated saturations. 0.13/0.34 # There were 1 total successful branch saturations. 0.13/0.34 # There were 0 successful branch saturations in interreduction. 0.13/0.34 # There were 0 successful branch saturations on the branch. 0.13/0.34 # There were 1 successful branch saturations after the branch. 0.13/0.34 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.13/0.34 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.13/0.34 # Begin clausification derivation 0.13/0.34 0.13/0.34 # End clausification derivation 0.13/0.34 # Begin listing active clauses obtained from FOF to CNF conversion 0.13/0.34 cnf(i_0_26, plain, (id(X1,X1))). 0.13/0.34 cnf(i_0_24, plain, (r1(esk9_1(X1)))). 0.13/0.34 cnf(i_0_45, plain, (r1(esk19_1(X1)))). 0.13/0.34 cnf(i_0_42, plain, (r1(esk20_1(X1)))). 0.13/0.34 cnf(i_0_23, plain, (id(esk8_1(X1),X1))). 0.13/0.34 cnf(i_0_43, plain, (id(esk18_1(X1),esk20_1(X1)))). 0.13/0.34 cnf(i_0_28, plain, (r3(X1,X2,esk13_2(X1,X2)))). 0.13/0.34 cnf(i_0_31, plain, (r2(X1,esk12_2(X2,X1)))). 0.13/0.34 cnf(i_0_39, plain, (r2(X1,esk17_2(X2,X1)))). 0.13/0.34 cnf(i_0_25, plain, (r3(X1,esk9_1(X1),esk8_1(X1)))). 0.13/0.34 cnf(i_0_40, plain, (r4(X1,X2,esk15_2(X1,X2)))). 0.13/0.34 cnf(i_0_32, plain, (id(esk11_2(X1,X2),esk10_2(X1,X2)))). 0.13/0.34 cnf(i_0_37, plain, (id(esk16_2(X1,X2),esk14_2(X1,X2)))). 0.13/0.34 cnf(i_0_44, plain, (r4(X1,esk19_1(X1),esk18_1(X1)))). 0.13/0.34 cnf(i_0_30, plain, (r3(X1,esk12_2(X1,X2),esk11_2(X1,X2)))). 0.13/0.34 cnf(i_0_41, plain, (r3(esk15_2(X1,X2),X1,esk14_2(X1,X2)))). 0.13/0.34 cnf(i_0_29, plain, (r2(esk13_2(X1,X2),esk10_2(X1,X2)))). 0.13/0.34 cnf(i_0_38, plain, (r4(X1,esk17_2(X1,X2),esk16_2(X1,X2)))). 0.13/0.34 cnf(i_0_27, plain, (~r1(X1)|~r2(X2,X3)|~id(X1,X3))). 0.13/0.34 cnf(i_0_6, plain, (id(X1,esk2_0)|~r1(X1))). 0.13/0.34 cnf(i_0_9, plain, (r1(X1)|~id(X1,esk2_0))). 0.13/0.34 cnf(i_0_1, plain, (id(X1,X2)|~id(X2,X1))). 0.13/0.34 cnf(i_0_50, plain, (r1(X1)|~r1(X2)|~id(X2,X1))). 0.13/0.34 cnf(i_0_47, plain, (r1(X1)|~r1(X2)|~id(X1,X2))). 0.13/0.34 cnf(i_0_3, plain, (id(X1,esk1_1(X2))|~r2(X2,X1))). 0.13/0.34 cnf(i_0_4, plain, (r2(X1,X2)|~id(X2,esk1_1(X1)))). 0.13/0.34 cnf(i_0_16, plain, (r1(esk4_1(X1))|id(X1,esk6_1(X1)))). 0.13/0.34 cnf(i_0_18, plain, (id(X1,esk6_1(X1))|id(X1,esk4_1(X1)))). 0.13/0.34 cnf(i_0_19, plain, (r3(X1,X2,X3)|~id(X3,esk7_2(X1,X2)))). 0.13/0.34 cnf(i_0_22, plain, (id(X1,esk7_2(X2,X3))|~r3(X2,X3,X1))). 0.13/0.34 cnf(i_0_15, plain, (r1(esk4_1(X1))|r2(esk5_1(X1),esk6_1(X1)))). 0.13/0.34 cnf(i_0_11, plain, (r4(X1,X2,X3)|~id(X3,esk3_2(X1,X2)))). 0.13/0.34 cnf(i_0_12, plain, (id(X1,esk3_2(X2,X3))|~r4(X2,X3,X1))). 0.13/0.34 cnf(i_0_46, plain, (id(X1,X2)|~id(X3,X2)|~id(X1,X3))). 0.13/0.34 cnf(i_0_60, negated_conjecture, (r1(esk22_2(X1,X2))|~r3(esk21_0,X2,X3)|~id(X3,X1))). 0.13/0.34 cnf(i_0_17, plain, (r2(esk5_1(X1),esk6_1(X1))|id(X1,esk4_1(X1)))). 0.13/0.34 cnf(i_0_59, negated_conjecture, (id(X1,esk22_2(X2,X1))|~r3(esk21_0,X1,X3)|~id(X3,X2))). 0.13/0.34 cnf(i_0_14, plain, (id(X1,X2)|~r2(X2,X3)|~r2(X1,X4)|~id(X4,X3))). 0.13/0.34 cnf(i_0_57, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X4,X2)|~id(X3,X1))). 0.13/0.34 cnf(i_0_56, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X2,X4)|~id(X1,X3))). 0.13/0.34 cnf(i_0_34, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). 0.13/0.34 cnf(i_0_35, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). 0.13/0.34 cnf(i_0_54, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). 0.13/0.34 cnf(i_0_51, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). 0.13/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.13/0.34 # Begin printing tableau 0.13/0.34 # Found 9 steps 0.13/0.34 cnf(i_0_59, negated_conjecture, (id(X8,esk22_2(esk13_2(esk21_0,X8),X8))|~r3(esk21_0,X8,esk13_2(esk21_0,X8))|~id(esk13_2(esk21_0,X8),esk13_2(esk21_0,X8))), inference(start_rule)). 0.13/0.34 cnf(i_0_62, plain, (~r3(esk21_0,X8,esk13_2(esk21_0,X8))), inference(closure_rule, [i_0_28])). 0.13/0.34 cnf(i_0_63, plain, (~id(esk13_2(esk21_0,X8),esk13_2(esk21_0,X8))), inference(closure_rule, [i_0_26])). 0.13/0.34 cnf(i_0_61, plain, (id(X8,esk22_2(esk13_2(esk21_0,X8),X8))), inference(extension_rule, [i_0_51])). 0.13/0.34 cnf(i_0_133, plain, (~r4(X8,X6,esk15_2(X8,X6))), inference(closure_rule, [i_0_40])). 0.13/0.34 cnf(i_0_134, plain, (~id(esk15_2(X8,X6),esk15_2(X8,X6))), inference(closure_rule, [i_0_26])). 0.13/0.34 cnf(i_0_135, plain, (~id(X6,X6)), inference(closure_rule, [i_0_26])). 0.13/0.34 cnf(i_0_132, plain, (r4(esk22_2(esk13_2(esk21_0,X8),X8),X6,esk15_2(X8,X6))), inference(extension_rule, [i_0_12])). 0.13/0.34 cnf(i_0_174, plain, (id(esk15_2(X8,X6),esk3_2(esk22_2(esk13_2(esk21_0,X8),X8),X6))), inference(etableau_closure_rule, [i_0_174, ...])). 0.13/0.34 # End printing tableau 0.13/0.34 # SZS output end 0.13/0.34 # Branches closed with saturation will be marked with an "s" 0.13/0.34 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.13/0.34 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.13/0.34 # Begin clausification derivation 0.13/0.34 0.13/0.34 # End clausification derivation 0.13/0.34 # Begin listing active clauses obtained from FOF to CNF conversion 0.13/0.34 cnf(i_0_26, plain, (id(X1,X1))). 0.13/0.34 cnf(i_0_24, plain, (r1(esk9_1(X1)))). 0.13/0.34 cnf(i_0_45, plain, (r1(esk19_1(X1)))). 0.13/0.34 cnf(i_0_42, plain, (r1(esk20_1(X1)))). 0.13/0.34 cnf(i_0_23, plain, (id(esk8_1(X1),X1))). 0.13/0.34 cnf(i_0_43, plain, (id(esk18_1(X1),esk20_1(X1)))). 0.13/0.34 cnf(i_0_28, plain, (r3(X1,X2,esk13_2(X1,X2)))). 0.13/0.34 cnf(i_0_31, plain, (r2(X1,esk12_2(X2,X1)))). 0.13/0.34 cnf(i_0_39, plain, (r2(X1,esk17_2(X2,X1)))). 0.13/0.34 cnf(i_0_25, plain, (r3(X1,esk9_1(X1),esk8_1(X1)))). 0.13/0.34 cnf(i_0_40, plain, (r4(X1,X2,esk15_2(X1,X2)))). 0.13/0.34 cnf(i_0_32, plain, (id(esk11_2(X1,X2),esk10_2(X1,X2)))). 0.13/0.34 cnf(i_0_37, plain, (id(esk16_2(X1,X2),esk14_2(X1,X2)))). 0.13/0.34 cnf(i_0_44, plain, (r4(X1,esk19_1(X1),esk18_1(X1)))). 0.13/0.34 cnf(i_0_30, plain, (r3(X1,esk12_2(X1,X2),esk11_2(X1,X2)))). 0.13/0.34 cnf(i_0_41, plain, (r3(esk15_2(X1,X2),X1,esk14_2(X1,X2)))). 0.13/0.34 cnf(i_0_29, plain, (r2(esk13_2(X1,X2),esk10_2(X1,X2)))). 0.13/0.34 cnf(i_0_38, plain, (r4(X1,esk17_2(X1,X2),esk16_2(X1,X2)))). 0.13/0.34 cnf(i_0_27, plain, (~r1(X1)|~r2(X2,X3)|~id(X1,X3))). 0.13/0.34 cnf(i_0_6, plain, (id(X1,esk2_0)|~r1(X1))). 0.13/0.34 cnf(i_0_9, plain, (r1(X1)|~id(X1,esk2_0))). 0.13/0.34 cnf(i_0_1, plain, (id(X1,X2)|~id(X2,X1))). 0.13/0.34 cnf(i_0_50, plain, (r1(X1)|~r1(X2)|~id(X2,X1))). 0.13/0.34 cnf(i_0_47, plain, (r1(X1)|~r1(X2)|~id(X1,X2))). 0.13/0.34 cnf(i_0_3, plain, (id(X1,esk1_1(X2))|~r2(X2,X1))). 0.13/0.34 cnf(i_0_4, plain, (r2(X1,X2)|~id(X2,esk1_1(X1)))). 0.13/0.34 cnf(i_0_16, plain, (r1(esk4_1(X1))|id(X1,esk6_1(X1)))). 0.13/0.34 cnf(i_0_18, plain, (id(X1,esk6_1(X1))|id(X1,esk4_1(X1)))). 0.13/0.34 cnf(i_0_19, plain, (r3(X1,X2,X3)|~id(X3,esk7_2(X1,X2)))). 0.13/0.34 cnf(i_0_22, plain, (id(X1,esk7_2(X2,X3))|~r3(X2,X3,X1))). 0.13/0.34 cnf(i_0_15, plain, (r1(esk4_1(X1))|r2(esk5_1(X1),esk6_1(X1)))). 0.13/0.34 cnf(i_0_11, plain, (r4(X1,X2,X3)|~id(X3,esk3_2(X1,X2)))). 0.13/0.34 cnf(i_0_12, plain, (id(X1,esk3_2(X2,X3))|~r4(X2,X3,X1))). 0.13/0.34 cnf(i_0_46, plain, (id(X1,X2)|~id(X3,X2)|~id(X1,X3))). 0.13/0.34 cnf(i_0_60, negated_conjecture, (r1(esk22_2(X1,X2))|~r3(esk21_0,X2,X3)|~id(X3,X1))). 0.13/0.34 cnf(i_0_17, plain, (r2(esk5_1(X1),esk6_1(X1))|id(X1,esk4_1(X1)))). 0.13/0.34 cnf(i_0_59, negated_conjecture, (id(X1,esk22_2(X2,X1))|~r3(esk21_0,X1,X3)|~id(X3,X2))). 0.13/0.34 cnf(i_0_14, plain, (id(X1,X2)|~r2(X2,X3)|~r2(X1,X4)|~id(X4,X3))). 0.13/0.34 cnf(i_0_57, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X4,X2)|~id(X3,X1))). 0.13/0.34 cnf(i_0_56, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X2,X4)|~id(X1,X3))). 0.13/0.34 cnf(i_0_34, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). 0.13/0.34 cnf(i_0_35, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). 0.13/0.34 cnf(i_0_54, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). 0.13/0.34 cnf(i_0_51, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). 0.13/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.13/0.34 # Begin printing tableau 0.13/0.34 # Found 9 steps 0.13/0.34 cnf(i_0_59, negated_conjecture, (id(X7,esk22_2(esk13_2(esk21_0,X7),X7))|~r3(esk21_0,X7,esk13_2(esk21_0,X7))|~id(esk13_2(esk21_0,X7),esk13_2(esk21_0,X7))), inference(start_rule)). 0.13/0.34 cnf(i_0_62, plain, (~r3(esk21_0,X7,esk13_2(esk21_0,X7))), inference(closure_rule, [i_0_28])). 0.13/0.34 cnf(i_0_63, plain, (~id(esk13_2(esk21_0,X7),esk13_2(esk21_0,X7))), inference(closure_rule, [i_0_26])). 0.13/0.34 cnf(i_0_61, plain, (id(X7,esk22_2(esk13_2(esk21_0,X7),X7))), inference(extension_rule, [i_0_51])). 0.13/0.34 cnf(i_0_133, plain, (~r4(X5,X7,esk15_2(X5,X7))), inference(closure_rule, [i_0_40])). 0.13/0.34 cnf(i_0_134, plain, (~id(esk15_2(X5,X7),esk15_2(X5,X7))), inference(closure_rule, [i_0_26])). 0.13/0.34 cnf(i_0_136, plain, (~id(X5,X5)), inference(closure_rule, [i_0_26])). 0.13/0.34 cnf(i_0_132, plain, (r4(X5,esk22_2(esk13_2(esk21_0,X7),X7),esk15_2(X5,X7))), inference(extension_rule, [i_0_12])). 0.13/0.34 cnf(i_0_174, plain, (id(esk15_2(X5,X7),esk3_2(X5,esk22_2(esk13_2(esk21_0,X7),X7)))), inference(etableau_closure_rule, [i_0_174, ...])). 0.13/0.34 # End printing tableau 0.13/0.34 # SZS output end 0.13/0.34 # Branches closed with saturation will be marked with an "s" 0.13/0.34 # There were 1 total branch saturation attempts. 0.13/0.34 # There were 0 of these attempts blocked. 0.13/0.34 # There were 0 deferred branch saturation attempts. 0.13/0.34 # There were 0 free duplicated saturations. 0.13/0.34 # There were 1 total successful branch saturations. 0.13/0.34 # There were 0 successful branch saturations in interreduction. 0.13/0.34 # There were 0 successful branch saturations on the branch. 0.13/0.34 # There were 1 successful branch saturations after the branch. 0.13/0.34 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.13/0.34 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.13/0.34 # Begin clausification derivation 0.13/0.34 0.13/0.34 # End clausification derivation 0.13/0.34 # Begin listing active clauses obtained from FOF to CNF conversion 0.13/0.34 cnf(i_0_26, plain, (id(X1,X1))). 0.13/0.34 cnf(i_0_24, plain, (r1(esk9_1(X1)))). 0.13/0.34 cnf(i_0_45, plain, (r1(esk19_1(X1)))). 0.13/0.34 cnf(i_0_42, plain, (r1(esk20_1(X1)))). 0.13/0.34 cnf(i_0_23, plain, (id(esk8_1(X1),X1))). 0.13/0.34 cnf(i_0_43, plain, (id(esk18_1(X1),esk20_1(X1)))). 0.13/0.34 cnf(i_0_28, plain, (r3(X1,X2,esk13_2(X1,X2)))). 0.13/0.34 cnf(i_0_31, plain, (r2(X1,esk12_2(X2,X1)))). 0.13/0.34 cnf(i_0_39, plain, (r2(X1,esk17_2(X2,X1)))). 0.13/0.34 cnf(i_0_25, plain, (r3(X1,esk9_1(X1),esk8_1(X1)))). 0.13/0.34 cnf(i_0_40, plain, (r4(X1,X2,esk15_2(X1,X2)))). 0.13/0.34 cnf(i_0_32, plain, (id(esk11_2(X1,X2),esk10_2(X1,X2)))). 0.13/0.34 cnf(i_0_37, plain, (id(esk16_2(X1,X2),esk14_2(X1,X2)))). 0.13/0.34 cnf(i_0_44, plain, (r4(X1,esk19_1(X1),esk18_1(X1)))). 0.13/0.34 cnf(i_0_30, plain, (r3(X1,esk12_2(X1,X2),esk11_2(X1,X2)))). 0.13/0.34 cnf(i_0_41, plain, (r3(esk15_2(X1,X2),X1,esk14_2(X1,X2)))). 0.13/0.34 cnf(i_0_29, plain, (r2(esk13_2(X1,X2),esk10_2(X1,X2)))). 0.13/0.34 cnf(i_0_38, plain, (r4(X1,esk17_2(X1,X2),esk16_2(X1,X2)))). 0.13/0.34 cnf(i_0_27, plain, (~r1(X1)|~r2(X2,X3)|~id(X1,X3))). 0.13/0.34 cnf(i_0_6, plain, (id(X1,esk2_0)|~r1(X1))). 0.13/0.34 cnf(i_0_9, plain, (r1(X1)|~id(X1,esk2_0))). 0.13/0.34 cnf(i_0_1, plain, (id(X1,X2)|~id(X2,X1))). 0.13/0.34 cnf(i_0_50, plain, (r1(X1)|~r1(X2)|~id(X2,X1))). 0.13/0.34 cnf(i_0_47, plain, (r1(X1)|~r1(X2)|~id(X1,X2))). 0.13/0.34 cnf(i_0_3, plain, (id(X1,esk1_1(X2))|~r2(X2,X1))). 0.13/0.34 cnf(i_0_4, plain, (r2(X1,X2)|~id(X2,esk1_1(X1)))). 0.13/0.34 cnf(i_0_16, plain, (r1(esk4_1(X1))|id(X1,esk6_1(X1)))). 0.13/0.34 cnf(i_0_18, plain, (id(X1,esk6_1(X1))|id(X1,esk4_1(X1)))). 0.13/0.34 cnf(i_0_19, plain, (r3(X1,X2,X3)|~id(X3,esk7_2(X1,X2)))). 0.13/0.34 cnf(i_0_22, plain, (id(X1,esk7_2(X2,X3))|~r3(X2,X3,X1))). 0.13/0.34 cnf(i_0_15, plain, (r1(esk4_1(X1))|r2(esk5_1(X1),esk6_1(X1)))). 0.13/0.34 cnf(i_0_11, plain, (r4(X1,X2,X3)|~id(X3,esk3_2(X1,X2)))). 0.13/0.34 cnf(i_0_12, plain, (id(X1,esk3_2(X2,X3))|~r4(X2,X3,X1))). 0.13/0.34 cnf(i_0_46, plain, (id(X1,X2)|~id(X3,X2)|~id(X1,X3))). 0.13/0.34 cnf(i_0_60, negated_conjecture, (r1(esk22_2(X1,X2))|~r3(esk21_0,X2,X3)|~id(X3,X1))). 0.13/0.34 cnf(i_0_17, plain, (r2(esk5_1(X1),esk6_1(X1))|id(X1,esk4_1(X1)))). 0.13/0.34 cnf(i_0_59, negated_conjecture, (id(X1,esk22_2(X2,X1))|~r3(esk21_0,X1,X3)|~id(X3,X2))). 0.13/0.34 cnf(i_0_14, plain, (id(X1,X2)|~r2(X2,X3)|~r2(X1,X4)|~id(X4,X3))). 0.13/0.34 cnf(i_0_57, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X4,X2)|~id(X3,X1))). 0.13/0.34 cnf(i_0_56, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X2,X4)|~id(X1,X3))). 0.13/0.34 cnf(i_0_34, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). 0.13/0.34 cnf(i_0_35, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). 0.13/0.34 cnf(i_0_54, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). 0.13/0.34 cnf(i_0_51, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). 0.13/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.13/0.34 # Begin printing tableau 0.13/0.34 # Found 9 steps 0.13/0.34 cnf(i_0_59, negated_conjecture, (id(X5,esk22_2(esk13_2(esk21_0,X5),X5))|~r3(esk21_0,X5,esk13_2(esk21_0,X5))|~id(esk13_2(esk21_0,X5),esk13_2(esk21_0,X5))), inference(start_rule)). 0.13/0.34 cnf(i_0_62, plain, (~r3(esk21_0,X5,esk13_2(esk21_0,X5))), inference(closure_rule, [i_0_28])). 0.13/0.34 cnf(i_0_63, plain, (~id(esk13_2(esk21_0,X5),esk13_2(esk21_0,X5))), inference(closure_rule, [i_0_26])). 0.13/0.34 cnf(i_0_61, plain, (id(X5,esk22_2(esk13_2(esk21_0,X5),X5))), inference(extension_rule, [i_0_54])). 0.13/0.34 cnf(i_0_128, plain, (~r4(esk22_2(esk13_2(esk21_0,X5),X5),X6,esk15_2(esk22_2(esk13_2(esk21_0,X5),X5),X6))), inference(closure_rule, [i_0_40])). 0.13/0.34 cnf(i_0_129, plain, (~id(esk15_2(esk22_2(esk13_2(esk21_0,X5),X5),X6),esk15_2(esk22_2(esk13_2(esk21_0,X5),X5),X6))), inference(closure_rule, [i_0_26])). 0.13/0.34 cnf(i_0_130, plain, (~id(X6,X6)), inference(closure_rule, [i_0_26])). 0.13/0.34 cnf(i_0_127, plain, (r4(X5,X6,esk15_2(esk22_2(esk13_2(esk21_0,X5),X5),X6))), inference(extension_rule, [i_0_12])). 0.13/0.34 cnf(i_0_174, plain, (id(esk15_2(esk22_2(esk13_2(esk21_0,X5),X5),X6),esk3_2(X5,X6))), inference(etableau_closure_rule, [i_0_174, ...])). 0.13/0.34 # End printing tableau 0.13/0.34 # SZS output end 0.13/0.34 # Branches closed with saturation will be marked with an "s" 0.13/0.34 # There were 1 total branch saturation attempts. 0.13/0.34 # There were 0 of these attempts blocked. 0.13/0.34 # There were 0 deferred branch saturation attempts. 0.13/0.34 # There were 0 free duplicated saturations. 0.13/0.34 # There were 1 total successful branch saturations. 0.13/0.34 # There were 0 successful branch saturations in interreduction. 0.13/0.34 # There were 0 successful branch saturations on the branch. 0.13/0.34 # There were 1 successful branch saturations after the branch. 0.13/0.34 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.13/0.34 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.13/0.34 # Begin clausification derivation 0.13/0.34 0.13/0.34 # End clausification derivation 0.13/0.34 # Begin listing active clauses obtained from FOF to CNF conversion 0.13/0.34 cnf(i_0_26, plain, (id(X1,X1))). 0.13/0.34 cnf(i_0_24, plain, (r1(esk9_1(X1)))). 0.13/0.34 cnf(i_0_45, plain, (r1(esk19_1(X1)))). 0.13/0.34 cnf(i_0_42, plain, (r1(esk20_1(X1)))). 0.13/0.34 cnf(i_0_23, plain, (id(esk8_1(X1),X1))). 0.13/0.34 cnf(i_0_43, plain, (id(esk18_1(X1),esk20_1(X1)))). 0.13/0.34 cnf(i_0_28, plain, (r3(X1,X2,esk13_2(X1,X2)))). 0.13/0.34 cnf(i_0_31, plain, (r2(X1,esk12_2(X2,X1)))). 0.13/0.34 cnf(i_0_39, plain, (r2(X1,esk17_2(X2,X1)))). 0.13/0.34 cnf(i_0_25, plain, (r3(X1,esk9_1(X1),esk8_1(X1)))). 0.13/0.34 cnf(i_0_40, plain, (r4(X1,X2,esk15_2(X1,X2)))). 0.13/0.34 cnf(i_0_32, plain, (id(esk11_2(X1,X2),esk10_2(X1,X2)))). 0.13/0.34 cnf(i_0_37, plain, (id(esk16_2(X1,X2),esk14_2(X1,X2)))). 0.13/0.34 cnf(i_0_44, plain, (r4(X1,esk19_1(X1),esk18_1(X1)))). 0.13/0.34 cnf(i_0_30, plain, (r3(X1,esk12_2(X1,X2),esk11_2(X1,X2)))). 0.13/0.34 cnf(i_0_41, plain, (r3(esk15_2(X1,X2),X1,esk14_2(X1,X2)))). 0.13/0.34 cnf(i_0_29, plain, (r2(esk13_2(X1,X2),esk10_2(X1,X2)))). 0.13/0.34 cnf(i_0_38, plain, (r4(X1,esk17_2(X1,X2),esk16_2(X1,X2)))). 0.13/0.34 cnf(i_0_27, plain, (~r1(X1)|~r2(X2,X3)|~id(X1,X3))). 0.13/0.34 cnf(i_0_6, plain, (id(X1,esk2_0)|~r1(X1))). 0.13/0.34 cnf(i_0_9, plain, (r1(X1)|~id(X1,esk2_0))). 0.13/0.34 cnf(i_0_1, plain, (id(X1,X2)|~id(X2,X1))). 0.13/0.34 cnf(i_0_50, plain, (r1(X1)|~r1(X2)|~id(X2,X1))). 0.13/0.34 cnf(i_0_47, plain, (r1(X1)|~r1(X2)|~id(X1,X2))). 0.13/0.34 cnf(i_0_3, plain, (id(X1,esk1_1(X2))|~r2(X2,X1))). 0.13/0.34 cnf(i_0_4, plain, (r2(X1,X2)|~id(X2,esk1_1(X1)))). 0.13/0.34 cnf(i_0_16, plain, (r1(esk4_1(X1))|id(X1,esk6_1(X1)))). 0.13/0.34 cnf(i_0_18, plain, (id(X1,esk6_1(X1))|id(X1,esk4_1(X1)))). 0.13/0.34 cnf(i_0_19, plain, (r3(X1,X2,X3)|~id(X3,esk7_2(X1,X2)))). 0.13/0.34 cnf(i_0_22, plain, (id(X1,esk7_2(X2,X3))|~r3(X2,X3,X1))). 0.13/0.34 cnf(i_0_15, plain, (r1(esk4_1(X1))|r2(esk5_1(X1),esk6_1(X1)))). 0.13/0.34 cnf(i_0_11, plain, (r4(X1,X2,X3)|~id(X3,esk3_2(X1,X2)))). 0.13/0.34 cnf(i_0_12, plain, (id(X1,esk3_2(X2,X3))|~r4(X2,X3,X1))). 0.13/0.34 cnf(i_0_46, plain, (id(X1,X2)|~id(X3,X2)|~id(X1,X3))). 0.13/0.34 cnf(i_0_60, negated_conjecture, (r1(esk22_2(X1,X2))|~r3(esk21_0,X2,X3)|~id(X3,X1))). 0.13/0.34 cnf(i_0_17, plain, (r2(esk5_1(X1),esk6_1(X1))|id(X1,esk4_1(X1)))). 0.13/0.34 cnf(i_0_59, negated_conjecture, (id(X1,esk22_2(X2,X1))|~r3(esk21_0,X1,X3)|~id(X3,X2))). 0.13/0.34 cnf(i_0_14, plain, (id(X1,X2)|~r2(X2,X3)|~r2(X1,X4)|~id(X4,X3))). 0.13/0.34 cnf(i_0_57, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X4,X2)|~id(X3,X1))). 0.13/0.34 cnf(i_0_56, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X2,X4)|~id(X1,X3))). 0.13/0.34 cnf(i_0_34, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). 0.13/0.34 cnf(i_0_35, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). 0.13/0.34 cnf(i_0_54, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). 0.13/0.34 cnf(i_0_51, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). 0.13/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.13/0.34 # Begin printing tableau 0.13/0.34 # Found 9 steps 0.13/0.34 cnf(i_0_59, negated_conjecture, (id(X6,esk22_2(esk13_2(esk21_0,X6),X6))|~r3(esk21_0,X6,esk13_2(esk21_0,X6))|~id(esk13_2(esk21_0,X6),esk13_2(esk21_0,X6))), inference(start_rule)). 0.13/0.34 cnf(i_0_62, plain, (~r3(esk21_0,X6,esk13_2(esk21_0,X6))), inference(closure_rule, [i_0_28])). 0.13/0.34 cnf(i_0_63, plain, (~id(esk13_2(esk21_0,X6),esk13_2(esk21_0,X6))), inference(closure_rule, [i_0_26])). 0.13/0.34 cnf(i_0_61, plain, (id(X6,esk22_2(esk13_2(esk21_0,X6),X6))), inference(extension_rule, [i_0_54])). 0.13/0.34 cnf(i_0_128, plain, (~r4(X5,esk22_2(esk13_2(esk21_0,X6),X6),esk15_2(X5,esk22_2(esk13_2(esk21_0,X6),X6)))), inference(closure_rule, [i_0_40])). 0.13/0.34 cnf(i_0_129, plain, (~id(esk15_2(X5,esk22_2(esk13_2(esk21_0,X6),X6)),esk15_2(X5,esk22_2(esk13_2(esk21_0,X6),X6)))), inference(closure_rule, [i_0_26])). 0.13/0.34 cnf(i_0_131, plain, (~id(X5,X5)), inference(closure_rule, [i_0_26])). 0.13/0.34 cnf(i_0_127, plain, (r4(X5,X6,esk15_2(X5,esk22_2(esk13_2(esk21_0,X6),X6)))), inference(extension_rule, [i_0_12])). 0.13/0.34 cnf(i_0_174, plain, (id(esk15_2(X5,esk22_2(esk13_2(esk21_0,X6),X6)),esk3_2(X5,X6))), inference(etableau_closure_rule, [i_0_174, ...])). 0.13/0.34 # End printing tableau 0.13/0.34 # SZS output end 0.13/0.34 # Branches closed with saturation will be marked with an "s" 0.13/0.34 # Child (7516) has found a proof. 0.13/0.34 0.13/0.34 # Proof search is over... 0.13/0.34 # Freeing feature tree 0.13/0.34 EOF