%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT114+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 : n029.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 : Unsatisfiable 0.13s 0.45s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT114+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.08/0.35 % Computer : n029.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Mon Sep 7 14:09:42 UTC 2026 % 0.08/0.35 % CPUTime : % 0.08/0.39 # No SInE strategy applied % 0.08/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.08/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.08/0.39 # % 0.08/0.39 # Presaturation interreduction done % 0.08/0.39 # Number of axioms: 51 Number of unprocessed: 51 % 0.08/0.39 # Tableaux proof search. % 0.08/0.39 # APR header successfully linked. % 0.08/0.39 # Hello from C++ % 0.08/0.39 # The folding up rule is enabled... % 0.08/0.39 # Local unification is enabled... % 0.08/0.39 # Any saturation attempts will use folding labels... % 0.08/0.39 # 51 beginning clauses after preprocessing and clausification % 0.08/0.39 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.08/0.39 # No conjectures. % 0.08/0.39 # There are 51 start rule candidates: % 0.08/0.39 # Found 17 unit axioms. % 0.08/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.08/0.39 # 51 start rule tableaux created. % 0.08/0.39 # 34 extension rule candidate clauses % 0.08/0.39 # 17 unit axiom clauses % 0.08/0.39 % 0.08/0.39 # Requested 8, 32 cores available to the main process. % 0.13/0.45 # There were 2 total branch saturation attempts. % 0.13/0.45 # There were 0 of these attempts blocked. % 0.13/0.45 # There were 0 deferred branch saturation attempts. % 0.13/0.45 # There were 0 free duplicated saturations. % 0.13/0.45 # There were 2 total successful branch saturations. % 0.13/0.45 # There were 0 successful branch saturations in interreduction. % 0.13/0.45 # There were 0 successful branch saturations on the branch. % 0.13/0.45 # There were 2 successful branch saturations after the branch. % 0.13/0.45 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.45 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.45 # Begin clausification derivation % 0.13/0.45 % 0.13/0.45 # End clausification derivation % 0.13/0.45 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.45 cnf(i_0_6, plain, (odrl_rel(rho1))). % 0.13/0.45 cnf(i_0_7, plain, (permission(l))). % 0.13/0.45 cnf(i_0_8, plain, (no_right(n1))). % 0.13/0.45 cnf(i_0_9, plain, (no_right(n2))). % 0.13/0.45 cnf(i_0_2, plain, (position(l))). % 0.13/0.45 cnf(i_0_3, plain, (position(n1))). % 0.13/0.45 cnf(i_0_4, plain, (position(n2))). % 0.13/0.45 cnf(i_0_5, plain, (legal_relator(rho1))). % 0.13/0.45 cnf(i_0_16, plain, (action(some_action))). % 0.13/0.45 cnf(i_0_17, plain, (target(some_target))). % 0.13/0.45 cnf(i_0_10, plain, (part_of(l,rho1))). % 0.13/0.45 cnf(i_0_11, plain, (part_of(n1,rho1))). % 0.13/0.45 cnf(i_0_12, plain, (part_of(n2,rho1))). % 0.13/0.45 cnf(i_0_13, plain, (cnt(l,some_action,some_target))). % 0.13/0.45 cnf(i_0_14, plain, (cnt(n1,some_action,some_target))). % 0.13/0.45 cnf(i_0_15, plain, (cnt(n2,some_action,some_target))). % 0.13/0.45 cnf(i_0_18, plain, (n2!=n1)). % 0.13/0.45 cnf(i_0_1, plain, (epred1_3(X1,X2,X3)|~odrl_rel(X3))). % 0.13/0.45 cnf(i_0_19, plain, (X1=l|~cnt(X1,some_action,some_target)|~part_of(X1,rho1)|~permission(X1))). % 0.13/0.45 cnf(i_0_23, plain, (permission(esk4_3(X1,X2,X3))|esk3_4(X1,X2,X3,X4)!=X4|~epred1_3(X3,X2,X1)|~no_right(X4)|~cnt(X4,X2,X3)|~part_of(X4,X1))). % 0.13/0.45 cnf(i_0_39, plain, (no_right(esk2_3(X1,X2,X3))|esk1_4(X1,X2,X3,X4)!=X4|~epred1_3(X3,X2,X1)|~cnt(X4,X2,X3)|~part_of(X4,X1)|~permission(X4))). % 0.13/0.45 cnf(i_0_38, plain, (part_of(esk2_3(X1,X2,X3),X1)|esk1_4(X1,X2,X3,X4)!=X4|~epred1_3(X3,X2,X1)|~cnt(X4,X2,X3)|~part_of(X4,X1)|~permission(X4))). % 0.13/0.45 cnf(i_0_35, plain, (no_right(esk3_4(X1,X2,X3,X4))|permission(esk4_3(X1,X2,X3))|~epred1_3(X3,X2,X1)|~no_right(X4)|~cnt(X4,X2,X3)|~part_of(X4,X1))). % 0.13/0.45 cnf(i_0_22, plain, (part_of(esk4_3(X1,X2,X3),X1)|esk3_4(X1,X2,X3,X4)!=X4|~epred1_3(X3,X2,X1)|~no_right(X4)|~cnt(X4,X2,X3)|~part_of(X4,X1))). % 0.13/0.45 cnf(i_0_51, plain, (no_right(esk2_3(X1,X2,X3))|permission(esk1_4(X1,X2,X3,X4))|~epred1_3(X3,X2,X1)|~cnt(X4,X2,X3)|~part_of(X4,X1)|~permission(X4))). % 0.13/0.45 cnf(i_0_37, plain, (cnt(esk2_3(X1,X2,X3),X2,X3)|esk1_4(X1,X2,X3,X4)!=X4|~epred1_3(X3,X2,X1)|~cnt(X4,X2,X3)|~part_of(X4,X1)|~permission(X4))). % 0.13/0.45 cnf(i_0_21, plain, (cnt(esk4_3(X1,X2,X3),X2,X3)|esk3_4(X1,X2,X3,X4)!=X4|~epred1_3(X3,X2,X1)|~no_right(X4)|~cnt(X4,X2,X3)|~part_of(X4,X1))). % 0.13/0.45 cnf(i_0_36, plain, (X1=esk2_3(X2,X3,X4)|esk1_4(X2,X3,X4,X5)!=X5|~epred1_3(X4,X3,X2)|~no_right(X1)|~cnt(X5,X3,X4)|~cnt(X1,X3,X4)|~part_of(X5,X2)|~part_of(X1,X2)|~permission(X5))). % 0.13/0.45 cnf(i_0_46, plain, (part_of(esk1_4(X1,X2,X3,X4),X1)|part_of(esk2_3(X1,X2,X3),X1)|~epred1_3(X3,X2,X1)|~cnt(X4,X2,X3)|~part_of(X4,X1)|~permission(X4))). % 0.13/0.45 cnf(i_0_30, plain, (part_of(esk3_4(X1,X2,X3,X4),X1)|part_of(esk4_3(X1,X2,X3),X1)|~epred1_3(X3,X2,X1)|~no_right(X4)|~cnt(X4,X2,X3)|~part_of(X4,X1))). % 0.13/0.45 cnf(i_0_27, plain, (cnt(esk3_4(X1,X2,X3,X4),X2,X3)|permission(esk4_3(X1,X2,X3))|~epred1_3(X3,X2,X1)|~no_right(X4)|~cnt(X4,X2,X3)|~part_of(X4,X1))). % 0.13/0.45 cnf(i_0_43, plain, (no_right(esk2_3(X1,X2,X3))|cnt(esk1_4(X1,X2,X3,X4),X2,X3)|~epred1_3(X3,X2,X1)|~cnt(X4,X2,X3)|~part_of(X4,X1)|~permission(X4))). % 0.13/0.45 cnf(i_0_31, plain, (part_of(esk3_4(X1,X2,X3,X4),X1)|permission(esk4_3(X1,X2,X3))|~epred1_3(X3,X2,X1)|~no_right(X4)|~cnt(X4,X2,X3)|~part_of(X4,X1))). % 0.13/0.45 cnf(i_0_47, plain, (no_right(esk2_3(X1,X2,X3))|part_of(esk1_4(X1,X2,X3,X4),X1)|~epred1_3(X3,X2,X1)|~cnt(X4,X2,X3)|~part_of(X4,X1)|~permission(X4))). % 0.13/0.45 cnf(i_0_50, plain, (part_of(esk2_3(X1,X2,X3),X1)|permission(esk1_4(X1,X2,X3,X4))|~epred1_3(X3,X2,X1)|~cnt(X4,X2,X3)|~part_of(X4,X1)|~permission(X4))). % 0.13/0.45 cnf(i_0_34, plain, (no_right(esk3_4(X1,X2,X3,X4))|part_of(esk4_3(X1,X2,X3),X1)|~epred1_3(X3,X2,X1)|~no_right(X4)|~cnt(X4,X2,X3)|~part_of(X4,X1))). % 0.13/0.45 cnf(i_0_41, plain, (cnt(esk1_4(X1,X2,X3,X4),X2,X3)|cnt(esk2_3(X1,X2,X3),X2,X3)|~epred1_3(X3,X2,X1)|~cnt(X4,X2,X3)|~part_of(X4,X1)|~permission(X4))). % 0.13/0.45 cnf(i_0_25, plain, (cnt(esk3_4(X1,X2,X3,X4),X2,X3)|cnt(esk4_3(X1,X2,X3),X2,X3)|~epred1_3(X3,X2,X1)|~no_right(X4)|~cnt(X4,X2,X3)|~part_of(X4,X1))). % 0.13/0.45 cnf(i_0_20, plain, (X1=esk4_3(X2,X3,X4)|esk3_4(X2,X3,X4,X5)!=X5|~epred1_3(X4,X3,X2)|~no_right(X5)|~cnt(X5,X3,X4)|~cnt(X1,X3,X4)|~part_of(X5,X2)|~part_of(X1,X2)|~permission(X1))). % 0.13/0.45 cnf(i_0_49, plain, (cnt(esk2_3(X1,X2,X3),X2,X3)|permission(esk1_4(X1,X2,X3,X4))|~epred1_3(X3,X2,X1)|~cnt(X4,X2,X3)|~part_of(X4,X1)|~permission(X4))). % 0.13/0.45 cnf(i_0_33, plain, (no_right(esk3_4(X1,X2,X3,X4))|cnt(esk4_3(X1,X2,X3),X2,X3)|~epred1_3(X3,X2,X1)|~no_right(X4)|~cnt(X4,X2,X3)|~part_of(X4,X1))). % 0.13/0.45 cnf(i_0_42, plain, (cnt(esk1_4(X1,X2,X3,X4),X2,X3)|part_of(esk2_3(X1,X2,X3),X1)|~epred1_3(X3,X2,X1)|~cnt(X4,X2,X3)|~part_of(X4,X1)|~permission(X4))). % 0.13/0.45 cnf(i_0_26, plain, (cnt(esk3_4(X1,X2,X3,X4),X2,X3)|part_of(esk4_3(X1,X2,X3),X1)|~epred1_3(X3,X2,X1)|~no_right(X4)|~cnt(X4,X2,X3)|~part_of(X4,X1))). % 0.13/0.45 cnf(i_0_45, plain, (cnt(esk2_3(X1,X2,X3),X2,X3)|part_of(esk1_4(X1,X2,X3,X4),X1)|~epred1_3(X3,X2,X1)|~cnt(X4,X2,X3)|~part_of(X4,X1)|~permission(X4))). % 0.13/0.45 cnf(i_0_29, plain, (cnt(esk4_3(X1,X2,X3),X2,X3)|part_of(esk3_4(X1,X2,X3,X4),X1)|~epred1_3(X3,X2,X1)|~no_right(X4)|~cnt(X4,X2,X3)|~part_of(X4,X1))). % 0.13/0.45 cnf(i_0_48, plain, (X1=esk2_3(X2,X3,X4)|permission(esk1_4(X2,X3,X4,X5))|~epred1_3(X4,X3,X2)|~no_right(X1)|~cnt(X5,X3,X4)|~cnt(X1,X3,X4)|~part_of(X5,X2)|~part_of(X1,X2)|~permission(X5))). % 0.13/0.45 cnf(i_0_32, plain, (X1=esk4_3(X2,X3,X4)|no_right(esk3_4(X2,X3,X4,X5))|~epred1_3(X4,X3,X2)|~no_right(X5)|~cnt(X5,X3,X4)|~cnt(X1,X3,X4)|~part_of(X5,X2)|~part_of(X1,X2)|~permission(X1))). % 0.13/0.45 cnf(i_0_44, plain, (X1=esk2_3(X2,X3,X4)|part_of(esk1_4(X2,X3,X4,X5),X2)|~epred1_3(X4,X3,X2)|~no_right(X1)|~cnt(X5,X3,X4)|~cnt(X1,X3,X4)|~part_of(X5,X2)|~part_of(X1,X2)|~permission(X5))). % 0.13/0.45 cnf(i_0_28, plain, (X1=esk4_3(X2,X3,X4)|part_of(esk3_4(X2,X3,X4,X5),X2)|~epred1_3(X4,X3,X2)|~no_right(X5)|~cnt(X5,X3,X4)|~cnt(X1,X3,X4)|~part_of(X5,X2)|~part_of(X1,X2)|~permission(X1))). % 0.13/0.45 cnf(i_0_40, plain, (X1=esk2_3(X2,X3,X4)|cnt(esk1_4(X2,X3,X4,X5),X3,X4)|~epred1_3(X4,X3,X2)|~no_right(X1)|~cnt(X5,X3,X4)|~cnt(X1,X3,X4)|~part_of(X5,X2)|~part_of(X1,X2)|~permission(X5))). % 0.13/0.45 cnf(i_0_24, plain, (X1=esk4_3(X2,X3,X4)|cnt(esk3_4(X2,X3,X4,X5),X3,X4)|~epred1_3(X4,X3,X2)|~no_right(X5)|~cnt(X5,X3,X4)|~cnt(X1,X3,X4)|~part_of(X5,X2)|~part_of(X1,X2)|~permission(X1))). % 0.13/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.45 # Begin printing tableau % 0.13/0.45 # Found 8 steps % 0.13/0.45 cnf(i_0_6, plain, (odrl_rel(rho1)), inference(start_rule)). % 0.13/0.45 cnf(i_0_52, plain, (odrl_rel(rho1)), inference(extension_rule, [i_0_1])). % 0.13/0.45 cnf(i_0_291, plain, (epred1_3(some_target,some_action,rho1)), inference(extension_rule, [i_0_23])). % 0.13/0.45 cnf(i_0_300, plain, (~no_right(n1)), inference(closure_rule, [i_0_8])). % 0.13/0.45 cnf(i_0_301, plain, (~cnt(n1,some_action,some_target)), inference(closure_rule, [i_0_14])). % 0.13/0.45 cnf(i_0_302, plain, (~part_of(n1,rho1)), inference(closure_rule, [i_0_11])). % 0.13/0.45 cnf(i_0_297, plain, (permission(esk4_3(rho1,some_action,some_target))), inference(etableau_closure_rule, [i_0_297, ...])). % 0.13/0.45 cnf(i_0_298, plain, (esk3_4(rho1,some_action,some_target,n1)!=n1), inference(etableau_closure_rule, [i_0_298, ...])). % 0.13/0.45 # End printing tableau % 0.13/0.45 # SZS output end % 0.13/0.45 # Branches closed with saturation will be marked with an "s" % 0.13/0.45 # Child (2734245) has found a proof. % 0.13/0.45 % 0.13/0.46 # Proof search is over... % 0.13/0.46 # Freeing feature tree %------------------------------------------------------------------------------