%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT014-1 : TPTP v9.3.0. Released v2.4.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:44 AM UTC 2026 % Result : Unsatisfiable 0.10s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT014-1 : TPTP v9.3.0. Released v2.4.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 : n018.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.10/0.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.36 % DateTime : Mon Sep 7 11:54:52 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: 17 Number of unprocessed: 17 % 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.39 # The folding up rule is enabled... % 0.10/0.39 # Local unification is enabled... % 0.10/0.39 # Any saturation attempts will use folding labels... % 0.10/0.39 # 17 beginning clauses after preprocessing and clausification % 0.10/0.39 # Creating start rules for all 9 conjectures. % 0.10/0.39 # There are 9 start rule candidates: % 0.10/0.39 # Found 10 unit axioms. % 0.10/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.10/0.39 # 9 start rule tableaux created. % 0.10/0.39 # 7 extension rule candidate clauses % 0.10/0.39 # 10 unit axiom clauses % 0.10/0.39 % 0.10/0.39 # Requested 8, 32 cores available to the main process. % 0.10/0.39 # There were 1 total branch saturation attempts. % 0.10/0.39 # There were 0 of these attempts blocked. % 0.10/0.39 # There were 0 deferred branch saturation attempts. % 0.10/0.39 # There were 0 free duplicated saturations. % 0.10/0.39 # There were 1 total successful branch saturations. % 0.10/0.39 # There were 0 successful branch saturations in interreduction. % 0.10/0.39 # There were 0 successful branch saturations on the branch. % 0.10/0.39 # There were 1 successful branch saturations after the branch. % 0.10/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.39 # Begin clausification derivation % 0.10/0.39 % 0.10/0.39 # End clausification derivation % 0.10/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.39 cnf(i_0_34, negated_conjecture, (greater(sk2,sk3))). % 0.10/0.39 cnf(i_0_33, negated_conjecture, (greater(sk5,sk4))). % 0.10/0.39 cnf(i_0_26, negated_conjecture, (organization(sk1,sk6))). % 0.10/0.39 cnf(i_0_27, negated_conjecture, (organization(sk1,sk7))). % 0.10/0.39 cnf(i_0_28, negated_conjecture, (reorganization_free(sk1,sk6,sk7))). % 0.10/0.39 cnf(i_0_31, negated_conjecture, (size(sk1,sk4,sk6))). % 0.10/0.39 cnf(i_0_32, negated_conjecture, (size(sk1,sk5,sk7))). % 0.10/0.39 cnf(i_0_29, negated_conjecture, (complexity(sk1,sk2,sk6))). % 0.10/0.39 cnf(i_0_30, negated_conjecture, (complexity(sk1,sk3,sk7))). % 0.10/0.39 cnf(i_0_18, plain, (~greater(X1,X1))). % 0.10/0.39 cnf(i_0_19, plain, (~greater(X1,X2)|~greater(X2,X1))). % 0.10/0.39 cnf(i_0_20, plain, (time(X1)|~organization(X2,X1))). % 0.10/0.39 cnf(i_0_22, plain, (reorganization_free(X1,X2,X3)|~reorganization_free(X1,X3,X2))). % 0.10/0.39 cnf(i_0_21, plain, (X1=X2|greater(X1,X2)|greater(X2,X1)|~time(X2)|~time(X1))). % 0.10/0.39 cnf(i_0_23, plain, (X1=X2|~size(X3,X2,X4)|~size(X3,X1,X4)|~organization(X3,X4))). % 0.10/0.39 cnf(i_0_24, 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.39 cnf(i_0_25, 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.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.10/0.39 # Begin printing tableau % 0.10/0.39 # Found 9 steps % 0.10/0.39 cnf(i_0_28, negated_conjecture, (reorganization_free(sk1,sk6,sk7)), inference(start_rule)). % 0.10/0.39 cnf(i_0_41, plain, (reorganization_free(sk1,sk6,sk7)), inference(extension_rule, [i_0_22])). % 0.10/0.39 cnf(i_0_50, plain, (reorganization_free(sk1,sk7,sk6)), inference(extension_rule, [i_0_24])). % 0.10/0.39 cnf(i_0_65, plain, (~size(sk1,sk4,sk6)), inference(closure_rule, [i_0_31])). % 0.10/0.39 cnf(i_0_66, plain, (~size(sk1,sk5,sk7)), inference(closure_rule, [i_0_32])). % 0.10/0.39 cnf(i_0_68, plain, (~organization(sk1,sk6)), inference(closure_rule, [i_0_26])). % 0.10/0.39 cnf(i_0_69, plain, (~organization(sk1,sk7)), inference(closure_rule, [i_0_27])). % 0.10/0.39 cnf(i_0_70, plain, (~greater(sk5,sk4)), inference(closure_rule, [i_0_33])). % 0.10/0.39 cnf(i_0_71, plain, (~greater(sk6,sk7)), inference(etableau_closure_rule, [i_0_71, ...])). % 0.10/0.39 # End printing tableau % 0.10/0.39 # SZS output end % 0.10/0.39 # Branches closed with saturation will be marked with an "s" % 0.10/0.39 # Child (1682676) has found a proof. % 0.10/0.39 % 0.10/0.40 # Proof search is over... % 0.10/0.40 # Freeing feature tree %------------------------------------------------------------------------------