TSTP Solution File: KRS131+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KRS131+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 : n018.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:38 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.11 % Problem : KRS131+1 : TPTP v8.1.0. Released v3.1.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 : n018.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 12:36:36 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: 14 Number of unprocessed: 14
% 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 # 14 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 4 conjectures.
% 0.12/0.36 # There are 4 start rule candidates:
% 0.12/0.36 # Found 2 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 4 start rule tableaux created.
% 0.12/0.36 # 12 extension rule candidate clauses
% 0.12/0.36 # 2 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 are not enough tableaux to fork, creating more from the initial 4
% 0.12/0.36 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 8 tableaux to operate on
% 0.12/0.37 # There were 4 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 4 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 4 successful branch saturations after the branch.
% 0.12/0.37 # There were 4 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 4 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 4 successful branch saturations after the branch.
% 0.12/0.37 # There were 4 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 4 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 4 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_1, plain, (~cowlNothing(X1))).
% 0.12/0.37 cnf(i_0_9, plain, (~cNothing(X1))).
% 0.12/0.37 cnf(i_0_14, negated_conjecture, (cA(esk6_0)|xsd_string(esk5_0)|~cnotA(esk6_0)|~xsd_integer(esk5_0))).
% 0.12/0.37 cnf(i_0_13, negated_conjecture, (cnotA(esk6_0)|xsd_string(esk5_0)|~cA(esk6_0)|~xsd_integer(esk5_0))).
% 0.12/0.37 cnf(i_0_16, negated_conjecture, (cA(esk6_0)|xsd_integer(esk5_0)|~cnotA(esk6_0)|~xsd_string(esk5_0))).
% 0.12/0.37 cnf(i_0_15, negated_conjecture, (cnotA(esk6_0)|xsd_integer(esk5_0)|~cA(esk6_0)|~xsd_string(esk5_0))).
% 0.12/0.37 cnf(i_0_3, plain, (xsd_integer(X1)|xsd_string(X1))).
% 0.12/0.37 cnf(i_0_10, plain, (cnotA(X1)|~cNothing(esk3_1(X1)))).
% 0.12/0.37 cnf(i_0_4, plain, (~xsd_integer(X1)|~xsd_string(X1))).
% 0.12/0.37 cnf(i_0_8, plain, (~rp(X1,X2)|~cNothing(X1))).
% 0.12/0.37 cnf(i_0_5, plain, (cA(X1)|~rq(X1,X2))).
% 0.12/0.37 cnf(i_0_12, plain, (cNothing(X1)|~cnotA(X2)|~rq(X2,X1))).
% 0.12/0.37 cnf(i_0_11, plain, (cnotA(X1)|rq(X1,esk3_1(X1)))).
% 0.12/0.37 cnf(i_0_7, plain, (rq(X1,esk1_1(X1))|~cA(X1))).
% 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_15, negated_conjecture, (cnotA(esk6_0)|xsd_integer(esk5_0)|~cA(esk6_0)|~xsd_string(esk5_0)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_19, plain, (~cA(esk6_0)), inference(extension_rule, [i_0_5])).
% 0.12/0.37 cnf(i_0_108, plain, (~rq(esk6_0,esk3_1(esk6_0))), inference(extension_rule, [i_0_11])).
% 0.12/0.37 cnf(i_0_17, plain, (cnotA(esk6_0)), inference(etableau_closure_rule, [i_0_17, ...])).
% 0.12/0.37 cnf(i_0_18, plain, (xsd_integer(esk5_0)), inference(etableau_closure_rule, [i_0_18, ...])).
% 0.12/0.37 cnf(i_0_20, plain, (~xsd_string(esk5_0)), inference(etableau_closure_rule, [i_0_20, ...])).
% 0.12/0.37 cnf(i_0_475, plain, (cnotA(esk6_0)), inference(etableau_closure_rule, [i_0_475, ...])).
% 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_1, plain, (~cowlNothing(X1))).
% 0.12/0.37 cnf(i_0_9, plain, (~cNothing(X1))).
% 0.12/0.37 cnf(i_0_14, negated_conjecture, (cA(esk6_0)|xsd_string(esk5_0)|~cnotA(esk6_0)|~xsd_integer(esk5_0))).
% 0.12/0.37 cnf(i_0_13, negated_conjecture, (cnotA(esk6_0)|xsd_string(esk5_0)|~cA(esk6_0)|~xsd_integer(esk5_0))).
% 0.12/0.37 cnf(i_0_16, negated_conjecture, (cA(esk6_0)|xsd_integer(esk5_0)|~cnotA(esk6_0)|~xsd_string(esk5_0))).
% 0.12/0.37 cnf(i_0_15, negated_conjecture, (cnotA(esk6_0)|xsd_integer(esk5_0)|~cA(esk6_0)|~xsd_string(esk5_0))).
% 0.12/0.37 cnf(i_0_3, plain, (xsd_integer(X1)|xsd_string(X1))).
% 0.12/0.37 cnf(i_0_10, plain, (cnotA(X1)|~cNothing(esk3_1(X1)))).
% 0.12/0.37 cnf(i_0_4, plain, (~xsd_integer(X1)|~xsd_string(X1))).
% 0.12/0.37 cnf(i_0_8, plain, (~rp(X1,X2)|~cNothing(X1))).
% 0.12/0.37 cnf(i_0_5, plain, (cA(X1)|~rq(X1,X2))).
% 0.12/0.37 cnf(i_0_12, plain, (cNothing(X1)|~cnotA(X2)|~rq(X2,X1))).
% 0.12/0.37 cnf(i_0_11, plain, (cnotA(X1)|rq(X1,esk3_1(X1)))).
% 0.12/0.37 cnf(i_0_7, plain, (rq(X1,esk1_1(X1))|~cA(X1))).
% 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 8 steps
% 0.12/0.37 cnf(i_0_14, negated_conjecture, (cA(esk6_0)|xsd_string(esk5_0)|~cnotA(esk6_0)|~xsd_integer(esk5_0)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_29, plain, (cA(esk6_0)), inference(extension_rule, [i_0_7])).
% 0.12/0.37 cnf(i_0_444, plain, (rq(esk6_0,esk1_1(esk6_0))), inference(extension_rule, [i_0_12])).
% 0.12/0.37 cnf(i_0_472, plain, (cNothing(esk1_1(esk6_0))), inference(closure_rule, [i_0_9])).
% 0.12/0.37 cnf(i_0_30, plain, (xsd_string(esk5_0)), inference(etableau_closure_rule, [i_0_30, ...])).
% 0.12/0.37 cnf(i_0_31, plain, (~cnotA(esk6_0)), inference(etableau_closure_rule, [i_0_31, ...])).
% 0.12/0.37 cnf(i_0_32, plain, (~xsd_integer(esk5_0)), inference(etableau_closure_rule, [i_0_32, ...])).
% 0.12/0.37 cnf(i_0_473, plain, (~cnotA(esk6_0)), inference(etableau_closure_rule, [i_0_473, ...])).
% 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 4 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 4 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 4 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_1, plain, (~cowlNothing(X1))).
% 0.12/0.37 cnf(i_0_9, plain, (~cNothing(X1))).
% 0.12/0.37 cnf(i_0_14, negated_conjecture, (cA(esk6_0)|xsd_string(esk5_0)|~cnotA(esk6_0)|~xsd_integer(esk5_0))).
% 0.12/0.37 cnf(i_0_13, negated_conjecture, (cnotA(esk6_0)|xsd_string(esk5_0)|~cA(esk6_0)|~xsd_integer(esk5_0))).
% 0.12/0.37 cnf(i_0_16, negated_conjecture, (cA(esk6_0)|xsd_integer(esk5_0)|~cnotA(esk6_0)|~xsd_string(esk5_0))).
% 0.12/0.37 cnf(i_0_15, negated_conjecture, (cnotA(esk6_0)|xsd_integer(esk5_0)|~cA(esk6_0)|~xsd_string(esk5_0))).
% 0.12/0.37 cnf(i_0_3, plain, (xsd_integer(X1)|xsd_string(X1))).
% 0.12/0.37 cnf(i_0_10, plain, (cnotA(X1)|~cNothing(esk3_1(X1)))).
% 0.12/0.37 cnf(i_0_4, plain, (~xsd_integer(X1)|~xsd_string(X1))).
% 0.12/0.37 cnf(i_0_8, plain, (~rp(X1,X2)|~cNothing(X1))).
% 0.12/0.37 cnf(i_0_5, plain, (cA(X1)|~rq(X1,X2))).
% 0.12/0.37 cnf(i_0_12, plain, (cNothing(X1)|~cnotA(X2)|~rq(X2,X1))).
% 0.12/0.37 cnf(i_0_11, plain, (cnotA(X1)|rq(X1,esk3_1(X1)))).
% 0.12/0.37 cnf(i_0_7, plain, (rq(X1,esk1_1(X1))|~cA(X1))).
% 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 8 steps
% 0.12/0.37 cnf(i_0_13, negated_conjecture, (cnotA(esk6_0)|xsd_string(esk5_0)|~cA(esk6_0)|~xsd_integer(esk5_0)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_25, plain, (cnotA(esk6_0)), inference(extension_rule, [i_0_12])).
% 0.12/0.37 cnf(i_0_307, plain, (cNothing(esk1_1(esk6_0))), inference(closure_rule, [i_0_9])).
% 0.12/0.37 cnf(i_0_309, plain, (~rq(esk6_0,esk1_1(esk6_0))), inference(extension_rule, [i_0_7])).
% 0.12/0.37 cnf(i_0_26, plain, (xsd_string(esk5_0)), inference(etableau_closure_rule, [i_0_26, ...])).
% 0.12/0.37 cnf(i_0_27, plain, (~cA(esk6_0)), inference(etableau_closure_rule, [i_0_27, ...])).
% 0.12/0.37 cnf(i_0_28, plain, (~xsd_integer(esk5_0)), inference(etableau_closure_rule, [i_0_28, ...])).
% 0.12/0.37 cnf(i_0_478, plain, (~cA(esk6_0)), inference(etableau_closure_rule, [i_0_478, ...])).
% 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 4 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 4 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 4 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_1, plain, (~cowlNothing(X1))).
% 0.12/0.37 cnf(i_0_9, plain, (~cNothing(X1))).
% 0.12/0.37 cnf(i_0_14, negated_conjecture, (cA(esk6_0)|xsd_string(esk5_0)|~cnotA(esk6_0)|~xsd_integer(esk5_0))).
% 0.12/0.37 cnf(i_0_13, negated_conjecture, (cnotA(esk6_0)|xsd_string(esk5_0)|~cA(esk6_0)|~xsd_integer(esk5_0))).
% 0.12/0.37 cnf(i_0_16, negated_conjecture, (cA(esk6_0)|xsd_integer(esk5_0)|~cnotA(esk6_0)|~xsd_string(esk5_0))).
% 0.12/0.37 cnf(i_0_15, negated_conjecture, (cnotA(esk6_0)|xsd_integer(esk5_0)|~cA(esk6_0)|~xsd_string(esk5_0))).
% 0.12/0.37 cnf(i_0_3, plain, (xsd_integer(X1)|xsd_string(X1))).
% 0.12/0.37 cnf(i_0_10, plain, (cnotA(X1)|~cNothing(esk3_1(X1)))).
% 0.12/0.37 cnf(i_0_4, plain, (~xsd_integer(X1)|~xsd_string(X1))).
% 0.12/0.37 cnf(i_0_8, plain, (~rp(X1,X2)|~cNothing(X1))).
% 0.12/0.37 cnf(i_0_5, plain, (cA(X1)|~rq(X1,X2))).
% 0.12/0.37 cnf(i_0_12, plain, (cNothing(X1)|~cnotA(X2)|~rq(X2,X1))).
% 0.12/0.37 cnf(i_0_11, plain, (cnotA(X1)|rq(X1,esk3_1(X1)))).
% 0.12/0.37 cnf(i_0_7, plain, (rq(X1,esk1_1(X1))|~cA(X1))).
% 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, (cA(esk6_0)|xsd_integer(esk5_0)|~cnotA(esk6_0)|~xsd_string(esk5_0)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_23, plain, (~cnotA(esk6_0)), inference(extension_rule, [i_0_11])).
% 0.12/0.37 cnf(i_0_245, plain, (rq(esk6_0,esk3_1(esk6_0))), inference(extension_rule, [i_0_5])).
% 0.12/0.37 cnf(i_0_21, plain, (cA(esk6_0)), inference(etableau_closure_rule, [i_0_21, ...])).
% 0.12/0.37 cnf(i_0_22, plain, (xsd_integer(esk5_0)), inference(etableau_closure_rule, [i_0_22, ...])).
% 0.12/0.37 cnf(i_0_24, plain, (~xsd_string(esk5_0)), inference(etableau_closure_rule, [i_0_24, ...])).
% 0.12/0.37 cnf(i_0_470, plain, (cA(esk6_0)), inference(etableau_closure_rule, [i_0_470, ...])).
% 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 (11514) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------