%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT085+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 : n026.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:54 AM UTC 2026 % Result : Theorem 0.14s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT085+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.09/0.35 % Computer : n026.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Mon Sep 7 14:21:27 UTC 2026 % 0.09/0.35 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N % 0.14/0.39 # and selection function SelectUnlessUniqMax. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 74 Number of unprocessed: 73 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 73 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 4 conjectures. % 0.14/0.39 # There are 4 start rule candidates: % 0.14/0.39 # Found 37 unit axioms. % 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.39 # 4 start rule tableaux created. % 0.14/0.39 # 36 extension rule candidate clauses % 0.14/0.39 # 37 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 4 % 0.14/0.39 # Returning from population with 19 new_tableaux and 0 remaining starting tableaux. % 0.14/0.39 # We now have 19 tableaux to operate on % 0.14/0.40 # There were 1 total branch saturation attempts. % 0.14/0.40 # There were 0 of these attempts blocked. % 0.14/0.40 # There were 0 deferred branch saturation attempts. % 0.14/0.40 # There were 0 free duplicated saturations. % 0.14/0.40 # There were 1 total successful branch saturations. % 0.14/0.40 # There were 0 successful branch saturations in interreduction. % 0.14/0.40 # There were 0 successful branch saturations on the branch. % 0.14/0.40 # There were 1 successful branch saturations after the branch. % 0.14/0.40 # There were 1 total branch saturation attempts. % 0.14/0.40 # There were 0 of these attempts blocked. % 0.14/0.40 # There were 0 deferred branch saturation attempts. % 0.14/0.40 # There were 0 free duplicated saturations. % 0.14/0.40 # There were 1 total successful branch saturations. % 0.14/0.40 # There were 0 successful branch saturations in interreduction. % 0.14/0.40 # There were 0 successful branch saturations on the branch. % 0.14/0.40 # There were 1 successful branch saturations after the branch. % 0.14/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.40 # Begin clausification derivation % 0.14/0.40 % 0.14/0.40 # End clausification derivation % 0.14/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.40 cnf(i_0_46, plain, (val(v0))). % 0.14/0.40 cnf(i_0_71, negated_conjecture, (leq(v100,esk6_0))). % 0.14/0.40 cnf(i_0_72, negated_conjecture, (leq(v200,esk5_0))). % 0.14/0.40 cnf(i_0_33, plain, (is_verdict(conflict))). % 0.14/0.40 cnf(i_0_47, plain, (val(v50))). % 0.14/0.40 cnf(i_0_34, plain, (is_verdict(compatible))). % 0.14/0.40 cnf(i_0_35, plain, (is_verdict(unknown))). % 0.14/0.40 cnf(i_0_48, plain, (val(v100))). % 0.14/0.40 cnf(i_0_49, plain, (val(v200))). % 0.14/0.40 cnf(i_0_73, negated_conjecture, (leq(v400,esk4_0))). % 0.14/0.40 cnf(i_0_50, plain, (val(v400))). % 0.14/0.40 cnf(i_0_51, plain, (less(v0,v50))). % 0.14/0.40 cnf(i_0_52, plain, (less(v0,v100))). % 0.14/0.40 cnf(i_0_53, plain, (less(v0,v200))). % 0.14/0.40 cnf(i_0_4, plain, (leq(X1,X1))). % 0.14/0.40 cnf(i_0_54, plain, (less(v0,v400))). % 0.14/0.40 cnf(i_0_55, plain, (less(v50,v100))). % 0.14/0.40 cnf(i_0_56, plain, (less(v50,v200))). % 0.14/0.40 cnf(i_0_57, plain, (less(v50,v400))). % 0.14/0.40 cnf(i_0_58, plain, (less(v100,v200))). % 0.14/0.40 cnf(i_0_59, plain, (less(v100,v400))). % 0.14/0.40 cnf(i_0_60, plain, (less(v200,v400))). % 0.14/0.40 cnf(i_0_42, plain, (box_verdict(compatible,compatible)=compatible)). % 0.14/0.40 cnf(i_0_70, plain, (v50!=v0)). % 0.14/0.40 cnf(i_0_69, plain, (v100!=v0)). % 0.14/0.40 cnf(i_0_66, plain, (v50!=v100)). % 0.14/0.40 cnf(i_0_68, plain, (v200!=v0)). % 0.14/0.40 cnf(i_0_65, plain, (v50!=v200)). % 0.14/0.40 cnf(i_0_36, plain, (compatible!=conflict)). % 0.14/0.40 cnf(i_0_37, plain, (unknown!=conflict)). % 0.14/0.40 cnf(i_0_38, plain, (compatible!=unknown)). % 0.14/0.40 cnf(i_0_63, plain, (v200!=v100)). % 0.14/0.40 cnf(i_0_67, plain, (v400!=v0)). % 0.14/0.40 cnf(i_0_64, plain, (v400!=v50)). % 0.14/0.40 cnf(i_0_62, plain, (v400!=v100)). % 0.14/0.40 cnf(i_0_61, plain, (v400!=v200)). % 0.14/0.40 cnf(i_0_1, plain, (~less(X1,X1))). % 0.14/0.40 cnf(i_0_74, negated_conjecture, (in_lopen(esk6_0,v0,v50)|in_lopen(esk5_0,v0,v100)|in_lopen(esk4_0,v0,v200))). % 0.14/0.40 cnf(i_0_39, plain, (X1=unknown|X1=compatible|X1=conflict|~is_verdict(X1))). % 0.14/0.40 cnf(i_0_5, plain, (leq(X1,X2)|~less(X1,X2))). % 0.14/0.40 cnf(i_0_17, plain, (less(X1,X2)|~in_lopen(X2,X1,X3))). % 0.14/0.40 cnf(i_0_19, plain, (less(X1,X2)|~in_ropen(X1,X3,X2))). % 0.14/0.40 cnf(i_0_23, plain, (less(X1,X2)|~in_open(X2,X1,X3))). % 0.14/0.40 cnf(i_0_22, plain, (less(X1,X2)|~in_open(X1,X3,X2))). % 0.14/0.40 cnf(i_0_16, plain, (leq(X1,X2)|~in_lopen(X1,X3,X2))). % 0.14/0.40 cnf(i_0_14, plain, (leq(X1,X2)|~in_closed(X2,X1,X3))). % 0.14/0.40 cnf(i_0_13, plain, (leq(X1,X2)|~in_closed(X1,X3,X2))). % 0.14/0.40 cnf(i_0_20, plain, (leq(X1,X2)|~in_ropen(X2,X1,X3))). % 0.14/0.40 cnf(i_0_3, plain, (X1=X2|less(X1,X2)|less(X2,X1))). % 0.14/0.40 cnf(i_0_6, plain, (X1=X2|less(X1,X2)|~leq(X1,X2))). % 0.14/0.40 cnf(i_0_7, plain, (X1=X2|~leq(X2,X1)|~leq(X1,X2))). % 0.14/0.40 cnf(i_0_12, plain, (in_closed(X1,X2,X3)|~leq(X1,X3)|~leq(X2,X1))). % 0.14/0.40 cnf(i_0_15, plain, (in_lopen(X1,X2,X3)|~leq(X1,X3)|~less(X2,X1))). % 0.14/0.40 cnf(i_0_18, plain, (in_ropen(X1,X2,X3)|~leq(X2,X1)|~less(X1,X3))). % 0.14/0.40 cnf(i_0_40, plain, (box_verdict(X1,conflict)=conflict|~is_verdict(X1))). % 0.14/0.40 cnf(i_0_11, plain, (leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3))). % 0.14/0.40 cnf(i_0_41, plain, (box_verdict(conflict,X1)=conflict|~is_verdict(X1))). % 0.14/0.40 cnf(i_0_21, plain, (in_open(X1,X2,X3)|~less(X1,X3)|~less(X2,X1))). % 0.14/0.40 cnf(i_0_2, plain, (less(X1,X2)|~less(X3,X2)|~less(X1,X3))). % 0.14/0.40 cnf(i_0_9, plain, (less(X1,X2)|~leq(X1,X3)|~less(X3,X2))). % 0.14/0.40 cnf(i_0_10, plain, (less(X1,X2)|~leq(X3,X2)|~less(X1,X3))). % 0.14/0.40 cnf(i_0_43, plain, (box_verdict(X1,unknown)=unknown|X1=conflict|~is_verdict(X1))). % 0.14/0.41 cnf(i_0_30, plain, (axis_subsumes(X1,X2,X3,X4)|~in_closed(esk3_4(X1,X2,X3,X4),X3,X4))). % 0.14/0.41 cnf(i_0_26, plain, (~axis_conflict(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.14/0.41 cnf(i_0_44, plain, (box_verdict(unknown,X1)=unknown|X1=conflict|~is_verdict(X1))). % 0.14/0.41 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.14/0.41 cnf(i_0_32, plain, (in_closed(X1,X2,X3)|~axis_subsumes(X4,X5,X2,X3)|~in_closed(X1,X4,X5))). % 0.14/0.41 cnf(i_0_27, plain, (axis_compatible(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.14/0.41 cnf(i_0_28, plain, (in_closed(esk2_4(X1,X2,X3,X4),X3,X4)|~axis_compatible(X1,X2,X3,X4))). % 0.14/0.41 cnf(i_0_29, plain, (in_closed(esk2_4(X1,X2,X3,X4),X1,X2)|~axis_compatible(X1,X2,X3,X4))). % 0.14/0.41 cnf(i_0_24, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(esk1_4(X1,X2,X3,X4),X3,X4))). % 0.14/0.41 cnf(i_0_25, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(esk1_4(X1,X2,X3,X4),X1,X2))). % 0.14/0.41 cnf(i_0_31, plain, (axis_subsumes(X1,X2,X3,X4)|in_closed(esk3_4(X1,X2,X3,X4),X1,X2))). % 0.14/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.41 # Begin printing tableau % 0.14/0.41 # Found 5 steps % 0.14/0.41 cnf(i_0_73, negated_conjecture, (leq(v400,esk4_0)), inference(start_rule)). % 0.14/0.41 cnf(i_0_85, plain, (leq(v400,esk4_0)), inference(extension_rule, [i_0_10])). % 0.14/0.41 cnf(i_0_426, plain, (less(esk4_0,esk4_0)), inference(closure_rule, [i_0_1])). % 0.14/0.41 cnf(i_0_428, plain, (~less(esk4_0,v400)), inference(extension_rule, [i_0_17])). % 0.14/0.41 cnf(i_0_471, plain, (~in_lopen(v400,esk4_0,X6)), inference(etableau_closure_rule, [i_0_471, ...])). % 0.14/0.41 # End printing tableau % 0.14/0.41 # SZS output end % 0.14/0.41 # Branches closed with saturation will be marked with an "s" % 0.14/0.41 # There were 1 total branch saturation attempts. % 0.14/0.41 # There were 0 of these attempts blocked. % 0.14/0.41 # There were 0 deferred branch saturation attempts. % 0.14/0.41 # There were 0 free duplicated saturations. % 0.14/0.41 # There were 1 total successful branch saturations. % 0.14/0.41 # There were 0 successful branch saturations in interreduction. % 0.14/0.41 # There were 0 successful branch saturations on the branch. % 0.14/0.41 # There were 1 successful branch saturations after the branch. % 0.14/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.41 # Begin clausification derivation % 0.14/0.41 % 0.14/0.41 # End clausification derivation % 0.14/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.41 cnf(i_0_46, plain, (val(v0))). % 0.14/0.41 cnf(i_0_71, negated_conjecture, (leq(v100,esk6_0))). % 0.14/0.41 cnf(i_0_72, negated_conjecture, (leq(v200,esk5_0))). % 0.14/0.41 cnf(i_0_33, plain, (is_verdict(conflict))). % 0.14/0.41 cnf(i_0_47, plain, (val(v50))). % 0.14/0.41 cnf(i_0_34, plain, (is_verdict(compatible))). % 0.14/0.41 cnf(i_0_35, plain, (is_verdict(unknown))). % 0.14/0.41 cnf(i_0_48, plain, (val(v100))). % 0.14/0.41 cnf(i_0_49, plain, (val(v200))). % 0.14/0.41 cnf(i_0_73, negated_conjecture, (leq(v400,esk4_0))). % 0.14/0.41 cnf(i_0_50, plain, (val(v400))). % 0.14/0.41 cnf(i_0_51, plain, (less(v0,v50))). % 0.14/0.41 cnf(i_0_52, plain, (less(v0,v100))). % 0.14/0.41 cnf(i_0_53, plain, (less(v0,v200))). % 0.14/0.41 cnf(i_0_4, plain, (leq(X1,X1))). % 0.14/0.41 cnf(i_0_54, plain, (less(v0,v400))). % 0.14/0.41 cnf(i_0_55, plain, (less(v50,v100))). % 0.14/0.41 cnf(i_0_56, plain, (less(v50,v200))). % 0.14/0.41 cnf(i_0_57, plain, (less(v50,v400))). % 0.14/0.41 cnf(i_0_58, plain, (less(v100,v200))). % 0.14/0.41 cnf(i_0_59, plain, (less(v100,v400))). % 0.14/0.41 cnf(i_0_60, plain, (less(v200,v400))). % 0.14/0.41 cnf(i_0_42, plain, (box_verdict(compatible,compatible)=compatible)). % 0.14/0.41 cnf(i_0_70, plain, (v50!=v0)). % 0.14/0.41 cnf(i_0_69, plain, (v100!=v0)). % 0.14/0.41 cnf(i_0_66, plain, (v50!=v100)). % 0.14/0.41 cnf(i_0_68, plain, (v200!=v0)). % 0.14/0.41 cnf(i_0_65, plain, (v50!=v200)). % 0.14/0.41 cnf(i_0_36, plain, (compatible!=conflict)). % 0.14/0.41 cnf(i_0_37, plain, (unknown!=conflict)). % 0.14/0.41 cnf(i_0_38, plain, (compatible!=unknown)). % 0.14/0.41 cnf(i_0_63, plain, (v200!=v100)). % 0.14/0.41 cnf(i_0_67, plain, (v400!=v0)). % 0.14/0.41 cnf(i_0_64, plain, (v400!=v50)). % 0.14/0.41 cnf(i_0_62, plain, (v400!=v100)). % 0.14/0.41 cnf(i_0_61, plain, (v400!=v200)). % 0.14/0.41 cnf(i_0_1, plain, (~less(X1,X1))). % 0.14/0.41 cnf(i_0_74, negated_conjecture, (in_lopen(esk6_0,v0,v50)|in_lopen(esk5_0,v0,v100)|in_lopen(esk4_0,v0,v200))). % 0.14/0.41 cnf(i_0_39, plain, (X1=unknown|X1=compatible|X1=conflict|~is_verdict(X1))). % 0.14/0.41 cnf(i_0_5, plain, (leq(X1,X2)|~less(X1,X2))). % 0.14/0.41 cnf(i_0_17, plain, (less(X1,X2)|~in_lopen(X2,X1,X3))). % 0.14/0.41 cnf(i_0_19, plain, (less(X1,X2)|~in_ropen(X1,X3,X2))). % 0.14/0.41 cnf(i_0_23, plain, (less(X1,X2)|~in_open(X2,X1,X3))). % 0.14/0.41 cnf(i_0_22, plain, (less(X1,X2)|~in_open(X1,X3,X2))). % 0.14/0.41 cnf(i_0_16, plain, (leq(X1,X2)|~in_lopen(X1,X3,X2))). % 0.14/0.41 cnf(i_0_14, plain, (leq(X1,X2)|~in_closed(X2,X1,X3))). % 0.14/0.41 cnf(i_0_13, plain, (leq(X1,X2)|~in_closed(X1,X3,X2))). % 0.14/0.41 cnf(i_0_20, plain, (leq(X1,X2)|~in_ropen(X2,X1,X3))). % 0.14/0.41 cnf(i_0_3, plain, (X1=X2|less(X1,X2)|less(X2,X1))). % 0.14/0.41 cnf(i_0_6, plain, (X1=X2|less(X1,X2)|~leq(X1,X2))). % 0.14/0.41 cnf(i_0_7, plain, (X1=X2|~leq(X2,X1)|~leq(X1,X2))). % 0.14/0.41 cnf(i_0_12, plain, (in_closed(X1,X2,X3)|~leq(X1,X3)|~leq(X2,X1))). % 0.14/0.41 cnf(i_0_15, plain, (in_lopen(X1,X2,X3)|~leq(X1,X3)|~less(X2,X1))). % 0.14/0.41 cnf(i_0_18, plain, (in_ropen(X1,X2,X3)|~leq(X2,X1)|~less(X1,X3))). % 0.14/0.41 cnf(i_0_40, plain, (box_verdict(X1,conflict)=conflict|~is_verdict(X1))). % 0.14/0.41 cnf(i_0_11, plain, (leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3))). % 0.14/0.41 cnf(i_0_41, plain, (box_verdict(conflict,X1)=conflict|~is_verdict(X1))). % 0.14/0.41 cnf(i_0_21, plain, (in_open(X1,X2,X3)|~less(X1,X3)|~less(X2,X1))). % 0.14/0.41 cnf(i_0_2, plain, (less(X1,X2)|~less(X3,X2)|~less(X1,X3))). % 0.14/0.41 cnf(i_0_9, plain, (less(X1,X2)|~leq(X1,X3)|~less(X3,X2))). % 0.14/0.41 cnf(i_0_10, plain, (less(X1,X2)|~leq(X3,X2)|~less(X1,X3))). % 0.14/0.41 cnf(i_0_43, plain, (box_verdict(X1,unknown)=unknown|X1=conflict|~is_verdict(X1))). % 0.14/0.41 cnf(i_0_30, plain, (axis_subsumes(X1,X2,X3,X4)|~in_closed(esk3_4(X1,X2,X3,X4),X3,X4))). % 0.14/0.41 cnf(i_0_26, plain, (~axis_conflict(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.14/0.41 cnf(i_0_44, plain, (box_verdict(unknown,X1)=unknown|X1=conflict|~is_verdict(X1))). % 0.14/0.41 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.14/0.41 cnf(i_0_32, plain, (in_closed(X1,X2,X3)|~axis_subsumes(X4,X5,X2,X3)|~in_closed(X1,X4,X5))). % 0.14/0.41 cnf(i_0_27, plain, (axis_compatible(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.14/0.41 cnf(i_0_28, plain, (in_closed(esk2_4(X1,X2,X3,X4),X3,X4)|~axis_compatible(X1,X2,X3,X4))). % 0.14/0.41 cnf(i_0_29, plain, (in_closed(esk2_4(X1,X2,X3,X4),X1,X2)|~axis_compatible(X1,X2,X3,X4))). % 0.14/0.41 cnf(i_0_24, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(es# There were 1 total branch saturation attempts. % 0.14/0.41 # There were 0 of these attempts blocked. % 0.14/0.41 # There were 0 deferred branch saturation attempts. % 0.14/0.41 # There were 0 free duplicated saturations. % 0.14/0.41 # There were 1 total successful branch saturations. % 0.14/0.41 # There were 0 successful branch saturations in interreduction. % 0.14/0.41 # There were 0 successful branch saturations on the branch. % 0.14/0.41 # There were 1 successful branch saturations after the branch. % 0.14/0.41 k1_4(X1,X2,X3,X4),X3,X4))). % 0.14/0.41 cnf(i_0_25, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(esk1_4(X1,X2,X3,X4),X1,X2))). % 0.14/0.41 cnf(i_0_31, plain, (axis_subsumes(X1,X2,X3,X4)|in_closed(esk3_4(X1,X2,X3,X4),X1,X2))). % 0.14/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.41 # Begin printing tableau % 0.14/0.41 # Found 6 steps % 0.14/0.41 cnf(i_0_72, negated_conjecture, (leq(v200,esk5_0)), inference(start_rule)). % 0.14/0.41 cnf(i_0_86, plain, (leq(v200,esk5_0)), inference(extension_rule, [i_0_12])). % 0.14/0.41 cnf(i_0_735, plain, (~leq(v200,v200)), inference(closure_rule, [i_0_4])). % 0.14/0.41 cnf(i_0_733, plain, (in_closed(v200,v200,esk5_0)), inference(extension_rule, [i_0_26])). % 0.14/0.41 cnf(i_0_793, plain, (~in_closed(v200,v200,esk5_0)), inference(closure_rule, [i_0_733])). % 0.14/0.41 cnf(i_0_791, plain, (~axis_conflict(v200,esk5_0,v200,esk5_0)), inference(etableau_closure_rule, [i_0_791, ...])). % 0.14/0.41 # End printing tableau % 0.14/0.41 # SZS output end % 0.14/0.41 # Branches closed with saturation will be marked with an "s" % 0.14/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.41 # Begin clausification derivation % 0.14/0.41 % 0.14/0.41 # End clausification derivation % 0.14/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.41 cnf(i_0_46, plain, (val(v0))). % 0.14/0.41 cnf(i_0_71, negated_conjecture, (leq(v100,esk6_0))). % 0.14/0.41 cnf(i_0_72, negated_conjecture, (leq(v200,esk5_0))). % 0.14/0.41 cnf(i_0_33, plain, (is_verdict(conflict))). % 0.14/0.41 cnf(i_0_47, plain, (val(v50))). % 0.14/0.41 cnf(i_0_34, plain, (is_verdict(compatible))). % 0.14/0.41 cnf(i_0_35, plain, (is_verdict(unknown))). % 0.14/0.41 cnf(i_0_48, plain, (val(v100))). % 0.14/0.41 cnf(i_0_49, plain, (val(v200))). % 0.14/0.41 cnf(i_0_73, negated_conjecture, (leq(v400,esk4_0))). % 0.14/0.41 cnf(i_0_50, plain, (val(v400))). % 0.14/0.41 cnf(i_0_51, plain, (less(v0,v50))). % 0.14/0.41 cnf(i_0_52, plain, (less(v0,v100))). % 0.14/0.41 cnf(i_0_53, plain, (less(v0,v200))). % 0.14/0.41 cnf(i_0_4, plain, (leq(X1,X1))). % 0.14/0.41 cnf(i_0_54, plain, (less(v0,v400))). % 0.14/0.41 cnf(i_0_55, plain, (less(v50,v100))). % 0.14/0.41 cnf(i_0_56, plain, (less(v50,v200))). % 0.14/0.41 cnf(i_0_57, plain, (less(v50,v400))). % 0.14/0.41 cnf(i_0_58, plain, (less(v100,v200))). % 0.14/0.41 cnf(i_0_59, plain, (less(v100,v400))). % 0.14/0.41 cnf(i_0_60, plain, (less(v200,v400))). % 0.14/0.41 cnf(i_0_42, plain, (box_verdict(compatible,compatible)=compatible)). % 0.14/0.41 cnf(i_0_70, plain, (v50!=v0)). % 0.14/0.41 cnf(i_0_69, plain, (v100!=v0)). % 0.14/0.41 cnf(i_0_66, plain, (v50!=v100)). % 0.14/0.41 cnf(i_0_68, plain, (v200!=v0)). % 0.14/0.41 cnf(i_0_65, plain, (v50!=v200)). % 0.14/0.41 cnf(i_0_36, plain, (compatible!=conflict)). % 0.14/0.41 cnf(i_0_37, plain, (unknown!=conflict)). % 0.14/0.41 cnf(i_0_38, plain, (compatible!=unknown)). % 0.14/0.41 cnf(i_0_63, plain, (v200!=v100)). % 0.14/0.41 cnf(i_0_67, plain, (v400!=v0)). % 0.14/0.41 cnf(i_0_64, plain, (v400!=v50)). % 0.14/0.41 cnf(i_0_62, plain, (v400!=v100)). % 0.14/0.41 cnf(i_0_61, plain, (v400!=v200)). % 0.14/0.41 cnf(i_0_1, plain, (~less(X1,X1))). % 0.14/0.41 cnf(i_0_74, negated_conjecture, (in_lopen(esk6_0,v0,v50)|in_lopen(esk5_0,v0,v100)|in_lopen(esk4_0,v0,v200))). % 0.14/0.41 cnf(i_0_39, plain, (X1=unknown|X1=compatible|X1=conflict|~is_verdict(X1))). % 0.14/0.41 cnf(i_0_5, plain, (leq(X1,X2)|~less(X1,X2))). % 0.14/0.41 cnf(i_0_17, plain, (less(X1,X2)|~in_lopen(X2,X1,X3))). % 0.14/0.41 cnf(i_0_19, plain, (less(X1,X2)|~in_ropen(X1,X3,X2))). % 0.14/0.41 cnf(i_0_23, plain, (less(X1,X2)|~in_open(X2,X1,X3))). % 0.14/0.41 cnf(i_0_22, plain, (less(X1,X2)|~in_open(X1,X3,X2))). % 0.14/0.41 cnf(i_0_16, plain, (leq(X1,X2)|~in_lopen(X1,X3,X2))). % 0.14/0.41 cnf(i_0_14, plain, (leq(X1,X2)|~in_closed(X2,X1,X3))). % 0.14/0.41 cnf(i_0_13, plain, (leq(X1,X2)|~in_closed(X1,X3,X2))). % 0.14/0.41 cnf(i_0_20, plain, (leq(X1,X2)|~in_ropen(X2,X1,X3))). % 0.14/0.41 cnf(i_0_3, plain, (X1=X2|less(X1,X2)|less(X2,X1))). % 0.14/0.41 cnf(i_0_6, plain, (X1=X2|less(X1,X2)|~leq(X1,X2))). % 0.14/0.41 cnf(i_0_7, plain, (X1=X2|~leq(X2,X1)|~leq(X1,X2))). % 0.14/0.41 cnf(i_0_12, plain, (in_closed(X1,X2,X3)|~leq(X1,X3)|~leq(X2,X1))). % 0.14/0.41 cnf(i_0_15, plain, (in_lopen(X1,X2,X3)|~leq(X1,X3)|~less(X2,X1))). % 0.14/0.41 cnf(i_0_18, plain, (in_ropen(X1,X2,X3)|~leq(X2,X1)|~less(X1,X3))). % 0.14/0.41 cnf(i_0_40, plain, (box_verdict(X1,conflict)=conflict|~is_verdict(X1))). % 0.14/0.41 cnf(i_0_11, plain, (leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3))). % 0.14/0.41 cnf(i_0_41, plain, (box_verdict(conflict,X1)=conflict|~is_verdict(X1))). % 0.14/0.41 cnf(i_0_21, plain, (in_open(X1,X2,X3)|~less(X1,X3)|~less(X2,X1))). % 0.14/0.41 cnf(i_0_2, plain, (less(X1,X2)|~less(X3,X2)|~less(X1,X3))). % 0.14/0.41 cnf(i_0_9, plain, (less(X1,X2)|~leq(X1,X3)|~less(X3,X2))). % 0.14/0.41 cnf(i_0_10, plain, (less(X1,X2)|~leq(X3,X2)|~less(X1,X3))). % 0.14/0.41 cnf(i_0_43, plain, (box_verdict(X1,unknown)=unknown|X1=conflict|~is_verdict(X1))). % 0.14/0.41 cnf(i_0_30, plain, (axis_subsumes(X1,X2,X3,X4)|~in_closed(esk3_4(X1,X2,X3,X4),X3,X4))). % 0.14/0.41 cnf(i_0_26, plain, (~axis_conflict(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.14/0.41 cnf(i_0_44, plain, (box_verdict(unknown,X1)=unknown|X1=conflict|~is_verdict(X1))). % 0.14/0.41 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.14/0.41 cnf(i_0_32, plain, (in_closed(X1,X2,X3)|~axis_subsumes(X4,X5,X2,X3)|~in_closed(X1,X4,X5))). % 0.14/0.41 cnf(i_0_27, plain, (axis_compatible(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.14/0.41 cnf(i_0_28, plain, (in_closed(esk2_4(X1,X2,X3,X4),X3,X4)|~axis_compatible(X1,X2,X3,X4))). % 0.14/0.41 cnf(i_0_29, plain, (in_closed(esk2_4(X1,X2,X3,X4),X1,X2)|~axis_compatible(X1,X2,X3,X4))). % 0.14/0.41 cnf(i_0_24, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(esk1_4(X1,X2,X3,X4),X3,X4))). % 0.14/0.41 cnf(i_0_25, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(esk1_4(X1,X2,X3,X4),X1,X2))). % 0.14/0.41 cnf(i_0_31, plain, (axis_subsumes(X1,X2,X3,X4)|in_closed(esk3_4(X1,X2,X3,X4),X1,X2))). % 0.14/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.41 # Begin printing tableau % 0.14/0.41 # Found 6 steps % 0.14/0.41 cnf(i_0_71, negated_conjecture, (leq(v100,esk6_0)), inference(start_rule)). % 0.14/0.41 cnf(i_0_87, plain, (leq(v100,esk6_0)), inference(extension_rule, [i_0_12])). % 0.14/0.41 cnf(i_0_735, plain, (~leq(v100,v100)), inference(closure_rule, [i_0_4])). % 0.14/0.41 cnf(i_0_733, plain, (in_closed(v100,v100,esk6_0)), inference(extension_rule, [i_0_26])). % 0.14/0.41 cnf(i_0_793, plain, (~in_closed(v100,v100,esk6_0)), inference(closure_rule, [i_0_733])). % 0.14/0.41 cnf(i_0_791, plain, (~axis_conflict(v100,esk6_0,v100,esk6_0)), inference(etableau_closure_rule, [i_0_791, ...])). % 0.14/0.41 # End printing tableau % 0.14/0.41 # SZS output end % 0.14/0.41 # Branches closed with saturation will be marked with an "s" % 0.14/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.41 # Begin clausification derivation % 0.14/0.41 % 0.14/0.41 # End clausification derivation % 0.14/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.41 cnf(i_0_46, plain, (val(v0))). % 0.14/0.41 cnf(i_0_71, negated_conjecture, (leq(v100,esk6_0))). % 0.14/0.41 cnf(i_0_72, negated_conjecture, (leq(v200,esk5_0))). % 0.14/0.41 cnf(i_0_33, plain, (is_verdict(conflict))). % 0.14/0.41 cnf(i_0_47, plain, (val(v50))). % 0.14/0.41 cnf(i_0_34, plain, (is_verdict(compatible))). % 0.14/0.41 cnf(i_0_35, plain, (is_verdict(unknown))). % 0.14/0.41 cnf(i_0_48, plain, (val(v100))). % 0.14/0.41 cnf(i_0_49, plain, (val(v200))). % 0.14/0.41 cnf(i_0_73, negated_conjecture, (leq(v400,esk4_0))). % 0.14/0.41 cnf(i_0_50, plain, (val(v400))). % 0.14/0.41 cnf(i_0_51, plain, (less(v0,v50))). % 0.14/0.41 cnf(i_0_52, plain, (less(v0,v100))). % 0.14/0.41 cnf(i_0_53, plain, (less(v0,v200))). % 0.14/0.41 cnf(i_0_4, plain, (leq(X1,X1))). % 0.14/0.41 cnf(i_0_54, plain, (less(v0,v400))). % 0.14/0.41 cnf(i_0_55, plain, (less(v50,v100))). % 0.14/0.41 cnf(i_0_56, plain, (less(v50,v200))). % 0.14/0.41 cnf(i_0_57, plain, (less(v50,v400))). % 0.14/0.41 cnf(i_0_58, plain, (less(v100,v200))). % 0.14/0.41 cnf(i_0_59, plain, (less(v100,v400))). % 0.14/0.41 cnf(i_0_60, plain, (less(v200,v400))). % 0.14/0.41 cnf(i_0_42, plain, (box_verdict(compatible,compatible)=compatible)). % 0.14/0.41 cnf(i_0_70, plain, (v50!=v0)). % 0.14/0.41 cnf(i_0_69, plain, (v100!=v0)). % 0.14/0.41 cnf(i_0_66, plain, (v50!=v100)). % 0.14/0.41 cnf(i_0_68, plain, (v200!=v0)). % 0.14/0.41 cnf(i_0_65, plain, (v50!=v200)). % 0.14/0.41 cnf(i_0_36, plain, (compatible!=conflict)). % 0.14/0.41 cnf(i_0_37, plain, (unknown!=conflict)). % 0.14/0.41 cnf(i_0_38, plain, (compatible!=unknown)). % 0.14/0.41 cnf(i_0_63, plain, (v200!=v100)). % 0.14/0.41 cnf(i_0_67, plain, (v400!=v0)). % 0.14/0.41 cnf(i_0_64, plain, (v400!=v50)). % 0.14/0.41 cnf(i_0_62, plain, (v400!=v100)). % 0.14/0.41 cnf(i_0_61, plain, (v400!=v200)). % 0.14/0.41 cnf(i_0_1, plain, (~less(X1,X1))). % 0.14/0.41 cnf(i_0_74, negated_conjecture, (in_lopen(esk6_0,v0,v50)|in_lopen(esk5_0,v0,v100)|in_lopen(esk4_0,v0,v200))). % 0.14/0.41 cnf(i_0_39, plain, (X1=unknown|X1=compatible|X1=conflict|~is_verdict(X1))). % 0.14/0.41 cnf(i_0_5, plain, (leq(X1,X2)|~less(X1,X2))). % 0.14/0.41 cnf(i_0_17, plain, (less(X1,X2)|~in_lopen(X2,X1,X3))). % 0.14/0.41 cnf(i_0_19, plain, (less(X1,X2)|~in_ropen(X1,X3,X2))). % 0.14/0.41 cnf(i_0_23, plain, (less(X1,X2)|~in_open(X2,X1,X3))). % 0.14/0.41 cnf(i_0_22, plain, (less(X1,X2)|~in_open(X1,X3,X2))). % 0.14/0.41 cnf(i_0_16, plain, (leq(X1,X2)|~in_lopen(X1,X3,X2))). % 0.14/0.41 cnf(i_0_14, plain, (leq(X1,X2)|~in_closed(X2,X1,X3))). % 0.14/0.41 cnf(i_0_13, plain, (leq(X1,X2)|~in_closed(X1,X3,X2))). % 0.14/0.41 cnf(i_0_20, plain, (leq(X1,X2)|~in_ropen(X2,X1,X3))). % 0.14/0.41 cnf(i_0_3, plain, (X1=X2|less(X1,X2)|less(X2,X1))). % 0.14/0.41 cnf(i_0_6, plain, (X1=X2|less(X1,X2)|~leq(X1,X2))). % 0.14/0.41 cnf(i_0_7, plain, (X1=X2|~leq(X2,X1)|~leq(X1,X2))). % 0.14/0.41 cnf(i_0_12, plain, (in_closed(X1,X2,X3)|~leq(X1,X3)|~leq(X2,X1))). % 0.14/0.41 cnf(i_0_15, plain, (in_lopen(X1,X2,X3)|~leq(X1,X3)|~less(X2,X1))). % 0.14/0.41 cnf(i_0_18, plain, (in_ropen(X1,X2,X3)|~leq(X2,X1)|~less(X1,X3))). % 0.14/0.41 cnf(i_0_40, plain, (box_verdict(X1,conflict)=conflict|~is_verdict(X1))). % 0.14/0.41 cnf(i_0_11, plain, (leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3))). % 0.14/0.41 cnf(i_0_41, plain, (box_verdict(conflict,X1)=conflict|~is_verdict(X1))). % 0.14/0.41 cnf(i_0_21, plain, (in_open(X1,X2,X3)|~less(X1,X3)|~less(X2,X1))). % 0.14/0.41 cnf(i_0_2, plain, (less(X1,X2)|~less(X3,X2)|~less(X1,X3))). % 0.14/0.41 cnf(i_0_9, plain, (less(X1,X2)|~leq(X1,X3)|~less(X3,X2))). % 0.14/0.41 cnf(i_0_10, plain, (less(X1,X2)|~leq(X3,X2)|~less(X1,X3))). % 0.14/0.41 cnf(i_0_43, plain, (box_verdict(X1,unknown)=unknown|X1=conflict|~is_verdict(X1))). % 0.14/0.41 cnf(i_0_30, plain, (axis_subsumes(X1,X2,X3,X4)|~in_closed(esk3_4(X1,X2,X3,X4),X3,X4))). % 0.14/0.41 cnf(i_0_26, plain, (~axis_conflict(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.14/0.41 cnf(i_0_44, plain, (box_verdict(unknown,X1)=unknown|X1=conflict|~is_verdict(X1))). % 0.14/0.41 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.14/0.41 cnf(i_0_32, plain, (in_closed(X1,X2,X3)|~axis_subsumes(X4,X5,X2,X3)|~in_closed(X1,X4,X5))). % 0.14/0.41 cnf(i_0_27, plain, (axis_compatible(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.14/0.41 cnf(i_0_28, plain, (in_closed(esk2_4(X1,X2,X3,X4),X3,X4)|~axis_compatible(X1,X2,X3,X4))). % 0.14/0.41 cnf(i_0_29, plain, (in_closed(esk2_4(X1,X2,X3,X4),X1,X2)|~axis_compatible(X1,X2,X3,X4))). % 0.14/0.41 cnf(i_0_24, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(esk1_4(X1,X2,X3,X4),X3,X4))). % 0.14/0.41 cnf(i_0_25, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(esk1_4(X1,X2,X3,X4),X1,X2))). % 0.14/0.41 cnf(i_0_31, plain, (axis_subsumes(X1,X2,X3,X4)|in_closed(esk3_4(X1,X2,X3,X4),X1,X2))). % 0.14/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.41 # Begin printing tableau % 0.14/0.41 # Found 5 steps % 0.14/0.41 cnf(i_0_73, negated_conjecture, (leq(v400,esk4_0)), inference(start_rule)). % 0.14/0.41 cnf(i_0_85, plain, (leq(v400,esk4_0)), inference(extension_rule, [i_0_9])). % 0.14/0.41 cnf(i_0_423, plain, (less(v400,v400)), inference(closure_rule, [i_0_1])). % 0.14/0.41 cnf(i_0_425, plain, (~less(esk4_0,v400)), inference(extension_rule, [i_0_17])). % 0.14/0.41 cnf(i_0_471, plain, (~in_lopen(v400,esk4_0,X6)), inference(etableau_closure_rule, [i_0_471, ...])). % 0.14/0.41 # End printing tableau % 0.14/0.41 # SZS output end % 0.14/0.41 # Branches closed with saturation will be marked with an "s" % 0.14/0.41 # There were 2 total branch saturation attempts. % 0.14/0.41 # There were 0 of these attempts blocked. % 0.14/0.41 # There were 0 deferred branch saturation attempts. % 0.14/0.41 # There were 0 free duplicated saturations. % 0.14/0.41 # There were 2 total successful branch saturations. % 0.14/0.41 # There were 0 successful branch saturations in interreduction. % 0.14/0.41 # There were 0 successful branch saturations on the branch. % 0.14/0.41 # There were 2 successful branch saturations after the branch. % 0.14/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.41 # Begin clausification derivation % 0.14/0.41 % 0.14/0.41 # End clausification derivation % 0.14/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.41 cnf(i_0_46, plain, (val(v0))). % 0.14/0.41 cnf(i_0_71, negated_conjecture, (leq(v100,esk6_0))). % 0.14/0.41 cnf(i_0_72, negated_conjecture, (leq(v200,esk5_0))). % 0.14/0.41 cnf(i_0_33, plain, (is_verdict(conflict))). % 0.14/0.41 cnf(i_0_47, plain, (val(v50))). % 0.14/0.41 cnf(i_0_34, plain, (is_verdict(compatible))). % 0.14/0.41 cnf(i_0_35, plain, (is_verdict(unknown))). % 0.14/0.41 cnf(i_0_48, plain, (val(v100))). % 0.14/0.41 cnf(i_0_49, plain, (val(v200))). % 0.14/0.41 cnf(i_0_73, negated_conjecture, (leq(v400,esk4_0))). % 0.14/0.41 cnf(i_0_50, plain, (val(v400))). % 0.14/0.41 cnf(i_0_51, plain, (less(v0,v50))). % 0.14/0.41 cnf(i_0_52, plain, (less(v0,v100))). % 0.14/0.41 cnf(i_0_53, plain, (less(v0,v200))). % 0.14/0.41 cnf(i_0_4, plain, (leq(X1,X1))). % 0.14/0.41 cnf(i_0_54, plain, (less(v0,v400))). % 0.14/0.41 cnf(i_0_55, plain, (less(v50,v100))). % 0.14/0.41 cnf(i_0_56, plain, (less(v50,v200))). % 0.14/0.41 cnf(i_0_57, plain, (less(v50,v400))). % 0.14/0.41 cnf(i_0_58, plain, (less(v100,v200))). % 0.14/0.41 cnf(i_0_59, plain, (less(v100,v400))). % 0.14/0.41 cnf(i_0_60, plain, (less(v200,v400))). % 0.14/0.41 cnf(i_0_42, plain, (box_verdict(compatible,compatible)=compatible)). % 0.14/0.41 cnf(i_0_70, plain, (v50!=v0)). % 0.14/0.41 cnf(i_0_69, plain, (v100!=v0)). % 0.14/0.41 cnf(i_0_66, plain, (v50!=v100)). % 0.14/0.41 cnf(i_0_68, plain, (v200!=v0)). % 0.14/0.41 cnf(i_0_65, plain, (v50!=v200)). % 0.14/0.41 cnf(i_0_36, plain, (compatible!=conflict)). % 0.14/0.41 cnf(i_0_37, plain, (unknown!=conflict)). % 0.14/0.41 cnf(i_0_38, plain, (compatible!=unknown)). % 0.14/0.41 cnf(i_0_63, plain, (v200!=v100)). % 0.14/0.41 cnf(i_0_67, plain, (v400!=v0)). % 0.14/0.41 cnf(i_0_64, plain, (v400!=v50)). % 0.14/0.41 cnf(i_0_62, plain, (v400!=v100)). % 0.14/0.41 cnf(i_0_61, plain, (v400!=v200)). % 0.14/0.41 cnf(i_0_1, plain, (~less(X1,X1))). % 0.14/0.41 cnf(i_0_74, negated_conjecture, (in_lopen(esk6_0,v0,v50)|in_lopen(esk5_0,v0,v100)|in_lopen(esk4_0,v0,v200))). % 0.14/0.41 cnf(i_0_39, plain, (X1=unknown|X1=compatible|X1=conflict|~is_verdict(X1))). % 0.14/0.41 cnf(i_0_5, plain, (leq(X1,X2)|~less(X1,X2))). % 0.14/0.41 cnf(i_0_17, plain, (less(X1,X2)|~in_lopen(X2,X1,X3))). % 0.14/0.41 cnf(i_0_19, plain, (less(X1,X2)|~in_ropen(X1,X3,X2))). % 0.14/0.41 cnf(i_0_23, plain, (less(X1,X2)|~in_open(X2,X1,X3))). % 0.14/0.41 cnf(i_0_22, plain, (less(X1,X2)|~in_open(X1,X3,X2))). % 0.14/0.41 cnf(i_0_16, plain, (leq(X1,X2)|~in_lopen(X1,X3,X2))). % 0.14/0.41 cnf(i_0_14, plain, (leq(X1,X2)|~in_closed(X2,X1,X3))). % 0.14/0.41 cnf(i_0_13, plain, (leq(X1,X2)|~in_closed(X1,X3,X2))). % 0.14/0.41 cnf(i_0_20, plain, (leq(X1,X2)|~in_ropen(X2,X1,X3))). % 0.14/0.41 cnf(i_0_3, plain, (X1=X2|less(X1,X2)|less(X2,X1))). % 0.14/0.41 cnf(i_0_6, plain, (X1=X2|less(X1,X2)|~leq(X1,X2))). % 0.14/0.41 cnf(i_0_7, plain, (X1=X2|~leq(X2,X1)|~leq(X1,X2))). % 0.14/0.41 cnf(i_0_12, plain, (in_closed(X1,X2,X3)|~leq(X1,X3)|~leq(X2,X1))). % 0.14/0.41 cnf(i_0_15, plain, (in_lopen(X1,X2,X3)|~leq(X1,X3)|~less(X2,X1))). % 0.14/0.41 cnf(i_0_18, plain, (in_ropen(X1,X2,X3)|~leq(X2,X1)|~less(X1,X3))). % 0.14/0.41 cnf(i_0_40, plain, (box_verdict(X1,conflict)=conflict|~is_verdict(X1))). % 0.14/0.41 cnf(i_0_11, plain, (leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3))). % 0.14/0.41 cnf(i_0_41, plain, (box_verdict(conflict,X1)=conflict|~is_verdict(X1))). % 0.14/0.41 cnf(i_0_21, plain, (in_open(X1,X2,X3)|~less(X1,X3)|~less(X2,X1))). % 0.14/0.41 cnf(i_0_2, plain, (less(X1,X2)|~less(X3,X2)|~less(X1,X3))). % 0.14/0.41 cnf(i_0_9, plain, (less(X1,X2)|~leq(X1,X3)|~less(X3,X2))). % 0.14/0.41 cnf(i_0_10, plain, (less(X1,X2)|~leq(X3,X2)|~less(X1,X3))). % 0.14/0.41 cnf(i_0_43, plain, (box_verdict(X1,unknown)=unknown|X1=conflict|~is_verdict(X1))). % 0.14/0.41 cnf(i_0_30, plain, (axis_subsumes(X1,X2,X3,X4)|~in_closed(esk3_4(X1,X2,X3,X4),X3,X4))). % 0.14/0.41 cnf(i_0_26, plain, (~axis_conflict(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.14/0.41 cnf(i_0_44, plain, (box_verdict(unknown,X1)=unknown|X1=conflict|~is_verdict(X1))). % 0.14/0.41 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.14/0.41 cnf(i_0_32, plain, (in_closed(X1,X2,X3)|~axis_subsumes(X4,X5,X2,X3)|~in_closed(X1,X4,X5))). % 0.14/0.41 cnf(i_0_27, plain, (axis_compatible(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.14/0.41 cnf(i_0_28, plain, (in_closed(esk2_4(X1,X2,X3,X4),X3,X4)|~axis_compatible(X1,X2,X3,X4))). % 0.14/0.41 cnf(i_0_29, plain, (in_closed(esk2_4(X1,X2,X3,X4),X1,X2)|~axis_compatible(X1,X2,X3,X4))). % 0.14/0.41 cnf(i_0_24, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(esk1_4(X1,X2,X3,X4),X3,X4))). % 0.14/0.41 cnf(i_0_25, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(esk1_4(X1,X2,X3,X4),X1,X2))). % 0.14/0.41 cnf(i_0_31, plain, (axis_subsumes(X1,X2,X3,X4)|in_closed(esk3_4(X1,X2,X3,X4),X1,X2))). % 0.14/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.41 # Begin printing tableau % 0.14/0.41 # Found 6 steps % 0.14/0.41 cnf(i_0_73, negated_conjecture, (leq(v400,esk4_0)), inference(start_rule)). % 0.14/0.41 cnf(i_0_85, plain, (leq(v400,esk4_0)), inference(extension_rule, [i_0_11])). % 0.14/0.41 cnf(i_0_412, plain, (leq(v400,esk4_0)), inference(extension_rule, [i_0_6])). % 0.14/0.41 cnf(i_0_414, plain, (~leq(v400,v400)), inference(closure_rule, [i_0_4])). % 0.14/0.41 cnf(i_0_489, plain, (v400=esk4_0), inference(etableau_closure_rule, [i_0_489, ...])). % 0.14/0.41 cnf(i_0_490, plain, (less(v400,esk4_0)), inference(etableau_closure_rule, [i_0_490, ...])). % 0.14/0.41 # End printing tableau % 0.14/0.41 # SZS output end % 0.14/0.41 # Branches closed with saturation will be marked with an "s" % 0.14/0.41 # Child (2653804) has found a proof. % 0.14/0.41 % 0.14/0.41 # Proof search is over... % 0.14/0.41 # Freeing feature tree %------------------------------------------------------------------------------