%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT001-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 : n016.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.13s 0.42s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT001-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.08/0.35 % Computer : n016.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 11:38:02 UTC 2026 % 0.08/0.36 % 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: 19 Number of unprocessed: 19 % 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 # 19 beginning clauses after preprocessing and clausification % 0.13/0.39 # Creating start rules for all 10 conjectures. % 0.13/0.39 # There are 10 start rule candidates: % 0.13/0.39 # Found 10 unit axioms. % 0.13/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.39 # 10 start rule tableaux created. % 0.13/0.39 # 9 extension rule candidate clauses % 0.13/0.39 # 10 unit axiom clauses % 0.13/0.39 % 0.13/0.39 # Requested 8, 32 cores available to the main process. % 0.13/0.41 # Ran out of tableaux, making start rules for all clauses % 0.13/0.42 # There were 8 total branch saturation attempts. % 0.13/0.42 # There were 0 of these attempts blocked. % 0.13/0.42 # There were 0 deferred branch saturation attempts. % 0.13/0.42 # There were 0 free duplicated saturations. % 0.13/0.42 # There were 8 total successful branch saturations. % 0.13/0.42 # There were 0 successful branch saturations in interreduction. % 0.13/0.42 # There were 0 successful branch saturations on the branch. % 0.13/0.42 # There were 8 successful branch saturations after the branch. % 0.13/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.42 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.42 # Begin clausification derivation % 0.13/0.42 % 0.13/0.42 # End clausification derivation % 0.13/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.42 cnf(i_0_29, negated_conjecture, (organization(sk4,sk6))). % 0.13/0.42 cnf(i_0_30, negated_conjecture, (organization(sk5,sk7))). % 0.13/0.42 cnf(i_0_37, negated_conjecture, (greater(sk9,sk8))). % 0.13/0.42 cnf(i_0_35, negated_conjecture, (survival_chance(sk4,sk10,sk6))). % 0.13/0.42 cnf(i_0_36, negated_conjecture, (survival_chance(sk5,sk11,sk7))). % 0.13/0.42 cnf(i_0_31, negated_conjecture, (reorganization_free(sk4,sk6,sk6))). % 0.13/0.42 cnf(i_0_32, negated_conjecture, (reorganization_free(sk5,sk7,sk7))). % 0.13/0.42 cnf(i_0_33, negated_conjecture, (inertia(sk4,sk8,sk6))). % 0.13/0.42 cnf(i_0_34, negated_conjecture, (inertia(sk5,sk9,sk7))). % 0.13/0.42 cnf(i_0_38, negated_conjecture, (~greater(sk11,sk10))). % 0.13/0.42 cnf(i_0_20, plain, (reliability(X1,sk1(X2,X1),X2)|~organization(X1,X2))). % 0.13/0.42 cnf(i_0_21, plain, (accountability(X1,sk2(X2,X1),X2)|~organization(X1,X2))). % 0.13/0.42 cnf(i_0_22, plain, (reproducibility(X1,sk3(X2,X1),X2)|~organization(X1,X2))). % 0.13/0.42 cnf(i_0_27, hypothesis, (greater(X1,X2)|~inertia(X3,X1,X4)|~inertia(X5,X2,X6)|~reorganization_free(X3,X4,X4)|~reorganization_free(X5,X6,X6)|~greater(X7,X8)|~reproducibility(X3,X7,X4)|~reproducibility(X5,X8,X6)|~organization(X3,X4)|~organization(X5,X6))). % 0.13/0.42 cnf(i_0_28, hypothesis, (greater(X1,X2)|~inertia(X3,X4,X5)|~inertia(X6,X7,X8)|~reorganization_free(X3,X5,X5)|~reorganization_free(X6,X8,X8)|~greater(X4,X7)|~reproducibility(X3,X1,X5)|~reproducibility(X6,X2,X8)|~organization(X3,X5)|~organization(X6,X8))). % 0.13/0.42 cnf(i_0_25, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~reproducibility(X5,X3,X6)|~reproducibility(X7,X4,X8)|~accountability(X5,X1,X6)|~accountability(X7,X2,X8)|~reliability(X5,X9,X6)|~reliability(X7,X10,X8)|~organization(X5,X6)|~organization(X7,X8))). % 0.13/0.42 cnf(i_0_24, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~reproducibility(X5,X3,X6)|~reproducibility(X7,X4,X8)|~accountability(X5,X9,X6)|~accountability(X7,X10,X8)|~reliability(X5,X1,X6)|~reliability(X7,X2,X8)|~organization(X5,X6)|~organization(X7,X8))). % 0.13/0.42 cnf(i_0_23, 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.13/0.42 cnf(i_0_26, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~greater(X5,X6)|~reproducibility(X7,X1,X8)|~reproducibility(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.13/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.42 # Begin printing tableau % 0.13/0.42 # Found 20 steps % 0.13/0.42 cnf(i_0_31, negated_conjecture, (reorganization_free(sk4,sk6,sk6)), inference(start_rule)). % 0.13/0.42 cnf(i_0_43, plain, (reorganization_free(sk4,sk6,sk6)), inference(extension_rule, [i_0_28])). % 0.13/0.42 cnf(i_0_479, plain, (greater(sk11,sk10)), inference(closure_rule, [i_0_38])). % 0.13/0.42 cnf(i_0_480, plain, (~inertia(sk4,sk8,sk6)), inference(closure_rule, [i_0_33])). % 0.13/0.42 cnf(i_0_481, plain, (~inertia(sk5,sk9,sk7)), inference(closure_rule, [i_0_34])). % 0.13/0.42 cnf(i_0_483, plain, (~reorganization_free(sk5,sk7,sk7)), inference(closure_rule, [i_0_32])). % 0.13/0.42 cnf(i_0_487, plain, (~organization(sk4,sk6)), inference(closure_rule, [i_0_29])). % 0.13/0.42 cnf(i_0_488, plain, (~organization(sk5,sk7)), inference(closure_rule, [i_0_30])). % 0.13/0.42 cnf(i_0_484, plain, (~greater(sk8,sk9)), inference(extension_rule, [i_0_25])). % 0.13/0.42 cnf(i_0_496, plain, (~greater(sk9,sk8)), inference(closure_rule, [i_0_37])). % 0.13/0.42 cnf(i_0_503, plain, (~organization(sk5,sk7)), inference(closure_rule, [i_0_30])). % 0.13/0.42 cnf(i_0_504, plain, (~organization(sk5,sk7)), inference(closure_rule, [i_0_30])). % 0.13/0.42 cnf(i_0_485, plain, (~reproducibility(sk4,sk11,sk6)), inference(etableau_closure_rule, [i_0_485, ...])). % 0.13/0.42 cnf(i_0_486, plain, (~reproducibility(sk5,sk10,sk7)), inference(etableau_closure_rule, [i_0_486, ...])). % 0.13/0.42 cnf(i_0_497, plain, (~reproducibility(sk5,sk9,sk7)), inference(etableau_closure_rule, [i_0_497, ...])). % 0.13/0.42 cnf(i_0_498, plain, (~reproducibility(sk5,sk8,sk7)), inference(etableau_closure_rule, [i_0_498, ...])). % 0.13/0.42 cnf(i_0_499, plain, (~accountability(sk5,sk8,sk7)), inference(etableau_closure_rule, [i_0_499, ...])). % 0.13/0.42 cnf(i_0_500, plain, (~accountability(sk5,sk9,sk7)), inference(etableau_closure_rule, [i_0_500, ...])). % 0.13/0.42 cnf(i_0_501, plain, (~reliability(sk5,X19,sk7)), inference(etableau_closure_rule, [i_0_501, ...])). % 0.13/0.42 cnf(i_0_502, plain, (~reliability(sk5,X20,sk7)), inference(etableau_closure_rule, [i_0_502, ...])). % 0.13/0.42 # End printing tableau % 0.13/0.42 # SZS output end % 0.13/0.42 # Branches closed with saturation will be marked with an "s" % 0.13/0.42 # Child (2612454) has found a proof. % 0.13/0.42 % 0.13/0.42 # Proof search is over... % 0.13/0.42 # Freeing feature tree %------------------------------------------------------------------------------