%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT075+1 : TPTP v9.3.1. Bugfixed v9.3.1. % 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 : n008.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Tue Sep 8 06:09:53 AM UTC 2026 % Result : Theorem 0.12s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT075+1 : TPTP v9.3.1. Bugfixed v9.3.1. % 0.00/0.04 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.07/0.34 % Computer : n008.cluster.edu % 0.07/0.34 % Model : x86_64 x86_64 % 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.34 % Memory : 8046.5625MB % 0.07/0.34 % OS : Linux 6.8.0-71-generic % 0.07/0.34 % CPULimit : 300 % 0.07/0.34 % WCLimit : 300 % 0.07/0.34 % DateTime : Mon Sep 7 14:11:53 UTC 2026 % 0.07/0.35 % CPUTime : % 0.12/0.38 # No SInE strategy applied % 0.12/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N % 0.12/0.38 # and selection function SelectUnlessUniqMax. % 0.12/0.38 # % 0.12/0.38 # Presaturation interreduction done % 0.12/0.38 # Number of axioms: 51 Number of unprocessed: 50 % 0.12/0.38 # Tableaux proof search. % 0.12/0.38 # APR header successfully linked. % 0.12/0.38 # Hello from C++ % 0.12/0.38 # The folding up rule is enabled... % 0.12/0.38 # Local unification is enabled... % 0.12/0.38 # Any saturation attempts will use folding labels... % 0.12/0.38 # 50 beginning clauses after preprocessing and clausification % 0.12/0.38 # Creating start rules for all 2 conjectures. % 0.12/0.38 # There are 2 start rule candidates: % 0.12/0.38 # Found 15 unit axioms. % 0.12/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.38 # 2 start rule tableaux created. % 0.12/0.38 # 35 extension rule candidate clauses % 0.12/0.38 # 15 unit axiom clauses % 0.12/0.38 % 0.12/0.38 # Requested 8, 32 cores available to the main process. % 0.12/0.38 # There are not enough tableaux to fork, creating more from the initial 2 % 0.12/0.38 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.12/0.38 # We now have 13 tableaux to operate on % 0.12/0.39 # There were 1 total branch saturation attempts. % 0.12/0.39 # There were 0 of these attempts blocked. % 0.12/0.39 # There were 0 deferred branch saturation attempts. % 0.12/0.39 # There were 0 free duplicated saturations. % 0.12/0.39 # There were 1 total successful branch saturations. % 0.12/0.39 # There were 0 successful branch saturations in interreduction. % 0.12/0.39 # There were 0 successful branch saturations on the branch. % 0.12/0.39 # There were 1 successful branch saturations after the branch. % 0.12/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.39 # Begin clausification derivation % 0.12/0.39 % 0.12/0.39 # End clausification derivation % 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.39 cnf(i_0_50, negated_conjecture, (leq(v600,esk4_0))). % 0.12/0.39 cnf(i_0_51, negated_conjecture, (in_open(esk4_0,v0,v600))). % 0.12/0.39 cnf(i_0_46, plain, (val(v0))). % 0.12/0.39 cnf(i_0_33, plain, (is_verdict(conflict))). % 0.12/0.39 cnf(i_0_34, plain, (is_verdict(compatible))). % 0.12/0.39 cnf(i_0_35, plain, (is_verdict(unknown))). % 0.12/0.39 cnf(i_0_47, plain, (val(v600))). % 0.12/0.39 cnf(i_0_48, plain, (less(v0,v600))). % 0.12/0.39 cnf(i_0_4, plain, (leq(X1,X1))). % 0.12/0.39 cnf(i_0_42, plain, (box_verdict(compatible,compatible)=compatible)). % 0.12/0.39 cnf(i_0_49, plain, (v0!=v600)). % 0.12/0.39 cnf(i_0_36, plain, (compatible!=conflict)). % 0.12/0.39 cnf(i_0_37, plain, (unknown!=conflict)). % 0.12/0.39 cnf(i_0_38, plain, (compatible!=unknown)). % 0.12/0.39 cnf(i_0_1, plain, (~less(X1,X1))). % 0.12/0.39 cnf(i_0_5, plain, (leq(X1,X2)|~less(X1,X2))). % 0.12/0.39 cnf(i_0_39, plain, (X1=unknown|X1=compatible|X1=conflict|~is_verdict(X1))). % 0.12/0.39 cnf(i_0_17, plain, (less(X1,X2)|~in_lopen(X2,X1,X3))). % 0.12/0.39 cnf(i_0_19, plain, (less(X1,X2)|~in_ropen(X1,X3,X2))). % 0.12/0.39 cnf(i_0_23, plain, (less(X1,X2)|~in_open(X2,X1,X3))). % 0.12/0.39 cnf(i_0_22, plain, (less(X1,X2)|~in_open(X1,X3,X2))). % 0.12/0.39 cnf(i_0_14, plain, (leq(X1,X2)|~in_closed(X2,X1,X3))). % 0.12/0.39 cnf(i_0_13, plain, (leq(X1,X2)|~in_closed(X1,X3,X2))). % 0.12/0.39 cnf(i_0_16, plain, (leq(X1,X2)|~in_lopen(X1,X3,X2))). % 0.12/0.39 cnf(i_0_20, plain, (leq(X1,X2)|~in_ropen(X2,X1,X3))). % 0.12/0.39 cnf(i_0_7, plain, (X1=X2|~leq(X2,X1)|~leq(X1,X2))). % 0.12/0.39 cnf(i_0_3, plain, (X1=X2|less(X1,X2)|less(X2,X1))). % 0.12/0.39 cnf(i_0_6, plain, (X1=X2|less(X1,X2)|~leq(X1,X2))). % 0.12/0.39 cnf(i_0_12, plain, (in_closed(X1,X2,X3)|~leq(X1,X3)|~leq(X2,X1))). % 0.12/0.39 cnf(i_0_15, plain, (in_lopen(X1,X2,X3)|~leq(X1,X3)|~less(X2,X1))). % 0.12/0.39 cnf(i_0_18, plain, (in_ropen(X1,X2,X3)|~leq(X2,X1)|~less(X1,X3))). % 0.12/0.39 cnf(i_0_21, plain, (in_open(X1,X2,X3)|~less(X1,X3)|~less(X2,X1))). % 0.12/0.39 cnf(i_0_40, plain, (box_verdict(X1,conflict)=conflict|~is_verdict(X1))). % 0.12/0.39 cnf(i_0_11, plain, (leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3))). % 0.12/0.39 cnf(i_0_41, plain, (box_verdict(conflict,X1)=conflict|~is_verdict(X1))). % 0.12/0.39 cnf(i_0_2, plain, (less(X1,X2)|~less(X3,X2)|~less(X1,X3))). % 0.12/0.39 cnf(i_0_9, plain, (less(X1,X2)|~leq(X1,X3)|~less(X3,X2))). % 0.12/0.39 cnf(i_0_10, plain, (less(X1,X2)|~leq(X3,X2)|~less(X1,X3))). % 0.12/0.39 cnf(i_0_26, plain, (~axis_conflict(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.12/0.39 cnf(i_0_43, plain, (box_verdict(X1,unknown)=unknown|X1=conflict|~is_verdict(X1))). % 0.12/0.39 cnf(i_0_30, plain, (axis_subsumes(X1,X2,X3,X4)|~in_closed(esk3_4(X1,X2,X3,X4),X3,X4))). % 0.12/0.39 cnf(i_0_44, plain, (box_verdict(unknown,X1)=unknown|X1=conflict|~is_verdict(X1))). % 0.12/0.39 cnf(i_0_45, plain, (box_verdict(X1,X2)=unknown|box_verdict(X1,X2)=compatible|box_verdict(X1,X2)=conflict|~is_verdict(X2)|~is_verdict(X1))). % 0.12/0.39 cnf(i_0_24, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(esk1_4(X1,X2,X3,X4),X3,X4))). % 0.12/0.39 cnf(i_0_32, plain, (in_closed(X1,X2,X3)|~axis_subsumes(X4,X5,X2,X3)|~in_closed(X1,X4,X5))). % 0.12/0.39 cnf(i_0_27, plain, (axis_compatible(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.12/0.39 cnf(i_0_28, plain, (in_closed(esk2_4(X1,X2,X3,X4),X3,X4)|~axis_compatible(X1,X2,X3,X4))). % 0.12/0.39 cnf(i_0_29, plain, (in_closed(esk2_4(X1,X2,X3,X4),X1,X2)|~axis_compatible(X1,X2,X3,X4))). % 0.12/0.39 cnf(i_0_25, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(esk1_4(X1,X2,X3,X4),X1,X2))). % 0.12/0.39 cnf(i_0_31, plain, (axis_subsumes(X1,X2,X3,X4)|in_closed(esk3_4(X1,X2,X3,X4),X1,X2))). % 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.39 # Begin printing tableau % 0.12/0.39 # Found 4 steps % 0.12/0.39 cnf(i_0_51, negated_conjecture, (in_open(esk4_0,v0,v600)), inference(start_rule)). % 0.12/0.39 cnf(i_0_59, plain, (in_open(esk4_0,v0,v600)), inference(extension_rule, [i_0_23])). % 0.12/0.39 cnf(i_0_71, plain, (less(v0,esk4_0)), inference(extension_rule, [i_0_5])). % 0.12/0.39 cnf(i_0_334, plain, (leq(v0,esk4_0)), inference(etableau_closure_rule, [i_0_334, ...])). % 0.12/0.39 # End printing tableau % 0.12/0.39 # SZS output end % 0.12/0.39 # Branches closed with saturation will be marked with an "s" % 0.12/0.39 # There were 1 total branch saturation attempts. % 0.12/0.39 # There were 0 of these attempts blocked. % 0.12/0.39 # There were 0 deferred branch saturation attempts. % 0.12/0.39 # There were 0 free duplicated saturations. % 0.12/0.39 # There were 1 total successful branch saturations. % 0.12/0.39 # There were 0 successful branch saturations in interreduction. % 0.12/0.39 # There were 0 successful branch saturations on the branch. % 0.12/0.39 # There were 1 successful branch saturations after the branch. % 0.12/0.39 # There were 1 total branch saturation attempts. % 0.12/0.39 # There were 0 of these attempts blocked. % 0.12/0.39 # There were 0 deferred branch saturation attempts. % 0.12/0.39 # There were 0 free duplicated saturations. % 0.12/0.39 # There were 1 total successful branch saturations. % 0.12/0.39 # There were 0 successful branch saturations in interreduction. % 0.12/0.39 # There were 0 successful branch saturations on the branch. % 0.12/0.39 # There were 1 successful branch saturations after the branch. % 0.12/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.39 # Begin clausification derivation % 0.12/0.39 % 0.12/0.39 # End clausification derivation % 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.39 cnf(i_0_50, negated_conjecture, (leq(v600,esk4_0))). % 0.12/0.39 cnf(i_0_51, negated_conjecture, (in_open(esk4_0,v0,v600))). % 0.12/0.39 cnf(i_0_46, plain, (val(v0))). % 0.12/0.39 cnf(i_0_33, plain, (is_verdict(conflict))). % 0.12/0.39 cnf(i_0_34, plain, (is_verdict(compatible))). % 0.12/0.39 cnf(i_0_35, plain, (is_verdict(unknown))). % 0.12/0.39 cnf(i_0_47, plain, (val(v600))). % 0.12/0.39 cnf(i_0_48, plain, (less(v0,v600))). % 0.12/0.39 cnf(i_0_4, plain, (leq(X1,X1))). % 0.12/0.39 cnf(i_0_42, plain, (box_verdict(compatible,compatible)=compatible)). % 0.12/0.39 cnf(i_0_49, plain, (v0!=v600)). % 0.12/0.39 cnf(i_0_36, plain, (compatible!=conflict)). % 0.12/0.39 cnf(i_0_37, plain, (unknown!=conflict)). % 0.12/0.39 cnf(i_0_38, plain, (compatible!=unknown)). % 0.12/0.39 cnf(i_0_1, plain, (~less(X1,X1))). % 0.12/0.39 cnf(i_0_5, plain, (leq(X1,X2)|~less(X1,X2))). % 0.12/0.39 cnf(i_0_39, plain, (X1=unknown|X1=compatible|X1=conflict|~is_verdict(X1))). % 0.12/0.39 cnf(i_0_17, plain, (less(X1,X2)|~in_lopen(X2,X1,X3))). % 0.12/0.39 cnf(i_0_19, plain, (less(X1,X2)|~in_ropen(X1,X3,X2))). % 0.12/0.39 cnf(i_0_23, plain, (less(X1,X2)|~in_open(X2,X1,X3))). % 0.12/0.39 cnf(i_0_22, plain, (less(X1,X2)|~in_open(X1,X3,X2))). % 0.12/0.39 cnf(i_0_14, plain, (leq(X1,X2)|~in_closed(X2,X1,X3))). % 0.12/0.39 cnf(i_0_13, plain, (leq(X1,X2)|~in_closed(X1,X3,X2))). % 0.12/0.39 cnf(i_0_16, plain, (leq(X1,X2)|~in_lopen(X1,X3,X2))). % 0.12/0.39 cnf(i_0_20, plain, (leq(X1,X2)|~in_ropen(X2,X1,X3))). % 0.12/0.39 cnf(i_0_7, plain, (X1=X2|~leq(X2,X1)|~leq(X1,X2))). % 0.12/0.39 cnf(i_0_3, plain, (X1=X2|less(X1,X2)|less(X2,X1))). % 0.12/0.39 cnf(i_0_6, plain, (X1=X2|less(X1,X2)|~leq(X1,X2))). % 0.12/0.39 cnf(i_0_12, plain, (in_closed(X1,X2,X3)|~leq(X1,X3)|~leq(X2,X1))). % 0.12/0.39 cnf(i_0_15, plain, (in_lopen(X1,X2,X3)|~leq(X1,X3)|~less(X2,X1))). % 0.12/0.39 cnf(i_0_18, plain, (in_ropen(X1,X2,X3)|~leq(X2,X1)|~less(X1,X3))). % 0.12/0.39 cnf(i_0_21, plain, (in_open(X1,X2,X3)|~less(X1,X3)|~less(X2,X1))). % 0.12/0.39 cnf(i_0_40, plain, (box_verdict(X1,conflict)=conflict|~is_verdict(X1))). % 0.12/0.39 cnf(i_0_11, plain, (leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3))). % 0.12/0.39 cnf(i_0_41, plain, (box_verdict(conflict,X1)=conflict|~is_verdict(X1))). % 0.12/0.39 cnf(i_0_2, plain, (less(X1,X2)|~less(X3,X2)|~less(X1,X3))). % 0.12/0.39 cnf(i_0_9, plain, (less(X1,X2)|~leq(X1,X3)|~less(X3,X2))). % 0.12/0.39 cnf(i_0_10, plain, (less(X1,X2)|~leq(X3,X2)|~less(X1,X3))). % 0.12/0.39 cnf(i_0_26, plain, (~axis_conflict(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.12/0.39 cnf(i_0_43, plain, (box_verdict(X1,unknown)=unknown|X1=conflict|~is_verdict(X1))). % 0.12/0.39 cnf(i_0_30, plain, (axis_subsumes(X1,X2,X3,X4)|~in_closed(esk3_4(X1,X2,X3,X4),X3,X4))). % 0.12/0.39 cnf(i_0_44, plain, (box_verdict(unknown,X1)=unknown|X1=conflict|~is_verdict(X1))). % 0.12/0.39 cnf(i_0_45, plain, (box_verdict(X1,X2)=unknown|box_verdict(X1,X2)=compatible|box_verdict(X1,X2)=conflict|~is_verdict(X2)|~is_verdict(X1))). % 0.12/0.39 cnf(i_0_24, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(esk1_4(X1,X2,X3,X4),X3,X4))). % 0.12/0.39 cnf(i_0_32, plain, (in_closed(X1,X2,X3)|~axis_subsumes(X4,X5,X2,X3)|~in_closed(X1,X4,X5))). % 0.12/0.39 cnf(i_0_27, plain, (axis_compatible(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.12/0.39 cnf(i_0_28, plain, (in_closed(esk2_4(X1,X2,X3,X4),X3,X4)|~axis_compatible(X1,X2,X3,X4))). % 0.12/0.39 cnf(i_0_29, plain, (in_closed(esk2_4(X1,X2,X3,X4),X1,X2)|~axis_compatible(X1,X2,X3,X4))). % 0.12/0.39 cnf(i_0_25, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(esk1_4(X1,X2,X3,X4),X1,X2))). % 0.12/0.39 cnf(i_0_31, plain, (axis_subsumes(X1,X2,X3,X4)|in_closed(esk3_4(X1,X2,X3,X4),X1,X2))). % 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.39 # Begin printing tableau % 0.12/0.39 # Found 5 steps % 0.12/0.39 cnf(i_0_50, negated_conjecture, (leq(v600,esk4_0)), inference(start_rule)). % 0.12/0.39 cnf(i_0_60, plain, (leq(v600,esk4_0)), inference(extension_rule, [i_0_10])). % 0.12/0.39 cnf(i_0_208, plain, (less(esk4_0,esk4_0)), inference(closure_rule, [i_0_1])). % 0.12/0.39 cnf(i_0_210, plain, (~less(esk4_0,v600)), inference(extension_rule, [i_0_17])). % 0.12/0.39 cnf(i_0_250, plain, (~in_lopen(v600,esk4_0,X6)), inference(etableau_closure_rule, [i_0_250, ...])). % 0.12/0.39 # End printing tableau % 0.12/0.39 # SZS output end % 0.12/0.39 # Branches closed with saturation will be marked with an "s" % 0.12/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.39 # Begin clausification derivation % 0.12/0.39 % 0.12/0.39 # End clausification derivation % 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.39 cnf(i_0_50, negated_conjecture, (leq(v600,esk4_0))). % 0.12/0.39 cnf(i_0_51, negated_conjecture, (in_open(esk4_0,v0,v600))). % 0.12/0.39 cnf(i_0_46, plain, (val(v0))). % 0.12/0.39 cnf(i_0_33, plain, (is_verdict(conflict))). % 0.12/0.39 cnf(i_0_34, plain, (is_verdict(compatible))). % 0.12/0.39 cnf(i_0_35, plain, (is_verdict(unknown))). % 0.12/0.39 cnf(i_0_47, plain, (val(v600))). % 0.12/0.39 cnf(i_0_48, plain, (less(v0,v600))). % 0.12/0.39 cnf(i_0_4, plain, (leq(X1,X1))). % 0.12/0.39 cnf(i_0_42, plain, (box_verdict(compatible,compatible)=compatible)). % 0.12/0.39 cnf(i_0_49, plain, (v0!=v600)). % 0.12/0.39 cnf(i_0_36, plain, (compatible!=conflict)). % 0.12/0.39 cnf(i_0_37, plain, (unknown!=conflict)). % 0.12/0.39 cnf(i_0_38, plain, (compatible!=unknown)). % 0.12/0.39 cnf(i_0_1, plain, (~less(X1,X1))). % 0.12/0.39 cnf(i_0_5, plain, (leq(X1,X2)|~less(X1,X2))). % 0.12/0.39 cnf(i_0_39, plain, (X1=unknown|X1=compatible|X1=conflict|~is_verdict(X1))). % 0.12/0.39 cnf(i_0_17, plain, (less(X1,X2)|~in_lopen(X2,X1,X3))). % 0.12/0.39 cnf(i_0_19, plain, (less(X1,X2)|~in_ropen(X1,X3,X2))). % 0.12/0.39 cnf(i_0_23, plain, (less(X1,X2)|~in_open(X2,X1,X3))). % 0.12/0.39 cnf(i_0_22, plain, (less(X1,X2)|~in_open(X1,X3,X2))). % 0.12/0.39 cnf(i_0_14, plain, (leq(X1,X2)|~in_closed(X2,X1,X3))). % 0.12/0.39 cnf(i_0_13, plain, (leq(X1,X2)|~in_closed(X1,X3,X2))). % 0.12/0.39 cnf(i_0_16, plain, (leq(X1,X2)|~in_lopen(X1,X3,X2))). % 0.12/0.39 cnf(i_0_20, plain, (leq(X1,X2)|~in_ropen(X2,X1,X3))). % 0.12/0.39 cnf(i_0_7, plain, (X1=X2|~leq(X2,X1)|~leq(X1,X2))). % 0.12/0.39 cnf(i_0_3, plain, (X1=X2|less(X1,X2)|less(X2,X1))). % 0.12/0.39 cnf(i_0_6, plain, (X1=X2|less(X1,X2)|~leq(X1,X2))). % 0.12/0.39 cnf(i_0_12, plain, (in_closed(X1,X2,X3)|~leq(X1,X3)|~leq(X2,X1))). % 0.12/0.39 cnf(i_0_15, plain, (in_lopen(X1,X2,X3)|~leq(X1,X3)|~less(X2,X1))). % 0.12/0.39 cnf(i_0_18, plain, (in_ropen(X1,X2,X3)|~leq(X2,X1)|~less(X1,X3))). % 0.12/0.39 cnf(i_0_21, plain, (in_open(X1,X2,X3)|~less(X1,X3)|~less(X2,X1))). % 0.12/0.39 cnf(i_0_40, plain, (box_verdict(X1,conflict)=conflict|~is_verdict(X1))). % 0.12/0.39 cnf(i_0_11, plain, (leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3))). % 0.12/0.39 cnf(i_0_41, plain, (box_verdict(conflict,X1)=conflict|~is_verdict(X1))). % 0.12/0.39 cnf(i_0_2, plain, (less(X1,X2)|~less(X3,X2)|~less(X1,X3))). % 0.12/0.39 cnf(i_0_9, plain, (less(X1,X2)|~leq(X1,X3)|~less(X3,X2))). % 0.12/0.39 cnf(i_0_10, plain, (less(X1,X2)|~leq(X3,X2)|~less(X1,X3))). % 0.12/0.39 cnf(i_0_26, plain, (~axis_conflict(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.12/0.39 cnf(i_0_43, plain, (box_verdict(X1,unknown)=unknown|X1=conflict|~is_verdict(X1))). % 0.12/0.39 cnf(i_0_30, plain, (axis_subsumes(X1,X2,X3,X4)|~in_closed(esk3_4(X1,X2,X3,X4),X3,X4))). % 0.12/0.39 cnf(i_0_44, plain, (box_verdict(unknown,X1)=unknown|X1=conflict|~is_verdict(X1))). % 0.12/0.39 cnf(i_0_45, plain, (box_verdict(X1,X2)=unknown|box_verdict(X1,X2)=compatible|box_verdict(X1,X2)=conflict|~is_verdict(X2)|~is_verdict(X1))). % 0.12/0.39 cnf(i_0_24, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(esk1_4(X1,X2,X3,X4),X3,X4))). % 0.12/0.39 cnf(i_0_32, plain, (in_closed(X1,X2,X3)|~axis_subsumes(X4,X5,X2,X3)|~in_closed(X1,X4,X5))). % 0.12/0.39 cnf(i_0_27, plain, (axis_compatible(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.12/0.39 cnf(i_0_28, plain, (in_closed(esk2_4(X1,X2,X3,X4),X3,X4)|~axis_compatible(X1,X2,X3,X4))). % 0.12/0.39 cnf(i_0_29, plain, (in_closed(esk2_4(X1,X2,X3,X4),X1,X2)|~axis_compatible(X1,X2,X3,X4))). % 0.12/0.39 cnf(i_0_25, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(esk1_4(X1,X2,X3,X4),X1,X2))). % 0.12/0.39 cnf(i_0_31, plain, (axis_subsumes(X1,X2,X3,X4)|in_closed(esk3_4(X1,X2,X3,X4),X1,X2))). % 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.39 # Begin printing tableau % 0.12/0.39 # Found 5 steps % 0.12/0.39 cnf(i_0_50, negated_conjecture, (leq(v600,esk4_0)), inference(start_rule)). % 0.12/0.39 cnf(i_0_60, plain, (leq(v600,esk4_0)), inference(extension_rule, [i_0_9])). % 0.12/0.39 cnf(i_0_205, plain, (less(v600,v600)), inference(closure_rule, [i_0_1])). % 0.12/0.39 cnf(i_0_207, plain, (~less(esk4_0,v600)), inference(extension_rule, [i_0_17])). % 0.12/0.39 cnf(i_0_250, plain, (~in_lopen(v600,esk4_0,X6)), inference(etableau_closure_rule, [i_0_250, ...])). % 0.12/0.39 # End printing tableau % 0.12/0.39 # SZS output end % 0.12/0.39 # Branches closed with saturation will be marked with an "s" % 0.12/0.39 # Child (1479550) has found a proof. % 0.12/0.39 % 0.12/0.39 # Proof search is over... % 0.12/0.39 # Freeing feature tree %------------------------------------------------------------------------------