TSTP Solution File: MGT053+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT053+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 : 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:41 EDT 2022
% Result : Theorem 0.12s 0.40s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : MGT053+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.36 % Computer : n017.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8042.1875MB
% 0.12/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 600
% 0.12/0.36 % DateTime : Thu Jun 9 08:50:04 EDT 2022
% 0.12/0.36 % CPUTime :
% 0.12/0.39 # No SInE strategy applied
% 0.12/0.39 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.12/0.39 # and selection function SelectNewComplexAHP.
% 0.12/0.39 #
% 0.12/0.39 # Presaturation interreduction done
% 0.12/0.39 # Number of axioms: 18 Number of unprocessed: 18
% 0.12/0.39 # Tableaux proof search.
% 0.12/0.39 # APR header successfully linked.
% 0.12/0.39 # Hello from C++
% 0.12/0.39 # The folding up rule is enabled...
% 0.12/0.39 # Local unification is enabled...
% 0.12/0.39 # Any saturation attempts will use folding labels...
% 0.12/0.39 # 18 beginning clauses after preprocessing and clausification
% 0.12/0.39 # Creating start rules for all 2 conjectures.
% 0.12/0.39 # There are 2 start rule candidates:
% 0.12/0.39 # Found 2 unit axioms.
% 0.12/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.39 # 2 start rule tableaux created.
% 0.12/0.39 # 16 extension rule candidate clauses
% 0.12/0.39 # 2 unit axiom clauses
% 0.12/0.39
% 0.12/0.39 # Requested 8, 32 cores available to the main process.
% 0.12/0.39 # There are not enough tableaux to fork, creating more from the initial 2
% 0.12/0.39 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.39 # We now have 10 tableaux to operate on
% 0.12/0.40 # There were 3 total branch saturation attempts.
% 0.12/0.40 # There were 0 of these attempts blocked.
% 0.12/0.40 # There were 0 deferred branch saturation attempts.
% 0.12/0.40 # There were 0 free duplicated saturations.
% 0.12/0.40 # There were 3 total successful branch saturations.
% 0.12/0.40 # There were 0 successful branch saturations in interreduction.
% 0.12/0.40 # There were 0 successful branch saturations on the branch.
% 0.12/0.40 # There were 3 successful branch saturations after the branch.
% 0.12/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.40 # Begin clausification derivation
% 0.12/0.40
% 0.12/0.40 # End clausification derivation
% 0.12/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.40 cnf(i_0_1, plain, (smaller_or_equal(X1,X1))).
% 0.12/0.40 cnf(i_0_4, plain, (greater_or_equal(X1,X1))).
% 0.12/0.40 cnf(i_0_17, negated_conjecture, (dissimilar(esk1_0,esk3_0,esk2_0)|dissimilar(esk1_0,esk2_0,esk3_0))).
% 0.12/0.40 cnf(i_0_18, negated_conjecture, (~dissimilar(esk1_0,esk2_0,esk3_0)|~dissimilar(esk1_0,esk3_0,esk2_0))).
% 0.12/0.40 cnf(i_0_16, plain, (organization(X1)|~dissimilar(X1,X2,X3))).
% 0.12/0.40 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))).
% 0.12/0.40 cnf(i_0_2, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))).
% 0.12/0.40 cnf(i_0_9, plain, (~greater(X1,X2)|~greater(X2,X1))).
% 0.12/0.40 cnf(i_0_8, plain, (greater(X1,X2)|~smaller(X2,X1))).
% 0.12/0.40 cnf(i_0_7, plain, (smaller(X1,X2)|~greater(X2,X1))).
% 0.12/0.40 cnf(i_0_5, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 0.12/0.40 cnf(i_0_3, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))).
% 0.12/0.40 cnf(i_0_6, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.12/0.40 cnf(i_0_15, plain, (~is_aligned(X1,X2)|~is_aligned(X1,X3)|~dissimilar(X1,X3,X2))).
% 0.12/0.40 cnf(i_0_12, plain, (is_aligned(X1,X2)|dissimilar(X1,X2,X3)|~is_aligned(X1,X3)|~organization(X1))).
% 0.12/0.40 cnf(i_0_13, plain, (is_aligned(X1,X2)|dissimilar(X1,X3,X2)|~is_aligned(X1,X3)|~organization(X1))).
% 0.12/0.40 cnf(i_0_10, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.12/0.40 cnf(i_0_14, plain, (is_aligned(X1,X2)|is_aligned(X1,X3)|~dissimilar(X1,X2,X3))).
% 0.12/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.40 # Begin printing tableau
% 0.12/0.40 # Found 7 steps
% 0.12/0.40 cnf(i_0_17, negated_conjecture, (dissimilar(esk1_0,esk3_0,esk2_0)|dissimilar(esk1_0,esk2_0,esk3_0)), inference(start_rule)).
% 0.12/0.40 cnf(i_0_24, plain, (dissimilar(esk1_0,esk2_0,esk3_0)), inference(extension_rule, [i_0_14])).
% 0.12/0.40 cnf(i_0_186, plain, (is_aligned(esk1_0,esk2_0)), inference(extension_rule, [i_0_15])).
% 0.12/0.40 cnf(i_0_215, plain, (~is_aligned(esk1_0,esk2_0)), inference(closure_rule, [i_0_186])).
% 0.12/0.40 cnf(i_0_23, plain, (dissimilar(esk1_0,esk3_0,esk2_0)), inference(etableau_closure_rule, [i_0_23, ...])).
% 0.12/0.40 cnf(i_0_187, plain, (is_aligned(esk1_0,esk3_0)), inference(etableau_closure_rule, [i_0_187, ...])).
% 0.12/0.40 cnf(i_0_216, plain, (~dissimilar(esk1_0,esk2_0,esk2_0)), inference(etableau_closure_rule, [i_0_216, ...])).
% 0.12/0.40 # End printing tableau
% 0.12/0.40 # SZS output end
% 0.12/0.40 # Branches closed with saturation will be marked with an "s"
% 0.12/0.40 # There were 3 total branch saturation attempts.
% 0.12/0.40 # There were 0 of these attempts blocked.
% 0.12/0.40 # There were 0 deferred branch saturation attempts.
% 0.12/0.40 # There were 0 free duplicated saturations.
% 0.12/0.40 # There were 3 total successful branch saturations.
% 0.12/0.40 # There were 0 successful branch saturations in interreduction.
% 0.12/0.40 # There were 0 successful branch saturations on the branch.
% 0.12/0.40 # There were 3 successful branch saturations after the branch.
% 0.12/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.40 # Begin clausification derivation
% 0.12/0.40
% 0.12/0.40 # End clausification derivation
% 0.12/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.40 cnf(i_0_1, plain, (smaller_or_equal(X1,X1))).
% 0.12/0.40 cnf(i_0_4, plain, (greater_or_equal(X1,X1))).
% 0.12/0.40 cnf(i_0_17, negated_conjecture, (dissimilar(esk1_0,esk3_0,esk2_0)|dissimilar(esk1_0,esk2_0,esk3_0))).
% 0.12/0.40 cnf(i_0_18, negated_conjecture, (~dissimilar(esk1_0,esk2_0,esk3_0)|~dissimilar(esk1_0,esk3_0,esk2_0))).
% 0.12/0.40 cnf(i_0_16, plain, (organization(X1)|~dissimilar(X1,X2,X3))).
% 0.12/0.40 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))).
% 0.12/0.40 cnf(i_0_2, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))).
% 0.12/0.40 cnf(i_0_9, plain, (~greater(X1,X2)|~greater(X2,X1))).
% 0.12/0.40 cnf(i_0_8, plain, (greater(X1,X2)|~smaller(X2,X1))).
% 0.12/0.40 cnf(i_0_7, plain, (smaller(X1,X2)|~greater(X2,X1))).
% 0.12/0.40 cnf(i_0_5, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 0.12/0.40 cnf(i_0_3, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))).
% 0.12/0.40 cnf(i_0_6, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.12/0.40 cnf(i_0_15, plain, (~is_aligned(X1,X2)|~is_aligned(X1,X3)|~dissimilar(X1,X3,X2))).
% 0.12/0.40 cnf(i_0_12, plain, (is_aligned(X1,X2)|dissimilar(X1,X2,X3)|~is_aligned(X1,X3)|~organization(X1))).
% 0.12/0.40 cnf(i_0_13, plain, (is_aligned(X1,X2)|dissimilar(X1,X3,X2)|~is_aligned(X1,X3)|~organization(X1))).
% 0.12/0.40 cnf(i_0_10, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.12/0.40 cnf(i_0_14, plain, (is_aligned(X1,X2)|is_aligned(X1,X3)|~dissimilar(X1,X2,X3))).
% 0.12/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.40 # Begin printing tableau
% 0.12/0.40 # Found 7 steps
% 0.12/0.40 cnf(i_0_17, negated_conjecture, (dissimilar(esk1_0,esk3_0,esk2_0)|dissimilar(esk1_0,esk2_0,esk3_0)), inference(start_rule)).
% 0.12/0.40 cnf(i_0_23, plain, (dissimilar(esk1_0,esk3_0,esk2_0)), inference(extension_rule, [i_0_14])).
% 0.12/0.40 cnf(i_0_144, plain, (is_aligned(esk1_0,esk3_0)), inference(extension_rule, [i_0_15])).
% 0.12/0.40 cnf(i_0_215, plain, (~is_aligned(esk1_0,esk3_0)), inference(closure_rule, [i_0_144])).
% 0.12/0.40 cnf(i_0_24, plain, (dissimilar(esk1_0,esk2_0,esk3_0)), inference(etableau_closure_rule, [i_0_24, ...])).
% 0.12/0.40 cnf(i_0_145, plain, (is_aligned(esk1_0,esk2_0)), inference(etableau_closure_rule, [i_0_145, ...])).
% 0.12/0.40 cnf(i_0_216, plain, (~dissimilar(esk1_0,esk3_0,esk3_0)), inference(etableau_closure_rule, [i_0_216, ...])).
% 0.12/0.40 # End printing tableau
% 0.12/0.40 # SZS output end
% 0.12/0.40 # Branches closed with saturation will be marked with an "s"
% 0.12/0.40 # Child (24144) has found a proof.
% 0.12/0.40
% 0.12/0.40 # Proof search is over...
% 0.12/0.40 # Freeing feature tree
%------------------------------------------------------------------------------