TSTP Solution File: MGT014+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT014+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:23 EDT 2022
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT014+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/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 : n028.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:26:32 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: 17 Number of unprocessed: 17
% 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 # 17 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 9 conjectures.
% 0.12/0.36 # There are 9 start rule candidates:
% 0.12/0.36 # Found 10 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 9 start rule tableaux created.
% 0.12/0.36 # 7 extension rule candidate clauses
% 0.12/0.36 # 10 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_9, negated_conjecture, (greater(esk2_0,esk3_0))).
% 0.12/0.37 cnf(i_0_10, negated_conjecture, (greater(esk5_0,esk4_0))).
% 0.12/0.37 cnf(i_0_17, negated_conjecture, (organization(esk1_0,esk6_0))).
% 0.12/0.37 cnf(i_0_16, negated_conjecture, (organization(esk1_0,esk7_0))).
% 0.12/0.37 cnf(i_0_15, negated_conjecture, (reorganization_free(esk1_0,esk6_0,esk7_0))).
% 0.12/0.37 cnf(i_0_12, negated_conjecture, (size(esk1_0,esk4_0,esk6_0))).
% 0.12/0.37 cnf(i_0_11, negated_conjecture, (size(esk1_0,esk5_0,esk7_0))).
% 0.12/0.37 cnf(i_0_14, negated_conjecture, (complexity(esk1_0,esk2_0,esk6_0))).
% 0.12/0.37 cnf(i_0_13, negated_conjecture, (complexity(esk1_0,esk3_0,esk7_0))).
% 0.12/0.37 cnf(i_0_1, plain, (~greater(X1,X1))).
% 0.12/0.37 cnf(i_0_2, plain, (~greater(X1,X2)|~greater(X2,X1))).
% 0.12/0.37 cnf(i_0_3, plain, (time(X1)|~organization(X2,X1))).
% 0.12/0.37 cnf(i_0_5, plain, (reorganization_free(X1,X2,X3)|~reorganization_free(X1,X3,X2))).
% 0.12/0.37 cnf(i_0_4, plain, (X1=X2|greater(X1,X2)|greater(X2,X1)|~time(X2)|~time(X1))).
% 0.12/0.37 cnf(i_0_6, plain, (X1=X2|~size(X3,X2,X4)|~size(X3,X1,X4)|~organization(X3,X4))).
% 0.12/0.37 cnf(i_0_7, hypothesis, (~size(X1,X2,X3)|~size(X1,X4,X5)|~reorganization_free(X1,X5,X3)|~organization(X1,X3)|~organization(X1,X5)|~greater(X4,X2)|~greater(X3,X5))).
% 0.12/0.37 cnf(i_0_8, hypothesis, (~complexity(X1,X2,X3)|~complexity(X1,X4,X5)|~reorganization_free(X1,X5,X3)|~organization(X1,X3)|~organization(X1,X5)|~greater(X4,X2)|~greater(X3,X5))).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 9 steps
% 0.12/0.37 cnf(i_0_15, negated_conjecture, (reorganization_free(esk1_0,esk6_0,esk7_0)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_24, plain, (reorganization_free(esk1_0,esk6_0,esk7_0)), inference(extension_rule, [i_0_5])).
% 0.12/0.37 cnf(i_0_33, plain, (reorganization_free(esk1_0,esk7_0,esk6_0)), inference(extension_rule, [i_0_7])).
% 0.12/0.37 cnf(i_0_48, plain, (~size(esk1_0,esk4_0,esk6_0)), inference(closure_rule, [i_0_12])).
% 0.12/0.37 cnf(i_0_49, plain, (~size(esk1_0,esk5_0,esk7_0)), inference(closure_rule, [i_0_11])).
% 0.12/0.37 cnf(i_0_51, plain, (~organization(esk1_0,esk6_0)), inference(closure_rule, [i_0_17])).
% 0.12/0.37 cnf(i_0_52, plain, (~organization(esk1_0,esk7_0)), inference(closure_rule, [i_0_16])).
% 0.12/0.37 cnf(i_0_53, plain, (~greater(esk5_0,esk4_0)), inference(closure_rule, [i_0_10])).
% 0.12/0.37 cnf(i_0_54, plain, (~greater(esk6_0,esk7_0)), inference(etableau_closure_rule, [i_0_54, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_9, negated_conjecture, (greater(esk2_0,esk3_0))).
% 0.12/0.37 cnf(i_0_10, negated_conjecture, (greater(esk5_0,esk4_0))).
% 0.12/0.37 cnf(i_0_17, negated_conjecture, (organization(esk1_0,esk6_0))).
% 0.12/0.37 cnf(i_0_16, negated_conjecture, (organization(esk1_0,esk7_0))).
% 0.12/0.37 cnf(i_0_15, negated_conjecture, (reorganization_free(esk1_0,esk6_0,esk7_0))).
% 0.12/0.37 cnf(i_0_12, negated_conjecture, (size(esk1_0,esk4_0,esk6_0))).
% 0.12/0.37 cnf(i_0_11, negated_conjecture, (size(esk1_0,esk5_0,esk7_0))).
% 0.12/0.37 cnf(i_0_14, negated_conjecture, (complexity(esk1_0,esk2_0,esk6_0))).
% 0.12/0.37 cnf(i_0_13, negated_conjecture, (complexity(esk1_0,esk3_0,esk7_0))).
% 0.12/0.37 cnf(i_0_1, plain, (~greater(X1,X1))).
% 0.12/0.37 cnf(i_0_2, plain, (~greater(X1,X2)|~greater(X2,X1))).
% 0.12/0.37 cnf(i_0_3, plain, (time(X1)|~organization(X2,X1))).
% 0.12/0.37 cnf(i_0_5, plain, (reorganization_free(X1,X2,X3)|~reorganization_free(X1,X3,X2))).
% 0.12/0.37 cnf(i_0_4, plain, (X1=X2|greater(X1,X2)|greater(X2,X1)|~time(X2)|~time(X1))).
% 0.12/0.37 cnf(i_0_6, plain, (X1=X2|~size(X3,X2,X4)|~size(X3,X1,X4)|~organization(X3,X4))).
% 0.12/0.37 cnf(i_0_7, hypothesis, (~size(X1,X2,X3)|~size(X1,X4,X5)|~reorganization_free(X1,X5,X3)|~organization(X1,X3)|~organization(X1,X5)|~greater(X4,X2)|~greater(X3,X5))).
% 0.12/0.37 cnf(i_0_8, hypothesis, (~complexity(X1,X2,X3)|~complexity(X1,X4,X5)|~reorganization_free(X1,X5,X3)|~organization(X1,X3)|~organization(X1,X5)|~greater(X4,X2)|~greater(X3,X5))).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 7 steps
% 0.12/0.37 cnf(i_0_16, negated_conjecture, (organization(esk1_0,esk7_0)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_25, plain, (organization(esk1_0,esk7_0)), inference(extension_rule, [i_0_3])).
% 0.12/0.37 cnf(i_0_31, plain, (time(esk7_0)), inference(extension_rule, [i_0_4])).
% 0.12/0.37 cnf(i_0_38, plain, (greater(esk7_0,esk7_0)), inference(closure_rule, [i_0_1])).
% 0.12/0.37 cnf(i_0_39, plain, (greater(esk7_0,esk7_0)), inference(closure_rule, [i_0_1])).
% 0.12/0.37 cnf(i_0_41, plain, (~time(esk7_0)), inference(closure_rule, [i_0_31])).
% 0.12/0.37 cnf(i_0_37, plain, (esk7_0=esk7_0), inference(etableau_closure_rule, [i_0_37, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_9, negated_conjecture, (greater(esk2_0,esk3_0))).
% 0.12/0.37 cnf(i_0_10, negated_conjecture, (greater(esk5_0,esk4_0))).
% 0.12/0.37 cnf(i_0_17, negated_conjecture, (organization(esk1_0,esk6_0))).
% 0.12/0.37 cnf(i_0_16, negated_conjecture, (organization(esk1_0,esk7_0))).
% 0.12/0.37 cnf(i_0_15, negated_conjecture, (reorganization_free(esk1_0,esk6_0,esk7_0))).
% 0.12/0.37 cnf(i_0_12, negated_conjecture, (size(esk1_0,esk4_0,esk6_0))).
% 0.12/0.37 cnf(i_0_11, negated_conjecture, (size(esk1_0,esk5_0,esk7_0))).
% 0.12/0.37 cnf(i_0_14, negated_conjecture, (complexity(esk1_0,esk2_0,esk6_0))).
% 0.12/0.37 cnf(i_0_13, negated_conjecture, (complexity(esk1_0,esk3_0,esk7_0))).
% 0.12/0.37 cnf(i_0_1, plain, (~greater(X1,X1))).
% 0.12/0.37 cnf(i_0_2, plain, (~greater(X1,X2)|~greater(X2,X1))).
% 0.12/0.37 cnf(i_0_3, plain, (time(X1)|~organization(X2,X1))).
% 0.12/0.37 cnf(i_0_5, plain, (reorganization_free(X1,X2,X3)|~reorganization_free(X1,X3,X2))).
% 0.12/0.37 cnf(i_0_4, plain, (X1=X2|greater(X1,X2)|greater(X2,X1)|~time(X2)|~time(X1))).
% 0.12/0.37 cnf(i_0_6, plain, (X1=X2|~size(X3,X2,X4)|~size(X3,X1,X4)|~organization(X3,X4))).
% 0.12/0.37 cnf(i_0_7, hypothesis, (~size(X1,X2,X3)|~size(X1,X4,X5)|~reorganization_free(X1,X5,X3)|~organization(X1,X3)|~organization(X1,X5)|~greater(X4,X2)|~greater(X3,X5))).
% 0.12/0.37 cnf(i_0_8, hypothesis, (~complexity(X1,X2,X3)|~complexity(X1,X4,X5)|~reorganization_free(X1,X5,X3)|~organization(X1,X3)|~organization(X1,X5)|~greater(X4,X2)|~greater(X3,X5))).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 7 steps
% 0.12/0.37 cnf(i_0_17, negated_conjecture, (organization(esk1_0,esk6_0)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_26, plain, (organization(esk1_0,esk6_0)), inference(extension_rule, [i_0_3])).
% 0.12/0.37 cnf(i_0_31, plain, (time(esk6_0)), inference(extension_rule, [i_0_4])).
% 0.12/0.37 cnf(i_0_38, plain, (greater(esk6_0,esk6_0)), inference(closure_rule, [i_0_1])).
% 0.12/0.37 cnf(i_0_39, plain, (greater(esk6_0,esk6_0)), inference(closure_rule, [i_0_1])).
% 0.12/0.37 cnf(i_0_41, plain, (~time(esk6_0)), inference(closure_rule, [i_0_31])).
% 0.12/0.37 cnf(i_0_37, plain, (esk6_0=esk6_0), inference(etableau_closure_rule, [i_0_37, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Child (6251) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------