TSTP Solution File: MGT038-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT038-1 : TPTP v8.1.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 : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 22:10:35 EDT 2022
% Result : Satisfiable 0.12s 0.36s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : MGT038-1 : TPTP v8.1.0. Released v2.4.0.
% 0.09/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 10:36:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___110_C45_F1_PI_SE_CS_SP_PS_S4S
% 0.12/0.36 # and selection function SelectNewComplexAHPNS.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 12 Number of unprocessed: 12
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 12 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 3 conjectures.
% 0.12/0.36 # There are 3 start rule candidates:
% 0.12/0.36 # Found 3 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 3 start rule tableaux created.
% 0.12/0.36 # 9 extension rule candidate clauses
% 0.12/0.36 # 3 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 3
% 0.12/0.36 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 12 tableaux to operate on
% 0.12/0.36 # 13131 Satisfiable branch
% 0.12/0.36 # 13135 Satisfiable branch
% 0.12/0.36 # 13134 Satisfiable branch
% 0.12/0.36 # 13132 Satisfiable branch
% 0.12/0.36 # 13133 Satisfiable branch
% 0.12/0.36 # Satisfiable branch found.
% 0.12/0.36 # Satisfiable branch found.
% 0.12/0.36 # There were 1 total branch saturation attempts.
% 0.12/0.36 # There were 0 of these attempts blocked.
% 0.12/0.36 # There were 0 deferred branch saturation attempts.
% 0.12/0.36 # There were 0 free duplicated saturations.
% 0.12/0.36 # There were 0 total successful branch saturations.
% 0.12/0.36 # There were 0 successful branch saturations in interreduction.
% 0.12/0.36 # There were 0 successful branch saturations on the branch.
% 0.12/0.36 # There were 0 successful branch saturations after the branch.
% 0.12/0.36 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # Begin clausification derivation
% 0.12/0.36
% 0.12/0.36 # End clausification derivation
% 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.36 cnf(i_0_22, negated_conjecture, (environment(sk3))).
% 0.12/0.36 cnf(i_0_23, negated_conjecture, (stable(sk3))).
% 0.12/0.36 cnf(i_0_13, plain, (finite_set(first_movers))).
% 0.12/0.36 cnf(i_0_24, negated_conjecture, (cardinality_at_time(first_movers,to)!=zero|~greater(X1,appear(first_movers,sk3))|~in_environment(sk3,X1))).
% 0.12/0.36 cnf(i_0_14, plain, (in_environment(X1,appear(first_movers,X1))|~stable(X1)|~environment(X1))).
% 0.12/0.36 cnf(i_0_20, hypothesis, (contracts_from(sk2(X1),first_movers)|~stable(X1)|~environment(X1))).
% 0.12/0.36 cnf(i_0_18, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.12/0.36 cnf(i_0_21, hypothesis, (greater(appear(efficient_producers,e),appear(first_movers,X1))|~environment(X1))).
% 0.12/0.36 cnf(i_0_16, plain, (cardinality_at_time(s,t2)=zero|~contracts_from(X1,X2)|~finite_set(X2))).
% 0.12/0.36 cnf(i_0_19, hypothesis, (greater(sk2(X1),appear(efficient_producers,X1))|~stable(X1)|~environment(X1))).
% 0.12/0.36 cnf(i_0_15, plain, (greater(sk1(X1,X2),X1)|~contracts_from(X1,X2)|~finite_set(X2))).
% 0.12/0.36 cnf(i_0_17, plain, (in_environment(X1,X2)|~greater(X2,X3)|~in_environment(X1,X3)|~stable(X1)|~environment(X1))).
% 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.36 # Begin printing tableau
% 0.12/0.36 # Found 4 steps
% 0.12/0.36 cnf(i_0_23, negated_conjecture, (stable(sk3)), inference(start_rule)).
% 0.12/0.36 cnf(i_0_28, plain, (stable(sk3)), inference(extension_rule, [i_0_14])).
% 0.12/0.36 cnf(i_0_116, plain, (~environment(sk3)), inference(closure_rule, [i_0_22])).
% 0.12/0.36 cnf(i_0_114, plain, (in_environment(sk3,appear(first_movers,sk3))), inference(extension_rule, [i_0_24])).
% 0.12/0.36 # End printing tableau
% 0.12/0.36 # SZS output end
% 0.12/0.36 # Branches closed with saturation will be marked with an "s"
% 0.12/0.36 # Satisfiable branch found.
% 0.12/0.36 # There were 1 total branch saturation attempts.
% 0.12/0.36 # There were 0 of these attempts blocked.
% 0.12/0.36 # There were 0 deferred branch saturation attempts.
% 0.12/0.36 # There were 0 free duplicated saturations.
% 0.12/0.36 # There were 0 total successful branch saturations.
% 0.12/0.36 # There were 0 successful branch saturations in interreduction.
% 0.12/0.36 # There were 0 successful branch saturations on the branch.
% 0.12/0.36 # There were 0 successful branch saturations after the branch.
% 0.12/0.36 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # Begin clausification derivation
% 0.12/0.36
% 0.12/0.36 # End clausification derivation
% 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.36 cnf(i_0_22, negated_conjecture, (environment(sk3))).
% 0.12/0.36 cnf(i_0_23, negated_conjecture, (stable(sk3))).
% 0.12/0.36 cnf(i_0_13, plain, (finite_set(first_movers))).
% 0.12/0.36 cnf(i_0_24, negated_conjecture, (cardinality_at_time(first_movers,to)!=zero|~greater(X1,appear(first_movers,sk3))|~in_environment(sk3,X1))).
% 0.12/0.36 cnf(i_0_14, plain, (in_environment(X1,appear(first_movers,X1))|~stable(X1)|~environment(X1))).
% 0.12/0.36 cnf(i_0_20, hypothesis, (contracts_from(sk2(X1),first_movers)|~stable(X1)|~environment(X1))).
% 0.12/0.36 cnf(i_0_18, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.12/0.36 cnf(i_0_21, hypothesis, (greater(appear(efficient_producers,e),appear(first_movers,X1))|~environment(X1))).
% 0.12/0.36 cnf(i_0_16, plain, (cardinality_at_time(s,t2)=zero|~contracts_from(X1,X2)|~finite_set(X2))).
% 0.12/0.36 cnf(i_0_19, hypothesis, (greater(sk2(X1),appear(efficient_producers,X1))|~stable(X1)|~environment(X1))).
% 0.12/0.36 cnf(i_0_15, plain, (greater(sk1(X1,X2),X1)|~contracts_from(X1,X2)|~finite_set(X2))).
% 0.12/0.36 cnf(i_0_17, plain, (in_environment(X1,X2)|~greater(X2,X3)|~in_environment(X1,X3)|~stable(X1)|~environment(X1))).
% 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.36 # Begin printing tableau
% 0.12/0.36 # Found 5 steps
% 0.12/0.36 cnf(i_0_22, negated_conjecture, (environment(sk3)), inference(start_rule)).
% 0.12/0.36 cnf(i_0_29, plain, (environment(sk3)), inference(extension_rule, [i_0_20])).
% 0.12/0.36 cnf(i_0_146, plain, (~stable(sk3)), inference(closure_rule, [i_0_23])).
% 0.12/0.36 cnf(i_0_145, plain, (contracts_from(sk2(sk3),first_movers)), inference(extension_rule, [i_0_16])).
% 0.12/0.36 cnf(i_0_183, plain, (~finite_set(first_movers)), inference(closure_rule, [i_0_13])).
% 0.12/0.36 # End printing tableau
% 0.12/0.36 # SZS output end
% 0.12/0.36 # Branches closed with saturation will be marked with an "s"
% 0.12/0.36 # Satisfiable branch found.
% 0.12/0.36 # There were 1 total branch saturation attempts.
% 0.12/0.36 # There were 0 of these attempts blocked.
% 0.12/0.36 # There were 0 deferred branch saturation attempts.
% 0.12/0.36 # There were 0 free duplicated saturations.
% 0.12/0.36 # There were 0 total successful branch saturations.
% 0.12/0.36 # There were 0 successful branch saturations in interreduction.
% 0.12/0.36 # There were 0 successful branch saturations on the branch.
% 0.12/0.36 # There were 0 successful branch saturations after the branch.
% 0.12/0.36 # There were 1 total branch saturation attempts.
% 0.12/0.36 # There were 0 of these attempts blocked.
% 0.12/0.36 # There were 0 deferred branch saturation attempts.
% 0.12/0.36 # There were 0 free duplicated saturations.
% 0.12/0.36 # There were 0 total successful branch saturations.
% 0.12/0.36 # There were 0 successful branch saturations in interreduction.
% 0.12/0.36 # There were 0 successful branch saturations on the branch.
% 0.12/0.36 # There were 0 successful branch saturations after the branch.
% 0.12/0.36 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # Begin clausification derivation
% 0.12/0.36
% 0.12/0.36 # End clausification derivation
% 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.36 cnf(i_0_22, negated_conjecture, (environment(sk3))).
% 0.12/0.36 cnf(i_0_23, negated_conjecture, (stable(sk3))).
% 0.12/0.36 cnf(i_0_13, plain, (finite_set(first_movers))).
% 0.12/0.36 cnf(i_0_24, negated_conjecture, (cardinality_at_time(first_movers,to)!=zero|~greater(X1,appear(first_movers,sk3))|~in_environment(sk3,X1))).
% 0.12/0.36 cnf(i_0_14, plain, (in_environment(X1,appear(first_movers,X1))|~stable(X1)|~environment(X1))).
% 0.12/0.36 cnf(i_0_20, hypothesis, (contracts_from(sk2(X1),first_movers)|~stable(X1)|~environment(X1))).
% 0.12/0.36 cnf(i_0_18, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.12/0.36 cnf(i_0_21, hypothesis, (greater(appear(efficient_producers,e),appear(first_movers,X1))|~environment(X1))).
% 0.12/0.36 cnf(i_0_16, plain, (cardinality_at_time(s,t2)=zero|~contracts_from(X1,X2)|~finite_set(X2))).
% 0.12/0.36 cnf(i_0_19, hypothesis, (greater(sk2(X1),appear(efficient_producers,X1))|~stable(X1)|~environment(X1))).
% 0.12/0.36 cnf(i_0_15, plain, (greater(sk1(X1,X2),X1)|~contracts_from(X1,X2)|~finite_set(X2))).
% 0.12/0.36 cnf(i_0_17, plain, (in_environment(X1,X2)|~greater(X2,X3)|~in_environment(X1,X3)|~stable(X1)|~environment(X1))).
% 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.36 # Begin printing tableau
% 0.12/0.36 # Found 4 steps
% 0.12/0.36 cnf(i_0_22, negated_conjecture, (environment(sk3)), inference(start_rule)).
% 0.12/0.36 cnf(i_0_29, plain, (environment(sk3)), inference(extension_rule, [i_0_14])).
% 0.12/0.36 cnf(i_0_143, plain, (~stable(sk3)), inference(closure_rule, [i_0_23])).
% 0.12/0.36 cnf(i_0_142, plain, (in_environment(sk3,appear(first_movers,sk3))), inference(extension_rule, [i_0_24])).
% 0.12/0.36 # End printing tableau
% 0.12/0.36 # SZS output end
% 0.12/0.36 # Branches closed with saturation will be marked with an "s"
% 0.12/0.36 # Creating equality axioms
% 0.12/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.36 # 13136 Satisfiable branch
% 0.12/0.36 # Satisfiable branch found.
% 0.12/0.36 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # Begin clausification derivation
% 0.12/0.36
% 0.12/0.36 # End clausification derivation
% 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.36 cnf(i_0_22, negated_conjecture, (environment(sk3))).
% 0.12/0.36 cnf(i_0_23, negated_conjecture, (stable(sk3))).
% 0.12/0.36 cnf(i_0_13, plain, (finite_set(first_movers))).
% 0.12/0.36 cnf(i_0_24, negated_conjecture, (cardinality_at_time(first_movers,to)!=zero|~greater(X1,appear(first_movers,sk3))|~in_environment(sk3,X1))).
% 0.12/0.36 cnf(i_0_14, plain, (in_environment(X1,appear(first_movers,X1))|~stable(X1)|~environment(X1))).
% 0.12/0.36 cnf(i_0_20, hypothesis, (contracts_from(sk2(X1),first_movers)|~stable(X1)|~environment(X1))).
% 0.12/0.36 cnf(i_0_18, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.12/0.36 cnf(i_0_21, hypothesis, (greater(appear(efficient_producers,e),appear(first_movers,X1))|~environment(X1))).
% 0.12/0.36 cnf(i_0_16, plain, (cardinality_at_time(s,t2)=zero|~contracts_from(X1,X2)|~finite_set(X2))).
% 0.12/0.36 cnf(i_0_19, hypothesis, (greater(sk2(X1),appear(efficient_producers,X1))|~stable(X1)|~environment(X1))).
% 0.12/0.36 cnf(i_0_15, plain, (greater(sk1(X1,X2),X1)|~contracts_from(X1,X2)|~finite_set(X2))).
% 0.12/0.36 cnf(i_0_17, plain, (in_environment(X1,X2)|~greater(X2,X3)|~in_environment(X1,X3)|~stable(X1)|~environment(X1))).
% 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.36 # Begin printing tableau
% 0.12/0.36 # Found 9 steps
% 0.12/0.36 cnf(i_0_22, negated_conjecture, (environment(sk3)), inference(start_rule)).
% 0.12/0.36 cnf(i_0_29, plain, (environment(sk3)), inference(extension_rule, [i_0_19])).
% 0.12/0.36 cnf(i_0_157, plain, (~stable(sk3)), inference(closure_rule, [i_0_23])).
% 0.12/0.36 cnf(i_0_156, plain, (greater(sk2(sk3),appear(efficient_producers,sk3))), inference(extension_rule, [i_0_18])).
% 0.12/0.36 cnf(i_0_176, plain, (greater(sk1(sk2(sk3),first_movers),appear(efficient_producers,sk3))), inference(extension_rule, [i_0_17])).
% 0.12/0.36 cnf(i_0_199, plain, (~stable(sk3)), inference(closure_rule, [i_0_23])).
% 0.12/0.36 cnf(i_0_200, plain, (~environment(sk3)), inference(closure_rule, [i_0_22])).
% 0.12/0.36 cnf(i_0_178, plain, (~greater(sk1(sk2(sk3),first_movers),sk2(sk3))), inference(extension_rule, [i_0_15])).
% 0.12/0.36 cnf(i_0_217, plain, (~finite_set(first_movers)), inference(closure_rule, [i_0_13])).
% 0.12/0.36 # End printing tableau
% 0.12/0.36 # SZS output end
% 0.12/0.36 # Branches closed with saturation will be marked with an "s"
% 0.12/0.36 # There were 1 total branch saturation attempts.
% 0.12/0.36 # There were 0 of these attempts blocked.
% 0.12/0.36 # There were 0 deferred branch saturation attempts.
% 0.12/0.36 # There were 0 free duplicated saturations.
% 0.12/0.36 # There were 0 total successful branch saturations.
% 0.12/0.36 # There were 0 successful branch saturations in interreduction.
% 0.12/0.36 # There were 0 successful branch saturations on the branch.
% 0.12/0.36 # There were 0 successful branch saturations after the branch.
% 0.12/0.36 # Child (13131) has found a proof.
% 0.12/0.36
% 0.12/0.36 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # Begin clausification derivation
% 0.12/0.36
% 0.12/0.36 # End clausification derivation
% 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.36 cnf(i_0_22, negated_conjecture, (environment(sk3))).
% 0.12/0.36 cnf(i_0_23, negated_conjecture, (stable(sk3))).
% 0.12/0.36 cnf(i_0_13, plain, (finite_set(first_movers))).
% 0.12/0.36 cnf(i_0_24, negated_conjecture, (cardinality_at_time(first_movers,to)!=zero|~greater(X1,appear(first_movers,sk3))|~in_environment(sk3,X1))).
% 0.12/0.36 cnf(i_0_14, plain, (in_environment(X1,appear(first_movers,X1))|~stable(X1)|~environment(X1))).
% 0.12/0.36 cnf(i_0_20, hypothesis, (contracts_from(sk2(X1),first_movers)|~stable(X1)|~environment(X1))).
% 0.12/0.36 cnf(i_0_18, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.12/0.36 cnf(i_0_21, hypothesis, (greater(appear(efficient_producers,e),appear(first_movers,X1))|~environment(X1))).
% 0.12/0.36 cnf(i_0_16, plain, (cardinality_at_time(s,t2)=zero|~contracts_from(X1,X2)|~finite_set(X2))).
% 0.12/0.36 cnf(i_0_19, hypothesis, (greater(sk2(X1),appear(efficient_producers,X1))|~stable(X1)|~environment(X1))).
% 0.12/0.36 cnf(i_0_15, plain, (greater(sk1(X1,X2),X1)|~contracts_from(X1,X2)|~finite_set(X2))).
% 0.12/0.36 cnf(i_0_17, plain, (in_environment(X1,X2)|~greater(X2,X3)|~in_environment(X1,X3)|~stable(X1)|~environment(X1))).
% 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.36 # Begin printing tableau
% 0.12/0.36 # Found 7 steps
% 0.12/0.36 cnf(i_0_22, negated_conjecture, (environment(sk3)), inference(start_rule)).
% 0.12/0.36 cnf(i_0_29, plain, (environment(sk3)), inference(extension_rule, [i_0_21])).
% 0.12/0.36 cnf(i_0_151, plain, (greater(appear(efficient_producers,e),appear(first_movers,sk3))), inference(extension_rule, [i_0_18])).
% 0.12/0.36 cnf(i_0_176, plain, (greater(sk2(e),appear(first_movers,sk3))), inference(extension_rule, [i_0_17])).
% 0.12/0.36 cnf(i_0_199, plain, (~stable(sk3)), inference(closure_rule, [i_0_23])).
% 0.12/0.36 cnf(i_0_200, plain, (~environment(sk3)), inference(closure_rule, [i_0_22])).
% 0.12/0.36 cnf(i_0_178, plain, (~greater(sk2(e),appear(efficient_producers,e))), inference(extension_rule, [i_0_19])).
% 0.12/0.36 # End printing tableau
% 0.12/0.36 # SZS output end
% 0.12/0.36 # Branches closed with saturation will be marked with an "s"
% 0.12/0.36 # Proof search is over...
% 0.12/0.36 # Freeing feature tree
%------------------------------------------------------------------------------