%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT013+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 : n018.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.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT013+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 : n018.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:53:07 UTC 2026 % 0.10/0.37 % CPUTime : % 0.10/0.40 # No SInE strategy applied % 0.10/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.10/0.40 # and selection function SelectComplexExceptUniqMaxHorn. % 0.10/0.40 # % 0.10/0.40 # Presaturation interreduction done % 0.10/0.40 # Number of axioms: 17 Number of unprocessed: 17 % 0.10/0.40 # Tableaux proof search. % 0.10/0.40 # APR header successfully linked. % 0.10/0.40 # 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 # 17 beginning clauses after preprocessing and clausification % 0.10/0.40 # Creating start rules for all 9 conjectures. % 0.10/0.40 # There are 9 start rule candidates: % 0.10/0.40 # Found 10 unit axioms. % 0.10/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.10/0.40 # 9 start rule tableaux created. % 0.10/0.40 # 7 extension rule candidate clauses % 0.10/0.40 # 10 unit axiom clauses % 0.10/0.40 % 0.10/0.40 # Requested 8, 32 cores available to the main process. % 0.10/0.40 # There were 1 total branch saturation attempts. % 0.10/0.40 # There were 0 of these attempts blocked. % 0.10/0.40 # There were 0 deferred branch saturation attempts. % 0.10/0.40 # There were 0 free duplicated saturations. % 0.10/0.40 # There were 1 total successful branch saturations. % 0.10/0.40 # There were 0 successful branch saturations in interreduction. % 0.10/0.40 # There were 0 successful branch saturations on the branch. % 0.10/0.40 # There were 1 successful branch saturations after the branch. % 0.10/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.40 # Begin clausification derivation % 0.10/0.40 % 0.10/0.40 # End clausification derivation % 0.10/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.40 cnf(i_0_10, negated_conjecture, (greater(esk3_0,esk2_0))). % 0.10/0.40 cnf(i_0_9, negated_conjecture, (greater(esk4_0,esk5_0))). % 0.10/0.40 cnf(i_0_17, negated_conjecture, (organization(esk1_0,esk6_0))). % 0.10/0.40 cnf(i_0_16, negated_conjecture, (organization(esk1_0,esk7_0))). % 0.10/0.40 cnf(i_0_15, negated_conjecture, (reorganization_free(esk1_0,esk6_0,esk7_0))). % 0.10/0.41 cnf(i_0_14, negated_conjecture, (complexity(esk1_0,esk2_0,esk6_0))). % 0.10/0.41 cnf(i_0_13, negated_conjecture, (complexity(esk1_0,esk3_0,esk7_0))). % 0.10/0.41 cnf(i_0_12, negated_conjecture, (size(esk1_0,esk4_0,esk6_0))). % 0.10/0.41 cnf(i_0_11, negated_conjecture, (size(esk1_0,esk5_0,esk7_0))). % 0.10/0.41 cnf(i_0_1, plain, (~greater(X1,X1))). % 0.10/0.41 cnf(i_0_2, plain, (~greater(X1,X2)|~greater(X2,X1))). % 0.10/0.41 cnf(i_0_3, plain, (time(X1)|~organization(X2,X1))). % 0.10/0.41 cnf(i_0_5, plain, (reorganization_free(X1,X2,X3)|~reorganization_free(X1,X3,X2))). % 0.10/0.41 cnf(i_0_4, plain, (X1=X2|greater(X1,X2)|greater(X2,X1)|~time(X2)|~time(X1))). % 0.10/0.41 cnf(i_0_6, plain, (X1=X2|~complexity(X3,X2,X4)|~complexity(X3,X1,X4)|~organization(X3,X4))). % 0.10/0.41 cnf(i_0_8, hypothesis, (~complexity(X1,X2,X3)|~complexity(X1,X4,X5)|~reorganization_free(X1,X5,X3)|~organization(X1,X3)|~organization(X1,X5)|~greater(X4,X2)|~greater(X3,X5))). % 0.10/0.41 cnf(i_0_7, hypothesis, (~size(X1,X2,X3)|~size(X1,X4,X5)|~reorganization_free(X1,X5,X3)|~organization(X1,X3)|~organization(X1,X5)|~greater(X4,X2)|~greater(X3,X5))). % 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 9 steps % 0.10/0.41 cnf(i_0_15, negated_conjecture, (reorganization_free(esk1_0,esk6_0,esk7_0)), inference(start_rule)). % 0.10/0.41 cnf(i_0_24, plain, (reorganization_free(esk1_0,esk6_0,esk7_0)), inference(extension_rule, [i_0_5])). % 0.10/0.41 cnf(i_0_33, plain, (reorganization_free(esk1_0,esk7_0,esk6_0)), inference(extension_rule, [i_0_8])). % 0.10/0.41 cnf(i_0_48, plain, (~complexity(esk1_0,esk2_0,esk6_0)), inference(closure_rule, [i_0_14])). % 0.10/0.41 cnf(i_0_49, plain, (~complexity(esk1_0,esk3_0,esk7_0)), inference(closure_rule, [i_0_13])). % 0.10/0.41 cnf(i_0_51, plain, (~organization(esk1_0,esk6_0)), inference(closure_rule, [i_0_17])). % 0.10/0.41 cnf(i_0_52, plain, (~organization(esk1_0,esk7_0)), inference(closure_rule, [i_0_16])). % 0.10/0.41 cnf(i_0_53, plain, (~greater(esk3_0,esk2_0)), inference(closure_rule, [i_0_10])). % 0.10/0.41 cnf(i_0_54, plain, (~greater(esk6_0,esk7_0)), inference(etableau_closure_rule, [i_0_54, ...])). % 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.41 # Child (1678068) has found a proof. % 0.10/0.41 % 0.10/0.41 # Proof search is over... % 0.10/0.41 # Freeing feature tree %------------------------------------------------------------------------------