%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT038-10 : TPTP v9.3.0. Released v7.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 : n017.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.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT038-10 : TPTP v9.3.0. Released v7.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.10/0.36 % Computer : n017.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/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 12:41:24 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: 14 Number of unprocessed: 14 % 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.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 # 14 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 14 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 # 0 extension rule candidate clauses % 0.10/0.40 # 14 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 # Creating equality axioms % 0.10/0.40 # Ran out of tableaux, making start rules for all clauses % 0.10/0.40 # Returning from population with 43 new_tableaux and 0 remaining starting tableaux. % 0.10/0.40 # We now have 43 tableaux to operate on % 0.10/0.40 # 1827284 Satisfiable branch % 0.10/0.40 # Satisfiable branch found. % 0.10/0.40 # There were 1 total branch saturation attempts. % 0.10/0.40 # There were 0 of these attempts blocked. % 0.10/0.40 # There were 0 deferred branch saturation attempts. % 0.10/0.40 # There were 0 free duplicated saturations. % 0.10/0.40 # There were 0 total successful branch saturations. % 0.10/0.40 # There were 0 successful branch saturations in interreduction. % 0.10/0.40 # There were 0 successful branch saturations on the branch. % 0.10/0.40 # There were 0 successful branch saturations after the branch. % 0.10/0.40 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.40 # Begin clausification derivation % 0.10/0.40 % 0.10/0.40 # End clausification derivation % 0.10/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.40 cnf(i_0_26, negated_conjecture, (environment(sk3)=true)). % 0.10/0.40 cnf(i_0_27, negated_conjecture, (stable(sk3)=true)). % 0.10/0.40 cnf(i_0_17, plain, (finite_set(first_movers)=true)). % 0.10/0.40 cnf(i_0_15, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.10/0.40 cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.10/0.40 cnf(i_0_25, hypothesis, (ifeq(environment(X1),true,greater(appear(efficient_producers,e),appear(first_movers,X1)),true)=true)). % 0.10/0.40 cnf(i_0_24, hypothesis, (ifeq(environment(X1),true,ifeq(stable(X1),true,contracts_from(sk2(X1),first_movers),true),true)=true)). % 0.10/0.40 cnf(i_0_20, plain, (ifeq2(finite_set(X1),true,ifeq2(contracts_from(X2,X1),true,cardinality_at_time(s,t2),zero),zero)=zero)). % 0.10/0.40 cnf(i_0_22, plain, (ifeq(greater(X1,X2),true,ifeq(greater(X3,X1),true,greater(X3,X2),true),true)=true)). % 0.10/0.40 cnf(i_0_18, plain, (ifeq(environment(X1),true,ifeq(stable(X1),true,in_environment(X1,appear(first_movers,X1)),true),true)=true)). % 0.10/0.40 cnf(i_0_23, hypothesis, (ifeq(environment(X1),true,ifeq(stable(X1),true,greater(sk2(X1),appear(efficient_producers,X1)),true),true)=true)). % 0.10/0.40 cnf(i_0_19, plain, (ifeq(finite_set(X1),true,ifeq(contracts_from(X2,X1),true,greater(sk1(X2,X1),X2),true),true)=true)). % 0.10/0.40 cnf(i_0_21, plain, (ifeq(greater(X1,X2),true,ifeq(in_environment(X3,X2),true,ifeq(environment(X3),true,ifeq(stable(X3),true,in_environment(X3,X1),true),true),true),true)=true)). % 0.10/0.40 cnf(i_0_28, negated_conjecture, (tuple(cardinality_at_time(first_movers,to),in_environment(sk3,X1),greater(X1,appear(first_movers,sk3)))!=tuple(zero,true,true))). % 0.10/0.40 cnf(i_0_32, plain, (X4=X4)). % 0.10/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.10/0.40 # Begin printing tableau % 0.10/0.40 # Found 8 steps % 0.10/0.40 cnf(i_0_26, negated_conjecture, (environment(sk3)=true), inference(start_rule)). % 0.10/0.40 cnf(i_0_49, plain, (environment(sk3)=true), inference(extension_rule, [i_0_48])). % 0.10/0.40 cnf(i_0_108, plain, (environment(sk3)!=true), inference(closure_rule, [i_0_26])). % 0.10/0.40 cnf(i_0_109, plain, (environment(sk3)!=true), inference(closure_rule, [i_0_26])). % 0.10/0.40 cnf(i_0_107, plain, (tuple(environment(sk3),environment(sk3),environment(sk3))=tuple(true,true,true)), inference(extension_rule, [i_0_36])). % 0.10/0.40 cnf(i_0_299, plain, (environment(sk3)!=true), inference(closure_rule, [i_0_26])). % 0.10/0.40 cnf(i_0_300, plain, (environment(sk3)!=true), inference(closure_rule, [i_0_26])). % 0.10/0.40 cnf(i_0_301, plain, (environment(sk3)!=true), inference(closure_rule, [i_0_26])). % 0.10/0.40 # End printing tableau % 0.10/0.40 # SZS output end % 0.10/0.40 # Branches closed with saturation will be marked with an "s" % 0.10/0.41 # Child (1827284) has found a proof. % 0.10/0.41 % 0.10/0.41 # Proof search is over... % 0.10/0.41 # Freeing feature tree %------------------------------------------------------------------------------