%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT001+1 : TPTP v9.3.0. Released v2.0.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 : n011.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 : Theorem 0.13s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT001+1 : TPTP v9.3.0. Released v2.0.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.09/0.36 % Computer : n011.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Mon Sep 7 11:33:15 UTC 2026 % 0.09/0.36 % CPUTime : % 0.09/0.38 # No SInE strategy applied % 0.09/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.09/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.09/0.38 # % 0.09/0.38 # Presaturation interreduction done % 0.09/0.38 # Number of axioms: 19 Number of unprocessed: 19 % 0.09/0.38 # Tableaux proof search. % 0.09/0.38 # APR header successfully linked. % 0.09/0.38 # Hello from C++ % 0.09/0.38 # The folding up rule is enabled... % 0.09/0.38 # Local unification is enabled... % 0.09/0.38 # Any saturation attempts will use folding labels... % 0.09/0.38 # 19 beginning clauses after preprocessing and clausification % 0.09/0.38 # Creating start rules for all 10 conjectures. % 0.09/0.38 # There are 10 start rule candidates: % 0.09/0.38 # Found 10 unit axioms. % 0.09/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.09/0.38 # 10 start rule tableaux created. % 0.09/0.38 # 9 extension rule candidate clauses % 0.09/0.38 # 10 unit axiom clauses % 0.09/0.38 % 0.09/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # Ran out of tableaux, making start rules for all clauses % 0.13/0.40 # There were 4 total branch saturation attempts. % 0.13/0.40 # There were 0 of these attempts blocked. % 0.13/0.40 # There were 0 deferred branch saturation attempts. % 0.13/0.40 # There were 0 free duplicated saturations. % 0.13/0.40 # There were 4 total successful branch saturations. % 0.13/0.40 # There were 0 successful branch saturations in interreduction. % 0.13/0.40 # There were 0 successful branch saturations on the branch. % 0.13/0.40 # There were 4 successful branch saturations after the branch. % 0.13/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # Begin clausification derivation % 0.13/0.40 % 0.13/0.40 # End clausification derivation % 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.40 cnf(i_0_19, negated_conjecture, (organization(esk4_0,esk6_0))). % 0.13/0.40 cnf(i_0_18, negated_conjecture, (organization(esk5_0,esk7_0))). % 0.13/0.40 cnf(i_0_11, negated_conjecture, (greater(esk9_0,esk8_0))). % 0.13/0.40 cnf(i_0_13, negated_conjecture, (survival_chance(esk4_0,esk10_0,esk6_0))). % 0.13/0.40 cnf(i_0_12, negated_conjecture, (survival_chance(esk5_0,esk11_0,esk7_0))). % 0.13/0.40 cnf(i_0_17, negated_conjecture, (reorganization_free(esk4_0,esk6_0,esk6_0))). % 0.13/0.40 cnf(i_0_16, negated_conjecture, (reorganization_free(esk5_0,esk7_0,esk7_0))). % 0.13/0.40 cnf(i_0_15, negated_conjecture, (inertia(esk4_0,esk8_0,esk6_0))). % 0.13/0.40 cnf(i_0_14, negated_conjecture, (inertia(esk5_0,esk9_0,esk7_0))). % 0.13/0.40 cnf(i_0_10, negated_conjecture, (~greater(esk11_0,esk10_0))). % 0.13/0.40 cnf(i_0_1, plain, (reliability(X1,esk1_2(X1,X2),X2)|~organization(X1,X2))). % 0.13/0.40 cnf(i_0_2, plain, (accountability(X1,esk2_2(X1,X2),X2)|~organization(X1,X2))). % 0.13/0.40 cnf(i_0_3, plain, (reproducibility(X1,esk3_2(X1,X2),X2)|~organization(X1,X2))). % 0.13/0.40 cnf(i_0_8, 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.40 cnf(i_0_9, 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.40 cnf(i_0_6, 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.40 cnf(i_0_7, 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.40 cnf(i_0_4, 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.40 cnf(i_0_5, 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.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.40 # Begin printing tableau % 0.13/0.40 # Found 20 steps % 0.13/0.40 cnf(i_0_18, negated_conjecture, (organization(esk5_0,esk7_0)), inference(start_rule)). % 0.13/0.40 cnf(i_0_3439, plain, (organization(esk5_0,esk7_0)), inference(extension_rule, [i_0_8])). % 0.13/0.40 cnf(i_0_7058, plain, (greater(esk11_0,esk10_0)), inference(closure_rule, [i_0_10])). % 0.13/0.40 cnf(i_0_7059, plain, (~inertia(esk4_0,esk8_0,esk6_0)), inference(closure_rule, [i_0_15])). % 0.13/0.40 cnf(i_0_7060, plain, (~inertia(esk5_0,esk9_0,esk7_0)), inference(closure_rule, [i_0_14])). % 0.13/0.40 cnf(i_0_7061, plain, (~reorganization_free(esk4_0,esk6_0,esk6_0)), inference(closure_rule, [i_0_17])). % 0.13/0.40 cnf(i_0_7062, plain, (~reorganization_free(esk5_0,esk7_0,esk7_0)), inference(closure_rule, [i_0_16])). % 0.13/0.40 cnf(i_0_7066, plain, (~organization(esk4_0,esk6_0)), inference(closure_rule, [i_0_19])). % 0.13/0.40 cnf(i_0_7063, plain, (~greater(esk8_0,esk9_0)), inference(extension_rule, [i_0_9])). % 0.13/0.40 cnf(i_0_7075, plain, (~inertia(esk4_0,esk8_0,esk6_0)), inference(closure_rule, [i_0_15])). % 0.13/0.40 cnf(i_0_7076, plain, (~inertia(esk5_0,esk9_0,esk7_0)), inference(closure_rule, [i_0_14])). % 0.13/0.40 cnf(i_0_7077, plain, (~reorganization_free(esk4_0,esk6_0,esk6_0)), inference(closure_rule, [i_0_17])). % 0.13/0.40 cnf(i_0_7078, plain, (~reorganization_free(esk5_0,esk7_0,esk7_0)), inference(closure_rule, [i_0_16])). % 0.13/0.40 cnf(i_0_7079, plain, (~greater(esk9_0,esk8_0)), inference(closure_rule, [i_0_11])). % 0.13/0.40 cnf(i_0_7082, plain, (~organization(esk4_0,esk6_0)), inference(closure_rule, [i_0_19])). % 0.13/0.40 cnf(i_0_7083, plain, (~organization(esk5_0,esk7_0)), inference(closure_rule, [i_0_18])). % 0.13/0.40 cnf(i_0_7064, plain, (~reproducibility(esk4_0,esk11_0,esk6_0)), inference(etableau_closure_rule, [i_0_7064, ...])). % 0.13/0.40 cnf(i_0_7065, plain, (~reproducibility(esk5_0,esk10_0,esk7_0)), inference(etableau_closure_rule, [i_0_7065, ...])). % 0.13/0.40 cnf(i_0_7080, plain, (~reproducibility(esk4_0,esk9_0,esk6_0)), inference(etableau_closure_rule, [i_0_7080, ...])). % 0.13/0.40 cnf(i_0_7081, plain, (~reproducibility(esk5_0,esk8_0,esk7_0)), inference(etableau_closure_rule, [i_0_7081, ...])). % 0.13/0.40 # End printing tableau % 0.13/0.40 # SZS output end % 0.13/0.40 # Branches closed with saturation will be marked with an "s" % 0.13/0.40 # Child (1566764) has found a proof. % 0.13/0.40 % 0.13/0.41 # Proof search is over... % 0.13/0.41 # Freeing feature tree %------------------------------------------------------------------------------