TSTP Solution File: MGT011+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT011+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 : n017.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:22 EDT 2022
% Result : Theorem 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 : MGT011+1 : TPTP v8.1.0. Released v2.0.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 : n017.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:21:04 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: 14 Number of unprocessed: 14
% 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 # 14 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 7 conjectures.
% 0.13/0.37 # There are 7 start rule candidates:
% 0.13/0.37 # Found 8 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 7 start rule tableaux created.
% 0.13/0.37 # 6 extension rule candidate clauses
% 0.13/0.37 # 8 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 7
% 0.13/0.37 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 13 tableaux to operate on
% 0.13/0.38 # Creating equality axioms
% 0.13/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.38 # Creating equality axioms
% 0.13/0.38 # Ran out of tableaux, making start rules for all clauses
% 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 1 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 1 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox/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_14, negated_conjecture, (organization(esk3_0,esk6_0))).
% 0.13/0.38 cnf(i_0_13, negated_conjecture, (organization(esk3_0,esk7_0))).
% 0.13/0.38 cnf(i_0_8, negated_conjecture, (greater(esk4_0,esk5_0))).
% 0.13/0.38 cnf(i_0_9, negated_conjecture, (greater(esk7_0,esk6_0))).
% 0.13/0.38 cnf(i_0_12, negated_conjecture, (reorganization_free(esk3_0,esk6_0,esk7_0))).
% 0.13/0.38 cnf(i_0_11, negated_conjecture, (size(esk3_0,esk4_0,esk6_0))).
% 0.13/0.38 cnf(i_0_10, negated_conjecture, (size(esk3_0,esk5_0,esk7_0))).
% 0.13/0.38 cnf(i_0_2, plain, (~greater(X1,X1))).
% 0.13/0.38 cnf(i_0_3, plain, (~greater(X1,X2)|~greater(X2,X1))).
% 0.13/0.38 cnf(i_0_1, plain, (inertia(X1,esk1_2(X1,X2),X2)|~organization(X1,X2))).
% 0.13/0.38 cnf(i_0_4, plain, (class(X1,esk2_2(X1,X2),X2)|~organization(X1,X2))).
% 0.13/0.38 cnf(i_0_5, plain, (X1=X2|~reorganization_free(X3,X4,X5)|~class(X3,X2,X5)|~class(X3,X1,X4)|~organization(X3,X5)|~organization(X3,X4))).
% 0.13/0.38 cnf(i_0_7, hypothesis, (greater(X1,X2)|~reorganization_free(X3,X4,X5)|~greater(X5,X4)|~inertia(X3,X1,X5)|~inertia(X3,X2,X4)|~organization(X3,X5)|~organization(X3,X4))).
% 0.13/0.38 cnf(i_0_6, hypothesis, (greater(X1,X2)|~size(X3,X4,X5)|~size(X6,X7,X8)|~class(X3,X9,X5)|~class(X6,X9,X8)|~greater(X4,X7)|~inertia(X3,X1,X5)|~inertia(X6,X2,X8)|~organization(X3,X5)|~organization(X6,X8))).
% 0.13/0.38 cnf(i_0_197, plain, (X48=X48)).
% 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 6 steps
% 0.13/0.38 cnf(i_0_197, plain, (esk3_0=esk3_0), inference(start_rule)).
% 0.13/0.38 cnf(i_0_244, plain, (esk3_0=esk3_0), inference(extension_rule, [i_0_201])).
% 0.13/0.38 cnf(i_0_283, plain, ($false), inference(closure_rule, [i_0_197])).
% 0.13/0.38 cnf(i_0_284, plain, (~organization(esk3_0,esk6_0)), inference(closure_rule, [i_0_14])).
% 0.13/0.38 cnf(i_0_281, plain, (organization(esk3_0,esk6_0)), inference(extension_rule, [i_0_1])).
% 0.13/0.38 cnf(i_0_287, plain, (inertia(esk3_0,esk1_2(esk3_0,esk6_0),esk6_0)), inference(etableau_closure_rule, [i_0_287, ...])).
% 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 # Creating equality axioms
% 0.13/0.38 # Ran out of tableaux, making start rules for all clauses
% 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 1 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 1 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox/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_14, negated_conjecture, (organization(esk3_0,esk6_0))).
% 0.13/0.38 cnf(i_0_13, negated_conjecture, (organization(esk3_0,esk7_0))).
% 0.13/0.38 cnf(i_0_8, negated_conjecture, (greater(esk4_0,esk5_0))).
% 0.13/0.38 cnf(i_0_9, negated_conjecture, (greater(esk7_0,esk6_0))).
% 0.13/0.38 cnf(i_0_12, negated_conjecture, (reorganization_free(esk3_0,esk6_0,esk7_0))).
% 0.13/0.38 cnf(i_0_11, negated_conjecture, (size(esk3_0,esk4_0,esk6_0))).
% 0.13/0.38 cnf(i_0_10, negated_conjecture, (size(esk3_0,esk5_0,esk7_0))).
% 0.13/0.38 cnf(i_0_2, plain, (~greater(X1,X1))).
% 0.13/0.38 cnf(i_0_3, plain, (~greater(X1,X2)|~greater(X2,X1))).
% 0.13/0.38 cnf(i_0_1, plain, (inertia(X1,esk1_2(X1,X2),X2)|~organization(X1,X2))).
% 0.13/0.38 cnf(i_0_4, plain, (class(X1,esk2_2(X1,X2),X2)|~organization(X1,X2))).
% 0.13/0.38 cnf(i_0_5, plain, (X1=X2|~reorganization_free(X3,X4,X5)|~class(X3,X2,X5)|~class(X3,X1,X4)|~organization(X3,X5)|~organization(X3,X4))).
% 0.13/0.38 cnf(i_0_7, hypothesis, (greater(X1,X2)|~reorganization_free(X3,X4,X5)|~greater(X5,X4)|~inertia(X3,X1,X5)|~inertia(X3,X2,X4)|~organization(X3,X5)|~organization(X3,X4))).
% 0.13/0.38 cnf(i_0_6, hypothesis, (greater(X1,X2)|~size(X3,X4,X5)|~size(X6,X7,X8)|~class(X3,X9,X5)|~class(X6,X9,X8)|~greater(X4,X7)|~inertia(X3,X1,X5)|~inertia(X6,X2,X8)|~organization(X3,X5)|~organization(X6,X8))).
% 0.13/0.38 cnf(i_0_197, plain, (X48=X48)).
% 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 6 steps
% 0.13/0.38 cnf(i_0_197, plain, (esk3_0=esk3_0), inference(start_rule)).
% 0.13/0.38 cnf(i_0_244, plain, (esk3_0=esk3_0), inference(extension_rule, [i_0_201])).
% 0.13/0.38 cnf(i_0_283, plain, ($false), inference(closure_rule, [i_0_197])).
% 0.13/0.38 cnf(i_0_284, plain, (~organization(esk3_0,esk6_0)), inference(closure_rule, [i_0_14])).
% 0.13/0.38 cnf(i_0_281, plain, (organization(esk3_0,esk6_0)), inference(extension_rule, [i_0_1])).
% 0.13/0.38 cnf(i_0_287, plain, (inertia(esk3_0,esk1_2(esk3_0,esk6_0),esk6_0)), inference(etableau_closure_rule, [i_0_287, ...])).
% 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 # 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 1 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 1 successful branch saturations after the branch.
% 0.13/0.38 # Creating equality axioms
% 0.13/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.38 # Creating equality axioms
% 0.13/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox/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_14, negated_conjecture, (organization(esk3_0,esk6_0))).
% 0.13/0.38 cnf(i_0_13, negated_conjecture, (organization(esk3_0,esk7_0))).
% 0.13/0.38 cnf(i_0_8, negated_conjecture, (greater(esk4_0,esk5_0))).
% 0.13/0.38 cnf(i_0_9, negated_conjecture, (greater(esk7_0,esk6_0))).
% 0.13/0.38 cnf(i_0_12, negated_conjecture, (reorganization_free(esk3_0,esk6_0,esk7_0))).
% 0.13/0.38 cnf(i_0_11, negated_conjecture, (size(esk3_0,esk4_0,esk6_0))).
% 0.13/0.38 cnf(i_0_10, negated_conjecture, (size(esk3_0,esk5_0,esk7_0))).
% 0.13/0.38 cnf(i_0_2, plain, (~greater(X1,X1))).
% 0.13/0.38 cnf(i_0_3, plain, (~greater(X1,X2)|~greater(X2,X1))).
% 0.13/0.38 cnf(i_0_1, plain, (inertia(X1,esk1_2(X1,X2),X2)|~organization(X1,X2))).
% 0.13/0.38 cnf(i_0_4, plain, (class(X1,esk2_2(X1,X2),X2)|~organization(X1,X2))).
% 0.13/0.38 cnf(i_0_5, plain, (X1=X2|~reorganization_free(X3,X4,X5)|~class(X3,X2,X5)|~class(X3,X1,X4)|~organization(X3,X5)|~organization(X3,X4))).
% 0.13/0.38 cnf(i_0_7, hypothesis, (greater(X1,X2)|~reorganization_free(X3,X4,X5)|~greater(X5,X4)|~inertia(X3,X1,X5)|~inertia(X3,X2,X4)|~organization(X3,X5)|~organization(X3,X4))).
% 0.13/0.38 cnf(i_0_6, hypothesis, (greater(X1,X2)|~size(X3,X4,X5)|~size(X6,X7,X8)|~class(X3,X9,X5)|~class(X6,X9,X8)|~greater(X4,X7)|~inertia(X3,X1,X5)|~inertia(X6,X2,X8)|~organization(X3,X5)|~organization(X6,X8))).
% 0.13/0.38 cnf(i_0_168, plain, (X48=X48)).
% 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 6 steps
% 0.13/0.38 cnf(i_0_168, plain, (esk3_0=esk3_0), inference(start_rule)).
% 0.13/0.38 cnf(i_0_215, plain, (esk3_0=esk3_0), inference(extension_rule, [i_0_172])).
% 0.13/0.38 cnf(i_0_254, plain, ($false), inference(closure_rule, [i_0_168])).
% 0.13/0.38 cnf(i_0_255, plain, (~organization(esk3_0,esk6_0)), inference(closure_rule, [i_0_14])).
% 0.13/0.38 cnf(i_0_252, plain, (organization(esk3_0,esk6_0)), inference(extension_rule, [i_0_1])).
% 0.13/0.38 cnf(i_0_258, plain, (inertia(esk3_0,esk1_2(esk3_0,esk6_0),esk6_0)), inference(etableau_closure_rule, [i_0_258, ...])).
% 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 (21944) has found a proof.
% 0.13/0.38
% 0.13/0.38 # Proof search is over...
% 0.13/0.38 # Freeing feature tree
%------------------------------------------------------------------------------