%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT116+1 : TPTP v9.3.0. Released v9.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 : n001.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:56 AM UTC 2026 % Result : Theorem 0.13s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT116+1 : TPTP v9.3.0. Released v9.3.0. % 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.34 % Computer : n001.cluster.edu % 0.10/0.34 % Model : x86_64 x86_64 % 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.34 % Memory : 8046.5625MB % 0.10/0.34 % OS : Linux 6.8.0-71-generic % 0.10/0.34 % CPULimit : 300 % 0.10/0.34 % WCLimit : 300 % 0.10/0.34 % DateTime : Mon Sep 7 14:14:07 UTC 2026 % 0.10/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 12 Number of unprocessed: 12 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # 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 # 12 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 1 conjectures. % 0.13/0.37 # There are 1 start rule candidates: % 0.13/0.37 # Found 11 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 1 extension rule candidate clauses % 0.13/0.37 # 11 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 1 % 0.13/0.37 # Closed tableau found in foldup close cycle with 0 folds and 4 closures done. % 0.13/0.37 # There were 0 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 0 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 0 successful branch saturations after the branch. % 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_8, plain, (subjection(s))). % 0.13/0.37 cnf(i_0_2, plain, (position(s))). % 0.13/0.37 cnf(i_0_5, plain, (event(e1))). % 0.13/0.37 cnf(i_0_3, plain, (legal_relator(rho_r))). % 0.13/0.37 cnf(i_0_4, plain, (rule(f1))). % 0.13/0.37 cnf(i_0_6, plain, (action(some_action))). % 0.13/0.37 cnf(i_0_7, plain, (target(some_target))). % 0.13/0.37 cnf(i_0_10, plain, (part_of(s,rho_r))). % 0.13/0.37 cnf(i_0_11, plain, (founds_rem(e1,rho_r,f1))). % 0.13/0.37 cnf(i_0_9, plain, (cnt(s,decl(some_action),some_target))). % 0.13/0.37 cnf(i_0_12, negated_conjecture, (~about_event(s,e1))). % 0.13/0.37 cnf(i_0_1, plain, (about_event(X1,X2)|~founds_rem(X2,X3,X4)|~part_of(X1,X3)|~cnt(X1,decl(X5),X6)|~subjection(X1))). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 6 steps % 0.13/0.37 cnf(i_0_12, negated_conjecture, (~about_event(s,e1)), inference(start_rule)). % 0.13/0.37 cnf(i_0_13, plain, (~about_event(s,e1)), inference(extension_rule, [i_0_1])). % 0.13/0.37 cnf(i_0_15, plain, (~founds_rem(e1,rho_r,f1)), inference(closure_rule, [i_0_11])). % 0.13/0.37 cnf(i_0_16, plain, (~part_of(s,rho_r)), inference(closure_rule, [i_0_10])). % 0.13/0.37 cnf(i_0_17, plain, (~cnt(s,decl(some_action),some_target)), inference(closure_rule, [i_0_9])). % 0.13/0.37 cnf(i_0_18, plain, (~subjection(s)), inference(closure_rule, [i_0_8])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 1 tableaux to operate on % 0.13/0.37 # Found closed tableau during pool population. % 0.13/0.37 # Proof search is over... % 0.13/0.37 # Freeing feature tree %------------------------------------------------------------------------------