%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT038-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 : n009.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 : Satisfiable 0.10s 0.41s % 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. Released v2.4.0. % 0.00/0.03 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.10/0.37 % Computer : n009.cluster.edu % 0.10/0.37 % Model : x86_64 x86_64 % 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.37 % Memory : 8046.5625MB % 0.10/0.37 % OS : Linux 6.8.0-71-generic % 0.10/0.37 % CPULimit : 300 % 0.10/0.37 % WCLimit : 300 % 0.10/0.37 % DateTime : Mon Sep 7 12:49: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___110_C45_F1_PI_SE_CS_SP_PS_S4S % 0.10/0.40 # and selection function SelectNewComplexAHPNS. % 0.10/0.40 # % 0.10/0.40 # Presaturation interreduction done % 0.10/0.40 # Number of axioms: 12 Number of unprocessed: 12 % 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 # 12 beginning clauses after preprocessing and clausification % 0.10/0.40 # Creating start rules for all 3 conjectures. % 0.10/0.40 # There are 3 start rule candidates: % 0.10/0.40 # Found 3 unit axioms. % 0.10/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.10/0.40 # 3 start rule tableaux created. % 0.10/0.40 # 9 extension rule candidate clauses % 0.10/0.40 # 3 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 are not enough tableaux to fork, creating more from the initial 3 % 0.10/0.40 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.10/0.40 # We now have 12 tableaux to operate on % 0.10/0.40 # 1558262 Satisfiable branch % 0.10/0.41 # Satisfiable branch found. % 0.10/0.41 # There were 1 total branch saturation attempts. % 0.10/0.41 # There were 0 of these attempts blocked. % 0.10/0.41 # There were 0 deferred branch saturation attempts. % 0.10/0.41 # There were 0 free duplicated saturations. % 0.10/0.41 # There were 0 total successful branch saturations. % 0.10/0.41 # There were 0 successful branch saturations in interreduction. % 0.10/0.41 # There were 0 successful branch saturations on the branch. % 0.10/0.41 # There were 0 successful branch saturations after the branch. % 0.10/0.41 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.10/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.10/0.41 # Begin clausification derivation % 0.10/0.41 % 0.10/0.41 # End clausification derivation % 0.10/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.41 cnf(i_0_22, negated_conjecture, (environment(sk3))). % 0.10/0.41 cnf(i_0_23, negated_conjecture, (stable(sk3))). % 0.10/0.41 cnf(i_0_13, plain, (finite_set(first_movers))). % 0.10/0.41 cnf(i_0_24, negated_conjecture, (cardinality_at_time(first_movers,to)!=zero|~greater(X1,appear(first_movers,sk3))|~in_environment(sk3,X1))). % 0.10/0.41 cnf(i_0_14, plain, (in_environment(X1,appear(first_movers,X1))|~stable(X1)|~environment(X1))). % 0.10/0.41 cnf(i_0_20, hypothesis, (contracts_from(sk2(X1),first_movers)|~stable(X1)|~environment(X1))). % 0.10/0.41 cnf(i_0_18, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.10/0.41 cnf(i_0_21, hypothesis, (greater(appear(efficient_producers,e),appear(first_movers,X1))|~environment(X1))). % 0.10/0.41 cnf(i_0_16, plain, (cardinality_at_time(s,t2)=zero|~contracts_from(X1,X2)|~finite_set(X2))). % 0.10/0.41 cnf(i_0_19, hypothesis, (greater(sk2(X1),appear(efficient_producers,X1))|~stable(X1)|~environment(X1))). % 0.10/0.41 cnf(i_0_15, plain, (greater(sk1(X1,X2),X1)|~contracts_from(X1,X2)|~finite_set(X2))). % 0.10/0.41 cnf(i_0_17, plain, (in_environment(X1,X2)|~greater(X2,X3)|~in_environment(X1,X3)|~stable(X1)|~environment(X1))). % 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 5 steps % 0.10/0.41 cnf(i_0_22, negated_conjecture, (environment(sk3)), inference(start_rule)). % 0.10/0.41 cnf(i_0_29, plain, (environment(sk3)), inference(extension_rule, [i_0_20])). % 0.10/0.41 cnf(i_0_146, plain, (~stable(sk3)), inference(closure_rule, [i_0_23])). % 0.10/0.41 cnf(i_0_145, plain, (contracts_from(sk2(sk3),first_movers)), inference(extension_rule, [i_0_16])). % 0.10/0.41 cnf(i_0_183, plain, (~finite_set(first_movers)), inference(closure_rule, [i_0_13])). % 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 (1558262) has found a proof. % 0.10/0.41 % 0.10/0.41 # Proof search is over... % 0.10/0.41 # Freeing feature tree %------------------------------------------------------------------------------