TSTP Solution File: KRS175+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KRS175+1 : TPTP v8.1.0. Released v3.1.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 : n025.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 03:00:46 EDT 2022
% Result : Theorem 0.18s 0.35s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS175+1 : TPTP v8.1.0. Released v3.1.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 : n025.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 : Tue Jun 7 10:35:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.35 # No SInE strategy applied
% 0.18/0.35 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.18/0.35 # and selection function SelectNewComplexAHP.
% 0.18/0.35 #
% 0.18/0.35 # Presaturation interreduction done
% 0.18/0.35 # Number of axioms: 16 Number of unprocessed: 16
% 0.18/0.35 # Tableaux proof search.
% 0.18/0.35 # APR header successfully linked.
% 0.18/0.35 # Hello from C++
% 0.18/0.35 # The folding up rule is enabled...
% 0.18/0.35 # Local unification is enabled...
% 0.18/0.35 # Any saturation attempts will use folding labels...
% 0.18/0.35 # 16 beginning clauses after preprocessing and clausification
% 0.18/0.35 # Creating start rules for all 6 conjectures.
% 0.18/0.35 # There are 6 start rule candidates:
% 0.18/0.35 # Found 3 unit axioms.
% 0.18/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.35 # 6 start rule tableaux created.
% 0.18/0.35 # 13 extension rule candidate clauses
% 0.18/0.35 # 3 unit axiom clauses
% 0.18/0.35
% 0.18/0.35 # Requested 8, 32 cores available to the main process.
% 0.18/0.35 # There are not enough tableaux to fork, creating more from the initial 6
% 0.18/0.35 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.35 # We now have 10 tableaux to operate on
% 0.18/0.35 # Creating equality axioms
% 0.18/0.35 # Ran out of tableaux, making start rules for all clauses
% 0.18/0.35 # Creating equality axioms
% 0.18/0.35 # Ran out of tableaux, making start rules for all clauses
% 0.18/0.35 # There were 1 total branch saturation attempts.
% 0.18/0.35 # There were 0 of these attempts blocked.
% 0.18/0.35 # There were 0 deferred branch saturation attempts.
% 0.18/0.35 # There were 0 free duplicated saturations.
% 0.18/0.35 # There were 1 total successful branch saturations.
% 0.18/0.35 # There were 0 successful branch saturations in interreduction.
% 0.18/0.35 # There were 0 successful branch saturations on the branch.
% 0.18/0.35 # There were 1 successful branch saturations after the branch.
% 0.18/0.35 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.35 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.35 # Begin clausification derivation
% 0.18/0.35
% 0.18/0.35 # End clausification derivation
% 0.18/0.35 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.35 cnf(i_0_12, plain, (cA(ia))).
% 0.18/0.35 cnf(i_0_17, plain, (cB(ib))).
% 0.18/0.35 cnf(i_0_8, plain, (~cowlNothing(X1))).
% 0.18/0.35 cnf(i_0_25, negated_conjecture, (xsd_integer(esk2_0)|esk3_0!=ia|~xsd_string(esk2_0)|~cA_and_B(esk3_0))).
% 0.18/0.35 cnf(i_0_26, negated_conjecture, (xsd_integer(esk2_0)|esk3_0!=ib|~xsd_string(esk2_0)|~cA_and_B(esk3_0))).
% 0.18/0.35 cnf(i_0_22, negated_conjecture, (xsd_string(esk2_0)|esk3_0!=ia|~xsd_integer(esk2_0)|~cA_and_B(esk3_0))).
% 0.18/0.35 cnf(i_0_23, negated_conjecture, (xsd_string(esk2_0)|esk3_0!=ib|~xsd_integer(esk2_0)|~cA_and_B(esk3_0))).
% 0.18/0.35 cnf(i_0_11, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.18/0.35 cnf(i_0_15, plain, (cA_and_B(X1)|~cA(X1))).
% 0.18/0.35 cnf(i_0_14, plain, (cA_and_B(X1)|~cB(X1))).
% 0.18/0.35 cnf(i_0_13, plain, (X1=ia|~cA(X1))).
% 0.18/0.35 cnf(i_0_18, plain, (X1=ib|~cB(X1))).
% 0.18/0.35 cnf(i_0_24, negated_conjecture, (esk3_0=ib|esk3_0=ia|cA_and_B(esk3_0)|~xsd_string(esk2_0))).
% 0.18/0.35 cnf(i_0_21, negated_conjecture, (esk3_0=ib|esk3_0=ia|cA_and_B(esk3_0)|~xsd_integer(esk2_0))).
% 0.18/0.35 cnf(i_0_10, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.18/0.35 cnf(i_0_16, plain, (cB(X1)|cA(X1)|~cA_and_B(X1))).
% 0.18/0.35 cnf(i_0_638, plain, (X26=X26)).
% 0.18/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.35 # Begin printing tableau
% 0.18/0.35 # Found 5 steps
% 0.18/0.35 cnf(i_0_638, plain, (ia=ia), inference(start_rule)).
% 0.18/0.35 cnf(i_0_690, plain, (ia=ia), inference(extension_rule, [i_0_642])).
% 0.18/0.35 cnf(i_0_739, plain, (~cA(ia)), inference(closure_rule, [i_0_12])).
% 0.18/0.35 cnf(i_0_737, plain, (cA(ia)), inference(extension_rule, [i_0_15])).
% 0.18/0.35 cnf(i_0_742, plain, (cA_and_B(ia)), inference(etableau_closure_rule, [i_0_742, ...])).
% 0.18/0.35 # End printing tableau
% 0.18/0.35 # SZS output end
% 0.18/0.35 # Branches closed with saturation will be marked with an "s"
% 0.18/0.35 # There were 1 total branch saturation attempts.
% 0.18/0.35 # There were 0 of these attempts blocked.
% 0.18/0.35 # There were 0 deferred branch saturation attempts.
% 0.18/0.35 # There were 0 free duplicated saturations.
% 0.18/0.35 # There were 1 total successful branch saturations.
% 0.18/0.35 # There were 0 successful branch saturations in interreduction.
% 0.18/0.35 # There were 0 successful branch saturations on the branch.
% 0.18/0.35 # There were 1 successful branch saturations after the branch.
% 0.18/0.35 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.35 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.35 # Begin clausification derivation
% 0.18/0.35
% 0.18/0.35 # End clausification derivation
% 0.18/0.35 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.35 cnf(i_0_12, plain, (cA(ia))).
% 0.18/0.35 cnf(i_0_17, plain, (cB(ib))).
% 0.18/0.35 cnf(i_0_8, plain, (~cowlNothing(X1))).
% 0.18/0.35 cnf(i_0_25, negated_conjecture, (xsd_integer(esk2_0)|esk3_0!=ia|~xsd_string(esk2_0)|~cA_and_B(esk3_0))).
% 0.18/0.35 cnf(i_0_26, negated_conjecture, (xsd_integer(esk2_0)|esk3_0!=ib|~xsd_string(esk2_0)|~cA_and_B(esk3_0))).
% 0.18/0.35 cnf(i_0_22, negated_conjecture, (xsd_string(esk2_0)|esk3_0!=ia|~xsd_integer(esk2_0)|~cA_and_B(esk3_0))).
% 0.18/0.35 cnf(i_0_23, negated_conjecture, (xsd_string(esk2_0)|esk3_0!=ib|~xsd_integer(esk2_0)|~cA_and_B(esk3_0))).
% 0.18/0.35 cnf(i_0_11, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.18/0.35 cnf(i_0_15, plain, (cA_and_B(X1)|~cA(X1))).
% 0.18/0.35 cnf(i_0_14, plain, (cA_and_B(X1)|~cB(X1))).
% 0.18/0.35 cnf(i_0_13, plain, (X1=ia|~cA(X1))).
% 0.18/0.35 cnf(i_0_18, plain, (X1=ib|~cB(X1))).
% 0.18/0.35 cnf(i_0_24, negated_conjecture, (esk3_0=ib|esk3_0=ia|cA_and_B(esk3_0)|~xsd_string(esk2_0))).
% 0.18/0.35 cnf(i_0_21, negated_conjecture, (esk3_0=ib|esk3_0=ia|cA_and_B(esk3_0)|~xsd_integer(esk2_0))).
% 0.18/0.35 cnf(i_0_10, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.18/0.35 cnf(i_0_16, plain, (cB(X1)|cA(X1)|~cA_and_B(X1))).
% 0.18/0.35 cnf(i_0_638, plain, (X26=X26)).
% 0.18/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.35 # Begin printing tableau
% 0.18/0.35 # Found 5 steps
% 0.18/0.35 cnf(i_0_638, plain, (ia=ia), inference(start_rule)).
% 0.18/0.35 cnf(i_0_690, plain, (ia=ia), inference(extension_rule, [i_0_642])).
% 0.18/0.35 cnf(i_0_739, plain, (~cA(ia)), inference(closure_rule, [i_0_12])).
% 0.18/0.35 cnf(i_0_737, plain, (cA(ia)), inference(extension_rule, [i_0_15])).
% 0.18/0.35 cnf(i_0_742, plain, (cA_and_B(ia)), inference(etableau_closure_rule, [i_0_742, ...])).
% 0.18/0.35 # End printing tableau
% 0.18/0.35 # SZS output end
% 0.18/0.35 # Branches closed with saturation will be marked with an "s"
% 0.18/0.35 # Child (16226) has found a proof.
% 0.18/0.35
% 0.18/0.35 # Proof search is over...
% 0.18/0.35 # Freeing feature tree
%------------------------------------------------------------------------------