TSTP Solution File: MGT027-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT027-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:28 EDT 2022
% Result : Unsatisfiable 0.18s 0.38s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : MGT027-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 09:28:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.18/0.36 # No SInE strategy applied
% 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N
% 0.18/0.36 # and selection function SelectUnlessUniqMax.
% 0.18/0.36 #
% 0.18/0.36 # Presaturation interreduction done
% 0.18/0.36 # Number of axioms: 16 Number of unprocessed: 16
% 0.18/0.36 # Tableaux proof search.
% 0.18/0.36 # APR header successfully linked.
% 0.18/0.36 # Hello from C++
% 0.18/0.37 # The folding up rule is enabled...
% 0.18/0.37 # Local unification is enabled...
% 0.18/0.37 # Any saturation attempts will use folding labels...
% 0.18/0.37 # 16 beginning clauses after preprocessing and clausification
% 0.18/0.37 # Creating start rules for all 3 conjectures.
% 0.18/0.37 # There are 3 start rule candidates:
% 0.18/0.37 # Found 3 unit axioms.
% 0.18/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.37 # 3 start rule tableaux created.
% 0.18/0.37 # 13 extension rule candidate clauses
% 0.18/0.37 # 3 unit axiom clauses
% 0.18/0.37
% 0.18/0.37 # Requested 8, 32 cores available to the main process.
% 0.18/0.37 # There are not enough tableaux to fork, creating more from the initial 3
% 0.18/0.37 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.37 # We now have 13 tableaux to operate on
% 0.18/0.38 # Creating equality axioms
% 0.18/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.18/0.38 # There were 1 total branch saturation attempts.
% 0.18/0.38 # There were 0 of these attempts blocked.
% 0.18/0.38 # There were 0 deferred branch saturation attempts.
% 0.18/0.38 # There were 0 free duplicated saturations.
% 0.18/0.38 # There were 1 total successful branch saturations.
% 0.18/0.38 # There were 0 successful branch saturations in interreduction.
% 0.18/0.38 # There were 0 successful branch saturations on the branch.
% 0.18/0.38 # There were 1 successful branch saturations after the branch.
% 0.18/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.38 # Begin clausification derivation
% 0.18/0.38
% 0.18/0.38 # End clausification derivation
% 0.18/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.38 cnf(i_0_30, negated_conjecture, (environment(sk3))).
% 0.18/0.38 cnf(i_0_31, negated_conjecture, (stable(sk3))).
% 0.18/0.38 cnf(i_0_26, plain, (greater_or_equal(X1,X1))).
% 0.18/0.38 cnf(i_0_32, negated_conjecture, (~contracts_from(X1,first_movers)|~greater(X1,appear(efficient_producers,sk3)))).
% 0.18/0.38 cnf(i_0_25, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 0.18/0.38 cnf(i_0_24, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.18/0.38 cnf(i_0_23, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.18/0.38 cnf(i_0_22, plain, (in_environment(X1,appear(efficient_producers,X1))|~stable(X1)|~environment(X1))).
% 0.18/0.38 cnf(i_0_21, plain, (in_environment(X1,X2)|~greater(X2,X3)|~in_environment(X1,X3)|~stable(X1)|~environment(X1))).
% 0.18/0.38 cnf(i_0_28, hypothesis, (greater(sk2(X1),appear(efficient_producers,X1))|~stable(X1)|~environment(X1))).
% 0.18/0.38 cnf(i_0_27, hypothesis, (greater(cardinality_at_time(efficient_producers,X1),zero)|~greater_or_equal(X1,appear(efficient_producers,X2))|~in_environment(X2,X1)|~environment(X2))).
% 0.18/0.38 cnf(i_0_19, plain, (contracts_from(X1,first_movers)|~greater(zero,growth_rate(first_movers,sk1(X1,X2)))|~in_environment(X2,X1)|~stable(X2)|~environment(X2))).
% 0.18/0.38 cnf(i_0_29, hypothesis, (greater(zero,growth_rate(first_movers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~greater_or_equal(X1,sk2(X2))|~stable(X2)|~environment(X2))).
% 0.18/0.38 cnf(i_0_20, plain, (subpopulations(first_movers,efficient_producers,X1,X2)|~greater(cardinality_at_time(first_movers,X2),zero)|~greater(cardinality_at_time(efficient_producers,X2),zero)|~in_environment(X1,X2)|~environment(X1))).
% 0.18/0.38 cnf(i_0_18, plain, (greater_or_equal(sk1(X1,X2),X1)|contracts_from(X1,first_movers)|~in_environment(X2,X1)|~stable(X2)|~environment(X2))).
% 0.18/0.38 cnf(i_0_17, plain, (contracts_from(X1,first_movers)|greater(cardinality_at_time(first_movers,sk1(X1,X2)),zero)|~in_environment(X2,X1)|~stable(X2)|~environment(X2))).
% 0.18/0.38 cnf(i_0_238, plain, (X4=X4)).
% 0.18/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.38 # Begin printing tableau
% 0.18/0.38 # Found 6 steps
% 0.18/0.38 cnf(i_0_238, plain, (sk3=sk3), inference(start_rule)).
% 0.18/0.38 cnf(i_0_307, plain, (sk3=sk3), inference(extension_rule, [i_0_242])).
% 0.18/0.38 cnf(i_0_367, plain, (~environment(sk3)), inference(closure_rule, [i_0_30])).
% 0.18/0.38 cnf(i_0_365, plain, (environment(sk3)), inference(extension_rule, [i_0_22])).
% 0.18/0.38 cnf(i_0_377, plain, (~stable(sk3)), inference(closure_rule, [i_0_31])).
% 0.18/0.38 cnf(i_0_376, plain, (in_environment(sk3,appear(efficient_producers,sk3))), inference(etableau_closure_rule, [i_0_376, ...])).
% 0.18/0.38 # End printing tableau
% 0.18/0.38 # SZS output end
% 0.18/0.38 # Branches closed with saturation will be marked with an "s"
% 0.18/0.38 # Child (17819) has found a proof.
% 0.18/0.38
% 0.18/0.38 # Proof search is over...
% 0.18/0.38 # Freeing feature tree
%------------------------------------------------------------------------------