%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT111+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 : n015.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.10s 0.42s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT111+1 : TPTP v9.3.0. Released v9.3.0. % 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.10/0.37 % Computer : n015.cluster.edu % 0.10/0.37 % Model : x86_64 x86_64 % 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.37 % Memory : 8046.5625MB % 0.10/0.37 % OS : Linux 6.8.0-71-generic % 0.10/0.37 % CPULimit : 300 % 0.10/0.37 % WCLimit : 300 % 0.10/0.37 % DateTime : Mon Sep 7 14:08:45 UTC 2026 % 0.10/0.37 % CPUTime : % 0.10/0.40 # No SInE strategy applied % 0.10/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.10/0.40 # and selection function SelectComplexExceptUniqMaxHorn. % 0.10/0.40 # % 0.10/0.40 # Presaturation interreduction done % 0.10/0.40 # Number of axioms: 18 Number of unprocessed: 18 % 0.10/0.40 # Tableaux proof search. % 0.10/0.40 # APR header successfully linked. % 0.10/0.40 # Hello from C++ % 0.10/0.40 # The folding up rule is enabled... % 0.10/0.40 # Local unification is enabled... % 0.10/0.40 # Any saturation attempts will use folding labels... % 0.10/0.40 # 18 beginning clauses after preprocessing and clausification % 0.10/0.40 # Creating start rules for all 1 conjectures. % 0.10/0.40 # There are 1 start rule candidates: % 0.10/0.40 # Found 4 unit axioms. % 0.10/0.40 # 1 start rule tableaux created. % 0.10/0.40 # 14 extension rule candidate clauses % 0.10/0.40 # 4 unit axiom clauses % 0.10/0.40 % 0.10/0.40 # Requested 8, 32 cores available to the main process. % 0.10/0.40 # There are not enough tableaux to fork, creating more from the initial 1 % 0.10/0.40 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.10/0.40 # We now have 8 tableaux to operate on % 0.10/0.42 # There were 5 total branch saturation attempts. % 0.10/0.42 # There were 0 of these attempts blocked. % 0.10/0.42 # There were 0 deferred branch saturation attempts. % 0.10/0.42 # There were 0 free duplicated saturations. % 0.10/0.42 # There were 5 total successful branch saturations. % 0.10/0.42 # There were 0 successful branch saturations in interreduction. % 0.10/0.42 # There were 0 successful branch saturations on the branch. % 0.10/0.42 # There were 5 successful branch saturations after the branch. % 0.10/0.42 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.42 # Begin clausification derivation % 0.10/0.42 % 0.10/0.42 # End clausification derivation % 0.10/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.42 cnf(i_0_1, plain, (agent(portal))). % 0.10/0.42 cnf(i_0_3, plain, (action(modify_act))). % 0.10/0.42 cnf(i_0_4, plain, (target(theater_ds))). % 0.10/0.42 cnf(i_0_2, plain, (agent(ensemble))). % 0.10/0.42 cnf(i_0_18, negated_conjecture, (~cnt(X1,modify_act,theater_ds)|~bearer(X1,portal)|~permission(X1))). % 0.10/0.42 cnf(i_0_5, plain, (~activates(X1,X2)|~act(X2,modify_act)|~aee(X2,portal)|~proh(X2))). % 0.10/0.42 cnf(i_0_17, plain, (permission(esk3_3(X1,X2,X3))|proh(esk1_3(X1,X2,X3))|~target(X3)|~action(X2)|~agent(X1))). % 0.10/0.42 cnf(i_0_14, plain, (permission(esk3_3(X1,X2,X3))|aee(esk1_3(X1,X2,X3),X1)|~target(X3)|~action(X2)|~agent(X1))). % 0.10/0.42 cnf(i_0_11, plain, (permission(esk3_3(X1,X2,X3))|act(esk1_3(X1,X2,X3),X2)|~target(X3)|~action(X2)|~agent(X1))). % 0.10/0.42 cnf(i_0_13, plain, (bearer(esk3_3(X1,X2,X3),X1)|aee(esk1_3(X1,X2,X3),X1)|~target(X3)|~action(X2)|~agent(X1))). % 0.10/0.42 cnf(i_0_15, plain, (cnt(esk3_3(X1,X2,X3),X2,X3)|proh(esk1_3(X1,X2,X3))|~target(X3)|~action(X2)|~agent(X1))). % 0.10/0.42 cnf(i_0_16, plain, (bearer(esk3_3(X1,X2,X3),X1)|proh(esk1_3(X1,X2,X3))|~target(X3)|~action(X2)|~agent(X1))). % 0.10/0.42 cnf(i_0_10, plain, (bearer(esk3_3(X1,X2,X3),X1)|act(esk1_3(X1,X2,X3),X2)|~target(X3)|~action(X2)|~agent(X1))). % 0.10/0.42 cnf(i_0_8, plain, (permission(esk3_3(X1,X2,X3))|activates(esk2_3(X1,X2,X3),esk1_3(X1,X2,X3))|~target(X3)|~action(X2)|~agent(X1))). % 0.10/0.42 cnf(i_0_12, plain, (cnt(esk3_3(X1,X2,X3),X2,X3)|aee(esk1_3(X1,X2,X3),X1)|~target(X3)|~action(X2)|~agent(X1))). % 0.10/0.42 cnf(i_0_9, plain, (cnt(esk3_3(X1,X2,X3),X2,X3)|act(esk1_3(X1,X2,X3),X2)|~target(X3)|~action(X2)|~agent(X1))). % 0.10/0.42 cnf(i_0_7, plain, (bearer(esk3_3(X1,X2,X3),X1)|activates(esk2_3(X1,X2,X3),esk1_3(X1,X2,X3))|~target(X3)|~action(X2)|~agent(X1))). % 0.10/0.42 cnf(i_0_6, plain, (cnt(esk3_3(X1,X2,X3),X2,X3)|activates(esk2_3(X1,X2,X3),esk1_3(X1,X2,X3))|~target(X3)|~action(X2)|~agent(X1))). % 0.10/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.10/0.42 # Begin printing tableau % 0.10/0.42 # Found 11 steps % 0.10/0.42 cnf(i_0_18, negated_conjecture, (~cnt(esk3_3(portal,modify_act,theater_ds),modify_act,theater_ds)|~bearer(esk3_3(portal,modify_act,theater_ds),portal)|~permission(esk3_3(portal,modify_act,theater_ds))), inference(start_rule)). % 0.10/0.42 cnf(i_0_20, plain, (~bearer(esk3_3(portal,modify_act,theater_ds),portal)), inference(extension_rule, [i_0_16])). % 0.10/0.42 cnf(i_0_120, plain, (~target(theater_ds)), inference(closure_rule, [i_0_4])). % 0.10/0.42 cnf(i_0_121, plain, (~action(modify_act)), inference(closure_rule, [i_0_3])). % 0.10/0.42 cnf(i_0_122, plain, (~agent(portal)), inference(closure_rule, [i_0_1])). % 0.10/0.42 cnf(i_0_119, plain, (proh(esk1_3(portal,modify_act,theater_ds))), inference(extension_rule, [i_0_5])). % 0.10/0.42 cnf(i_0_19, plain, (~cnt(esk3_3(portal,modify_act,theater_ds),modify_act,theater_ds)), inference(etableau_closure_rule, [i_0_19, ...])). % 0.10/0.42 cnf(i_0_21, plain, (~permission(esk3_3(portal,modify_act,theater_ds))), inference(etableau_closure_rule, [i_0_21, ...])). % 0.10/0.42 cnf(i_0_156, plain, (~activates(X3,esk1_3(portal,modify_act,theater_ds))), inference(etableau_closure_rule, [i_0_156, ...])). % 0.10/0.42 cnf(i_0_157, plain, (~act(esk1_3(portal,modify_act,theater_ds),modify_act)), inference(etableau_closure_rule, [i_0_157, ...])). % 0.10/0.42 cnf(i_0_158, plain, (~aee(esk1_3(portal,modify_act,theater_ds),portal)), inference(etableau_closure_rule, [i_0_158, ...])). % 0.10/0.42 # End printing tableau % 0.10/0.42 # SZS output end % 0.10/0.42 # Branches closed with saturation will be marked with an "s" % 0.10/0.42 # Child (1318005) has found a proof. % 0.10/0.42 % 0.10/0.42 # Proof search is over... % 0.10/0.42 # Freeing feature tree %------------------------------------------------------------------------------