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.0.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 : n029.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 : CounterSatisfiable 0.12s 0.36s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT031+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/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 : n029.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 11:29:07 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___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 15 Number of unprocessed: 15
% 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 # 15 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 4 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 # 11 extension rule candidate clauses
% 0.12/0.36 # 4 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 11 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 11 tableaux to operate on
% 0.12/0.36 # 465 Satisfiable branch
% 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 CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.36 # SZS output start for /export/starexec/sandbox2/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_15, negated_conjecture, (environment(esk2_0))).
% 0.12/0.36 cnf(i_0_14, negated_conjecture, (in_environment(esk2_0,appear(an_organisation,esk2_0)))).
% 0.12/0.36 cnf(i_0_8, plain, (greater_or_equal(X1,X1))).
% 0.12/0.36 cnf(i_0_13, negated_conjecture, (appear(an_organisation,esk2_0)!=appear(first_movers,esk2_0))).
% 0.12/0.36 cnf(i_0_9, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 0.12/0.36 cnf(i_0_6, plain, (greater_or_equal(appear(first_movers,X1),appear(an_organisation,X1))|~environment(X1))).
% 0.12/0.36 cnf(i_0_10, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.12/0.36 cnf(i_0_7, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.12/0.36 cnf(i_0_4, plain, (~in_environment(X1,X2)|~greater(cardinality_at_time(efficient_producers,X2),zero)|~greater(appear(efficient_producers,X1),X2)|~environment(X1))).
% 0.12/0.36 cnf(i_0_5, plain, (~in_environment(X1,X2)|~greater(cardinality_at_time(first_movers,X2),zero)|~greater(appear(first_movers,X1),X2)|~environment(X1))).
% 0.12/0.36 cnf(i_0_12, hypothesis, (greater(appear(efficient_producers,e),appear(first_movers,X1))|~environment(X1))).
% 0.12/0.36 cnf(i_0_1, plain, (greater(number_of_organizations(e,appear(an_organisation,X1)),zero)|~environment(X1))).
% 0.12/0.36 cnf(i_0_11, hypothesis, (X1=first_movers|X1=efficient_producers|~subpopulation(X1,X2,X3)|~greater(cardinality_at_time(X1,X3),zero)|~environment(X2))).
% 0.12/0.36 cnf(i_0_3, plain, (subpopulation(esk1_2(X1,X2),X1,X2)|~greater(number_of_organizations(X1,X2),zero)|~environment(X1))).
% 0.12/0.36 cnf(i_0_2, plain, (greater(cardinality_at_time(esk1_2(X1,X2),X2),zero)|~greater(number_of_organizations(X1,X2),zero)|~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_14, negated_conjecture, (in_environment(esk2_0,appear(an_organisation,esk2_0))), inference(start_rule)).
% 0.12/0.36 cnf(i_0_18, plain, (in_environment(esk2_0,appear(an_organisation,esk2_0))), inference(extension_rule, [i_0_4])).
% 0.12/0.36 cnf(i_0_66, plain, (~environment(esk2_0)), inference(closure_rule, [i_0_15])).
% 0.12/0.36 cnf(i_0_64, plain, (~greater(cardinality_at_time(efficient_producers,appear(an_organisation,esk2_0)),zero)), inference(extension_rule, [i_0_10])).
% 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.37 # Child (465) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------