%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT041-2 : 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 : n002.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:49 AM UTC 2026 % Result : Unsatisfiable 0.13s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT041-2 : 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.08/0.35 % Computer : n002.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Mon Sep 7 13:05:22 UTC 2026 % 0.08/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 8 Number of unprocessed: 8 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 8 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 1 conjectures. % 0.13/0.38 # There are 1 start rule candidates: % 0.13/0.38 # Found 4 unit axioms. % 0.13/0.38 # 1 start rule tableaux created. % 0.13/0.38 # 4 extension rule candidate clauses % 0.13/0.38 # 4 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.38 # Closed tableau found in foldup close cycle with 0 folds and 1 closures done. % 0.13/0.38 # There were 0 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_12, hypothesis, (organisation_at_time(sk1,sk2))). % 0.13/0.38 cnf(i_0_13, hypothesis, (founding_time(sk1,sk2))). % 0.13/0.38 cnf(i_0_14, hypothesis, (number_of_routines(sk1,sk2,high))). % 0.13/0.38 cnf(i_0_15, hypothesis, (~has_elaborated_routines(sk1,sk2))). % 0.13/0.38 cnf(i_0_16, negated_conjecture, (first_mover(X1)|efficient_producer(X1)|~organisation_at_time(X1,X2))). % 0.13/0.38 cnf(i_0_10, hypothesis, (has_elaborated_routines(X1,X2)|~founding_time(X1,X2)|~efficient_producer(X1)|~organisation_at_time(X1,X2))). % 0.13/0.38 cnf(i_0_11, hypothesis, (number_of_routines(X1,X2,low)|~first_mover(X1)|~founding_time(X1,X2)|~organisation_at_time(X1,X2))). % 0.13/0.38 cnf(i_0_9, plain, (~number_of_routines(X1,X2,low)|~number_of_routines(X1,X2,high))). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 11 steps % 0.13/0.38 cnf(i_0_16, negated_conjecture, (first_mover(sk1)|efficient_producer(sk1)|~organisation_at_time(sk1,sk2)), inference(start_rule)). % 0.13/0.38 cnf(i_0_19, plain, (~organisation_at_time(sk1,sk2)), inference(closure_rule, [i_0_12])). % 0.13/0.38 cnf(i_0_17, plain, (first_mover(sk1)), inference(extension_rule, [i_0_11])). % 0.13/0.38 cnf(i_0_26, plain, (~founding_time(sk1,sk2)), inference(closure_rule, [i_0_13])). % 0.13/0.38 cnf(i_0_27, plain, (~organisation_at_time(sk1,sk2)), inference(closure_rule, [i_0_12])). % 0.13/0.38 cnf(i_0_18, plain, (efficient_producer(sk1)), inference(extension_rule, [i_0_10])). % 0.13/0.38 cnf(i_0_46, plain, (has_elaborated_routines(sk1,sk2)), inference(closure_rule, [i_0_15])). % 0.13/0.38 cnf(i_0_47, plain, (~founding_time(sk1,sk2)), inference(closure_rule, [i_0_13])). % 0.13/0.38 cnf(i_0_49, plain, (~organisation_at_time(sk1,sk2)), inference(closure_rule, [i_0_12])). % 0.13/0.38 cnf(i_0_24, plain, (number_of_routines(sk1,sk2,low)), inference(extension_rule, [i_0_9])). % 0.13/0.38 cnf(i_0_81, plain, (~number_of_routines(sk1,sk2,high)), inference(closure_rule, [i_0_14])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 0.13/0.38 # We now have 1 tableaux to operate on % 0.13/0.38 # Found closed tableau during pool population. % 0.13/0.38 # Proof search is over... % 0.13/0.38 # Freeing feature tree %------------------------------------------------------------------------------