%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT010+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 : n001.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.41s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT010+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.10/0.36 % Computer : n001.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.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.36 % DateTime : Mon Sep 7 11:52:22 UTC 2026 % 0.10/0.36 % CPUTime : % 0.10/0.39 # No SInE strategy applied % 0.10/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.10/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.10/0.39 # % 0.10/0.39 # Presaturation interreduction done % 0.10/0.39 # Number of axioms: 19 Number of unprocessed: 19 % 0.10/0.39 # Tableaux proof search. % 0.10/0.39 # APR header successfully linked. % 0.10/0.39 # 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 # 19 beginning clauses after preprocessing and clausification % 0.10/0.40 # Creating start rules for all 14 conjectures. % 0.10/0.40 # There are 14 start rule candidates: % 0.10/0.40 # Found 13 unit axioms. % 0.10/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.10/0.40 # 14 start rule tableaux created. % 0.10/0.40 # 6 extension rule candidate clauses % 0.10/0.40 # 13 unit axiom clauses % 0.10/0.40 % 0.10/0.40 # Requested 8, 32 cores available to the main process. % 0.10/0.41 # There were 4 total branch saturation attempts. % 0.10/0.41 # There were 0 of these attempts blocked. % 0.10/0.41 # There were 0 deferred branch saturation attempts. % 0.10/0.41 # There were 0 free duplicated saturations. % 0.10/0.41 # There were 4 total successful branch saturations. % 0.10/0.41 # There were 0 successful branch saturations in interreduction. % 0.10/0.41 # There were 0 successful branch saturations on the branch. % 0.10/0.41 # There were 4 successful branch saturations after the branch. % 0.10/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.41 # Begin clausification derivation % 0.10/0.41 % 0.10/0.41 # End clausification derivation % 0.10/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.41 cnf(i_0_19, negated_conjecture, (organization(esk2_0,esk11_0))). % 0.10/0.41 cnf(i_0_18, negated_conjecture, (organization(esk3_0,esk12_0))). % 0.10/0.41 cnf(i_0_7, negated_conjecture, (greater(esk10_0,esk9_0))). % 0.10/0.41 cnf(i_0_13, negated_conjecture, (reliability(esk2_0,esk5_0,esk11_0))). % 0.10/0.41 cnf(i_0_12, negated_conjecture, (reliability(esk3_0,esk6_0,esk12_0))). % 0.10/0.41 cnf(i_0_11, negated_conjecture, (accountability(esk2_0,esk7_0,esk11_0))). % 0.10/0.41 cnf(i_0_10, negated_conjecture, (accountability(esk3_0,esk8_0,esk12_0))). % 0.10/0.41 cnf(i_0_17, negated_conjecture, (reorganization_free(esk2_0,esk11_0,esk11_0))). % 0.10/0.41 cnf(i_0_16, negated_conjecture, (reorganization_free(esk3_0,esk12_0,esk12_0))). % 0.10/0.41 cnf(i_0_15, negated_conjecture, (class(esk2_0,esk4_0,esk11_0))). % 0.10/0.41 cnf(i_0_14, negated_conjecture, (class(esk3_0,esk4_0,esk12_0))). % 0.10/0.41 cnf(i_0_9, negated_conjecture, (size(esk2_0,esk9_0,esk11_0))). % 0.10/0.41 cnf(i_0_8, negated_conjecture, (size(esk3_0,esk10_0,esk12_0))). % 0.10/0.41 cnf(i_0_6, negated_conjecture, (~greater(esk6_0,esk5_0)|~greater(esk8_0,esk7_0))). % 0.10/0.41 cnf(i_0_1, plain, (reproducibility(X1,esk1_2(X1,X2),X2)|~organization(X1,X2))). % 0.10/0.41 cnf(i_0_3, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~accountability(X5,X1,X6)|~accountability(X7,X2,X8)|~reliability(X5,X9,X6)|~reliability(X7,X10,X8)|~reproducibility(X5,X3,X6)|~reproducibility(X7,X4,X8)|~organization(X5,X6)|~organization(X7,X8))). % 0.10/0.41 cnf(i_0_4, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~accountability(X5,X6,X7)|~accountability(X8,X9,X10)|~reliability(X5,X1,X7)|~reliability(X8,X2,X10)|~reproducibility(X5,X3,X7)|~reproducibility(X8,X4,X10)|~organization(X5,X7)|~organization(X8,X10))). % 0.10/0.41 cnf(i_0_2, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~greater(X5,X6)|~accountability(X7,X3,X8)|~accountability(X9,X4,X10)|~reliability(X7,X5,X8)|~reliability(X9,X6,X10)|~reproducibility(X7,X1,X8)|~reproducibility(X9,X2,X10)|~organization(X7,X8)|~organization(X9,X10))). % 0.10/0.41 cnf(i_0_5, hypothesis, (greater(X1,X2)|~size(X3,X4,X5)|~size(X6,X7,X8)|~class(X3,X9,X5)|~class(X6,X9,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.10/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.10/0.41 # Begin printing tableau % 0.10/0.41 # Found 14 steps % 0.10/0.41 cnf(i_0_9, negated_conjecture, (size(esk2_0,esk9_0,esk11_0)), inference(start_rule)). % 0.10/0.41 cnf(i_0_23, plain, (size(esk2_0,esk9_0,esk11_0)), inference(extension_rule, [i_0_5])). % 0.10/0.41 cnf(i_0_70, plain, (~size(esk3_0,esk10_0,esk12_0)), inference(closure_rule, [i_0_8])). % 0.10/0.41 cnf(i_0_71, plain, (~class(esk2_0,esk4_0,esk11_0)), inference(closure_rule, [i_0_15])). % 0.10/0.41 cnf(i_0_72, plain, (~class(esk3_0,esk4_0,esk12_0)), inference(closure_rule, [i_0_14])). % 0.10/0.41 cnf(i_0_73, plain, (~reorganization_free(esk2_0,esk11_0,esk11_0)), inference(closure_rule, [i_0_17])). % 0.10/0.41 cnf(i_0_74, plain, (~reorganization_free(esk3_0,esk12_0,esk12_0)), inference(closure_rule, [i_0_16])). % 0.10/0.41 cnf(i_0_78, plain, (~organization(esk2_0,esk11_0)), inference(closure_rule, [i_0_19])). % 0.10/0.41 cnf(i_0_79, plain, (~organization(esk3_0,esk12_0)), inference(closure_rule, [i_0_18])). % 0.10/0.41 cnf(i_0_68, plain, (greater(esk6_0,esk5_0)), inference(extension_rule, [i_0_6])). % 0.10/0.41 cnf(i_0_75, plain, (~greater(esk9_0,esk10_0)), inference(etableau_closure_rule, [i_0_75, ...])). % 0.10/0.41 cnf(i_0_76, plain, (~reproducibility(esk2_0,esk6_0,esk11_0)), inference(etableau_closure_rule, [i_0_76, ...])). % 0.10/0.41 cnf(i_0_77, plain, (~reproducibility(esk3_0,esk5_0,esk12_0)), inference(etableau_closure_rule, [i_0_77, ...])). % 0.10/0.41 cnf(i_0_114, plain, (~greater(esk8_0,esk7_0)), inference(etableau_closure_rule, [i_0_114, ...])). % 0.10/0.41 # End printing tableau % 0.10/0.41 # SZS output end % 0.10/0.41 # Branches closed with saturation will be marked with an "s" % 0.10/0.42 # Child (2938418) has found a proof. % 0.10/0.42 % 0.10/0.42 # Proof search is over... % 0.10/0.42 # Freeing feature tree %------------------------------------------------------------------------------