%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT004-1 : TPTP v9.3.0. Released v2.4.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 : n004.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:42 AM UTC 2026 % Result : Unsatisfiable 0.10s 0.48s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT004-1 : TPTP v9.3.0. Released v2.4.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.36 % Computer : n004.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % 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 11:35: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: 14 Number of unprocessed: 14 % 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 # 14 beginning clauses after preprocessing and clausification % 0.10/0.40 # Creating start rules for all 9 conjectures. % 0.10/0.40 # There are 9 start rule candidates: % 0.10/0.40 # Found 9 unit axioms. % 0.10/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.10/0.40 # 9 start rule tableaux created. % 0.10/0.40 # 5 extension rule candidate clauses % 0.10/0.40 # 9 unit axiom clauses % 0.10/0.40 % 0.10/0.40 # Requested 8, 32 cores available to the main process. % 0.10/0.41 # Ran out of tableaux, making start rules for all clauses % 0.10/0.41 # Ran out of tableaux, making start rules for all clauses % 0.10/0.41 # Ran out of tableaux, making start rules for all clauses % 0.10/0.42 # Ran out of tableaux, making start rules for all clauses % 0.10/0.43 # Ran out of tableaux, making start rules for all clauses % 0.10/0.45 # Ran out of tableaux, making start rules for all clauses % 0.10/0.48 # There were 36 total branch saturation attempts. % 0.10/0.48 # There were 0 of these attempts blocked. % 0.10/0.48 # There were 0 deferred branch saturation attempts. % 0.10/0.48 # There were 2 free duplicated saturations. % 0.10/0.48 # There were 36 total successful branch saturations. % 0.10/0.48 # There were 0 successful branch saturations in interreduction. % 0.10/0.48 # There were 0 successful branch saturations on the branch. % 0.10/0.48 # There were 34 successful branch saturations after the branch. % 0.10/0.48 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.48 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.48 # Begin clausification derivation % 0.10/0.48 % 0.10/0.48 # End clausification derivation % 0.10/0.48 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.48 cnf(i_0_20, negated_conjecture, (organization(sk3,sk6))). % 0.10/0.48 cnf(i_0_21, negated_conjecture, (organization(sk3,sk7))). % 0.10/0.48 cnf(i_0_26, negated_conjecture, (greater(sk7,sk6))). % 0.10/0.48 cnf(i_0_23, negated_conjecture, (survival_chance(sk3,sk4,sk6))). % 0.10/0.48 cnf(i_0_24, negated_conjecture, (survival_chance(sk3,sk5,sk7))). % 0.10/0.48 cnf(i_0_22, negated_conjecture, (reorganization(sk3,sk8,sk9))). % 0.10/0.48 cnf(i_0_27, negated_conjecture, (~greater(sk7,sk9))). % 0.10/0.48 cnf(i_0_25, negated_conjecture, (~greater(sk8,sk6))). % 0.10/0.48 cnf(i_0_28, negated_conjecture, (~greater(sk4,sk5))). % 0.10/0.48 cnf(i_0_15, plain, (reliability(X1,sk1(X2,X1),X2)|~organization(X1,X2))). % 0.10/0.48 cnf(i_0_16, plain, (accountability(X1,sk2(X2,X1),X2)|~organization(X1,X2))). % 0.10/0.48 cnf(i_0_19, hypothesis, (greater(X1,X2)|greater(X3,X4)|greater(X5,X6)|~reorganization(X7,X3,X2)|~greater(X1,X4)|~accountability(X7,X6,X1)|~accountability(X7,X5,X4)|~reliability(X7,X8,X1)|~reliability(X7,X9,X4)|~organization(X7,X1)|~organization(X7,X4))). % 0.10/0.48 cnf(i_0_17, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~greater(X5,X6)|~survival_chance(X7,X1,X8)|~survival_chance(X9,X2,X10)|~accountability(X7,X3,X8)|~accountability(X9,X4,X10)|~reliability(X7,X5,X8)|~reliability(X9,X6,X10)|~organization(X7,X8)|~organization(X9,X10))). % 0.10/0.48 cnf(i_0_18, hypothesis, (greater(X1,X2)|greater(X3,X4)|greater(X5,X6)|~reorganization(X7,X3,X2)|~greater(X1,X4)|~accountability(X7,X8,X1)|~accountability(X7,X9,X4)|~reliability(X7,X6,X1)|~reliability(X7,X5,X4)|~organization(X7,X1)|~organization(X7,X4))). % 0.10/0.48 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.10/0.48 # Begin printing tableau % 0.10/0.48 # Found 22 steps % 0.10/0.48 cnf(i_0_24, negated_conjecture, (survival_chance(sk3,sk5,sk7)), inference(start_rule)). % 0.10/0.48 cnf(i_0_1142, plain, (survival_chance(sk3,sk5,sk7)), inference(extension_rule, [i_0_17])). % 0.10/0.48 cnf(i_0_5955, plain, (~greater(sk7,sk6)), inference(closure_rule, [i_0_26])). % 0.10/0.48 cnf(i_0_5956, plain, (~greater(sk7,sk6)), inference(closure_rule, [i_0_26])). % 0.10/0.48 cnf(i_0_5958, plain, (~survival_chance(sk3,sk4,sk6)), inference(closure_rule, [i_0_23])). % 0.10/0.48 cnf(i_0_5963, plain, (~organization(sk3,sk7)), inference(closure_rule, [i_0_21])). % 0.10/0.48 cnf(i_0_5964, plain, (~organization(sk3,sk6)), inference(closure_rule, [i_0_20])). % 0.10/0.48 cnf(i_0_5954, plain, (greater(sk5,sk4)), inference(extension_rule, [i_0_19])). % 0.10/0.48 cnf(i_0_5971, plain, (greater(sk7,sk9)), inference(closure_rule, [i_0_27])). % 0.10/0.48 cnf(i_0_5972, plain, (~reorganization(sk3,sk8,sk9)), inference(closure_rule, [i_0_22])). % 0.10/0.48 cnf(i_0_5959, plain, (~accountability(sk3,sk7,sk7)), inference(etableau_closure_rule, [i_0_5959, ...])). % 0.10/0.48 cnf(i_0_5960, plain, (~accountability(sk3,sk6,sk6)), inference(etableau_closure_rule, [i_0_5960, ...])). % 0.10/0.48 cnf(i_0_5961, plain, (~reliability(sk3,sk7,sk7)), inference(etableau_closure_rule, [i_0_5961, ...])). % 0.10/0.48 cnf(i_0_5962, plain, (~reliability(sk3,sk6,sk6)), inference(etableau_closure_rule, [i_0_5962, ...])). % 0.10/0.48 cnf(i_0_5969, plain, (greater(sk5,sk9)), inference(etableau_closure_rule, [i_0_5969, ...])). % 0.10/0.48 cnf(i_0_5970, plain, (greater(sk8,sk4)), inference(etableau_closure_rule, [i_0_5970, ...])). % 0.10/0.48 cnf(i_0_5974, plain, (~accountability(sk3,sk9,sk5)), inference(etableau_closure_rule, [i_0_5974, ...])). % 0.10/0.48 cnf(i_0_5975, plain, (~accountability(sk3,sk7,sk4)), inference(etableau_closure_rule, [i_0_5975, ...])). % 0.10/0.48 cnf(i_0_5976, plain, (~reliability(sk3,X17,sk5)), inference(etableau_closure_rule, [i_0_5976, ...])). % 0.10/0.48 cnf(i_0_5977, plain, (~reliability(sk3,X18,sk4)), inference(etableau_closure_rule, [i_0_5977, ...])). % 0.10/0.48 cnf(i_0_5978, plain, (~organization(sk3,sk5)), inference(etableau_closure_rule, [i_0_5978, ...])). % 0.10/0.48 cnf(i_0_5979, plain, (~organization(sk3,sk4)), inference(etableau_closure_rule, [i_0_5979, ...])). % 0.10/0.48 # End printing tableau % 0.10/0.48 # SZS output end % 0.10/0.48 # Branches closed with saturation will be marked with an "s" % 0.10/0.48 # Child (3310200) has found a proof. % 0.10/0.48 % 0.10/0.48 # Proof search is over... % 0.10/0.48 # Freeing feature tree %------------------------------------------------------------------------------