%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU261+1 : TPTP v8.1.0. Released v3.3.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 : n015.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 : Tue Jul 19 09:25:18 EDT 2022 % Result : Theorem 0.13s 0.38s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SEU261+1 : TPTP v8.1.0. Released v3.3.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n015.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sun Jun 19 16:21:29 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PS_S0Y % 0.13/0.36 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 21 Number of unprocessed: 21 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 21 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 7 conjectures. % 0.13/0.37 # There are 7 start rule candidates: % 0.13/0.37 # Found 9 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 7 start rule tableaux created. % 0.13/0.37 # 12 extension rule candidate clauses % 0.13/0.37 # 9 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 7 % 0.13/0.37 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 11 tableaux to operate on % 0.13/0.38 # There were 5 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 5 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 5 successful branch saturations after the branch. % 0.13/0.38 # There were 5 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 5 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 5 successful branch saturations after the branch. % 0.13/0.38 # There were 5 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 5 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 5 successful branch saturations after the branch. % 0.13/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_16, negated_conjecture, (relation(esk2_0))). % 0.13/0.38 cnf(i_0_15, negated_conjecture, (relation(esk3_0))). % 0.13/0.38 cnf(i_0_14, negated_conjecture, (relation(esk4_0))). % 0.13/0.38 cnf(i_0_12, negated_conjecture, (well_ordering(esk2_0))). % 0.13/0.38 cnf(i_0_8, plain, (relation(esk1_0))). % 0.13/0.38 cnf(i_0_13, negated_conjecture, (function(esk4_0))). % 0.13/0.38 cnf(i_0_7, plain, (function(esk1_0))). % 0.13/0.38 cnf(i_0_11, negated_conjecture, (relation_isomorphism(esk2_0,esk3_0,esk4_0))). % 0.13/0.38 cnf(i_0_10, negated_conjecture, (~well_ordering(esk3_0))). % 0.13/0.38 cnf(i_0_6, plain, (reflexive(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_5, plain, (transitive(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_4, plain, (antisymmetric(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_3, plain, (connected(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_2, plain, (well_founded_relation(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_21, plain, (reflexive(X1)|~epred1_2(X1,X2)|~reflexive(X2))). % 0.13/0.38 cnf(i_0_20, plain, (transitive(X1)|~epred1_2(X1,X2)|~transitive(X2))). % 0.13/0.38 cnf(i_0_18, plain, (antisymmetric(X1)|~epred1_2(X1,X2)|~antisymmetric(X2))). % 0.13/0.38 cnf(i_0_19, plain, (connected(X1)|~epred1_2(X1,X2)|~connected(X2))). % 0.13/0.38 cnf(i_0_17, plain, (well_founded_relation(X1)|~epred1_2(X1,X2)|~well_founded_relation(X2))). % 0.13/0.38 cnf(i_0_1, plain, (well_ordering(X1)|~well_founded_relation(X1)|~connected(X1)|~antisymmetric(X1)|~transitive(X1)|~reflexive(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_9, plain, (epred1_2(X1,X2)|~relation_isomorphism(X2,X1,X3)|~function(X3)|~relation(X3)|~relation(X1)|~relation(X2))). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 12 steps % 0.13/0.38 cnf(i_0_12, negated_conjecture, (well_ordering(esk2_0)), inference(start_rule)). % 0.13/0.38 cnf(i_0_25, plain, (well_ordering(esk2_0)), inference(extension_rule, [i_0_3])). % 0.13/0.38 cnf(i_0_169, plain, (~relation(esk2_0)), inference(closure_rule, [i_0_16])). % 0.13/0.38 cnf(i_0_167, plain, (connected(esk2_0)), inference(extension_rule, [i_0_19])). % 0.13/0.38 cnf(i_0_225, plain, (connected(esk3_0)), inference(extension_rule, [i_0_1])). % 0.13/0.38 cnf(i_0_255, plain, (well_ordering(esk3_0)), inference(closure_rule, [i_0_10])). % 0.13/0.38 cnf(i_0_261, plain, (~relation(esk3_0)), inference(closure_rule, [i_0_15])). % 0.13/0.38 cnf(i_0_226, plain, (~epred1_2(esk3_0,esk2_0)), inference(etableau_closure_rule, [i_0_226, ...])). % 0.13/0.38 cnf(i_0_256, plain, (~well_founded_relation(esk3_0)), inference(etableau_closure_rule, [i_0_256, ...])). % 0.13/0.38 cnf(i_0_258, plain, (~antisymmetric(esk3_0)), inference(etableau_closure_rule, [i_0_258, ...])). % 0.13/0.38 cnf(i_0_259, plain, (~transitive(esk3_0)), inference(etableau_closure_rule, [i_0_259, ...])). % 0.13/0.38 cnf(i_0_260, plain, (~reflexive(esk3_0)), inference(etableau_closure_rule, [i_0_260, ...])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_16, negated_conjecture, (relation(esk2_0))). % 0.13/0.38 cnf(i_0_15, negated_conjecture, (relation(esk3_0))). % 0.13/0.38 cnf(i_0_14, negated_conjecture, (relation(esk4_0))). % 0.13/0.38 cnf(i_0_12, negated_conjecture, (well_ordering(esk2_0))). % 0.13/0.38 cnf(i_0_8, plain, (relation(esk1_0))). % 0.13/0.38 cnf(i_0_13, negated_conjecture, (function(esk4_0))). % 0.13/0.38 cnf(i_0_7, plain, (function(esk1_0))). % 0.13/0.38 cnf(i_0_11, negated_conjecture, (relation_isomorphism(esk2_0,esk3_0,esk4_0))). % 0.13/0.38 cnf(i_0_10, negated_conjecture, (~well_ordering(esk3_0))). % 0.13/0.38 cnf(i_0_6, plain, (reflexive(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_5, plain, (transitive(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_4, plain, (antisymmetric(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_3, plain, (connected(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_2, plain, (well_founded_relation(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_21, plain, (reflexive(X1)|~epred1_2(X1,X2)|~reflexive(X2))). % 0.13/0.38 cnf(i_0_20, plain, (transitive(X1)|~epred1_2(X1,X2)|~transitive(X2))). % 0.13/0.38 cnf(i_0_18, plain, (antisymmetric(X1)|~epred1_2(X1,X2)|~antisymmetric(X2))). % 0.13/0.38 cnf(i_0_19, plain, (connected(X1)|~epred1_2(X1,X2)|~connected(X2))). % 0.13/0.38 cnf(i_0_17, plain, (well_founded_relation(X1)|~epred1_2(X1,X2)|~well_founded_relation(X2))). % 0.13/0.38 cnf(i_0_1, plain, (well_ordering(X1)|~well_founded_relation(X1)|~connected(X1)|~antisymmetric(X1)|~transitive(X1)|~reflexive(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_9, plain, (epred1_2(X1,X2)|~relation_isomorphism(X2,X1,X3)|~function(X3)|~relation(X3)|~relation(X1)|~relation(X2))). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 12 steps % 0.13/0.38 cnf(i_0_12, negated_conjecture, (well_ordering(esk2_0)), inference(start_rule)). % 0.13/0.38 cnf(i_0_25, plain, (well_ordering(esk2_0)), inference(extension_rule, [i_0_2])). % 0.13/0.38 cnf(i_0_172, plain, (~relation(esk2_0)), inference(closure_rule, [i_0_16])). % 0.13/0.38 cnf(i_0_170, plain, (well_founded_relation(esk2_0)), inference(extension_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_228, plain, (well_founded_relation(esk3_0)), inference(extension_rule, [i_0_1])). % 0.13/0.38 cnf(i_0_258, plain, (well_ordering(esk3_0)), inference(closure_rule, [i_0_10])). % 0.13/0.38 cnf(i_0_264, plain, (~relation(esk3_0)), inference(closure_rule, [i_0_15])). % 0.13/0.38 cnf(i_0_229, plain, (~epred1_2(esk3_0,esk2_0)), inference(etableau_closure_rule, [i_0_229, ...])). % 0.13/0.38 cnf(i_0_260, plain, (~connected(esk3_0)), inference(etableau_closure_rule, [i_0_260, ...])). % 0.13/0.38 cnf(i_0_261, plain, (~antisymmetric(esk3_0)), inference(etableau_closure_rule, [i_0_261, ...])). % 0.13/0.38 cnf(i_0_262, plain, (~transitive(esk3_0)), inference(etableau_closure_rule, [i_0_262, ...])). % 0.13/0.38 cnf(i_0_263, plain, (~reflexive(esk3_0)), inference(etableau_closure_rule, [i_0_263, ...])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # There were 5 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 5 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 5 successful branch saturations after the branch. % 0.13/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_16, negated_conjecture, (relation(esk2_0))). % 0.13/0.38 cnf(i_0_15, negated_conjecture, (relation(esk3_0))). % 0.13/0.38 cnf(i_0_14, negated_conjecture, (relation(esk4_0))). % 0.13/0.38 cnf(i_0_12, negated_conjecture, (well_ordering(esk2_0))). % 0.13/0.38 cnf(i_0_8, plain, (relation(esk1_0))). % 0.13/0.38 cnf(i_0_13, negated_conjecture, (function(esk4_0))). % 0.13/0.38 cnf(i_0_7, plain, (function(esk1_0))). % 0.13/0.38 cnf(i_0_11, negated_conjecture, (relation_isomorphism(esk2_0,esk3_0,esk4_0))). % 0.13/0.38 cnf(i_0_10, negated_conjecture, (~well_ordering(esk3_0))). % 0.13/0.38 cnf(i_0_6, plain, (reflexive(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_5, plain, (transitive(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_4, plain, (antisymmetric(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_3, plain, (connected(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_2, plain, (well_founded_relation(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_21, plain, (reflexive(X1)|~epred1_2(X1,X2)|~reflexive(X2))). % 0.13/0.38 cnf(i_0_20, plain, (transitive(X1)|~epred1_2(X1,X2)|~transitive(X2))). % 0.13/0.38 cnf(i_0_18, plain, (antisymmetric(X1)|~epred1_2(X1,X2)|~antisymmetric(X2))). % 0.13/0.38 cnf(i_0_19, plain, (connected(X1)|~epred1_2(X1,X2)|~connected(X2))). % 0.13/0.38 cnf(i_0_17, plain, (well_founded_relation(X1)|~epred1_2(X1,X2)|~well_founded_relation(X2))). % 0.13/0.38 cnf(i_0_1, plain, (well_ordering(X1)|~well_founded_relation(X1)|~connected(X1)|~antisymmetric(X1)|~transitive(X1)|~reflexive(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_9, plain, (epred1_2(X1,X2)|~relation_isomorphism(X2,X1,X3)|~function(X3)|~relation(X3)|~relation(X1)|~relation(X2))). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 12 steps % 0.13/0.38 cnf(i_0_12, negated_conjecture, (well_ordering(esk2_0)), inference(start_rule)). % 0.13/0.38 cnf(i_0_25, plain, (well_ordering(esk2_0)), inference(extension_rule, [i_0_4])). % 0.13/0.38 cnf(i_0_166, plain, (~relation(esk2_0)), inference(closure_rule, [i_0_16])). % 0.13/0.38 cnf(i_0_164, plain, (antisymmetric(esk2_0)), inference(extension_rule, [i_0_18])). % 0.13/0.38 cnf(i_0_222, plain, (antisymmetric(esk3_0)), inference(extension_rule, [i_0_1])). % 0.13/0.38 cnf(i_0_252, plain, (well_ordering(esk3_0)), inference(closure_rule, [i_0_10])). % 0.13/0.38 cnf(i_0_258, plain, (~relation(esk3_0)), inference(closure_rule, [i_0_15])). % 0.13/0.38 cnf(i_0_223, plain, (~epred1_2(esk3_0,esk2_0)), inference(etableau_closure_rule, [i_0_223, ...])). % 0.13/0.38 cnf(i_0_253, plain, (~well_founded_relation(esk3_0)), inference(etableau_closure_rule, [i_0_253, ...])). % 0.13/0.38 cnf(i_0_254, plain, (~connected(esk3_0)), inference(etableau_closure_rule, [i_0_254, ...])). % 0.13/0.38 cnf(i_0_256, plain, (~transitive(esk3_0)), inference(etableau_closure_rule, [i_0_256, ...])). % 0.13/0.38 cnf(i_0_257, plain, (~reflexive(esk3_0)), inference(etableau_closure_rule, [i_0_257, ...])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # There were 5 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 5 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 5 successful branch saturations after the branch. % 0.13/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_16, negated_conjecture, (relation(esk2_0))). % 0.13/0.38 cnf(i_0_15, negated_conjecture, (relation(esk3_0))). % 0.13/0.38 cnf(i_0_14, negated_conjecture, (relation(esk4_0))). % 0.13/0.38 cnf(i_0_12, negated_conjecture, (well_ordering(esk2_0))). % 0.13/0.38 cnf(i_0_8, plain, (relation(esk1_0))). % 0.13/0.38 cnf(i_0_13, negated_conjecture, (function(esk4_0))). % 0.13/0.38 cnf(i_0_7, plain, (function(esk1_0))). % 0.13/0.38 cnf(i_0_11, negated_conjecture, (relation_isomorphism(esk2_0,esk3_0,esk4_0))). % 0.13/0.38 cnf(i_0_10, negated_conjecture, (~well_ordering(esk3_0))). % 0.13/0.38 cnf(i_0_6, plain, (reflexive(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_5, plain, (transitive(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_4, plain, (antisymmetric(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_3, plain, (connected(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_2, plain, (well_founded_relation(X1)|~well_ordering(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_21, plain, (reflexive(X1)|~epred1_2(X1,X2)|~reflexive(X2))). % 0.13/0.38 cnf(i_0_20, plain, (transitive(X1)|~epred1_2(X1,X2)|~transitive(X2))). % 0.13/0.38 cnf(i_0_18, plain, (antisymmetric(X1)|~epred1_2(X1,X2)|~antisymmetric(X2))). % 0.13/0.38 cnf(i_0_19, plain, (connected(X1)|~epred1_2(X1,X2)|~connected(X2))). % 0.13/0.38 cnf(i_0_17, plain, (well_founded_relation(X1)|~epred1_2(X1,X2)|~well_founded_relation(X2))). % 0.13/0.38 cnf(i_0_1, plain, (well_ordering(X1)|~well_founded_relation(X1)|~connected(X1)|~antisymmetric(X1)|~transitive(X1)|~reflexive(X1)|~relation(X1))). % 0.13/0.38 cnf(i_0_9, plain, (epred1_2(X1,X2)|~relation_isomorphism(X2,X1,X3)|~function(X3)|~relation(X3)|~relation(X1)|~relation(X2))). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 12 steps % 0.13/0.38 cnf(i_0_12, negated_conjecture, (well_ordering(esk2_0)), inference(start_rule)). % 0.13/0.38 cnf(i_0_25, plain, (well_ordering(esk2_0)), inference(extension_rule, [i_0_5])). % 0.13/0.38 cnf(i_0_163, plain, (~relation(esk2_0)), inference(closure_rule, [i_0_16])). % 0.13/0.38 cnf(i_0_161, plain, (transitive(esk2_0)), inference(extension_rule, [i_0_20])). % 0.13/0.38 cnf(i_0_219, plain, (transitive(esk3_0)), inference(extension_rule, [i_0_1])). % 0.13/0.38 cnf(i_0_249, plain, (well_ordering(esk3_0)), inference(closure_rule, [i_0_10])). % 0.13/0.38 cnf(i_0_255, plain, (~relation(esk3_0)), inference(closure_rule, [i_0_15])). % 0.13/0.38 cnf(i_0_220, plain, (~epred1_2(esk3_0,esk2_0)), inference(etableau_closure_rule, [i_0_220, ...])). % 0.13/0.38 cnf(i_0_250, plain, (~well_founded_relation(esk3_0)), inference(etableau_closure_rule, [i_0_250, ...])). % 0.13/0.38 cnf(i_0_251, plain, (~connected(esk3_0)), inference(etableau_closure_rule, [i_0_251, ...])). % 0.13/0.38 cnf(i_0_252, plain, (~antisymmetric(esk3_0)), inference(etableau_closure_rule, [i_0_252, ...])). % 0.13/0.38 cnf(i_0_254, plain, (~reflexive(esk3_0)), inference(etableau_closure_rule, [i_0_254, ...])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Child (3582) has found a proof. % 0.13/0.38 % 0.13/0.38 # Proof search is over... % 0.13/0.38 # Freeing feature tree %------------------------------------------------------------------------------