%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT038+1 : TPTP v9.3.0. Bugfixed v9.3.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 : n020.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:48 AM UTC 2026 % Result : CounterSatisfiable 0.13s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT038+1 : TPTP v9.3.0. Bugfixed v9.3.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.35 % Computer : n020.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Mon Sep 7 12:48:58 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___110_C45_F1_PI_SE_CS_SP_PS_S4S % 0.13/0.39 # and selection function SelectNewComplexAHPNS. % 0.13/0.39 # % 0.13/0.39 # Presaturation interreduction done % 0.13/0.39 # Number of axioms: 12 Number of unprocessed: 12 % 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 # 12 beginning clauses after preprocessing and clausification % 0.13/0.39 # Creating start rules for all 3 conjectures. % 0.13/0.39 # There are 3 start rule candidates: % 0.13/0.39 # Found 3 unit axioms. % 0.13/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.39 # 3 start rule tableaux created. % 0.13/0.39 # 9 extension rule candidate clauses % 0.13/0.39 # 3 unit axiom clauses % 0.13/0.39 % 0.13/0.39 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # There are not enough tableaux to fork, creating more from the initial 3 % 0.13/0.39 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.13/0.39 # We now have 12 tableaux to operate on % 0.13/0.39 # 2965679 Satisfiable branch % 0.13/0.39 # Satisfiable branch found. % 0.13/0.39 # There were 1 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 0 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 0 successful branch saturations after the branch. % 0.13/0.39 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_12, negated_conjecture, (environment(esk3_0))). % 0.13/0.39 cnf(i_0_11, negated_conjecture, (stable(esk3_0))). % 0.13/0.39 cnf(i_0_1, plain, (finite_set(first_movers))). % 0.13/0.39 cnf(i_0_10, negated_conjecture, (cardinality_at_time(first_movers,X1)!=zero|~greater(X1,appear(first_movers,esk3_0))|~in_environment(esk3_0,X1))). % 0.13/0.39 cnf(i_0_2, plain, (in_environment(X1,appear(first_movers,X1))|~stable(X1)|~environment(X1))). % 0.13/0.39 cnf(i_0_9, hypothesis, (greater(appear(efficient_producers,X1),appear(first_movers,X1))|~environment(X1))). % 0.13/0.39 cnf(i_0_7, hypothesis, (contracts_from(esk2_1(X1),first_movers)|~stable(X1)|~environment(X1))). % 0.13/0.39 cnf(i_0_6, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.13/0.39 cnf(i_0_8, hypothesis, (greater(esk2_1(X1),appear(efficient_producers,X1))|~stable(X1)|~environment(X1))). % 0.13/0.39 cnf(i_0_4, plain, (greater(esk1_2(X1,X2),X2)|~contracts_from(X2,X1)|~finite_set(X1))). % 0.13/0.39 cnf(i_0_3, plain, (cardinality_at_time(s,esk1_2(X1,X2))=zero|~contracts_from(X2,X1)|~finite_set(X1))). % 0.13/0.39 cnf(i_0_5, plain, (in_environment(X1,X2)|~greater(X2,X3)|~in_environment(X1,X3)|~stable(X1)|~environment(X1))). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 9 steps % 0.13/0.39 cnf(i_0_12, negated_conjecture, (environment(esk3_0)), inference(start_rule)). % 0.13/0.39 cnf(i_0_17, plain, (environment(esk3_0)), inference(extension_rule, [i_0_9])). % 0.13/0.39 cnf(i_0_133, plain, (greater(appear(efficient_producers,esk3_0),appear(first_movers,esk3_0))), inference(extension_rule, [i_0_6])). % 0.13/0.39 cnf(i_0_166, plain, (greater(esk2_1(esk3_0),appear(first_movers,esk3_0))), inference(extension_rule, [i_0_5])). % 0.13/0.39 cnf(i_0_189, plain, (~stable(esk3_0)), inference(closure_rule, [i_0_11])). % 0.13/0.39 cnf(i_0_190, plain, (~environment(esk3_0)), inference(closure_rule, [i_0_12])). % 0.13/0.39 cnf(i_0_168, plain, (~greater(esk2_1(esk3_0),appear(efficient_producers,esk3_0))), inference(extension_rule, [i_0_8])). % 0.13/0.39 cnf(i_0_200, plain, (~stable(esk3_0)), inference(closure_rule, [i_0_11])). % 0.13/0.39 cnf(i_0_201, plain, (~environment(esk3_0)), inference(closure_rule, [i_0_12])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 # 2965676 Satisfiable branch % 0.13/0.40 # Child (2965679) has found a proof. % 0.13/0.40 % 0.13/0.40 # Proof search is over... % 0.13/0.40 # Freeing feature tree %------------------------------------------------------------------------------