%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT092+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 : n016.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.03s 0.41s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT092+1 : TPTP v9.3.1. Bugfixed v9.3.1. % 0.00/0.03 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.10/0.36 % Computer : n016.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % OS : Linux 6.8.0-71-generic % 0.03/0.36 % CPULimit : 300 % 0.03/0.36 % WCLimit : 300 % 0.03/0.36 % DateTime : Mon Sep 7 14:28:47 UTC 2026 % 0.03/0.36 % CPUTime : % 0.03/0.40 # No SInE strategy applied % 0.03/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N % 0.03/0.40 # and selection function SelectUnlessUniqMax. % 0.03/0.40 # % 0.03/0.40 # Presaturation interreduction done % 0.03/0.40 # Number of axioms: 65 Number of unprocessed: 61 % 0.03/0.40 # Tableaux proof search. % 0.03/0.40 # APR header successfully linked. % 0.03/0.40 # Hello from C++ % 0.03/0.40 # The folding up rule is enabled... % 0.03/0.40 # Local unification is enabled... % 0.03/0.40 # Any saturation attempts will use folding labels... % 0.03/0.40 # 61 beginning clauses after preprocessing and clausification % 0.03/0.40 # Creating start rules for all 1 conjectures. % 0.03/0.40 # There are 1 start rule candidates: % 0.03/0.40 # Found 23 unit axioms. % 0.03/0.40 # 1 start rule tableaux created. % 0.03/0.40 # 38 extension rule candidate clauses % 0.03/0.40 # 23 unit axiom clauses % 0.03/0.40 % 0.03/0.40 # Requested 8, 32 cores available to the main process. % 0.03/0.40 # There are not enough tableaux to fork, creating more from the initial 1 % 0.03/0.41 # There were 3 total branch saturation attempts. % 0.03/0.41 # There were 0 of these attempts blocked. % 0.03/0.41 # There were 0 deferred branch saturation attempts. % 0.03/0.41 # There were 0 free duplicated saturations. % 0.03/0.41 # There were 3 total successful branch saturations. % 0.03/0.41 # There were 0 successful branch saturations in interreduction. % 0.03/0.41 # There were 0 successful branch saturations on the branch. % 0.03/0.41 # There were 3 successful branch saturations after the branch. % 0.03/0.41 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.03/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.03/0.41 # Begin clausification derivation % 0.03/0.41 % 0.03/0.41 # End clausification derivation % 0.03/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.03/0.41 cnf(i_0_52, plain, (val(v0))). % 0.03/0.41 cnf(i_0_53, plain, (val(v400))). % 0.03/0.41 cnf(i_0_54, plain, (val(v800))). % 0.03/0.41 cnf(i_0_55, plain, (val(v1200))). % 0.03/0.41 cnf(i_0_56, plain, (less(v0,v400))). % 0.03/0.41 cnf(i_0_39, plain, (is_verdict(conflict))). % 0.03/0.41 cnf(i_0_40, plain, (is_verdict(compatible))). % 0.03/0.41 cnf(i_0_41, plain, (is_verdict(unknown))). % 0.03/0.41 cnf(i_0_57, plain, (less(v400,v800))). % 0.03/0.41 cnf(i_0_58, plain, (less(v800,v1200))). % 0.03/0.41 cnf(i_0_4, plain, (leq(X1,X1))). % 0.03/0.41 cnf(i_0_48, plain, (box_verdict(compatible,compatible)=compatible)). % 0.03/0.41 cnf(i_0_64, plain, (v0!=v400)). % 0.03/0.41 cnf(i_0_63, plain, (v0!=v800)). % 0.03/0.41 cnf(i_0_61, plain, (v800!=v400)). % 0.03/0.41 cnf(i_0_62, plain, (v1200!=v0)). % 0.03/0.41 cnf(i_0_60, plain, (v1200!=v400)). % 0.03/0.41 cnf(i_0_42, plain, (compatible!=conflict)). % 0.03/0.41 cnf(i_0_43, plain, (unknown!=conflict)). % 0.03/0.41 cnf(i_0_44, plain, (compatible!=unknown)). % 0.03/0.41 cnf(i_0_59, plain, (v1200!=v800)). % 0.03/0.41 cnf(i_0_1, plain, (~less(X1,X1))). % 0.03/0.41 cnf(i_0_65, negated_conjecture, (~completion_conflict(v400,v800,v0,v1200))). % 0.03/0.41 cnf(i_0_5, plain, (leq(X1,X2)|~less(X1,X2))). % 0.03/0.41 cnf(i_0_23, plain, (less(X1,X2)|~in_lopen(X2,X1,X3))). % 0.03/0.41 cnf(i_0_25, plain, (less(X1,X2)|~in_ropen(X1,X3,X2))). % 0.03/0.41 cnf(i_0_45, plain, (X1=unknown|X1=compatible|X1=conflict|~is_verdict(X1))). % 0.03/0.41 cnf(i_0_29, plain, (less(X1,X2)|~in_open(X2,X1,X3))). % 0.03/0.41 cnf(i_0_28, plain, (less(X1,X2)|~in_open(X1,X3,X2))). % 0.03/0.41 cnf(i_0_20, plain, (leq(X1,X2)|~in_closed(X2,X1,X3))). % 0.03/0.41 cnf(i_0_19, plain, (leq(X1,X2)|~in_closed(X1,X3,X2))). % 0.03/0.41 cnf(i_0_22, plain, (leq(X1,X2)|~in_lopen(X1,X3,X2))). % 0.03/0.41 cnf(i_0_26, plain, (leq(X1,X2)|~in_ropen(X2,X1,X3))). % 0.03/0.41 cnf(i_0_7, plain, (X1=X2|~leq(X2,X1)|~leq(X1,X2))). % 0.03/0.41 cnf(i_0_6, plain, (X1=X2|less(X1,X2)|~leq(X1,X2))). % 0.03/0.41 cnf(i_0_46, plain, (box_verdict(X1,conflict)=conflict|~is_verdict(X1))). % 0.03/0.41 cnf(i_0_3, plain, (X1=X2|less(X1,X2)|less(X2,X1))). % 0.03/0.41 cnf(i_0_12, plain, (completion_compatible(X1,X2,X3)|~leq(X1,X3)|~leq(X2,X1))). % 0.03/0.41 cnf(i_0_18, plain, (in_closed(X1,X2,X3)|~leq(X1,X3)|~leq(X2,X1))). % 0.03/0.41 cnf(i_0_21, plain, (in_lopen(X1,X2,X3)|~leq(X1,X3)|~less(X2,X1))). % 0.03/0.41 cnf(i_0_24, plain, (in_ropen(X1,X2,X3)|~leq(X2,X1)|~less(X1,X3))). % 0.03/0.41 cnf(i_0_27, plain, (in_open(X1,X2,X3)|~less(X1,X3)|~less(X2,X1))). % 0.03/0.41 cnf(i_0_47, plain, (box_verdict(conflict,X1)=conflict|~is_verdict(X1))). % 0.03/0.41 cnf(i_0_2, plain, (less(X1,X2)|~less(X3,X2)|~less(X1,X3))). % 0.03/0.41 cnf(i_0_9, plain, (less(X1,X2)|~leq(X1,X3)|~less(X3,X2))). % 0.03/0.41 cnf(i_0_10, plain, (less(X1,X2)|~leq(X3,X2)|~less(X1,X3))). % 0.03/0.41 cnf(i_0_11, plain, (leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3))). % 0.03/0.41 cnf(i_0_32, plain, (~in_closed(X1,X2,X3)|~in_closed(X1,X4,X5)|~axis_conflict(X4,X5,X2,X3))). % 0.03/0.41 cnf(i_0_36, plain, (axis_subsumes(X1,X2,X3,X4)|~in_closed(esk3_4(X1,X2,X3,X4),X3,X4))). % 0.03/0.41 cnf(i_0_17, plain, (in_closed(X1,X2,X3)|~in_closed(X1,X4,X5)|~axis_subsumes(X4,X5,X2,X3))). % 0.03/0.41 cnf(i_0_49, plain, (box_verdict(X1,unknown)=unknown|X1=conflict|~is_verdict(X1))). % 0.03/0.41 cnf(i_0_50, plain, (box_verdict(unknown,X1)=unknown|X1=conflict|~is_verdict(X1))). % 0.03/0.41 cnf(i_0_15, plain, (completion_conflict(X1,X2,X3,X4)|~leq(X2,X4)|~leq(X1,X4)|~leq(X3,X1)|~less(X1,X2))). % 0.03/0.41 cnf(i_0_51, plain, (box_verdict(X1,X2)=unknown|box_verdict(X1,X2)=compatible|box_verdict(X1,X2)=conflict|~is_verdict(X2)|~is_verdict(X1))). % 0.03/0.41 cnf(i_0_37, plain, (in_closed(esk3_4(X1,X2,X3,X4),X1,X2)|axis_subsumes(X1,X2,X3,X4))). % 0.03/0.41 cnf(i_0_33, plain, (axis_compatible(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.03/0.41 cnf(i_0_34, plain, (in_closed(esk2_4(X1,X2,X3,X4),X3,X4)|~axis_compatible(X1,X2,X3,X4))). % 0.03/0.41 cnf(i_0_30, plain, (in_closed(esk1_4(X1,X2,X3,X4),X3,X4)|axis_conflict(X1,X2,X3,X4))). % 0.03/0.41 cnf(i_0_35, plain, (in_closed(esk2_4(X1,X2,X3,X4),X1,X2)|~axis_compatible(X1,X2,X3,X4))). % 0.03/0.41 cnf(i_0_31, plain, (in_closed(esk1_4(X1,X2,X3,X4),X1,X2)|axis_conflict(X1,X2,X3,X4))). % 0.03/0.41 cnf(i_0_16, plain, (axis_conflict(X1,X2,X3,X4)|~axis_conflict(X5,X6,X3,X4)|~axis_subsumes(X1,X2,X5,X6))). % 0.03/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.03/0.41 # Begin printing tableau % 0.03/0.41 # Found 7 steps % 0.03/0.41 cnf(i_0_65, negated_conjecture, (~completion_conflict(v400,v800,v0,v1200)), inference(start_rule)). % 0.03/0.41 cnf(i_0_73, plain, (~completion_conflict(v400,v800,v0,v1200)), inference(extension_rule, [i_0_15])). % 0.03/0.41 cnf(i_0_154, plain, (~less(v400,v800)), inference(closure_rule, [i_0_57])). % 0.03/0.41 cnf(i_0_151, plain, (~leq(v800,v1200)), inference(extension_rule, [i_0_20])). % 0.03/0.41 cnf(i_0_152, plain, (~leq(v400,v1200)), inference(etableau_closure_rule, [i_0_152, ...])). % 0.03/0.41 cnf(i_0_153, plain, (~leq(v0,v400)), inference(etableau_closure_rule, [i_0_153, ...])). % 0.03/0.41 cnf(i_0_191, plain, (~in_closed(v1200,v800,X6)), inference(etableau_closure_rule, [i_0_191, ...])). % 0.03/0.41 # End printing tableau % 0.03/0.41 # SZS output end % 0.03/0.41 # Branches closed with saturation will be marked with an "s" % 0.03/0.41 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.03/0.41 # We now have 2 tableaux to operate on % 0.03/0.41 # Found closed tableau during pool population. % 0.03/0.41 # Proof search is over... % 0.03/0.41 # Freeing feature tree %------------------------------------------------------------------------------