%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT066-1 : TPTP v9.3.0. Released v2.5.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 : n026.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:53 AM UTC 2026 % Result : Satisfiable 0.13s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT066-1 : TPTP v9.3.0. Released v2.5.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 : n026.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.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Mon Sep 7 13:51:27 UTC 2026 % 0.09/0.36 % CPUTime : % 0.13/0.39 # No SInE strategy applied % 0.13/0.39 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA % 0.13/0.39 # and selection function SelectNewComplexAHP. % 0.13/0.39 # % 0.13/0.39 # Presaturation interreduction done % 0.13/0.39 # Number of axioms: 11 Number of unprocessed: 11 % 0.13/0.39 # Tableaux proof search. % 0.13/0.39 # APR header successfully linked. % 0.13/0.39 # Hello from C++ % 0.13/0.39 # The folding up rule is enabled... % 0.13/0.39 # Local unification is enabled... % 0.13/0.39 # Any saturation attempts will use folding labels... % 0.13/0.39 # 11 beginning clauses after preprocessing and clausification % 0.13/0.39 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.13/0.39 # No conjectures. % 0.13/0.39 # There are 11 start rule candidates: % 0.13/0.39 # Found 2 unit axioms. % 0.13/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.39 # 11 start rule tableaux created. % 0.13/0.39 # 9 extension rule candidate clauses % 0.13/0.39 # 2 unit axiom clauses % 0.13/0.39 % 0.13/0.39 # Requested 8, 32 cores available to the main process. % 0.13/0.40 # Creating equality axioms % 0.13/0.40 # Ran out of tableaux, making start rules for all clauses % 0.13/0.40 # 2620955 Satisfiable branch % 0.13/0.40 # Satisfiable branch found. % 0.13/0.40 # There were 1 total branch saturation attempts. % 0.13/0.40 # There were 0 of these attempts blocked. % 0.13/0.40 # There were 0 deferred branch saturation attempts. % 0.13/0.40 # There were 0 free duplicated saturations. % 0.13/0.40 # There were 0 total successful branch saturations. % 0.13/0.40 # There were 0 successful branch saturations in interreduction. % 0.13/0.40 # There were 0 successful branch saturations on the branch. % 0.13/0.40 # There were 0 successful branch saturations after the branch. % 0.13/0.40 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # Begin clausification derivation % 0.13/0.40 % 0.13/0.40 # End clausification derivation % 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.40 cnf(i_0_14, plain, (smaller_or_equal(X1,X1))). % 0.13/0.40 cnf(i_0_17, plain, (greater_or_equal(X1,X1))). % 0.13/0.40 cnf(i_0_18, plain, (greater(X1,X2)|~smaller(X2,X1))). % 0.13/0.40 cnf(i_0_20, plain, (~greater(X1,X2)|~greater(X2,X1))). % 0.13/0.40 cnf(i_0_13, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 0.13/0.40 cnf(i_0_22, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 0.13/0.40 cnf(i_0_19, plain, (smaller(X1,X2)|~greater(X2,X1))). % 0.13/0.40 cnf(i_0_16, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.13/0.40 cnf(i_0_12, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 0.13/0.40 cnf(i_0_15, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.13/0.40 cnf(i_0_21, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.13/0.40 cnf(i_0_547, plain, (X4=X4)). % 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.40 # Begin printing tableau % 0.13/0.40 # Found 7 steps % 0.13/0.40 cnf(i_0_547, plain, (X3=X3), inference(start_rule)). % 0.13/0.40 cnf(i_0_579, plain, (X3=X3), inference(extension_rule, [i_0_552])). % 0.13/0.40 cnf(i_0_873, plain, ($false), inference(closure_rule, [i_0_547])). % 0.13/0.40 cnf(i_0_871, plain, (smaller(X3,X3)), inference(extension_rule, [i_0_18])). % 0.13/0.40 cnf(i_0_882, plain, (greater(X3,X3)), inference(extension_rule, [i_0_20])). % 0.13/0.40 cnf(i_0_885, plain, (~greater(X3,X3)), inference(closure_rule, [i_0_882])). % 0.13/0.40 cnf(i_0_874, plain, (~smaller(X3,X3)), inference(extension_rule, [i_0_19])). % 0.13/0.40 # End printing tableau % 0.13/0.40 # SZS output end % 0.13/0.40 # Branches closed with saturation will be marked with an "s" % 0.13/0.40 # Creating equality axioms % 0.13/0.40 # Ran out of tableaux, making start rules for all clauses % 0.13/0.40 # 2620952 Satisfiable branch % 0.13/0.40 # Creating equality axioms % 0.13/0.40 # Ran out of tableaux, making start rules for all clauses % 0.13/0.40 # 2620953 Satisfiable branch % 0.13/0.40 # Child (2620955) has found a proof. % 0.13/0.40 % 0.13/0.40 # Proof search is over... % 0.13/0.40 # Freeing feature tree %------------------------------------------------------------------------------