TSTP Solution File: MGT060-1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : MGT060-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 : n024.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:43 EDT 2022

% Result   : Unsatisfiable 226.19s 29.00s
% Output   : CNFRefutation 226.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : MGT060-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.34  % Computer : n024.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Thu Jun  9 09:28:19 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.37  # No SInE strategy applied
% 0.13/0.37  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37  #
% 0.13/0.37  # Presaturation interreduction done
% 0.13/0.37  # Number of axioms: 25 Number of unprocessed: 25
% 0.13/0.37  # Tableaux proof search.
% 0.13/0.37  # APR header successfully linked.
% 0.13/0.37  # Hello from C++
% 0.13/0.37  # The folding up rule is enabled...
% 0.13/0.37  # Local unification is enabled...
% 0.13/0.37  # Any saturation attempts will use folding labels...
% 0.13/0.37  # 25 beginning clauses after preprocessing and clausification
% 0.13/0.37  # Creating start rules for all 4 conjectures.
% 0.13/0.37  # There are 4 start rule candidates:
% 0.13/0.37  # Found 11 unit axioms.
% 0.13/0.37  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37  # 4 start rule tableaux created.
% 0.13/0.37  # 14 extension rule candidate clauses
% 0.13/0.37  # 11 unit axiom clauses
% 0.13/0.37  
% 0.13/0.37  # Requested 8, 32 cores available to the main process.
% 0.13/0.37  # There are not enough tableaux to fork, creating more from the initial 4
% 0.13/0.37  # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37  # We now have 10 tableaux to operate on
% 2.72/0.72  # Creating equality axioms
% 2.72/0.72  # Ran out of tableaux, making start rules for all clauses
% 2.72/0.74  # Creating equality axioms
% 2.72/0.74  # Ran out of tableaux, making start rules for all clauses
% 2.72/0.75  # Creating equality axioms
% 2.72/0.75  # Ran out of tableaux, making start rules for all clauses
% 2.72/0.75  # Creating equality axioms
% 2.72/0.75  # Ran out of tableaux, making start rules for all clauses
% 2.72/0.76  # Creating equality axioms
% 2.72/0.76  # Ran out of tableaux, making start rules for all clauses
% 3.24/0.78  # Creating equality axioms
% 3.24/0.78  # Ran out of tableaux, making start rules for all clauses
% 37.88/5.20  # Creating equality axioms
% 37.88/5.20  # Ran out of tableaux, making start rules for all clauses
% 95.94/12.66  # Creating equality axioms
% 95.94/12.66  # Ran out of tableaux, making start rules for all clauses
% 226.19/29.00  # There were 22 total branch saturation attempts.
% 226.19/29.00  # There were 1 of these attempts blocked.
% 226.19/29.00  # There were 0 deferred branch saturation attempts.
% 226.19/29.00  # There were 2 free duplicated saturations.
% 226.19/29.00  # There were 9 total successful branch saturations.
% 226.19/29.00  # There were 2 successful branch saturations in interreduction.
% 226.19/29.00  # There were 0 successful branch saturations on the branch.
% 226.19/29.00  # There were 5 successful branch saturations after the branch.
% 226.19/29.00  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 226.19/29.00  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 226.19/29.00  # Begin clausification derivation
% 226.19/29.00  
% 226.19/29.00  # End clausification derivation
% 226.19/29.00  # Begin listing active clauses obtained from FOF to CNF conversion
% 226.19/29.00  cnf(i_0_47, negated_conjecture, (organization(sk1))).
% 226.19/29.00  cnf(i_0_48, negated_conjecture, (has_immunity(sk1,sk2))).
% 226.19/29.00  cnf(i_0_44, plain, (greater(low,very_low))).
% 226.19/29.00  cnf(i_0_43, plain, (greater(mod1,low))).
% 226.19/29.00  cnf(i_0_46, plain, (greater(mod2,low))).
% 226.19/29.00  cnf(i_0_28, plain, (smaller_or_equal(X1,X1))).
% 226.19/29.00  cnf(i_0_42, plain, (greater(high,mod1))).
% 226.19/29.00  cnf(i_0_45, plain, (greater(high,mod2))).
% 226.19/29.00  cnf(i_0_31, plain, (greater_or_equal(X1,X1))).
% 226.19/29.00  cnf(i_0_49, negated_conjecture, (~has_immunity(sk1,sk3))).
% 226.19/29.00  cnf(i_0_50, negated_conjecture, (~greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)))).
% 226.19/29.00  cnf(i_0_34, plain, (~greater(X1,X2)|~greater(X2,X1))).
% 226.19/29.00  cnf(i_0_32, plain, (greater(X1,X2)|~smaller(X2,X1))).
% 226.19/29.00  cnf(i_0_33, plain, (smaller(X1,X2)|~greater(X2,X1))).
% 226.19/29.00  cnf(i_0_36, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))).
% 226.19/29.00  cnf(i_0_30, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 226.19/29.00  cnf(i_0_27, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))).
% 226.19/29.00  cnf(i_0_26, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))).
% 226.19/29.00  cnf(i_0_29, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 226.19/29.00  cnf(i_0_35, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 226.19/29.00  cnf(i_0_37, plain, (hazard_of_mortality(X1,X2)=very_low|~has_immunity(X1,X2)|~organization(X1))).
% 226.19/29.00  cnf(i_0_38, plain, (hazard_of_mortality(X1,X2)=low|has_immunity(X1,X2)|~positional_advantage(X1,X2)|~is_aligned(X1,X2)|~organization(X1))).
% 226.19/29.00  cnf(i_0_39, plain, (hazard_of_mortality(X1,X2)=mod1|is_aligned(X1,X2)|has_immunity(X1,X2)|~positional_advantage(X1,X2)|~organization(X1))).
% 226.19/29.00  cnf(i_0_40, plain, (hazard_of_mortality(X1,X2)=mod2|positional_advantage(X1,X2)|has_immunity(X1,X2)|~is_aligned(X1,X2)|~organization(X1))).
% 226.19/29.00  cnf(i_0_41, plain, (hazard_of_mortality(X1,X2)=high|positional_advantage(X1,X2)|is_aligned(X1,X2)|has_immunity(X1,X2)|~organization(X1))).
% 226.19/29.00  cnf(i_0_1047491, plain, (X4=X4)).
% 226.19/29.00  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 226.19/29.00  # Begin printing tableau
% 226.19/29.00  # Found 16 steps
% 226.19/29.00  cnf(i_0_41, plain, (hazard_of_mortality(sk1,sk3)=high|positional_advantage(sk1,sk3)|is_aligned(sk1,sk3)|has_immunity(sk1,sk3)|~organization(sk1)), inference(start_rule)).
% 226.19/29.00  cnf(i_0_1047558, plain, (has_immunity(sk1,sk3)), inference(closure_rule, [i_0_49])).
% 226.19/29.00  cnf(i_0_1047559, plain, (~organization(sk1)), inference(closure_rule, [i_0_47])).
% 226.19/29.00  cnf(i_0_1047555, plain, (hazard_of_mortality(sk1,sk3)=high), inference(extension_rule, [i_0_1047494])).
% 226.19/29.00  cnf(i_0_2482403, plain, (hazard_of_mortality(sk1,sk3)=hazard_of_mortality(sk1,sk3)), inference(extension_rule, [i_0_1047492])).
% 226.19/29.00  cnf(i_0_1047556, plain, (positional_advantage(sk1,sk3)), inference(etableau_closure_rule, [i_0_1047556, ...])).
% 226.19/29.00  cnf(i_0_1047557, plain, (is_aligned(sk1,sk3)), inference(etableau_closure_rule, [i_0_1047557, ...])).
% 226.19/29.00  cnf(i_0_2482432, plain, (hazard_of_mortality(sk1,sk3)=hazard_of_mortality(sk1,sk3)), inference(extension_rule, [i_0_1047497])).
% 226.19/29.00  cnf(i_0_2482526, plain, ($false), inference(closure_rule, [i_0_1047491])).
% 226.19/29.00  cnf(i_0_2482527, plain, (~greater_or_equal(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk3))), inference(closure_rule, [i_0_31])).
% 226.19/29.00  cnf(i_0_2482405, plain, (high!=hazard_of_mortality(sk1,sk3)), inference(extension_rule, [i_0_41])).
% 226.19/29.00  cnf(i_0_2482549, plain, (has_immunity(sk1,sk3)), inference(closure_rule, [i_0_49])).
% 226.19/29.00  cnf(i_0_2482550, plain, (~organization(sk1)), inference(closure_rule, [i_0_47])).
% 226.19/29.00  cnf(i_0_2482524, plain, (greater_or_equal(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk3))), inference(etableau_closure_rule, [i_0_2482524, ...])).
% 226.19/29.00  cnf(i_0_2482547, plain, (positional_advantage(sk1,sk3)), inference(etableau_closure_rule, [i_0_2482547, ...])).
% 226.19/29.00  cnf(i_0_2482548, plain, (is_aligned(sk1,sk3)), inference(etableau_closure_rule, [i_0_2482548, ...])).
% 226.19/29.00  # End printing tableau
% 226.19/29.00  # SZS output end
% 226.19/29.00  # Branches closed with saturation will be marked with an "s"
% 226.19/29.01  # Child (11684) has found a proof.
% 226.19/29.01  
% 226.19/29.01  # Proof search is over...
% 226.19/29.01  # Freeing feature tree
%------------------------------------------------------------------------------