%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUN062+1 : TPTP v8.1.0. Bugfixed v7.4.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n021.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 600s % DateTime : Mon Jul 18 16:26:17 EDT 2022 % Result : Theorem 0.20s 0.40s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : NUN062+1 : TPTP v8.1.0. Bugfixed v7.4.0. % 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n021.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Thu Jun 2 04:11:16 EDT 2022 % 0.12/0.34 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___110_C45_F1_PI_SE_CS_SP_PS_S4S % 0.20/0.38 # and selection function SelectNewComplexAHPNS. % 0.20/0.38 # % 0.20/0.38 # Presaturation interreduction done % 0.20/0.38 # Number of axioms: 44 Number of unprocessed: 44 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # Hello from C++ % 0.20/0.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 44 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 2 conjectures. % 0.20/0.38 # There are 2 start rule candidates: % 0.20/0.38 # Found 18 unit axioms. % 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.38 # 2 start rule tableaux created. % 0.20/0.38 # 26 extension rule candidate clauses % 0.20/0.38 # 18 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 2 % 0.20/0.38 # Returning from population with 25 new_tableaux and 0 remaining starting tableaux. % 0.20/0.38 # We now have 25 tableaux to operate on % 0.20/0.40 # There were 1 total branch saturation attempts. % 0.20/0.40 # There were 0 of these attempts blocked. % 0.20/0.40 # There were 0 deferred branch saturation attempts. % 0.20/0.40 # There were 0 free duplicated saturations. % 0.20/0.40 # There were 1 total successful branch saturations. % 0.20/0.40 # There were 0 successful branch saturations in interreduction. % 0.20/0.40 # There were 0 successful branch saturations on the branch. % 0.20/0.40 # There were 1 successful branch saturations after the branch. % 0.20/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.40 # Begin clausification derivation % 0.20/0.40 % 0.20/0.40 # End clausification derivation % 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.40 cnf(i_0_17, plain, (id(X1,X1))). % 0.20/0.40 cnf(i_0_48, plain, (r1(esk14_1(X1)))). % 0.20/0.40 cnf(i_0_53, plain, (r1(esk16_1(X1)))). % 0.20/0.40 cnf(i_0_50, plain, (r1(esk17_1(X1)))). % 0.20/0.40 cnf(i_0_49, plain, (id(esk13_1(X1),X1))). % 0.20/0.40 cnf(i_0_51, plain, (id(esk15_1(X1),esk17_1(X1)))). % 0.20/0.40 cnf(i_0_36, plain, (r3(X1,X2,esk8_2(X1,X2)))). % 0.20/0.40 cnf(i_0_39, plain, (r2(X1,esk7_2(X2,X1)))). % 0.20/0.40 cnf(i_0_44, plain, (r2(X1,esk11_2(X2,X1)))). % 0.20/0.40 cnf(i_0_47, plain, (r3(X1,esk14_1(X1),esk13_1(X1)))). % 0.20/0.40 cnf(i_0_41, plain, (r4(X1,X2,esk12_2(X1,X2)))). % 0.20/0.40 cnf(i_0_40, plain, (id(esk6_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.40 cnf(i_0_45, plain, (id(esk10_2(X1,X2),esk9_2(X1,X2)))). % 0.20/0.40 cnf(i_0_52, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))). % 0.20/0.40 cnf(i_0_38, plain, (r3(X1,esk7_2(X1,X2),esk6_2(X1,X2)))). % 0.20/0.40 cnf(i_0_42, plain, (r3(esk12_2(X1,X2),X1,esk9_2(X1,X2)))). % 0.20/0.40 cnf(i_0_37, plain, (r2(esk8_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.40 cnf(i_0_43, plain, (r4(X1,esk11_2(X1,X2),esk10_2(X1,X2)))). % 0.20/0.40 cnf(i_0_58, plain, (~r2(X1,X2)|~r1(X3)|~id(X3,X2))). % 0.20/0.40 cnf(i_0_4, plain, (id(X1,esk1_0)|~r1(X1))). % 0.20/0.40 cnf(i_0_1, plain, (r1(X1)|~id(X1,esk1_0))). % 0.20/0.40 cnf(i_0_18, plain, (id(X1,X2)|~id(X2,X1))). % 0.20/0.40 cnf(i_0_22, plain, (r1(X1)|~r1(X2)|~id(X2,X1))). % 0.20/0.40 cnf(i_0_21, plain, (r1(X1)|~r1(X2)|~id(X1,X2))). % 0.20/0.40 cnf(i_0_8, plain, (id(X1,esk2_1(X2))|~r2(X2,X1))). % 0.20/0.40 cnf(i_0_5, plain, (r2(X1,X2)|~id(X2,esk2_1(X1)))). % 0.20/0.40 cnf(i_0_55, plain, (r1(esk18_1(X1))|id(X1,esk20_1(X1)))). % 0.20/0.40 cnf(i_0_57, plain, (id(X1,esk20_1(X1))|id(X1,esk18_1(X1)))). % 0.20/0.40 cnf(i_0_9, plain, (r3(X1,X2,X3)|~id(X3,esk3_2(X1,X2)))). % 0.20/0.40 cnf(i_0_12, plain, (id(X1,esk3_2(X2,X3))|~r3(X2,X3,X1))). % 0.20/0.40 cnf(i_0_54, plain, (r2(esk19_1(X1),esk20_1(X1))|r1(esk18_1(X1)))). % 0.20/0.40 cnf(i_0_13, plain, (r4(X1,X2,X3)|~id(X3,esk4_2(X1,X2)))). % 0.20/0.40 cnf(i_0_16, plain, (id(X1,esk4_2(X2,X3))|~r4(X2,X3,X1))). % 0.20/0.40 cnf(i_0_19, plain, (id(X1,X2)|~id(X3,X2)|~id(X1,X3))). % 0.20/0.40 cnf(i_0_59, negated_conjecture, (r1(esk22_2(X1,X2))|~r3(esk21_0,X2,X3)|~id(X3,X1))). % 0.20/0.40 cnf(i_0_56, plain, (r2(esk19_1(X1),esk20_1(X1))|id(X1,esk18_1(X1)))). % 0.20/0.40 cnf(i_0_60, negated_conjecture, (id(X1,esk22_2(X2,X1))|~r3(esk21_0,X1,X3)|~id(X3,X2))). % 0.20/0.40 cnf(i_0_46, plain, (id(X1,X2)|~r2(X2,X3)|~r2(X1,X4)|~id(X4,X3))). % 0.20/0.40 cnf(i_0_26, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X4,X2)|~id(X3,X1))). % 0.20/0.40 cnf(i_0_25, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X2,X4)|~id(X1,X3))). % 0.20/0.40 cnf(i_0_30, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). % 0.20/0.40 cnf(i_0_29, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). % 0.20/0.40 cnf(i_0_34, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). % 0.20/0.40 cnf(i_0_33, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). % 0.20/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.40 # Begin printing tableau % 0.20/0.40 # Found 9 steps % 0.20/0.40 cnf(i_0_60, negated_conjecture, (id(X5,esk22_2(esk8_2(esk21_0,X5),X5))|~r3(esk21_0,X5,esk8_2(esk21_0,X5))|~id(esk8_2(esk21_0,X5),esk8_2(esk21_0,X5))), inference(start_rule)). % 0.20/0.40 cnf(i_0_62, plain, (~r3(esk21_0,X5,esk8_2(esk21_0,X5))), inference(closure_rule, [i_0_36])). % 0.20/0.40 cnf(i_0_63, plain, (~id(esk8_2(esk21_0,X5),esk8_2(esk21_0,X5))), inference(closure_rule, [i_0_17])). % 0.20/0.40 cnf(i_0_61, plain, (id(X5,esk22_2(esk8_2(esk21_0,X5),X5))), inference(extension_rule, [i_0_33])). % 0.20/0.40 cnf(i_0_133, plain, (~r4(esk22_2(esk8_2(esk21_0,X5),X5),X6,esk12_2(esk22_2(esk8_2(esk21_0,X5),X5),X6))), inference(closure_rule, [i_0_41])). % 0.20/0.40 cnf(i_0_134, plain, (~id(esk12_2(esk22_2(esk8_2(esk21_0,X5),X5),X6),esk12_2(esk22_2(esk8_2(esk21_0,X5),X5),X6))), inference(closure_rule, [i_0_17])). % 0.20/0.40 cnf(i_0_135, plain, (~id(X6,X6)), inference(closure_rule, [i_0_17])). % 0.20/0.40 cnf(i_0_132, plain, (r4(X5,X6,esk12_2(esk22_2(esk8_2(esk21_0,X5),X5),X6))), inference(extension_rule, [i_0_16])). % 0.20/0.40 cnf(i_0_174, plain, (id(esk12_2(esk22_2(esk8_2(esk21_0,X5),X5),X6),esk4_2(X5,X6))), inference(etableau_closure_rule, [i_0_174, ...])). % 0.20/0.40 # End printing tableau % 0.20/0.40 # SZS output end % 0.20/0.40 # Branches closed with saturation will be mar# There were 1 total branch saturation attempts. % 0.20/0.40 # There were 0 of these attempts blocked. % 0.20/0.40 # There were 0 deferred branch saturation attempts. % 0.20/0.40 # There were 0 free duplicated saturations. % 0.20/0.40 # There were 1 total successful branch saturations. % 0.20/0.40 # There were 0 successful branch saturations in interreduction. % 0.20/0.40 # There were 0 successful branch saturations on the branch. % 0.20/0.40 # There were 1 successful branch saturations after the branch. % 0.20/0.40 ked with an "s" % 0.20/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.40 # Begin clausification derivation % 0.20/0.40 % 0.20/0.40 # End clausification derivation % 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.40 cnf(i_0_17, plain, (id(X1,X1))). % 0.20/0.40 cnf(i_0_48, plain, (r1(esk14_1(X1)))). % 0.20/0.40 cnf(i_0_53, plain, (r1(esk16_1(X1)))). % 0.20/0.40 cnf(i_0_50, plain, (r1(esk17_1(X1)))). % 0.20/0.40 cnf(i_0_49, plain, (id(esk13_1(X1),X1))). % 0.20/0.40 cnf(i_0_51, plain, (id(esk15_1(X1),esk17_1(X1)))). % 0.20/0.40 cnf(i_0_36, plain, (r3(X1,X2,esk8_2(X1,X2)))). % 0.20/0.40 cnf(i_0_39, plain, (r2(X1,esk7_2(X2,X1)))). % 0.20/0.40 cnf(i_0_44, plain, (r2(X1,esk11_2(X2,X1)))). % 0.20/0.40 cnf(i_0_47, plain, (r3(X1,esk14_1(X1),esk13_1(X1)))). % 0.20/0.40 cnf(i_0_41, plain, (r4(X1,X2,esk12_2(X1,X2)))). % 0.20/0.40 cnf(i_0_40, plain, (id(esk6_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.40 cnf(i_0_45, plain, (id(esk10_2(X1,X2),esk9_2(X1,X2)))). % 0.20/0.40 cnf(i_0_52, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))). % 0.20/0.40 cnf(i_0_38, plain, (r3(X1,esk7_2(X1,X2),esk6_2(X1,X2)))). % 0.20/0.40 cnf(i_0_42, plain, (r3(esk12_2(X1,X2),X1,esk9_2(X1,X2)))). % 0.20/0.41 cnf(i_0_37, plain, (r2(esk8_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.41 cnf(i_0_43, plain, (r4(X1,esk11_2(X1,X2),esk10_2(X1,X2)))). % 0.20/0.41 cnf(i_0_58, plain, (~r2(X1,X2)|~r1(X3)|~id(X3,X2))). % 0.20/0.41 cnf(i_0_4, plain, (id(X1,esk1_0)|~r1(X1))). % 0.20/0.41 cnf(i_0_1, plain, (r1(X1)|~id(X1,esk1_0))). % 0.20/0.41 cnf(i_0_18, plain, (id(X1,X2)|~id(X2,X1))). % 0.20/0.41 cnf(i_0_22, plain, (r1(X1)|~r1(X2)|~id(X2,X1))). % 0.20/0.41 cnf(i_0_21, plain, (r1(X1)|~r1(X2)|~id(X1,X2))). % 0.20/0.41 cnf(i_0_8, plain, (id(X1,esk2_1(X2))|~r2(X2,X1))). % 0.20/0.41 cnf(i_0_5, plain, (r2(X1,X2)|~id(X2,esk2_1(X1)))). % 0.20/0.41 cnf(i_0_55, plain, (r1(esk18_1(X1))|id(X1,esk20_1(X1)))). % 0.20/0.41 cnf(i_0_57, plain, (id(X1,esk20_1(X1))|id(X1,esk18_1(X1)))). % 0.20/0.41 cnf(i_0_9, plain, (r3(X1,X2,X3)|~id(X3,esk3_2(X1,X2)))). % 0.20/0.41 cnf(i_0_12, plain, (id(X1,esk3_2(X2,X3))|~r3(X2,X3,X1))). % 0.20/0.41 cnf(i_0_54, plain, (r2(esk19_1(X1),esk20_1(X1))|r1(esk18_1(X1)))). % 0.20/0.41 cnf(i_0_13, plain, (r4(X1,X2,X3)|~id(X3,esk4_2(X1,X2)))). % 0.20/0.41 cnf(i_0_16, plain, (id(X1,esk4_2(X2,X3))|~r4(X2,X3,X1))). % 0.20/0.41 cnf(i_0_19, plain, (id(X1,X2)|~id(X3,X2)|~id(X1,X3))). % 0.20/0.41 cnf(i_0_59, negated_conjecture, (r1(esk22_2(X1,X2))|~r3(esk21_0,X2,X3)|~id(X3,X1))). % 0.20/0.41 cnf(i_0_56, plain, (r2(esk19_1(X1),esk20_1(X1))|id(X1,esk18_1(X1)))). % 0.20/0.41 cnf(i_0_60, negated_conjecture, (id(X1,esk22_2(X2,X1))|~r3(esk21_0,X1,X3)|~id(X3,X2))). % 0.20/0.41 cnf(i_0_46, plain, (id(X1,X2)|~r2(X2,X3)|~r2(X1,X4)|~id(X4,X3))). % 0.20/0.41 cnf(i_0_26, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X4,X2)|~id(X3,X1))). % 0.20/0.41 cnf(i_0_25, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X2,X4)|~id(X1,X3))). % 0.20/0.41 cnf(i_0_30, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). % 0.20/0.41 cnf(i_0_29, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). % 0.20/0.41 cnf(i_0_34, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). % 0.20/0.41 cnf(i_0_33, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). % 0.20/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.41 # Begin printing tableau % 0.20/0.41 # Found 9 steps % 0.20/0.41 cnf(i_0_60, negated_conjecture, (id(X6,esk22_2(esk8_2(esk21_0,X6),X6))|~r3(esk21_0,X6,esk8_2(esk21_0,X6))|~id(esk8_2(esk21_0,X6),esk8_2(esk21_0,X6))), inference(start_rule)). % 0.20/0.41 cnf(i_0_62, plain, (~r3(esk21_0,X6,esk8_2(esk21_0,X6))), inference(closure_rule, [i_0_36])). % 0.20/0.41 cnf(i_0_63, plain, (~id(esk8_2(esk21_0,X6),esk8_2(esk21_0,X6))), inference(closure_rule, [i_0_17])). % 0.20/0.41 cnf(i_0_61, plain, (id(X6,esk22_2(esk8_2(esk21_0,X6),X6))), inference(extension_rule, [i_0_33])). % 0.20/0.41 cnf(i_0_133, plain, (~r4(X5,esk22_2(esk8_2(esk21_0,X6),X6),esk12_2(X5,esk22_2(esk8_2(esk21_0,X6),X6)))), inference(closure_rule, [i_0_41])). % 0.20/0.41 cnf(i_0_134, plain, (~id(esk12_2(X5,esk22_2(esk8_2(esk21_0,X6),X6)),esk12_2(X5,esk22_2(esk8_2(esk21_0,X6),X6)))), inference(closure_rule, [i_0_17])). % 0.20/0.41 cnf(i_0_136, plain, (~id(X5,X5)), inference(closure_rule, [i_0_17])). % 0.20/0.41 cnf(i_0_132, plain, (r4(X5,X6,esk12_2(X5,esk22_2(esk8_2(esk21_0,X6),X6)))), inference(extension_rule, [i_0_16])). % 0.20/0.41 cnf(i_0_174, plain, (id(esk12_2(X5,esk22_2(esk8_2(esk21_0,X6),X6)),esk4_2(X5,X6))), inference(etableau_closure_rule, [i_0_174, ...])). % 0.20/0.41 # End printing tableau % 0.20/0.41 # SZS output end % 0.20/0.41 # Branches closed with saturation will be mar# There were 1 total branch saturation attempts. % 0.20/0.41 # There were 0 of these attempts blocked. % 0.20/0.41 # There were 0 deferred branch saturation attempts. % 0.20/0.41 # There were 0 free duplicated saturations. % 0.20/0.41 # There were 1 total successful branch saturations. % 0.20/0.41 # There were 0 successful branch saturations in interreduction. % 0.20/0.41 # There were 0 successful branch saturations on the branch. % 0.20/0.41 # There were 1 successful branch saturations after the branch. % 0.20/0.41 ked with an "s" % 0.20/0.41 # There were 1 total branch saturation attempts. % 0.20/0.41 # There were 0 of these attempts blocked. % 0.20/0.41 # There were 0 deferred branch saturation attempts. % 0.20/0.41 # There were 0 free duplicated saturations. % 0.20/0.41 # There were 1 total successful branch saturations. % 0.20/0.41 # There were 0 successful branch saturations in interreduction. % 0.20/0.41 # There were 0 successful branch saturations on the branch. % 0.20/0.41 # There were 1 successful branch saturations after the branch. % 0.20/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.41 # Begin clausification derivation % 0.20/0.41 % 0.20/0.41 # End clausification derivation % 0.20/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.41 cnf(i_0_17, plain, (id(X1,X1))). % 0.20/0.41 cnf(i_0_48, plain, (r1(esk14_1(X1)))). % 0.20/0.41 cnf(i_0_53, plain, (r1(esk16_1(X1)))). % 0.20/0.41 cnf(i_0_50, plain, (r1(esk17_1(X1)))). % 0.20/0.41 cnf(i_0_49, plain, (id(esk13_1(X1),X1))). % 0.20/0.41 cnf(i_0_51, plain, (id(esk15_1(X1),esk17_1(X1)))). % 0.20/0.41 cnf(i_0_36, plain, (r3(X1,X2,esk8_2(X1,X2)))). % 0.20/0.41 cnf(i_0_39, plain, (r2(X1,esk7_2(X2,X1)))). % 0.20/0.41 cnf(i_0_44, plain, (r2(X1,esk11_2(X2,X1)))). % 0.20/0.41 cnf(i_0_47, plain, (r3(X1,esk14_1(X1),esk13_1(X1)))). % 0.20/0.41 cnf(i_0_41, plain, (r4(X1,X2,esk12_2(X1,X2)))). % 0.20/0.41 cnf(i_0_40, plain, (id(esk6_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.41 cnf(i_0_45, plain, (id(esk10_2(X1,X2),esk9_2(X1,X2)))). % 0.20/0.41 cnf(i_0_52, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))). % 0.20/0.41 cnf(i_0_38, plain, (r3(X1,esk7_2(X1,X2),esk6_2(X1,X2)))). % 0.20/0.41 cnf(i_0_42, plain, (r3(esk12_2(X1,X2),X1,esk9_2(X1,X2)))). % 0.20/0.41 cnf(i_0_37, plain, (r2(esk8_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.41 cnf(i_0_43, plain, (r4(X1,esk11_2(X1,X2),esk10_2(X1,X2)))). % 0.20/0.41 cnf(i_0_58, plain, (~r2(X1,X2)|~r1(X3)|~id(X3,X2))). % 0.20/0.41 cnf(i_0_4, plain, (id(X1,esk1_0)|~r1(X1))). % 0.20/0.41 cnf(i_0_1, plain, (r1(X1)|~id(X1,esk1_0))). % 0.20/0.41 cnf(i_0_18, plain, (id(X1,X2)|~id(X2,X1))). % 0.20/0.41 cnf(i_0_22, plain, (r1(X1)|~r1(X2)|~id(X2,X1))). % 0.20/0.41 cnf(i_0_21, plain, (r1(X1)|~r1(X2)|~id(X1,X2))). % 0.20/0.41 cnf(i_0_8, plain, (id(X1,esk2_1(X2))|~r2(X2,X1))). % 0.20/0.41 cnf(i_0_5, plain, (r2(X1,X2)|~id(X2,esk2_1(X1)))). % 0.20/0.41 cnf(i_0_55, plain, (r1(esk18_1(X1))|id(X1,esk20_1(X1)))). % 0.20/0.41 cnf(i_0_57, plain, (id(X1,esk20_1(X1))|id(X1,esk18_1(X1)))). % 0.20/0.41 cnf(i_0_9, plain, (r3(X1,X2,X3)|~id(X3,esk3_2(X1,X2)))). % 0.20/0.41 cnf(i_0_12, plain, (id(X1,esk3_2(X2,X3))|~r3(X2,X3,X1))). % 0.20/0.41 cnf(i_0_54, plain, (r2(esk19_1(X1),esk20_1(X1))|r1(esk18_1(X1)))). % 0.20/0.41 cnf(i_0_13, plain, (r4(X1,X2,X3)|~id(X3,esk4_2(X1,X2)))). % 0.20/0.41 cnf(i_0_16, plain, (id(X1,esk4_2(X2,X3))|~r4(X2,X3,X1))). % 0.20/0.41 cnf(i_0_19, plain, (id(X1,X2)|~id(X3,X2)|~id(X1,X3))). % 0.20/0.41 cnf(i_0_59, negated_conjecture, (r1(esk22_2(X1,X2))|~r3(esk21_0,X2,X3)|~id(X3,X1))). % 0.20/0.41 cnf(i_0_56, plain, (r2(esk19_1(X1),esk20_1(X1))|id(X1,esk18_1(X1)))). % 0.20/0.41 cnf(i_0_60, negated_conjecture, (id(X1,esk22_2(X2,X1))|~r3(esk21_0,X1,X3)|~id(X3,X2))). % 0.20/0.41 cnf(i_0_46, plain, (id(X1,X2)|~r2(X2,X3)|~r2(X1,X4)|~id(X4,X3))). % 0.20/0.41 cnf(i_0_26, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X4,X2)|~id(X3,X1))). % 0.20/0.41 cnf(i_0_25, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X2,X4)|~id(X1,X3))). % 0.20/0.41 cnf(i_0_30, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). % 0.20/0.41 cnf(i_0_29, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). % 0.20/0.41 cnf(i_0_34, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). % 0.20/0.41 cnf(i_0_33, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). % 0.20/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.41 # Begin printing tableau % 0.20/0.41 # Found 9 steps % 0.20/0.41 cnf(i_0_60, negated_conjecture, (id(X8,esk22_2(esk8_2(esk21_0,X8),X8))|~r3(esk21_0,X8,esk8_2(esk21_0,X8))|~id(esk8_2(esk21_0,X8),esk8_2(esk21_0,X8))), inference(start_rule)). % 0.20/0.41 cnf(i_0_62, plain, (~r3(esk21_0,X8,esk8_2(esk21_0,X8))), inference(closure_rule, [i_0_36])). % 0.20/0.41 cnf(i_0_63, plain, (~id(esk8_2(esk21_0,X8),esk8_2(esk21_0,X8))), inference(closure_rule, [i_0_17])). % 0.20/0.41 cnf(i_0_61, plain, (id(X8,esk22_2(esk8_2(esk21_0,X8),X8))), inference(extension_rule, [i_0_34])). % 0.20/0.41 cnf(i_0_128, plain, (~r4(X8,X6,esk12_2(X8,X6))), inference(closure_rule, [i_0_41])). % 0.20/0.41 cnf(i_0_129, plain, (~id(esk12_2(X8,X6),esk12_2(X8,X6))), inference(closure_rule, [i_0_17])). % 0.20/0.41 cnf(i_0_130, plain, (~id(X6,X6)), inference(closure_rule, [i_0_17])). % 0.20/0.41 cnf(i_0_127, plain, (r4(esk22_2(esk8_2(esk21_0,X8),X8),X6,esk12_2(X8,X6))), inference(extension_rule, [i_0_16])). % 0.20/0.41 cnf(i_0_174, plain, (id(esk12_2(X8,X6),esk4_2(esk22_2(esk8_2(esk21_0,X8),X8),X6))), inference(etableau_closure_rule, [i_0_174, ...])). % 0.20/0.41 # End printing tableau % 0.20/0.41 # SZS output end % 0.20/0.41 # Branches closed with saturation will be marked with an "s" % 0.20/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.41 # Begin clausification derivation % 0.20/0.41 % 0.20/0.41 # End clausification derivation % 0.20/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.41 cnf(i_0_17, plain, (id(X1,X1))). % 0.20/0.41 cnf(i_0_48, plain, (r1(esk14_1(X1)))). % 0.20/0.41 cnf(i_0_53, plain, (r1(esk16_1(X1)))). % 0.20/0.41 cnf(i_0_50, plain, (r1(esk17_1(X1)))). % 0.20/0.41 cnf(i_0_49, plain, (id(esk13_1(X1),X1))). % 0.20/0.41 cnf(i_0_51, plain, (id(esk15_1(X1),esk17_1(X1)))). % 0.20/0.41 cnf(i_0_36, plain, (r3(X1,X2,esk8_2(X1,X2)))). % 0.20/0.41 cnf(i_0_39, plain, (r2(X1,esk7_2(X2,X1)))). % 0.20/0.41 cnf(i_0_44, plain, (r2(X1,esk11_2(X2,X1)))). % 0.20/0.41 cnf(i_0_47, plain, (r3(X1,esk14_1(X1),esk13_1(X1)))). % 0.20/0.41 cnf(i_0_41, plain, (r4(X1,X2,esk12_2(X1,X2)))). % 0.20/0.41 cnf(i_0_40, plain, (id(esk6_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.41 cnf(i_0_45, plain, (id(esk10_2(X1,X2),esk9_2(X1,X2)))). % 0.20/0.41 cnf(i_0_52, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))). % 0.20/0.41 cnf(i_0_38, plain, (r3(X1,esk7_2(X1,X2),esk6_2(X1,X2)))). % 0.20/0.41 cnf(i_0_42, plain, (r3(esk12_2(X1,X2),X1,esk9_2(X1,X2)))). % 0.20/0.41 cnf(i_0_37, plain, (r2(esk8_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.41 cnf(i_0_43, plain, (r4(X1,esk11_2(X1,X2),esk10_2(X1,X2)))). % 0.20/0.41 cnf(i_0_58, plain, (~r2(X1,X2)|~r1(X3)|~id(X3,X2))). % 0.20/0.41 cnf(i_0_4, plain, (id(X1,esk1_0)|~r1(X1))). % 0.20/0.41 cnf(i_0_1, plain, (r1(X1)|~id(X1,esk1_0))). % 0.20/0.41 cnf(i_0_18, plain, (id(X1,X2)|~id(X2,X1))). % 0.20/0.41 cnf(i_0_22, plain, (r1(X1)|~r1(X2)|~id(X2,X1))). % 0.20/0.41 cnf(i_0_21, plain, (r1(X1)|~r1(X2)|~id(X1,X2))). % 0.20/0.41 cnf(i_0_8, plain, (id(X1,esk2_1(X2))|~r2(X2,X1))). % 0.20/0.41 cnf(i_0_5, plain, (r2(X1,X2)|~id(X2,esk2_1(X1)))). % 0.20/0.41 cnf(i_0_55, plain, (r1(esk18_1(X1))|id(X1,esk20_1(X1)))). % 0.20/0.41 cnf(i_0_57, plain, (id(X1,esk20_1(X1))|id(X1,esk18_1(X1)))). % 0.20/0.41 cnf(i_0_9, plain, (r3(X1,X2,X3)|~id(X3,esk3_2(X1,X2)))). % 0.20/0.41 cnf(i_0_12, plain, (id(X1,esk3_2(X2,X3))|~r3(X2,X3,X1))). % 0.20/0.41 cnf(i_0_54, plain, (r2(esk19_1(X1),esk20_1(X1))|r1(esk18_1(X1)))). % 0.20/0.41 cnf(i_0_13, plain, (r4(X1,X2,X3)|~id(X3,esk4_2(X1,X2)))). % 0.20/0.41 cnf(i_0_16, plain, (id(X1,esk4_2(X2,X3))|~r4(X2,X3,X1))). % 0.20/0.41 cnf(i_0_19, plain, (id(X1,X2)|~id(X3,X2)|~id(X1,X3))). % 0.20/0.41 cnf(i_0_59, negated_conjecture, (r1(esk22_2(X1,X2))|~r3(esk21_0,X2,X3)|~id(X3,X1))). % 0.20/0.41 cnf(i_0_56, plain, (r2(esk19_1(X1),esk20_1(X1))|id(X1,esk18_1(X1)))). % 0.20/0.41 cnf(i_0_60, negated_conjecture, (id(X1,esk22_2(X2,X1))|~r3(esk21_0,X1,X3)|~id(X3,X2))). % 0.20/0.41 cnf(i_0_46, plain, (id(X1,X2)|~r2(X2,X3)|~r2(X1,X4)|~id(X4,X3))). % 0.20/0.41 cnf(i_0_26, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X4,X2)|~id(X3,X1))). % 0.20/0.41 cnf(i_0_25, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X2,X4)|~id(X1,X3))). % 0.20/0.41 cnf(i_0_30, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). % 0.20/0.41 cnf(i_0_29, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). % 0.20/0.41 cnf(i_0_34, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). % 0.20/0.41 cnf(i_0_33, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). % 0.20/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.41 # Begin printing tableau % 0.20/0.41 # Found 9 steps % 0.20/0.41 cnf(i_0_60, negated_conjecture, (id(X7,esk22_2(esk8_2(esk21_0,X7),X7))|~r3(esk21_0,X7,esk8_2(esk21_0,X7))|~id(esk8_2(esk21_0,X7),esk8_2(esk21_0,X7))), inference(start_rule)). % 0.20/0.41 cnf(i_0_62, plain, (~r3(esk21_0,X7,esk8_2(esk21_0,X7))), inference(closure_rule, [i_0_36])). % 0.20/0.41 cnf(i_0_63, plain, (~id(esk8_2(esk21_0,X7),esk8_2(esk21_0,X7))), inference(closure_rule, [i_0_17])). % 0.20/0.41 cnf(i_0_61, plain, (id(X7,esk22_2(esk8_2(esk21_0,X7),X7))), inference(extension_rule, [i_0_34])). % 0.20/0.41 cnf(i_0_128, plain, (~r4(X5,X7,esk12_2(X5,X7))), inference(closure_rule, [i_0_41])). % 0.20/0.41 cnf(i_0_129, plain, (~id(esk12_2(X5,X7),esk12_2(X5,X7))), inference(closure_rule, [i_0_17])). % 0.20/0.41 cnf(i_0_131, plain, (~id(X5,X5)), inference(closure_rule, [i_0_17])). % 0.20/0.41 cnf(i_0_127, plain, (r4(X5,esk22_2(esk8_2(esk21_0,X7),X7),esk12_2(X5,X7))), inference(extension_rule, [i_0_16])). % 0.20/0.41 cnf(i_0_174, plain, (id(esk12_2(X5,X7),esk4_2(X5,esk22_2(esk8_2(esk21_0,X7),X7)))), inference(etableau_closure_rule, [i_0_174, ...])). % 0.20/0.41 # End printing tableau % 0.20/0.41 # SZS output end % 0.20/0.41 # Branches closed with saturation will be marked with an "s" % 0.20/0.41 # Child (17762) has found a proof. % 0.20/0.41 % 0.20/0.41 # Proof search is over... % 0.20/0.41 # Freeing feature tree %------------------------------------------------------------------------------