%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT007+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 : n012.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:43 AM UTC 2026 % Result : Theorem 0.10s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.01 % Problem : MGT007+1 : TPTP v9.3.0. Released v2.0.0. % 0.00/0.02 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.04/0.29 % Computer : n012.cluster.edu % 0.04/0.29 % Model : x86_64 x86_64 % 0.04/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.04/0.29 % Memory : 8046.5625MB % 0.04/0.29 % OS : Linux 6.8.0-71-generic % 0.04/0.29 % CPULimit : 300 % 0.04/0.29 % WCLimit : 300 % 0.04/0.29 % DateTime : Mon Sep 7 11:42:56 UTC 2026 % 0.04/0.29 % CPUTime : % 0.04/0.31 # No SInE strategy applied % 0.04/0.31 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.04/0.31 # and selection function SelectComplexExceptUniqMaxHorn. % 0.04/0.31 # % 0.04/0.31 # Presaturation interreduction done % 0.04/0.31 # Number of axioms: 17 Number of unprocessed: 17 % 0.04/0.31 # Tableaux proof search. % 0.04/0.31 # APR header successfully linked. % 0.04/0.31 # Hello from C++ % 0.04/0.31 # The folding up rule is enabled... % 0.04/0.31 # Local unification is enabled... % 0.04/0.31 # Any saturation attempts will use folding labels... % 0.04/0.31 # 17 beginning clauses after preprocessing and clausification % 0.04/0.31 # Creating start rules for all 9 conjectures. % 0.04/0.31 # There are 9 start rule candidates: % 0.04/0.31 # Found 9 unit axioms. % 0.04/0.31 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.04/0.31 # 9 start rule tableaux created. % 0.04/0.31 # 8 extension rule candidate clauses % 0.04/0.31 # 9 unit axiom clauses % 0.04/0.31 % 0.04/0.31 # Requested 8, 32 cores available to the main process. % 0.04/0.32 # Ran out of tableaux, making start rules for all clauses % 0.04/0.32 # Ran out of tableaux, making start rules for all clauses % 0.04/0.32 # Ran out of tableaux, making start rules for all clauses % 0.10/0.33 # Ran out of tableaux, making start rules for all clauses % 0.10/0.34 # There were 10 total branch saturation attempts. % 0.10/0.34 # There were 0 of these attempts blocked. % 0.10/0.34 # There were 0 deferred branch saturation attempts. % 0.10/0.34 # There were 1 free duplicated saturations. % 0.10/0.34 # There were 10 total successful branch saturations. % 0.10/0.34 # There were 0 successful branch saturations in interreduction. % 0.10/0.34 # There were 0 successful branch saturations on the branch. % 0.10/0.34 # There were 9 successful branch saturations after the branch. % 0.10/0.34 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.34 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.34 # Begin clausification derivation % 0.10/0.34 % 0.10/0.34 # End clausification derivation % 0.10/0.34 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.34 cnf(i_0_17, negated_conjecture, (organization(esk4_0,esk7_0))). % 0.10/0.34 cnf(i_0_16, negated_conjecture, (organization(esk4_0,esk8_0))). % 0.10/0.34 cnf(i_0_11, negated_conjecture, (greater(esk8_0,esk7_0))). % 0.10/0.34 cnf(i_0_14, negated_conjecture, (reproducibility(esk4_0,esk5_0,esk7_0))). % 0.10/0.34 cnf(i_0_13, negated_conjecture, (reproducibility(esk4_0,esk6_0,esk8_0))). % 0.10/0.34 cnf(i_0_15, negated_conjecture, (reorganization(esk4_0,esk9_0,esk10_0))). % 0.10/0.34 cnf(i_0_9, negated_conjecture, (~greater(esk5_0,esk6_0))). % 0.10/0.34 cnf(i_0_10, negated_conjecture, (~greater(esk8_0,esk10_0))). % 0.10/0.34 cnf(i_0_12, negated_conjecture, (~greater(esk9_0,esk7_0))). % 0.10/0.34 cnf(i_0_1, plain, (reliability(X1,esk1_2(X1,X2),X2)|~organization(X1,X2))). % 0.10/0.34 cnf(i_0_2, plain, (accountability(X1,esk2_2(X1,X2),X2)|~organization(X1,X2))). % 0.10/0.34 cnf(i_0_3, plain, (reproducibility(X1,esk3_2(X1,X2),X2)|~organization(X1,X2))). % 0.10/0.34 cnf(i_0_5, 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.10/0.34 cnf(i_0_6, 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.10/0.34 cnf(i_0_4, 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.10/0.34 cnf(i_0_7, hypothesis, (greater(X1,X2)|greater(X3,X4)|greater(X5,X6)|~reorganization(X7,X5,X4)|~greater(X3,X6)|~accountability(X7,X2,X3)|~accountability(X7,X1,X6)|~reliability(X7,X8,X3)|~reliability(X7,X9,X6)|~organization(X7,X3)|~organization(X7,X6))). % 0.10/0.34 cnf(i_0_8, hypothesis, (greater(X1,X2)|greater(X3,X4)|greater(X5,X6)|~reorganization(X7,X5,X4)|~greater(X3,X6)|~accountability(X7,X8,X3)|~accountability(X7,X9,X6)|~reliability(X7,X2,X3)|~reliability(X7,X1,X6)|~organization(X7,X3)|~organization(X7,X6))). % 0.10/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.10/0.34 # Begin printing tableau % 0.10/0.34 # Found 20 steps % 0.10/0.34 cnf(i_0_13, negated_conjecture, (reproducibility(esk4_0,esk6_0,esk8_0)), inference(start_rule)). % 0.10/0.34 cnf(i_0_22, plain, (reproducibility(esk4_0,esk6_0,esk8_0)), inference(extension_rule, [i_0_5])). % 0.10/0.34 cnf(i_0_33, plain, (greater(esk9_0,esk7_0)), inference(closure_rule, [i_0_12])). % 0.10/0.34 cnf(i_0_36, plain, (~reproducibility(esk4_0,esk6_0,esk8_0)), inference(closure_rule, [i_0_13])). % 0.10/0.34 cnf(i_0_41, plain, (~organization(esk4_0,esk8_0)), inference(closure_rule, [i_0_16])). % 0.10/0.34 cnf(i_0_42, plain, (~organization(esk4_0,esk8_0)), inference(closure_rule, [i_0_16])). % 0.10/0.34 cnf(i_0_34, plain, (~greater(esk6_0,esk6_0)), inference(extension_rule, [i_0_6])). % 0.10/0.34 cnf(i_0_50, plain, (~greater(esk8_0,esk7_0)), inference(closure_rule, [i_0_11])). % 0.10/0.34 cnf(i_0_57, plain, (~organization(esk4_0,esk8_0)), inference(closure_rule, [i_0_16])). % 0.10/0.34 cnf(i_0_58, plain, (~organization(esk4_0,esk8_0)), inference(closure_rule, [i_0_16])). % 0.10/0.34 cnf(i_0_37, plain, (~accountability(esk4_0,esk9_0,esk8_0)), inference(etableau_closure_rule, [i_0_37, ...])). % 0.10/0.34 cnf(i_0_38, plain, (~accountability(esk4_0,esk7_0,esk8_0)), inference(etableau_closure_rule, [i_0_38, ...])). % 0.10/0.34 cnf(i_0_39, plain, (~reliability(esk4_0,X19,esk8_0)), inference(etableau_closure_rule, [i_0_39, ...])). % 0.10/0.34 cnf(i_0_40, plain, (~reliability(esk4_0,X20,esk8_0)), inference(etableau_closure_rule, [i_0_40, ...])). % 0.10/0.34 cnf(i_0_51, plain, (~reproducibility(esk4_0,esk8_0,esk8_0)), inference(etableau_closure_rule, [i_0_51, ...])). % 0.10/0.34 cnf(i_0_52, plain, (~reproducibility(esk4_0,esk7_0,esk8_0)), inference(etableau_closure_rule, [i_0_52, ...])). % 0.10/0.34 cnf(i_0_53, plain, (~accountability(esk4_0,X21,esk8_0)), inference(etableau_closure_rule, [i_0_53, ...])). % 0.10/0.34 cnf(i_0_54, plain, (~accountability(esk4_0,X22,esk8_0)), inference(etableau_closure_rule, [i_0_54, ...])). % 0.10/0.34 cnf(i_0_55, plain, (~reliability(esk4_0,esk6_0,esk8_0)), inference(etableau_closure_rule, [i_0_55, ...])). % 0.10/0.34 cnf(i_0_56, plain, (~reliability(esk4_0,esk6_0,esk8_0)), inference(etableau_closure_rule, [i_0_56, ...])). % 0.10/0.34 # End printing tableau % 0.10/0.34 # SZS output end % 0.10/0.34 # Branches closed with saturation will be marked with an "s" % 0.10/0.34 # Child (2675072) has found a proof. % 0.10/0.34 % 0.10/0.34 # Proof search is over... % 0.10/0.34 # Freeing feature tree %------------------------------------------------------------------------------