TSTP Solution File: MGT001+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT001+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 : n028.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:19 EDT 2022
% Result : Theorem 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : MGT001+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.13/0.33 % Computer : n028.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:19:17 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.36 # No SInE strategy applied
% 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.36 #
% 0.13/0.36 # Presaturation interreduction done
% 0.13/0.36 # Number of axioms: 19 Number of unprocessed: 19
% 0.13/0.36 # Tableaux proof search.
% 0.13/0.36 # APR header successfully linked.
% 0.13/0.36 # Hello from C++
% 0.13/0.36 # The folding up rule is enabled...
% 0.13/0.36 # Local unification is enabled...
% 0.13/0.36 # Any saturation attempts will use folding labels...
% 0.13/0.36 # 19 beginning clauses after preprocessing and clausification
% 0.13/0.36 # Creating start rules for all 10 conjectures.
% 0.13/0.36 # There are 10 start rule candidates:
% 0.13/0.36 # Found 10 unit axioms.
% 0.13/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.36 # 10 start rule tableaux created.
% 0.13/0.36 # 9 extension rule candidate clauses
% 0.13/0.36 # 10 unit axiom clauses
% 0.13/0.36
% 0.13/0.36 # Requested 8, 32 cores available to the main process.
% 0.13/0.39 # There were 4 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 4 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 4 successful branch saturations after the branch.
% 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # Begin clausification derivation
% 0.13/0.39
% 0.13/0.39 # End clausification derivation
% 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.39 cnf(i_0_19, negated_conjecture, (organization(esk4_0,esk6_0))).
% 0.13/0.39 cnf(i_0_18, negated_conjecture, (organization(esk5_0,esk7_0))).
% 0.13/0.39 cnf(i_0_11, negated_conjecture, (greater(esk9_0,esk8_0))).
% 0.13/0.39 cnf(i_0_13, negated_conjecture, (survival_chance(esk4_0,esk10_0,esk6_0))).
% 0.13/0.39 cnf(i_0_12, negated_conjecture, (survival_chance(esk5_0,esk11_0,esk7_0))).
% 0.13/0.39 cnf(i_0_17, negated_conjecture, (reorganization_free(esk4_0,esk6_0,esk6_0))).
% 0.13/0.39 cnf(i_0_16, negated_conjecture, (reorganization_free(esk5_0,esk7_0,esk7_0))).
% 0.13/0.39 cnf(i_0_15, negated_conjecture, (inertia(esk4_0,esk8_0,esk6_0))).
% 0.13/0.39 cnf(i_0_14, negated_conjecture, (inertia(esk5_0,esk9_0,esk7_0))).
% 0.13/0.39 cnf(i_0_10, negated_conjecture, (~greater(esk11_0,esk10_0))).
% 0.13/0.39 cnf(i_0_1, plain, (reliability(X1,esk1_2(X1,X2),X2)|~organization(X1,X2))).
% 0.13/0.39 cnf(i_0_2, plain, (accountability(X1,esk2_2(X1,X2),X2)|~organization(X1,X2))).
% 0.13/0.39 cnf(i_0_3, plain, (reproducibility(X1,esk3_2(X1,X2),X2)|~organization(X1,X2))).
% 0.13/0.39 cnf(i_0_8, hypothesis, (greater(X1,X2)|~inertia(X3,X4,X5)|~inertia(X6,X7,X8)|~reorganization_free(X3,X5,X5)|~reorganization_free(X6,X8,X8)|~greater(X4,X7)|~reproducibility(X3,X1,X5)|~reproducibility(X6,X2,X8)|~organization(X3,X5)|~organization(X6,X8))).
% 0.13/0.39 cnf(i_0_9, hypothesis, (greater(X1,X2)|~inertia(X3,X1,X4)|~inertia(X5,X2,X6)|~reorganization_free(X3,X4,X4)|~reorganization_free(X5,X6,X6)|~greater(X7,X8)|~reproducibility(X3,X7,X4)|~reproducibility(X5,X8,X6)|~organization(X3,X4)|~organization(X5,X6))).
% 0.13/0.39 cnf(i_0_6, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~reproducibility(X5,X3,X6)|~reproducibility(X7,X4,X8)|~accountability(X5,X1,X6)|~accountability(X7,X2,X8)|~reliability(X5,X9,X6)|~reliability(X7,X10,X8)|~organization(X5,X6)|~organization(X7,X8))).
% 0.13/0.39 cnf(i_0_7, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~reproducibility(X5,X3,X6)|~reproducibility(X7,X4,X8)|~accountability(X5,X9,X6)|~accountability(X7,X10,X8)|~reliability(X5,X1,X6)|~reliability(X7,X2,X8)|~organization(X5,X6)|~organization(X7,X8))).
% 0.13/0.39 cnf(i_0_4, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~greater(X5,X6)|~survival_chance(X7,X1,X8)|~survival_chance(X9,X2,X10)|~accountability(X7,X3,X8)|~accountability(X9,X4,X10)|~reliability(X7,X5,X8)|~reliability(X9,X6,X10)|~organization(X7,X8)|~organization(X9,X10))).
% 0.13/0.39 cnf(i_0_5, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~greater(X5,X6)|~reproducibility(X7,X1,X8)|~reproducibility(X9,X2,X10)|~accountability(X7,X3,X8)|~accountability(X9,X4,X10)|~reliability(X7,X5,X8)|~reliability(X9,X6,X10)|~organization(X7,X8)|~organization(X9,X10))).
% 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.39 # Begin printing tableau
% 0.13/0.39 # Found 20 steps
% 0.13/0.39 cnf(i_0_15, negated_conjecture, (inertia(esk4_0,esk8_0,esk6_0)), inference(start_rule)).
% 0.13/0.39 cnf(i_0_22, plain, (inertia(esk4_0,esk8_0,esk6_0)), inference(extension_rule, [i_0_8])).
% 0.13/0.39 cnf(i_0_36, plain, (greater(esk11_0,esk10_0)), inference(closure_rule, [i_0_10])).
% 0.13/0.39 cnf(i_0_38, plain, (~inertia(esk5_0,esk9_0,esk7_0)), inference(closure_rule, [i_0_14])).
% 0.13/0.39 cnf(i_0_39, plain, (~reorganization_free(esk4_0,esk6_0,esk6_0)), inference(closure_rule, [i_0_17])).
% 0.13/0.39 cnf(i_0_40, plain, (~reorganization_free(esk5_0,esk7_0,esk7_0)), inference(closure_rule, [i_0_16])).
% 0.13/0.39 cnf(i_0_44, plain, (~organization(esk4_0,esk6_0)), inference(closure_rule, [i_0_19])).
% 0.13/0.39 cnf(i_0_45, plain, (~organization(esk5_0,esk7_0)), inference(closure_rule, [i_0_18])).
% 0.13/0.39 cnf(i_0_41, plain, (~greater(esk8_0,esk9_0)), inference(extension_rule, [i_0_9])).
% 0.13/0.39 cnf(i_0_53, plain, (~inertia(esk4_0,esk8_0,esk6_0)), inference(closure_rule, [i_0_15])).
% 0.13/0.39 cnf(i_0_54, plain, (~inertia(esk5_0,esk9_0,esk7_0)), inference(closure_rule, [i_0_14])).
% 0.13/0.39 cnf(i_0_55, plain, (~reorganization_free(esk4_0,esk6_0,esk6_0)), inference(closure_rule, [i_0_17])).
% 0.13/0.39 cnf(i_0_56, plain, (~reorganization_free(esk5_0,esk7_0,esk7_0)), inference(closure_rule, [i_0_16])).
% 0.13/0.39 # There were 4 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 4 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 4 successful branch saturations after the branch.
% 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # Begin clausification derivation
% 0.13/0.39
% 0.13/0.39 # End clausification derivation
% 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.39 cnf(i_0_19, negated_conjecture, (organization(esk4_0,esk6_0))).
% 0.13/0.39 cnf(i_0_18, negated_conjecture, (organization(esk5_0,esk7_0))).
% 0.13/0.39 cnf(i_0_11, negated_conjecture, (greater(esk9_0,esk8_0))).
% 0.13/0.39 cnf(i_0_13, negated_conjecture, (survival_chance(esk4_0,esk10_0,esk6_0))).
% 0.13/0.39 cnf(i_0_12, negated_conjecture, (survival_chance(esk5_0,esk11_0,esk7_0))).
% 0.13/0.39 cnf(i_0_17, negated_conjecture, (reorganization_free(esk4_0,esk6_0,esk6_0))).
% 0.13/0.39 cnf(i_0_16, negated_conjecture, (reorganization_free(esk5_0,esk7_0,esk7_0))).
% 0.13/0.39 cnf(i_0_15, negated_conjecture, (inertia(esk4_0,esk8_0,esk6_0))).
% 0.13/0.39 cnf(i_0_14, negated_conjecture, (inertia(esk5_0,esk9_0,esk7_0))).
% 0.13/0.39 cnf(i_0_10, negated_conjecture, (~greater(esk11_0,esk10_0))).
% 0.13/0.39 cnf(i_0_1, plain, (reliability(X1,esk1_2(X1,X2),X2)|~organization(X1,X2))).
% 0.13/0.39 cnf(i_0_2, plain, (accountability(X1,esk2_2(X1,X2),X2)|~organization(X1,X2))).
% 0.13/0.39 cnf(i_0_3, plain, (reproducibility(X1,esk3_2(X1,X2),X2)|~organization(X1,X2))).
% 0.13/0.39 cnf(i_0_8, hypothesis, (greater(X1,X2)|~inertia(X3,X4,X5)|~inertia(X6,X7,X8)|~reorganization_free(X3,X5,X5)|~reorganization_free(X6,X8,X8)|~greater(X4,X7)|~reproducibility(X3,X1,X5)|~reproducibility(X6,X2,X8)|~organization(X3,X5)|~organization(X6,X8))).
% 0.13/0.39 cnf(i_0_9, hypothesis, (greater(X1,X2)|~inertia(X3,X1,X4)|~inertia(X5,X2,X6)|~reorganization_free(X3,X4,X4)|~reorganization_free(X5,X6,X6)|~greater(X7,X8)|~reproducibility(X3,X7,X4)|~reproducibility(X5,X8,X6)|~organization(X3,X4)|~organization(X5,X6))).
% 0.13/0.39 cnf(i_0_6, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~reproducibility(X5,X3,X6)|~reproducibility(X7,X4,X8)|~accountability(X5,X1,X6)|~accountability(X7,X2,X8)|~reliability(X5,X9,X6)|~reliability(X7,X10,X8)|~organization(X5,X6)|~organization(X7,X8))).
% 0.13/0.39 cnf(i_0_7, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~reproducibility(X5,X3,X6)|~reproducibility(X7,X4,X8)|~accountability(X5,X9,X6)|~accountability(X7,X10,X8)|~reliability(X5,X1,X6)|~reliability(X7,X2,X8)|~organization(X5,X6)|~organization(X7,X8))).
% 0.13/0.39 cnf(i_0_4, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~greater(X5,X6)|~survival_chance(X7,X1,X8)|~survival_chance(X9,X2,X10)|~accountability(X7,X3,X8)|~accountability(X9,X4,X10)|~reliability(X7,X5,X8)|~reliability(X9,X6,X10)|~organization(X7,X8)|~organization(X9,X10))).
% 0.13/0.39 cnf(i_0_5, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~greater(X5,X6)|~reproducibility(X7,X1,X8)|~reproducibility(X9,X2,X10)|~accountability(X7,X3,X8)|~accountability(X9,X4,X10)|~reliability(X7,X5,X8)|~reliability(X9,X6,X10)|~organization(X7,X8)|~organization(X9,X10))).
% 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.39 # Begin printing tableau
% 0.13/0.39 # Found 20 steps
% 0.13/0.39 cnf(i_0_16, negated_conjecture, (reorganization_free(esk5_0,esk7_0,esk7_0)), inference(start_rule)).
% 0.13/0.39 cnf(i_0_23, plain, (reorganization_free(esk5_0,esk7_0,esk7_0)), inference(extension_rule, [i_0_8])).
% 0.13/0.39 cnf(i_0_36, plain, (greater(esk11_0,esk10_0)), inference(closure_rule, [i_0_10])).
% 0.13/0.39 cnf(i_0_37, plain, (~inertia(esk5_0,esk9_0,esk7_0)), inference(closure_rule, [i_0_14])).
% 0.13/0.39 cnf(i_0_38, plain, (~inertia(esk5_0,esk9_0,esk7_0)), inference(closure_rule, [i_0_14])).
% 0.13/0.39 cnf(i_0_40, plain, (~reorganization_free(esk5_0,esk7_0,esk7_0)), inference(closure_rule, [i_0_16])).
% 0.13/0.39 cnf(i_0_44, plain, (~organization(esk5_0,esk7_0)), inference(closure_rule, [i_0_18])).
% 0.13/0.39 cnf(i_0_45, plain, (~organization(esk5_0,esk7_0)), inference(closure_rule, [i_0_18])).
% 0.13/0.39 cnf(i_0_41, plain, (~greater(esk9_0,esk9_0)), inference(extension_rule, [i_0_9])).
% 0.13/0.39 cnf(i_0_53, plain, (~inertia(esk5_0,esk9_0,esk7_0)), inference(closure_rule, [i_0_14])).
% 0.13/0.39 cnf(i_0_54, plain, (~inertia(esk5_0,esk9_0,esk7_0)), inference(closure_rule, [i_0_14])).
% 0.13/0.39 cnf(i_0_55, plain, (~reorganization_free(esk5_0,esk7_0,esk7_0)), inference(closure_rule, [i_0_16])).
% 0.13/0.39 cnf(i_0_56, plain, (~reorganization_free(esk5_0,esk7_0,esk7_0)), inference(closure_rule, [i_0_16])).
% 0.13/0.39 cnf(i_0_57, plain, (~greater(esk9_0,esk8_0)), inference(closure_rule, [i_0_11])).
% 0.13/0.39 cnf(i_0_60, plain, (~organization(esk5_0,esk7_0)), inference(closure_rule, [i_0_18])).
% 0.13/0.39 cnf(i_0_61, plain, (~organization(esk5_0,esk7_0)), inference(closure_rule, [i_0_18])).
% 0.13/0.39 cnf(i_0_42, plain, (~reproducibility(esk5_0,esk11_0,esk7_0)), inference(etableau_closure_rule, [i_0_42, ...])).
% 0.13/0.39 cnf(i_0_43, plain, (~reproducibility(esk5_0,esk10_0,esk7_0)), inference(etableau_closure_rule, [i_0_43, ...])).
% 0.13/0.39 cnf(i_0_58, plain, (~reproducibility(esk5_0,esk9_0,esk7_0)), inference(etableau_closure_rule, [i_0_58, ...])).
% 0.13/0.39 cnf(i_0_59, plain, (~reproducibility(esk5_0,esk8_0,esk7_0)), inference(etableau_closure_rule, [i_0_59, ...])).
% 0.13/0.39 # End printing tableau
% 0.13/0.39 # SZS output end
% 0.13/0.39 # Branches closed with saturation will be marked with an "s"
% 0.13/0.39 cnf(i_0_57, plain, (~greater(esk9_0,esk8_0)), inference(closure_rule, [i_0_11])).
% 0.13/0.39 cnf(i_0_60, plain, (~organization(esk4_0,esk6_0)), inference(closure_rule, [i_0_19])).
% 0.13/0.39 cnf(i_0_61, plain, (~organization(esk5_0,esk7_0)), inference(closure_rule, [i_0_18])).
% 0.13/0.39 cnf(i_0_42, plain, (~reproducibility(esk4_0,esk11_0,esk6_0)), inference(etableau_closure_rule, [i_0_42, ...])).
% 0.13/0.39 cnf(i_0_43, plain, (~reproducibility(esk5_0,esk10_0,esk7_0)), inference(etableau_closure_rule, [i_0_43, ...])).
% 0.13/0.39 cnf(i_0_58, plain, (~reproducibility(esk4_0,esk9_0,esk6_0)), inference(etableau_closure_rule, [i_0_58, ...])).
% 0.13/0.39 cnf(i_0_59, plain, (~reproducibility(esk5_0,esk8_0,esk7_0)), inference(etableau_closure_rule, [i_0_59, ...])).
% 0.13/0.39 # End printing tableau
% 0.13/0.39 # SZS output end
% 0.13/0.39 # Branches closed with saturation will be marked with an "s"
% 0.13/0.39 # Child (8709) has found a proof.
% 0.13/0.39
% 0.13/0.39 # Proof search is over...
% 0.13/0.39 # Freeing feature tree
%------------------------------------------------------------------------------