%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT094+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 : n006.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:55 AM UTC 2026 % Result : Theorem 0.09s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT094+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.36 % Computer : n006.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Mon Sep 7 14:25:01 UTC 2026 % 0.09/0.36 % CPUTime : % 0.09/0.40 # No SInE strategy applied % 0.09/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.09/0.40 # and selection function SelectComplexExceptUniqMaxHorn. % 0.09/0.40 # % 0.09/0.40 # Presaturation interreduction done % 0.09/0.40 # Number of axioms: 127 Number of unprocessed: 126 % 0.09/0.40 # Tableaux proof search. % 0.09/0.40 # APR header successfully linked. % 0.09/0.40 # Hello from C++ % 0.09/0.40 # The folding up rule is enabled... % 0.09/0.40 # Local unification is enabled... % 0.09/0.40 # Any saturation attempts will use folding labels... % 0.09/0.40 # 126 beginning clauses after preprocessing and clausification % 0.09/0.40 # Creating start rules for all 1 conjectures. % 0.09/0.40 # There are 1 start rule candidates: % 0.09/0.40 # Found 82 unit axioms. % 0.09/0.40 # 1 start rule tableaux created. % 0.09/0.40 # 44 extension rule candidate clauses % 0.09/0.40 # 82 unit axiom clauses % 0.09/0.40 % 0.09/0.40 # Requested 8, 32 cores available to the main process. % 0.09/0.40 # There are not enough tableaux to fork, creating more from the initial 1 % 0.09/0.40 # Closed tableau found in foldup close cycle with 0 folds and 1 closures done. % 0.09/0.40 # There were 0 total branch saturation attempts. % 0.09/0.40 # There were 0 of these attempts blocked. % 0.09/0.40 # There were 0 deferred branch saturation attempts. % 0.09/0.40 # There were 0 free duplicated saturations. % 0.09/0.40 # There were 0 total successful branch saturations. % 0.09/0.40 # There were 0 successful branch saturations in interreduction. % 0.09/0.40 # There were 0 successful branch saturations on the branch. % 0.09/0.40 # There were 0 successful branch saturations after the branch. % 0.09/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.09/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.09/0.40 # Begin clausification derivation % 0.09/0.40 % 0.09/0.40 # End clausification derivation % 0.09/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.09/0.40 cnf(i_0_33, plain, (is_verdict(conflict))). % 0.09/0.40 cnf(i_0_46, plain, (is_presence(present))). % 0.09/0.40 cnf(i_0_62, plain, (val(v0))). % 0.09/0.40 cnf(i_0_68, plain, (val(v600))). % 0.09/0.40 cnf(i_0_34, plain, (is_verdict(compatible))). % 0.09/0.40 cnf(i_0_69, plain, (val(v800))). % 0.09/0.40 cnf(i_0_35, plain, (is_verdict(unknown))). % 0.09/0.40 cnf(i_0_47, plain, (is_presence(absent))). % 0.09/0.40 cnf(i_0_63, plain, (val(v16))). % 0.09/0.40 cnf(i_0_64, plain, (val(v32))). % 0.09/0.40 cnf(i_0_75, plain, (less(v0,v600))). % 0.09/0.40 cnf(i_0_76, plain, (less(v0,v800))). % 0.09/0.40 cnf(i_0_97, plain, (less(v600,v800))). % 0.09/0.40 cnf(i_0_65, plain, (val(v150))). % 0.09/0.40 cnf(i_0_66, plain, (val(v300))). % 0.09/0.40 cnf(i_0_67, plain, (val(v400))). % 0.09/0.40 cnf(i_0_4, plain, (leq(X1,X1))). % 0.09/0.40 cnf(i_0_70, plain, (less(v0,v16))). % 0.09/0.40 cnf(i_0_71, plain, (less(v0,v32))). % 0.09/0.40 cnf(i_0_72, plain, (less(v0,v150))). % 0.09/0.40 cnf(i_0_73, plain, (less(v0,v300))). % 0.09/0.40 cnf(i_0_74, plain, (less(v0,v400))). % 0.09/0.40 cnf(i_0_81, plain, (less(v16,v600))). % 0.09/0.40 cnf(i_0_82, plain, (less(v16,v800))). % 0.09/0.40 cnf(i_0_86, plain, (less(v32,v600))). % 0.09/0.40 cnf(i_0_77, plain, (less(v16,v32))). % 0.09/0.40 cnf(i_0_78, plain, (less(v16,v150))). % 0.09/0.40 cnf(i_0_79, plain, (less(v16,v300))). % 0.09/0.40 cnf(i_0_80, plain, (less(v16,v400))). % 0.09/0.40 cnf(i_0_87, plain, (less(v32,v800))). % 0.09/0.40 cnf(i_0_90, plain, (less(v150,v600))). % 0.09/0.40 cnf(i_0_91, plain, (less(v150,v800))). % 0.09/0.40 cnf(i_0_93, plain, (less(v300,v600))). % 0.09/0.40 cnf(i_0_94, plain, (less(v300,v800))). % 0.09/0.40 cnf(i_0_83, plain, (less(v32,v150))). % 0.09/0.40 cnf(i_0_95, plain, (less(v400,v600))). % 0.09/0.40 cnf(i_0_84, plain, (less(v32,v300))). % 0.09/0.40 cnf(i_0_85, plain, (less(v32,v400))). % 0.09/0.40 cnf(i_0_88, plain, (less(v150,v300))). % 0.09/0.40 cnf(i_0_89, plain, (less(v150,v400))). % 0.09/0.40 cnf(i_0_96, plain, (less(v400,v800))). % 0.09/0.40 cnf(i_0_92, plain, (less(v300,v400))). % 0.09/0.40 cnf(i_0_51, plain, (subs_verdict(X1,X2,present,X3,X4,absent)=unknown)). % 0.09/0.40 cnf(i_0_50, plain, (subs_verdict(X1,X2,absent,X3,X4,present)=unknown)). % 0.09/0.40 cnf(i_0_52, plain, (subs_verdict(X1,X2,absent,X3,X4,absent)=unknown)). % 0.09/0.40 cnf(i_0_42, plain, (box_verdict(compatible,compatible)=compatible)). % 0.09/0.40 cnf(i_0_56, plain, (box_subs(compatible,compatible)=compatible)). % 0.09/0.40 cnf(i_0_120, plain, (v600!=v0)). % 0.09/0.40 cnf(i_0_119, plain, (v800!=v0)). % 0.09/0.40 cnf(i_0_98, plain, (v800!=v600)). % 0.09/0.40 cnf(i_0_127, negated_conjecture, (subs_verdict(v0,v800,present,v0,v600,present)!=conflict)). % 0.09/0.40 cnf(i_0_36, plain, (compatible!=conflict)). % 0.09/0.40 cnf(i_0_37, plain, (unknown!=conflict)). % 0.09/0.40 cnf(i_0_38, plain, (unknown!=compatible)). % 0.09/0.40 cnf(i_0_48, plain, (absent!=present)). % 0.09/0.40 cnf(i_0_125, plain, (v16!=v0)). % 0.09/0.40 cnf(i_0_124, plain, (v32!=v0)). % 0.09/0.40 cnf(i_0_123, plain, (v150!=v0)). % 0.09/0.40 cnf(i_0_122, plain, (v300!=v0)). % 0.09/0.40 cnf(i_0_121, plain, (v400!=v0)). % 0.09/0.40 cnf(i_0_114, plain, (v16!=v600)). % 0.09/0.40 cnf(i_0_109, plain, (v32!=v600)). % 0.09/0.40 cnf(i_0_118, plain, (v32!=v16)). % 0.09/0.40 cnf(i_0_117, plain, (v150!=v16)). % 0.09/0.40 cnf(i_0_112, plain, (v150!=v32)). % 0.09/0.40 cnf(i_0_116, plain, (v300!=v16)). % 0.09/0.40 cnf(i_0_111, plain, (v300!=v32)). % 0.09/0.40 cnf(i_0_105, plain, (v150!=v600)). % 0.09/0.40 cnf(i_0_102, plain, (v300!=v600)). % 0.09/0.40 cnf(i_0_100, plain, (v400!=v600)). % 0.09/0.40 cnf(i_0_113, plain, (v16!=v800)). % 0.09/0.40 cnf(i_0_108, plain, (v32!=v800)). % 0.09/0.40 cnf(i_0_107, plain, (v300!=v150)). % 0.09/0.40 cnf(i_0_115, plain, (v400!=v16)). % 0.09/0.40 cnf(i_0_110, plain, (v400!=v32)). % 0.09/0.40 cnf(i_0_106, plain, (v400!=v150)). % 0.09/0.40 cnf(i_0_103, plain, (v400!=v300)). % 0.09/0.40 cnf(i_0_104, plain, (v150!=v800)). % 0.09/0.40 cnf(i_0_101, plain, (v300!=v800)). % 0.09/0.40 cnf(i_0_99, plain, (v400!=v800)). % 0.09/0.40 cnf(i_0_126, plain, (~axis_subsumes(v0,v800,v0,v600))). % 0.09/0.40 cnf(i_0_1, plain, (~less(X1,X1))). % 0.09/0.40 cnf(i_0_49, plain, (X1=absent|X1=present|~is_presence(X1))). % 0.09/0.40 cnf(i_0_39, plain, (X1=unknown|X1=compatible|X1=conflict|~is_verdict(X1))). % 0.09/0.40 cnf(i_0_5, plain, (leq(X1,X2)|~less(X1,X2))). % 0.09/0.40 cnf(i_0_3, plain, (X1=X2|less(X1,X2)|less(X2,X1))). % 0.09/0.40 cnf(i_0_17, plain, (less(X1,X2)|~in_lopen(X2,X1,X3))). % 0.09/0.40 cnf(i_0_19, plain, (less(X1,X2)|~in_ropen(X1,X3,X2))). % 0.09/0.40 cnf(i_0_23, plain, (less(X1,X2)|~in_open(X2,X1,X3))). % 0.09/0.40 cnf(i_0_22, plain, (less(X1,X2)|~in_open(X1,X3,X2))). % 0.09/0.40 cnf(i_0_14, plain, (leq(X1,X2)|~in_closed(X2,X1,X3))). % 0.09/0.40 cnf(i_0_13, plain, (leq(X1,X2)|~in_closed(X1,X3,X2))). % 0.09/0.40 cnf(i_0_16, plain, (leq(X1,X2)|~in_lopen(X1,X3,X2))). % 0.09/0.40 cnf(i_0_20, plain, (leq(X1,X2)|~in_ropen(X2,X1,X3))). % 0.09/0.40 cnf(i_0_40, plain, (box_verdict(X1,conflict)=conflict|~is_verdict(X1))). % 0.09/0.40 cnf(i_0_7, plain, (X1=X2|~leq(X2,X1)|~leq(X1,X2))). % 0.09/0.40 cnf(i_0_6, plain, (X1=X2|less(X1,X2)|~leq(X1,X2))). % 0.09/0.40 cnf(i_0_12, plain, (in_closed(X1,X2,X3)|~leq(X1,X3)|~leq(X2,X1))). % 0.09/0.40 cnf(i_0_15, plain, (in_lopen(X1,X2,X3)|~leq(X1,X3)|~less(X2,X1))). % 0.09/0.40 cnf(i_0_41, plain, (box_verdict(conflict,X1)=conflict|~is_verdict(X1))). % 0.09/0.40 cnf(i_0_57, plain, (box_subs(X1,conflict)=conflict|~is_verdict(X1))). % 0.09/0.40 cnf(i_0_58, plain, (box_subs(conflict,X1)=conflict|~is_verdict(X1))). % 0.09/0.40 cnf(i_0_18, plain, (in_ropen(X1,X2,X3)|~leq(X2,X1)|~less(X1,X3))). % 0.09/0.40 cnf(i_0_21, plain, (in_open(X1,X2,X3)|~less(X1,X3)|~less(X2,X1))). % 0.09/0.40 cnf(i_0_2, plain, (less(X1,X2)|~less(X3,X2)|~less(X1,X3))). % 0.09/0.40 cnf(i_0_9, plain, (less(X1,X2)|~leq(X1,X3)|~less(X3,X2))). % 0.09/0.40 cnf(i_0_54, plain, (subs_verdict(X1,X2,present,X3,X4,present)=conflict|axis_subsumes(X1,X2,X3,X4))). % 0.09/0.40 cnf(i_0_53, plain, (subs_verdict(X1,X2,present,X3,X4,present)=compatible|~axis_subsumes(X1,X2,X3,X4))). % 0.09/0.40 cnf(i_0_59, plain, (box_subs(X1,X2)=unknown|X2=compatible|X2=conflict|X1=conflict|~is_verdict(X1)|~is_verdict(X2))). % 0.09/0.40 cnf(i_0_10, plain, (less(X1,X2)|~leq(X3,X2)|~less(X1,X3))). % 0.09/0.40 cnf(i_0_11, plain, (leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3))). % 0.09/0.40 cnf(i_0_26, plain, (~axis_conflict(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.09/0.40 cnf(i_0_30, plain, (axis_subsumes(X1,X2,X3,X4)|~in_closed(esk3_4(X1,X2,X3,X4),X3,X4))). % 0.09/0.40 cnf(i_0_60, plain, (box_subs(X1,X2)=unknown|X1=compatible|X1=conflict|X2=conflict|~is_verdict(X2)|~is_verdict(X1))). % 0.09/0.40 cnf(i_0_43, plain, (box_verdict(X1,unknown)=unknown|X1=conflict|~is_verdict(X1))). % 0.09/0.40 cnf(i_0_44, plain, (box_verdict(unknown,X1)=unknown|X1=conflict|~is_verdict(X1))). % 0.09/0.40 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.09/0.40 cnf(i_0_61, plain, (box_subs(X1,X2)=unknown|box_subs(X1,X2)=compatible|box_subs(X1,X2)=conflict|~is_verdict(X2)|~is_verdict(X1))). % 0.09/0.40 cnf(i_0_32, plain, (in_closed(X1,X2,X3)|~axis_subsumes(X4,X5,X2,X3)|~in_closed(X1,X4,X5))). % 0.09/0.40 cnf(i_0_27, plain, (axis_compatible(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.09/0.40 cnf(i_0_28, plain, (in_closed(esk2_4(X1,X2,X3,X4),X3,X4)|~axis_compatible(X1,X2,X3,X4))). % 0.09/0.40 cnf(i_0_29, plain, (in_closed(esk2_4(X1,X2,X3,X4),X1,X2)|~axis_compatible(X1,X2,X3,X4))). % 0.09/0.40 cnf(i_0_24, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(esk1_4(X1,X2,X3,X4),X3,X4))). % 0.09/0.40 cnf(i_0_25, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(esk1_4(X1,X2,X3,X4),X1,X2))). % 0.09/0.40 cnf(i_0_31, plain, (axis_subsumes(X1,X2,X3,X4)|in_closed(esk3_4(X1,X2,X3,X4),X1,X2))). % 0.09/0.40 cnf(i_0_55, plain, (subs_verdict(X1,X2,X3,X4,X5,X6)=unknown|subs_verdict(X1,X2,X3,X4,X5,X6)=compatible|subs_verdict(X1,X2,X3,X4,X5,X6)=conflict|~is_presence(X6)|~is_presence(X3))). % 0.09/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.09/0.40 # Begin printing tableau % 0.09/0.40 # Found 3 steps % 0.09/0.40 cnf(i_0_127, negated_conjecture, (subs_verdict(v0,v800,present,v0,v600,present)!=conflict), inference(start_rule)). % 0.09/0.40 cnf(i_0_139, plain, (subs_verdict(v0,v800,present,v0,v600,present)!=conflict), inference(extension_rule, [i_0_54])). % 0.09/0.40 cnf(i_0_201, plain, (axis_subsumes(v0,v800,v0,v600)), inference(closure_rule, [i_0_126])). % 0.09/0.40 # End printing tableau % 0.09/0.40 # SZS output end % 0.09/0.40 # Branches closed with saturation will be marked with an "s" % 0.09/0.40 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux. % 0.09/0.40 # We now have 5 tableaux to operate on % 0.09/0.40 # Found closed tableau during pool population. % 0.09/0.40 # Proof search is over... % 0.09/0.40 # Freeing feature tree %------------------------------------------------------------------------------