%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT002+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 : 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 : Theorem 0.10s 0.47s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT002+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.43 % Computer : n004.cluster.edu % 0.10/0.43 % Model : x86_64 x86_64 % 0.10/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.43 % Memory : 8046.5625MB % 0.10/0.43 % OS : Linux 6.8.0-71-generic % 0.10/0.43 % CPULimit : 300 % 0.10/0.43 % WCLimit : 300 % 0.10/0.43 % DateTime : Mon Sep 7 11:32:30 UTC 2026 % 0.10/0.43 % CPUTime : % 0.10/0.46 # No SInE strategy applied % 0.10/0.46 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.10/0.46 # and selection function SelectComplexExceptUniqMaxHorn. % 0.10/0.46 # % 0.10/0.46 # Presaturation interreduction done % 0.10/0.46 # Number of axioms: 13 Number of unprocessed: 13 % 0.10/0.46 # Tableaux proof search. % 0.10/0.46 # APR header successfully linked. % 0.10/0.46 # Hello from C++ % 0.10/0.47 # The folding up rule is enabled... % 0.10/0.47 # Local unification is enabled... % 0.10/0.47 # Any saturation attempts will use folding labels... % 0.10/0.47 # 13 beginning clauses after preprocessing and clausification % 0.10/0.47 # Creating start rules for all 7 conjectures. % 0.10/0.47 # There are 7 start rule candidates: % 0.10/0.47 # Found 7 unit axioms. % 0.10/0.47 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.10/0.47 # 7 start rule tableaux created. % 0.10/0.47 # 6 extension rule candidate clauses % 0.10/0.47 # 7 unit axiom clauses % 0.10/0.47 % 0.10/0.47 # Requested 8, 32 cores available to the main process. % 0.10/0.47 # There are not enough tableaux to fork, creating more from the initial 7 % 0.10/0.47 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux. % 0.10/0.47 # We now have 15 tableaux to operate on % 0.10/0.47 # There were 3 total branch saturation attempts. % 0.10/0.47 # There were 0 of these attempts blocked. % 0.10/0.47 # There were 0 deferred branch saturation attempts. % 0.10/0.47 # There were 0 free duplicated saturations. % 0.10/0.47 # There were 3 total successful branch saturations. % 0.10/0.47 # There were 0 successful branch saturations in interreduction. % 0.10/0.47 # There were 0 successful branch saturations on the branch. % 0.10/0.47 # There were 3 successful branch saturations after the branch. % 0.10/0.47 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.10/0.47 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.10/0.47 # Begin clausification derivation % 0.10/0.47 % 0.10/0.47 # End clausification derivation % 0.10/0.47 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.47 cnf(i_0_13, negated_conjecture, (organization(esk2_0,esk5_0))). % 0.10/0.47 cnf(i_0_12, negated_conjecture, (organization(esk2_0,esk6_0))). % 0.10/0.47 cnf(i_0_8, negated_conjecture, (greater(esk6_0,esk5_0))). % 0.10/0.47 cnf(i_0_11, negated_conjecture, (reorganization_free(esk2_0,esk5_0,esk6_0))). % 0.10/0.47 cnf(i_0_10, negated_conjecture, (inertia(esk2_0,esk3_0,esk5_0))). % 0.10/0.47 cnf(i_0_9, negated_conjecture, (inertia(esk2_0,esk4_0,esk6_0))). % 0.10/0.47 cnf(i_0_7, negated_conjecture, (~greater(esk4_0,esk3_0))). % 0.10/0.47 cnf(i_0_2, plain, (reorganization_free(X1,X2,X2)|~reorganization_free(X1,X3,X2))). % 0.10/0.47 cnf(i_0_3, plain, (reorganization_free(X1,X2,X2)|~reorganization_free(X1,X2,X3))). % 0.10/0.47 cnf(i_0_1, plain, (reproducibility(X1,esk1_2(X1,X2),X2)|~organization(X1,X2))). % 0.10/0.47 cnf(i_0_6, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~reorganization_free(X5,X4,X3)|~reproducibility(X5,X1,X3)|~reproducibility(X5,X2,X4)|~organization(X5,X3)|~organization(X5,X4))). % 0.10/0.47 cnf(i_0_4, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~inertia(X5,X3,X6)|~inertia(X7,X4,X8)|~reorganization_free(X5,X6,X6)|~reorganization_free(X7,X8,X8)|~reproducibility(X5,X1,X6)|~reproducibility(X7,X2,X8)|~organization(X5,X6)|~organization(X7,X8))). % 0.10/0.47 cnf(i_0_5, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~inertia(X5,X1,X6)|~inertia(X7,X2,X8)|~reorganization_free(X5,X6,X6)|~reorganization_free(X7,X8,X8)|~reproducibility(X5,X3,X6)|~reproducibility(X7,X4,X8)|~organization(X5,X6)|~organization(X7,X8))). % 0.10/0.47 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.10/0.47 # Begin printing tableau % 0.10/0.47 # Found 14 steps % 0.10/0.47 cnf(i_0_8, negated_conjecture, (greater(esk6_0,esk5_0)), inference(start_rule)). % 0.10/0.47 cnf(i_0_18, plain, (greater(esk6_0,esk5_0)), inference(extension_rule, [i_0_5])). % 0.10/0.47 cnf(i_0_452, plain, (greater(esk4_0,esk3_0)), inference(closure_rule, [i_0_7])). % 0.10/0.47 cnf(i_0_454, plain, (~inertia(esk2_0,esk4_0,esk6_0)), inference(closure_rule, [i_0_9])). % 0.10/0.47 cnf(i_0_455, plain, (~inertia(esk2_0,esk3_0,esk5_0)), inference(closure_rule, [i_0_10])). % 0.10/0.47 cnf(i_0_460, plain, (~organization(esk2_0,esk6_0)), inference(closure_rule, [i_0_12])). % 0.10/0.47 cnf(i_0_461, plain, (~organization(esk2_0,esk5_0)), inference(closure_rule, [i_0_13])). % 0.10/0.47 cnf(i_0_456, plain, (~reorganization_free(esk2_0,esk6_0,esk6_0)), inference(extension_rule, [i_0_2])). % 0.10/0.47 cnf(i_0_463, plain, (~reorganization_free(esk2_0,esk5_0,esk6_0)), inference(closure_rule, [i_0_11])). % 0.10/0.47 cnf(i_0_457, plain, (~reorganization_free(esk2_0,esk5_0,esk5_0)), inference(extension_rule, [i_0_3])). % 0.10/0.47 cnf(i_0_465, plain, (~reorganization_free(esk2_0,esk5_0,esk5_0)), inference(extension_rule, [i_0_2])). % 0.10/0.47 cnf(i_0_458, plain, (~reproducibility(esk2_0,esk6_0,esk6_0)), inference(etableau_closure_rule, [i_0_458, ...])). % 0.10/0.47 cnf(i_0_459, plain, (~reproducibility(esk2_0,esk5_0,esk5_0)), inference(etableau_closure_rule, [i_0_459, ...])). % 0.10/0.47 cnf(i_0_529, plain, (~reorganization_free(esk2_0,X7,esk5_0)), inference(etableau_closure_rule, [i_0_529, ...])). % 0.10/0.47 # End printing tableau % 0.10/0.47 # SZS output end % 0.10/0.47 # Branches closed with saturation will be marked with an "s" % 0.10/0.47 # Child (3304293) has found a proof. % 0.10/0.47 % 0.10/0.48 # Proof search is over... % 0.10/0.48 # Freeing feature tree %------------------------------------------------------------------------------