TSTP Solution File: MGT031-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT031-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 : n021.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:30 EDT 2022
% Result : Satisfiable 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT031-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 9 07:34:08 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 15 Number of unprocessed: 15
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 15 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 3 conjectures.
% 0.13/0.38 # There are 3 start rule candidates:
% 0.13/0.38 # Found 4 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 3 start rule tableaux created.
% 0.13/0.38 # 11 extension rule candidate clauses
% 0.13/0.38 # 4 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 3
% 0.13/0.38 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 11 tableaux to operate on
% 0.13/0.38 # 23570 Satisfiable branch
% 0.13/0.38 # 23571 Satisfiable branch
% 0.13/0.38 # 23573 Satisfiable branch
% 0.13/0.38 # 23575 Satisfiable branch
% 0.13/0.38 # Satisfiable branch found.
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 0 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 0 successful branch saturations after the branch.
% 0.13/0.38 # 23577 Satisfiable branch
% 0.13/0.38 # Satisfiable branch found.
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 0 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 0 successful branch saturations after the branch.
% 0.13/0.38 # Satisfiable branch found.
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 0 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 0 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_28, negated_conjecture, (environment(sk2))).
% 0.13/0.38 cnf(i_0_29, negated_conjecture, (in_environment(sk2,appear(an_organisation,sk2)))).
% 0.13/0.38 cnf(i_0_25, plain, (greater_or_equal(X1,X1))).
% 0.13/0.38 cnf(i_0_30, negated_conjecture, (appear(an_organisation,sk2)!=appear(first_movers,sk2))).
% 0.13/0.38 cnf(i_0_24, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 0.13/0.38 cnf(i_0_21, plain, (greater_or_equal(appear(first_movers,X1),appear(an_organisation,X1))|~environment(X1))).
% 0.13/0.38 cnf(i_0_23, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.13/0.38 cnf(i_0_22, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.13/0.38 cnf(i_0_19, plain, (~in_environment(X1,X2)|~greater(cardinality_at_time(efficient_producers,X2),zero)|~greater(appear(efficient_producers,X1),X2)|~environment(X1))).
% 0.13/0.38 cnf(i_0_20, plain, (~in_environment(X1,X2)|~greater(cardinality_at_time(first_movers,X2),zero)|~greater(appear(first_movers,X1),X2)|~environment(X1))).
% 0.13/0.38 cnf(i_0_27, hypothesis, (greater(appear(efficient_producers,e),appear(first_movers,X1))|~environment(X1))).
% 0.13/0.38 cnf(i_0_16, plain, (greater(number_of_organizations(e,appear(an_organisation,X1)),zero)|~environment(X1))).
% 0.13/0.38 cnf(i_0_26, hypothesis, (X1=first_movers|X1=efficient_producers|~subpopulation(X1,X2,X3)|~greater(cardinality_at_time(X1,X3),zero)|~environment(X2))).
% 0.13/0.38 cnf(i_0_17, plain, (subpopulation(sk1(X1,X2),X2,X1)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))).
% 0.13/0.38 cnf(i_0_18, plain, (greater(cardinality_at_time(sk1(X1,X2),X1),zero)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 3 steps
% 0.13/0.38 cnf(i_0_28, negated_conjecture, (environment(sk2)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_34, plain, (environment(sk2)), inference(extension_rule, [i_0_16])).
% 0.13/0.38 cnf(i_0_121, plain, (greater(number_of_organizations(e,appear(an_organisation,sk2)),zero)), inference(extension_rule, [i_0_24])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_28, negated_conjecture, (environment(sk2))).
% 0.13/0.38 cnf(i_0_29, negated_conjecture, (in_environment(sk2,appear(an_organisation,sk2)))).
% 0.13/0.38 cnf(i_0_25, plain, (greater_or_equal(X1,X1))).
% 0.13/0.38 cnf(i_0_30, negated_conjecture, (appear(an_organisation,sk2)!=appear(first_movers,sk2))).
% 0.13/0.38 cnf(i_0_24, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 0.13/0.38 cnf(i_0_21, plain, (greater_or_equal(appear(first_movers,X1),appear(an_organisation,X1))|~environment(X1))).
% 0.13/0.38 cnf(i_0_23, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.13/0.38 cnf(i_0_22, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.13/0.38 cnf(i_0_19, plain, (~in_environment(X1,X2)|~greater(cardinality_at_time(efficient_producers,X2),zero)|~greater(appear(efficient_producers,X1),X2)|~environment(X1))).
% 0.13/0.38 cnf(i_0_20, plain, (~in_environment(X1,X2)|~greater(cardinality_at_time(first_movers,X2),zero)|~greater(appear(first_movers,X1),X2)|~environment(X1))).
% 0.13/0.38 cnf(i_0_27, hypothesis, (greater(appear(efficient_producers,e),appear(first_movers,X1))|~environment(X1))).
% 0.13/0.38 cnf(i_0_16, plain, (greater(number_of_organizations(e,appear(an_organisation,X1)),zero)|~environment(X1))).
% 0.13/0.38 cnf(i_0_26, hypothesis, (X1=first_movers|X1=efficient_producers|~subpopulation(X1,X2,X3)|~greater(cardinality_at_time(X1,X3),zero)|~environment(X2))).
% 0.13/0.38 cnf(i_0_17, plain, (subpopulation(sk1(X1,X2),X2,X1)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))).
% 0.13/0.38 cnf(i_0_18, plain, (greater(cardinality_at_time(sk1(X1,X2),X1),zero)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 3 steps
% 0.13/0.38 cnf(i_0_30, negated_conjecture, (appear(an_organisation,sk2)!=appear(first_movers,sk2)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_32, plain, (appear(an_organisation,sk2)!=appear(first_movers,sk2)), inference(extension_rule, [i_0_23])).
% 0.13/0.38 cnf(i_0_40, plain, (greater(appear(an_organisation,sk2),appear(first_movers,sk2))), inference(extension_rule, [i_0_22])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # Satisfiable branch found.
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 0 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 0 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_28, negated_conjecture, (environment(sk2))).
% 0.13/0.38 cnf(i_0_29, negated_conjecture, (in_environment(sk2,appear(an_organisation,sk2)))).
% 0.13/0.38 cnf(i_0_25, plain, (greater_or_equal(X1,X1))).
% 0.13/0.38 cnf(i_0_30, negated_conjecture, (appear(an_organisation,sk2)!=appear(first_movers,sk2))).
% 0.13/0.38 cnf(i_0_24, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 0.13/0.38 cnf(i_0_21, plain, (greater_or_equal(appear(first_movers,X1),appear(an_organisation,X1))|~environment(X1))).
% 0.13/0.38 cnf(i_0_23, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.13/0.38 cnf(i_0_22, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.13/0.38 cnf(i_0_19, plain, (~in_environment(X1,X2)|~greater(cardinality_at_time(efficient_producers,X2),zero)|~greater(appear(efficient_producers,X1),X2)|~environment(X1))).
% 0.13/0.38 cnf(i_0_20, plain, (~in_environment(X1,X2)|~greater(cardinality_at_time(first_movers,X2),zero)|~greater(appear(first_movers,X1),X2)|~environment(X1))).
% 0.13/0.38 cnf(i_0_27, hypothesis, (greater(appear(efficient_producers,e),appear(first_movers,X1))|~environment(X1))).
% 0.13/0.38 cnf(i_0_16, plain, (greater(number_of_organizations(e,appear(an_organisation,X1)),zero)|~environment(X1))).
% 0.13/0.38 cnf(i_0_26, hypothesis, (X1=first_movers|X1=efficient_producers|~subpopulation(X1,X2,X3)|~greater(cardinality_at_time(X1,X3),zero)|~environment(X2))).
% 0.13/0.38 cnf(i_0_17, plain, (subpopulation(sk1(X1,X2),X2,X1)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))).
% 0.13/0.38 cnf(i_0_18, plain, (greater(cardinality_at_time(sk1(X1,X2),X1),zero)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 3 steps
% 0.13/0.38 cnf(i_0_28, negated_conjecture, (environment(sk2)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_34, plain, (environment(sk2)), inference(extension_rule, [i_0_27])).
% 0.13/0.38 cnf(i_0_119, plain, (greater(appear(efficient_producers,e),appear(first_movers,sk2))), inference(extension_rule, [i_0_24])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # Satisfiable branch found.
% 0.13/0.38 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_28, negated_conjecture, (environment(sk2))).
% 0.13/0.38 cnf(i_0_29, negated_conjecture, (in_environment(sk2,appear(an_organisation,sk2)))).
% 0.13/0.38 cnf(i_0_25, plain, (greater_or_equal(X1,X1))).
% 0.13/0.38 cnf(i_0_30, negated_conjecture, (appear(an_organisation,sk2)!=appear(first_movers,sk2))).
% 0.13/0.38 cnf(i_0_24, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 0.13/0.38 cnf(i_0_21, plain, (greater_or_equal(appear(first_movers,X1),appear(an_organisation,X1))|~environment(X1))).
% 0.13/0.38 cnf(i_0_23, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.13/0.38 cnf(i_0_22, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.13/0.38 cnf(i_0_19, plain, (~in_environment(X1,X2)|~greater(cardinality_at_time(efficient_producers,X2),zero)|~greater(appear(efficient_producers,X1),X2)|~environment(X1))).
% 0.13/0.38 cnf(i_0_20, plain, (~in_environment(X1,X2)|~greater(cardinality_at_time(first_movers,X2),zero)|~greater(appear(first_movers,X1),X2)|~environment(X1))).
% 0.13/0.38 cnf(i_0_27, hypothesis, (greater(appear(efficient_producers,e),appear(first_movers,X1))|~environment(X1))).
% 0.13/0.38 cnf(i_0_16, plain, (greater(number_of_organizations(e,appear(an_organisation,X1)),zero)|~environment(X1))).
% 0.13/0.38 cnf(i_0_26, hypothesis, (X1=first_movers|X1=efficient_producers|~subpopulation(X1,X2,X3)|~greater(cardinality_at_time(X1,X3),zero)|~environment(X2))).
% 0.13/0.38 cnf(i_0_17, plain, (subpopulation(sk1(X1,X2),X2,X1)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))).
% 0.13/0.38 cnf(i_0_18, plain, (greater(cardinality_at_time(sk1(X1,X2),X1),zero)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 4 steps
% 0.13/0.38 cnf(i_0_29, negated_conjecture, (in_environment(sk2,appear(an_organisation,sk2))), inference(start_rule)).
% 0.13/0.38 cnf(i_0_33, plain, (in_environment(sk2,appear(an_organisation,sk2))), inference(extension_rule, [i_0_19])).
% 0.13/0.38 cnf(i_0_81, plain, (~environment(sk2)), inference(closure_rule, [i_0_28])).
% 0.13/0.38 cnf(i_0_79, plain, (~greater(cardinality_at_time(efficient_producers,appear(an_organisation,sk2)),zero)), inference(extension_rule, [i_0_23])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # Child (23573) has found a proof.
% 0.13/0.38
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 0 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 0 successful branch saturations after the branch.
% 0.13/0.38 # Proof search is over...
% 0.13/0.38 # Freeing feature tree
%------------------------------------------------------------------------------