TSTP Solution File: MGT013-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT013-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 : n020.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 : Unsatisfiable 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.11 % Problem : MGT013-1 : TPTP v8.1.0. Released v2.4.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 : n020.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 09:37:06 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.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 1 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 1 successful branch saturations after the branch.
% 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 1 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 1 successful branch saturations after the branch.
% 0.12/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # SZS output start for /export/starexec/sandbox/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_33, negated_conjecture, (greater(sk3,sk2))).
% 0.12/0.36 cnf(i_0_34, negated_conjecture, (greater(sk4,sk5))).
% 0.12/0.36 cnf(i_0_26, negated_conjecture, (organization(sk1,sk6))).
% 0.12/0.36 cnf(i_0_27, negated_conjecture, (organization(sk1,sk7))).
% 0.12/0.36 cnf(i_0_28, negated_conjecture, (reorganization_free(sk1,sk6,sk7))).
% 0.12/0.36 cnf(i_0_29, negated_conjecture, (complexity(sk1,sk2,sk6))).
% 0.12/0.36 cnf(i_0_30, negated_conjecture, (complexity(sk1,sk3,sk7))).
% 0.12/0.36 cnf(i_0_31, negated_conjecture, (size(sk1,sk4,sk6))).
% 0.12/0.36 cnf(i_0_32, negated_conjecture, (size(sk1,sk5,sk7))).
% 0.12/0.36 cnf(i_0_18, plain, (~greater(X1,X1))).
% 0.12/0.36 cnf(i_0_19, plain, (~greater(X1,X2)|~greater(X2,X1))).
% 0.12/0.36 cnf(i_0_20, plain, (time(X1)|~organization(X2,X1))).
% 0.12/0.36 cnf(i_0_22, plain, (reorganization_free(X1,X2,X3)|~reorganization_free(X1,X3,X2))).
% 0.12/0.36 cnf(i_0_21, plain, (X1=X2|greater(X1,X2)|greater(X2,X1)|~time(X2)|~time(X1))).
% 0.12/0.36 cnf(i_0_23, plain, (X1=X2|~complexity(X3,X2,X4)|~complexity(X3,X1,X4)|~organization(X3,X4))).
% 0.12/0.36 cnf(i_0_25, 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.36 cnf(i_0_24, 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.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 7 steps
% 0.12/0.36 cnf(i_0_27, negated_conjecture, (organization(sk1,sk7)), inference(start_rule)).
% 0.12/0.36 cnf(i_0_42, plain, (organization(sk1,sk7)), inference(extension_rule, [i_0_20])).
% 0.12/0.36 cnf(i_0_48, plain, (time(sk7)), inference(extension_rule, [i_0_21])).
% 0.12/0.36 cnf(i_0_55, plain, (greater(sk7,sk7)), inference(closure_rule, [i_0_18])).
% 0.12/0.36 cnf(i_0_56, plain, (greater(sk7,sk7)), inference(closure_rule, [i_0_18])).
% 0.12/0.36 cnf(i_0_58, plain, (~time(sk7)), inference(closure_rule, [i_0_48])).
% 0.12/0.36 cnf(i_0_54, plain, (sk7=sk7), inference(etableau_closure_rule, [i_0_54, ...])).
% 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.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # SZS output start for /export/starexec/sandbox/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_33, negated_conjecture, (greater(sk3,sk2))).
% 0.12/0.36 cnf(i_0_34, negated_conjecture, (greater(sk4,sk5))).
% 0.12/0.36 cnf(i_0_26, negated_conjecture, (organization(sk1,sk6))).
% 0.12/0.36 cnf(i_0_27, negated_conjecture, (organization(sk1,sk7))).
% 0.12/0.36 cnf(i_0_28, negated_conjecture, (reorganization_free(sk1,sk6,sk7))).
% 0.12/0.36 cnf(i_0_29, negated_conjecture, (complexity(sk1,sk2,sk6))).
% 0.12/0.36 cnf(i_0_30, negated_conjecture, (complexity(sk1,sk3,sk7))).
% 0.12/0.36 cnf(i_0_31, negated_conjecture, (size(sk1,sk4,sk6))).
% 0.12/0.36 cnf(i_0_32, negated_conjecture, (size(sk1,sk5,sk7))).
% 0.12/0.36 cnf(i_0_18, plain, (~greater(X1,X1))).
% 0.12/0.36 cnf(i_0_19, plain, (~greater(X1,X2)|~greater(X2,X1))).
% 0.12/0.36 cnf(i_0_20, plain, (time(X1)|~organization(X2,X1))).
% 0.12/0.36 cnf(i_0_22, plain, (reorganization_free(X1,X2,X3)|~reorganization_free(X1,X3,X2))).
% 0.12/0.36 cnf(i_0_21, plain, (X1=X2|greater(X1,X2)|greater(X2,X1)|~time(X2)|~time(X1))).
% 0.12/0.36 cnf(i_0_23, plain, (X1=X2|~complexity(X3,X2,X4)|~complexity(X3,X1,X4)|~organization(X3,X4))).
% 0.12/0.36 cnf(i_0_25, 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.36 cnf(i_0_24, 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.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 9 steps
% 0.12/0.36 cnf(i_0_28, negated_conjecture, (reorganization_free(sk1,sk6,sk7)), inference(start_rule)).
% 0.12/0.36 cnf(i_0_41, plain, (reorganization_free(sk1,sk6,sk7)), inference(extension_rule, [i_0_22])).
% 0.12/0.36 cnf(i_0_50, plain, (reorganization_free(sk1,sk7,sk6)), inference(extension_rule, [i_0_25])).
% 0.12/0.36 cnf(i_0_65, plain, (~complexity(sk1,sk2,sk6)), inference(closure_rule, [i_0_29])).
% 0.12/0.36 cnf(i_0_66, plain, (~complexity(sk1,sk3,sk7)), inference(closure_rule, [i_0_30])).
% 0.12/0.36 cnf(i_0_68, plain, (~organization(sk1,sk6)), inference(closure_rule, [i_0_26])).
% 0.12/0.36 cnf(i_0_69, plain, (~organization(sk1,sk7)), inference(closure_rule, [i_0_27])).
% 0.12/0.36 cnf(i_0_70, plain, (~greater(sk3,sk2)), inference(closure_rule, [i_0_33])).
% 0.12/0.36 cnf(i_0_71, plain, (~greater(sk6,sk7)), inference(etableau_closure_rule, [i_0_71, ...])).
% 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.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 1 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 1 successful branch saturations after the branch.
% 0.12/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # SZS output start for /export/starexec/sandbox/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_33, negated_conjecture, (greater(sk3,sk2))).
% 0.12/0.36 cnf(i_0_34, negated_conjecture, (greater(sk4,sk5))).
% 0.12/0.36 cnf(i_0_26, negated_conjecture, (organization(sk1,sk6))).
% 0.12/0.36 cnf(i_0_27, negated_conjecture, (organization(sk1,sk7))).
% 0.12/0.36 cnf(i_0_28, negated_conjecture, (reorganization_free(sk1,sk6,sk7))).
% 0.12/0.36 cnf(i_0_29, negated_conjecture, (complexity(sk1,sk2,sk6))).
% 0.12/0.36 cnf(i_0_30, negated_conjecture, (complexity(sk1,sk3,sk7))).
% 0.12/0.36 cnf(i_0_31, negated_conjecture, (size(sk1,sk4,sk6))).
% 0.12/0.36 cnf(i_0_32, negated_conjecture, (size(sk1,sk5,sk7))).
% 0.12/0.36 cnf(i_0_18, plain, (~greater(X1,X1))).
% 0.12/0.36 cnf(i_0_19, plain, (~greater(X1,X2)|~greater(X2,X1))).
% 0.12/0.36 cnf(i_0_20, plain, (time(X1)|~organization(X2,X1))).
% 0.12/0.36 cnf(i_0_22, plain, (reorganization_free(X1,X2,X3)|~reorganization_free(X1,X3,X2))).
% 0.12/0.36 cnf(i_0_21, plain, (X1=X2|greater(X1,X2)|greater(X2,X1)|~time(X2)|~time(X1))).
% 0.12/0.36 cnf(i_0_23, plain, (X1=X2|~complexity(X3,X2,X4)|~complexity(X3,X1,X4)|~organization(X3,X4))).
% 0.12/0.36 cnf(i_0_25, 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.36 cnf(i_0_24, 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.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 7 steps
% 0.12/0.36 cnf(i_0_26, negated_conjecture, (organization(sk1,sk6)), inference(start_rule)).
% 0.12/0.36 cnf(i_0_43, plain, (organization(sk1,sk6)), inference(extension_rule, [i_0_20])).
% 0.12/0.36 cnf(i_0_48, plain, (time(sk6)), inference(extension_rule, [i_0_21])).
% 0.12/0.36 cnf(i_0_55, plain, (greater(sk6,sk6)), inference(closure_rule, [i_0_18])).
% 0.12/0.36 cnf(i_0_56, plain, (greater(sk6,sk6)), inference(closure_rule, [i_0_18])).
% 0.12/0.36 cnf(i_0_58, plain, (~time(sk6)), inference(closure_rule, [i_0_48])).
% 0.12/0.36 cnf(i_0_54, plain, (sk6=sk6), inference(etableau_closure_rule, [i_0_54, ...])).
% 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.36 # Child (1680) has found a proof.
% 0.12/0.36
% 0.12/0.36 # Proof search is over...
% 0.12/0.36 # Freeing feature tree
%------------------------------------------------------------------------------