%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT113+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 : Theorem 0.13s 0.41s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT113+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.09/0.35 % Computer : n029.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Mon Sep 7 14:08:57 UTC 2026 % 0.09/0.35 % CPUTime : % 0.13/0.39 # No SInE strategy applied % 0.13/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.39 # % 0.13/0.39 # Presaturation interreduction done % 0.13/0.39 # Number of axioms: 46 Number of unprocessed: 46 % 0.13/0.39 # Tableaux proof search. % 0.13/0.39 # APR header successfully linked. % 0.13/0.39 # Hello from C++ % 0.13/0.39 # The folding up rule is enabled... % 0.13/0.39 # Local unification is enabled... % 0.13/0.39 # Any saturation attempts will use folding labels... % 0.13/0.39 # 46 beginning clauses after preprocessing and clausification % 0.13/0.39 # Creating start rules for all 1 conjectures. % 0.13/0.39 # There are 1 start rule candidates: % 0.13/0.39 # Found 14 unit axioms. % 0.13/0.39 # 1 start rule tableaux created. % 0.13/0.39 # 32 extension rule candidate clauses % 0.13/0.39 # 14 unit axiom clauses % 0.13/0.39 % 0.13/0.39 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.39 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.13/0.39 # We now have 9 tableaux to operate on % 0.13/0.41 # Ran out of tableaux, making start rules for all clauses % 0.13/0.41 # Closed tableau found in foldup close cycle with 0 folds and 7 closures done. % 0.13/0.41 # There were 0 total branch saturation attempts. % 0.13/0.41 # There were 0 of these attempts blocked. % 0.13/0.41 # There were 0 deferred branch saturation attempts. % 0.13/0.41 # There were 0 free duplicated saturations. % 0.13/0.41 # There were 0 total successful branch saturations. % 0.13/0.41 # There were 0 successful branch saturations in interreduction. % 0.13/0.41 # There were 0 successful branch saturations on the branch. % 0.13/0.41 # There were 0 successful branch saturations after the branch. % 0.13/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.41 # Begin clausification derivation % 0.13/0.41 % 0.13/0.41 # End clausification derivation % 0.13/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.41 cnf(i_0_38, plain, (proh(f1))). % 0.13/0.41 cnf(i_0_39, plain, (has_rem(f1))). % 0.13/0.41 cnf(i_0_32, plain, (agent(marketplace))). % 0.13/0.41 cnf(i_0_33, plain, (agent(philharmonie))). % 0.13/0.41 cnf(i_0_34, plain, (action(distrib))). % 0.13/0.41 cnf(i_0_35, plain, (target(concert_ds))). % 0.13/0.41 cnf(i_0_36, plain, (rule(f1))). % 0.13/0.41 cnf(i_0_37, plain, (event(e1))). % 0.13/0.41 cnf(i_0_40, plain, (aee(f1,marketplace))). % 0.13/0.41 cnf(i_0_41, plain, (aer(f1,philharmonie))). % 0.13/0.41 cnf(i_0_42, plain, (act(f1,distrib))). % 0.13/0.41 cnf(i_0_43, plain, (tgt(f1,concert_ds))). % 0.13/0.41 cnf(i_0_44, plain, (activates(e1,f1))). % 0.13/0.41 cnf(i_0_45, plain, (does(marketplace,distrib,concert_ds))). % 0.13/0.41 cnf(i_0_27, plain, (power(esk9_2(X1,X2))|~competent_for(X1,X2))). % 0.13/0.41 cnf(i_0_24, plain, (subjection(esk10_2(X1,X2))|~competent_for(X1,X2))). % 0.13/0.41 cnf(i_0_21, plain, (competent_for(esk8_1(X1),X1)|~inst_event(X1))). % 0.13/0.41 cnf(i_0_26, plain, (bearer(esk9_2(X1,X2),X1)|~competent_for(X1,X2))). % 0.13/0.41 cnf(i_0_25, plain, (about_event(esk9_2(X1,X2),X2)|~competent_for(X1,X2))). % 0.13/0.41 cnf(i_0_22, plain, (about_event(esk10_2(X1,X2),X2)|~competent_for(X1,X2))). % 0.13/0.41 cnf(i_0_20, plain, (inst_event(esk7_4(X1,X2,X3,X4))|~norm_state_change(X1,X2,X3,X4))). % 0.13/0.41 cnf(i_0_23, plain, (bearer(esk10_2(X1,X2),esk11_2(X1,X2))|~competent_for(X1,X2))). % 0.13/0.41 cnf(i_0_19, plain, (triggers(esk7_4(X1,X2,X3,X4),X1,X2,X3,X4)|~norm_state_change(X1,X2,X3,X4))). % 0.13/0.41 cnf(i_0_30, plain, (about_event(X1,X2)|~power(X1)|~founds_rem(X2,X3,X4)|~part_of(X1,X3)|~cnt(X1,decl(X5),X6))). % 0.13/0.41 cnf(i_0_31, plain, (about_event(X1,X2)|~subjection(X1)|~founds_rem(X2,X3,X4)|~part_of(X1,X3)|~cnt(X1,decl(X5),X6))). % 0.13/0.41 cnf(i_0_46, negated_conjecture, (~subjection(X1)|~power(X2)|~founds_rem(e1,X3,f1)|~part_of(X1,X3)|~part_of(X2,X3)|~cnt(X1,decl(distrib),concert_ds)|~cnt(X2,decl(distrib),concert_ds)|~bearer(X1,marketplace)|~bearer(X2,philharmonie))). % 0.13/0.41 cnf(i_0_29, plain, (rem_act(X1,esk12_4(X1,X2,X3,X4))|~does(X2,X3,X4)|~has_rem(X1)|~tgt(X1,X4)|~act(X1,X3)|~aee(X1,X2)|~proh(X1))). % 0.13/0.41 cnf(i_0_28, plain, (norm_state_change(X1,esk12_4(X2,X1,X3,X4),X4,duty_rem)|~does(X1,X3,X4)|~has_rem(X2)|~tgt(X2,X4)|~act(X2,X3)|~aee(X2,X1)|~proh(X2))). % 0.13/0.41 cnf(i_0_8, plain, (duty(esk2_6(X1,X2,X3,X4,X5,X6))|~activates(X6,X1)|~tgt(X1,X5)|~act(X1,X4)|~aer(X1,X3)|~aee(X1,X2)|~proh(X1))). % 0.13/0.41 cnf(i_0_4, plain, (right(esk3_6(X1,X2,X3,X4,X5,X6))|~activates(X6,X1)|~tgt(X1,X5)|~act(X1,X4)|~aer(X1,X3)|~aee(X1,X2)|~proh(X1))). % 0.13/0.41 cnf(i_0_17, plain, (power(esk5_6(X1,X2,X3,X4,X5,X6))|~has_rem(X1)|~activates(X6,X1)|~tgt(X1,X5)|~act(X1,X4)|~aer(X1,X3)|~aee(X1,X2)|~proh(X1))). % 0.13/0.41 cnf(i_0_13, plain, (subjection(esk6_6(X1,X2,X3,X4,X5,X6))|~has_rem(X1)|~activates(X6,X1)|~tgt(X1,X5)|~act(X1,X4)|~aer(X1,X3)|~aee(X1,X2)|~proh(X1))). % 0.13/0.41 cnf(i_0_7, plain, (bearer(esk2_6(X1,X2,X3,X4,X5,X6),X2)|~activates(X6,X1)|~tgt(X1,X5)|~act(X1,X4)|~aer(X1,X3)|~aee(X1,X2)|~proh(X1))). % 0.13/0.41 cnf(i_0_3, plain, (bearer(esk3_6(X1,X2,X3,X4,X5,X6),X3)|~activates(X6,X1)|~tgt(X1,X5)|~act(X1,X4)|~aer(X1,X3)|~aee(X1,X2)|~proh(X1))). % 0.13/0.41 cnf(i_0_16, plain, (bearer(esk5_6(X1,X2,X3,X4,X5,X6),X3)|~has_rem(X1)|~activates(X6,X1)|~tgt(X1,X5)|~act(X1,X4)|~aer(X1,X3)|~aee(X1,X2)|~proh(X1))). % 0.13/0.41 cnf(i_0_12, plain, (bearer(esk6_6(X1,X2,X3,X4,X5,X6),X2)|~has_rem(X1)|~activates(X6,X1)|~tgt(X1,X5)|~act(X1,X4)|~aer(X1,X3)|~aee(X1,X2)|~proh(X1))). % 0.13/0.41 cnf(i_0_9, plain, (founds(X1,esk1_6(X2,X3,X4,X5,X6,X1),X2)|~activates(X1,X2)|~tgt(X2,X6)|~act(X2,X5)|~aer(X2,X4)|~aee(X2,X3)|~proh(X2))). % 0.13/0.41 cnf(i_0_18, plain, (founds_rem(X1,esk4_6(X2,X3,X4,X5,X6,X1),X2)|~has_rem(X2)|~activates(X1,X2)|~tgt(X2,X6)|~act(X2,X5)|~aer(X2,X4)|~aee(X2,X3)|~proh(X2))). % 0.13/0.41 cnf(i_0_6, plain, (cnt(esk2_6(X1,X2,X3,X4,X5,X6),rfr(X4),X5)|~activates(X6,X1)|~tgt(X1,X5)|~act(X1,X4)|~aer(X1,X3)|~aee(X1,X2)|~proh(X1))). % 0.13/0.41 cnf(i_0_2, plain, (cnt(esk3_6(X1,X2,X3,X4,X5,X6),rfr(X4),X5)|~activates(X6,X1)|~tgt(X1,X5)|~act(X1,X4)|~aer(X1,X3)|~aee(X1,X2)|~proh(X1))). % 0.13/0.41 cnf(i_0_15, plain, (cnt(esk5_6(X1,X2,X3,X4,X5,X6),decl(X4),X5)|~has_rem(X1)|~activates(X6,X1)|~tgt(X1,X5)|~act(X1,X4)|~aer(X1,X3)|~aee(X1,X2)|~proh(X1))). % 0.13/0.41 cnf(i_0_11, plain, (cnt(esk6_6(X1,X2,X3,X4,X5,X6),decl(X4),X5)|~has_rem(X1)|~activates(X6,X1)|~tgt(X1,X5)|~act(X1,X4)|~aer(X1,X3)|~aee(X1,X2)|~proh(X1))). % 0.13/0.41 cnf(i_0_5, plain, (part_of(esk2_6(X1,X2,X3,X4,X5,X6),esk1_6(X1,X2,X3,X4,X5,X6))|~activates(X6,X1)|~tgt(X1,X5)|~act(X1,X4)|~aer(X1,X3)|~aee(X1,X2)|~proh(X1))). % 0.13/0.41 cnf(i_0_1, plain, (part_of(esk3_6(X1,X2,X3,X4,X5,X6),esk1_6(X1,X2,X3,X4,X5,X6))|~activates(X6,X1)|~tgt(X1,X5)|~act(X1,X4)|~aer(X1,X3)|~aee(X1,X2)|~proh(X1))). % 0.13/0.41 cnf(i_0_14, plain, (part_of(esk5_6(X1,X2,X3,X4,X5,X6),esk4_6(X1,X2,X3,X4,X5,X6))|~has_rem(X1)|~activates(X6,X1)|~tgt(X1,X5)|~act(X1,X4)|~aer(X1,X3)|~aee(X1,X2)|~proh(X1))). % 0.13/0.41 cnf(i_0_10, plain, (part_of(esk6_6(X1,X2,X3,X4,X5,X6),esk4_6(X1,X2,X3,X4,X5,X6))|~has_rem(X1)|~activates(X6,X1)|~tgt(X1,X5)|~act(X1,X4)|~aer(X1,X3)|~aee(X1,X2)|~proh(X1))). % 0.13/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.41 # Begin printing tableau % 0.13/0.41 # Found 73 steps % 0.13/0.41 cnf(i_0_46, negated_conjecture, (~subjection(esk6_6(f1,marketplace,philharmonie,distrib,concert_ds,e1))|~power(esk5_6(f1,marketplace,philharmonie,distrib,concert_ds,e1))|~founds_rem(e1,esk4_6(f1,marketplace,philharmonie,distrib,concert_ds,e1),f1)|~part_of(esk6_6(f1,marketplace,philharmonie,distrib,concert_ds,e1),esk4_6(f1,marketplace,philharmonie,distrib,concert_ds,e1))|~part_of(esk5_6(f1,marketplace,philharmonie,distrib,concert_ds,e1),esk4_6(f1,marketplace,philharmonie,distrib,concert_ds,e1))|~cnt(esk6_6(f1,marketplace,philharmonie,distrib,concert_ds,e1),decl(distrib),concert_ds)|~cnt(esk5_6(f1,marketplace,philharmonie,distrib,concert_ds,e1),decl(distrib),concert_ds)|~bearer(esk6_6(f1,marketplace,philharmonie,distrib,concert_ds,e1),marketplace)|~bearer(esk5_6(f1,marketplace,philharmonie,distrib,concert_ds,e1),philharmonie)), inference(start_rule)). % 0.13/0.41 cnf(i_0_49, plain, (~founds_rem(e1,esk4_6(f1,marketplace,philharmonie,distrib,concert_ds,e1),f1)), inference(extension_rule, [i_0_18])). % 0.13/0.41 cnf(i_0_538, plain, (~has_rem(f1)), inference(closure_rule, [i_0_39])). % 0.13/0.41 cnf(i_0_539, plain, (~activates(e1,f1)), inference(closure_rule, [i_0_44])). % 0.13/0.41 cnf(i_0_540, plain, (~tgt(f1,concert_ds)), inference(closure_rule, [i_0_43])). % 0.13/0.41 cnf(i_0_541, plain, (~act(f1,distrib)), inference(closure_rule, [i_0_42])). % 0.13/0.41 cnf(i_0_542, plain, (~aer(f1,philharmonie)), inference(closure_rule, [i_0_41])). % 0.13/0.41 cnf(i_0_543, plain, (~aee(f1,marketplace)), inference(closure_rule, [i_0_40])). % 0.13/0.41 cnf(i_0_544, plain, (~proh(f1)), inference(closure_rule, [i_0_38])). % 0.13/0.41 cnf(i_0_48, plain, (~power(esk5_6(f1,marketplace,philharmonie,distrib,concert_ds,e1))), inference(extension_rule, [i_0_17])). % 0.13/0.41 cnf(i_0_7360, plain, (~has_rem(f1)), inference(closure_rule, [i_0_39])). % 0.13/0.41 cnf(i_0_7361, plain, (~activates(e1,f1)), inference(closure_rule, [i_0_44])). % 0.13/0.41 cnf(i_0_7362, plain, (~tgt(f1,concert_ds)), inference(closure_rule, [i_0_43])). % 0.13/0.41 cnf(i_0_7363, plain, (~act(f1,distrib)), inference(closure_rule, [i_0_42])). % 0.13/0.41 cnf(i_0_7364, plain, (~aer(f1,philharmonie)), inference(closure_rule, [i_0_41])). % 0.13/0.41 cnf(i_0_7365, plain, (~aee(f1,marketplace)), inference(closure_rule, [i_0_40])). % 0.13/0.41 cnf(i_0_7366, plain, (~proh(f1)), inference(closure_rule, [i_0_38])). % 0.13/0.41 cnf(i_0_47, plain, (~subjection(esk6_6(f1,marketplace,philharmonie,distrib,concert_ds,e1))), inference(extension_rule, [i_0_13])). % 0.13/0.41 cnf(i_0_7414, plain, (~has_rem(f1)), inference(closure_rule, [i_0_39])). % 0.13/0.41 cnf(i_0_7415, plain, (~activates(e1,f1)), inference(closure_rule, [i_0_44])). % 0.13/0.41 cnf(i_0_7416, plain, (~tgt(f1,concert_ds)), inference(closure_rule, [i_0_43])). % 0.13/0.41 cnf(i_0_7417, plain, (~act(f1,distrib)), inference(closure_rule, [i_0_42])). % 0.13/0.41 cnf(i_0_7418, plain, (~aer(f1,philharmonie)), inference(closure_rule, [i_0_41])). % 0.13/0.41 cnf(i_0_7419, plain, (~aee(f1,marketplace)), inference(closure_rule, [i_0_40])). % 0.13/0.41 cnf(i_0_7420, plain, (~proh(f1)), inference(closure_rule, [i_0_38])). % 0.13/0.41 cnf(i_0_53, plain, (~cnt(esk5_6(f1,marketplace,philharmonie,distrib,concert_ds,e1),decl(distrib),concert_ds)), inference(extension_rule, [i_0_15])). % 0.13/0.41 cnf(i_0_7575, plain, (~has_rem(f1)), inference(closure_rule, [i_0# Ran out of tableaux, making start rules for all clauses % 0.13/0.41 _39])). % 0.13/0.41 cnf(i_0_7576, plain, (~activates(e1,f1)), inference(closure_rule, [i_0_44])). % 0.13/0.41 cnf(i_0_7577, plain, (~tgt(f1,concert_ds)), inference(closure_rule, [i_0_43])). % 0.13/0.41 cnf(i_0_7578, plain, (~act(f1,distrib)), inference(closure_rule, [i_0_42])). % 0.13/0.41 cnf(i_0_7579, plain, (~aer(f1,philharmonie)), inference(closure_rule, [i_0_41])). % 0.13/0.41 cnf(i_0_7580, plain, (~aee(f1,marketplace)), inference(closure_rule, [i_0_40])). % 0.13/0.41 cnf(i_0_7581, plain, (~proh(f1)), inference(closure_rule, [i_0_38])). % 0.13/0.41 cnf(i_0_52, plain, (~cnt(esk6_6(f1,marketplace,philharmonie,distrib,concert_ds,e1),decl(distrib),concert_ds)), inference(extension_rule, [i_0_11])). % 0.13/0.41 cnf(i_0_7681, plain, (~has_rem(f1)), inference(closure_rule, [i_0_39])). % 0.13/0.41 cnf(i_0_7682, plain, (~activates(e1,f1)), inference(closure_rule, [i_0_44])). % 0.13/0.41 cnf(i_0_7683, plain, (~tgt(f1,concert_ds)), inference(closure_rule, [i_0_43])). % 0.13/0.41 cnf(i_0_7684, plain, (~act(f1,distrib)), inference(closure_rule, [i_0_42])). % 0.13/0.41 cnf(i_0_7685, plain, (~aer(f1,philharmonie)), inference(closure_rule, [i_0_41])). % 0.13/0.41 cnf(i_0_7686, plain, (~aee(f1,marketplace)), inference(closure_rule, [i_0_40])). % 0.13/0.41 cnf(i_0_7687, plain, (~proh(f1)), inference(closure_rule, [i_0_38])). % 0.13/0.41 cnf(i_0_51, plain, (~part_of(esk5_6(f1,marketplace,philharmonie,distrib,concert_ds,e1),esk4_6(f1,marketplace,philharmonie,distrib,concert_ds,e1))), inference(extension_rule, [i_0_14])). % 0.13/0.41 cnf(i_0_7826, plain, (~has_rem(f1)), inference(closure_rule, [i_0_39])). % 0.13/0.41 cnf(i_0_7827, plain, (~activates(e1,f1)), inference(closure_rule, [i_0_44])). % 0.13/0.41 cnf(i_0_7828, plain, (~tgt(f1,concert_ds)), inference(closure_rule, [i_0_43])). % 0.13/0.41 cnf(i_0_7829, plain, (~act(f1,distrib)), inference(closure_rule, [i_0_42])). % 0.13/0.41 cnf(i_0_7830, plain, (~aer(f1,philharmonie)), inference(closure_rule, [i_0_41])). % 0.13/0.41 cnf(i_0_7831, plain, (~aee(f1,marketplace)), inference(closure_rule, [i_0_40])). % 0.13/0.41 cnf(i_0_7832, plain, (~proh(f1)), inference(closure_rule, [i_0_38])). % 0.13/0.41 cnf(i_0_50, plain, (~part_of(esk6_6(f1,marketplace,philharmonie,distrib,concert_ds,e1),esk4_6(f1,marketplace,philharmonie,distrib,concert_ds,e1))), inference(extension_rule, [i_0_10])). % 0.13/0.41 cnf(i_0_7946, plain, (~has_rem(f1)), inference(closure_rule, [i_0_39])). % 0.13/0.41 cnf(i_0_7947, plain, (~activates(e1,f1)), inference(closure_rule, [i_0_44])). % 0.13/0.41 cnf(i_0_7948, plain, (~tgt(f1,concert_ds)), inference(closure_rule, [i_0_43])). % 0.13/0.41 cnf(i_0_7949, plain, (~act(f1,distrib)), inference(closure_rule, [i_0_42])). % 0.13/0.41 cnf(i_0_7950, plain, (~aer(f1,philharmonie)), inference(closure_rule, [i_0_41])). % 0.13/0.41 cnf(i_0_7951, plain, (~aee(f1,marketplace)), inference(closure_rule, [i_0_40])). % 0.13/0.41 cnf(i_0_7952, plain, (~proh(f1)), inference(closure_rule, [i_0_38])). % 0.13/0.41 cnf(i_0_54, plain, (~bearer(esk6_6(f1,marketplace,philharmonie,distrib,concert_ds,e1),marketplace)), inference(extension_rule, [i_0_12])). % 0.13/0.41 cnf(i_0_8015, plain, (~has_rem(f1)), inference(closure_rule, [i_0_39])). % 0.13/0.41 cnf(i_0_8016, plain, (~activates(e1,f1)), inference(closure_rule, [i_0_44])). % 0.13/0.41 cnf(i_0_8017, plain, (~tgt(f1,concert_ds)), inference(closure_rule, [i_0_43])). % 0.13/0.41 cnf(i_0_8018, plain, (~act(f1,distrib)), inference(closure_rule, [i_0_42])). % 0.13/0.41 cnf(i_0_8019, plain, (~aer(f1,philharmonie)), inference(closure_rule, [i_0_41])). % 0.13/0.41 cnf(i_0_8020, plain, (~aee(f1,marketplace)), inference(closure_rule, [i_0_40])). % 0.13/0.41 cnf(i_0_8021, plain, (~proh(f1)), inference(closure_rule, [i_0_38])). % 0.13/0.41 cnf(i_0_55, plain, (~bearer(esk5_6(f1,marketplace,philharmonie,distrib,concert_ds,e1),philharmonie)), inference(extension_rule, [i_0_16])). % 0.13/0.41 cnf(i_0_8076, plain, (~has_rem(f1)), inference(closure_rule, [i_0_39])). % 0.13/0.41 cnf(i_0_8077, plain, (~activates(e1,f1)), inference(closure_rule, [i_0_44])). % 0.13/0.41 cnf(i_0_8078, plain, (~tgt(f1,concert_ds)), inference(closure_rule, [i_0_43])). % 0.13/0.41 cnf(i_0_8079, plain, (~act(f1,distrib)), inference(closure_rule, [i_0_42])). % 0.13/0.41 cnf(i_0_8080, plain, (~aer(f1,philharmonie)), inference(closure_rule, [i_0_41])). % 0.13/0.41 cnf(i_0_8081, plain, (~aee(f1,marketplace)), inference(closure_rule, [i_0_40])). % 0.13/0.41 cnf(i_0_8082, plain, (~proh(f1)), inference(closure_rule, [i_0_38])). % 0.13/0.41 # End printing tableau % 0.13/0.41 # SZS output end % 0.13/0.41 # Branches closed with saturation will be marked with an "s" % 0.13/0.41 # Ran out of tableaux, making start rules for all clauses % 0.13/0.42 # Child (2731606) has found a proof. % 0.13/0.42 % 0.13/0.42 # Proof search is over... % 0.13/0.42 # Freeing feature tree %------------------------------------------------------------------------------