TSTP Solution File: KRS162+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KRS162+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:43 EDT 2022
% Result : Theorem 0.18s 0.40s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : KRS162+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/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 20:13:04 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: 28 Number of unprocessed: 28
% 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 # 28 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 20 conjectures.
% 0.12/0.36 # There are 20 start rule candidates:
% 0.12/0.36 # Found 1 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 20 start rule tableaux created.
% 0.12/0.36 # 27 extension rule candidate clauses
% 0.12/0.36 # 1 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.18/0.40 # There were 13 total branch saturation attempts.
% 0.18/0.40 # There were 0 of these attempts blocked.
% 0.18/0.40 # There were 0 deferred branch saturation attempts.
% 0.18/0.40 # There were 9 free duplicated saturations.
% 0.18/0.40 # There were 13 total successful branch saturations.
% 0.18/0.40 # There were 0 successful branch saturations in interreduction.
% 0.18/0.40 # There were 0 successful branch saturations on the branch.
% 0.18/0.40 # There were 4 successful branch saturations after the branch.
% 0.18/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.40 # Begin clausification derivation
% 0.18/0.40
% 0.18/0.40 # End clausification derivation
% 0.18/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.40 cnf(i_0_13, plain, (~cowlNothing(X1))).
% 0.18/0.40 cnf(i_0_39, negated_conjecture, (xsd_integer(esk2_0)|esk5_0!=esk4_0|~xsd_string(esk2_0))).
% 0.18/0.40 cnf(i_0_35, negated_conjecture, (xsd_integer(esk2_0)|esk7_0!=esk6_0|~xsd_string(esk2_0))).
% 0.18/0.40 cnf(i_0_34, negated_conjecture, (xsd_integer(esk2_0)|esk8_0!=esk6_0|~xsd_string(esk2_0))).
% 0.18/0.40 cnf(i_0_33, negated_conjecture, (xsd_integer(esk2_0)|esk8_0!=esk7_0|~xsd_string(esk2_0))).
% 0.18/0.40 cnf(i_0_15, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.18/0.40 cnf(i_0_29, negated_conjecture, (xsd_string(esk2_0)|esk5_0!=esk4_0)).
% 0.18/0.40 cnf(i_0_19, plain, (~cB(X1)|~cA(X1))).
% 0.18/0.40 cnf(i_0_16, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.18/0.40 cnf(i_0_21, plain, (rr(X1,X2)|~rp(X1,X2))).
% 0.18/0.40 cnf(i_0_20, plain, (rr(X1,X2)|~rq(X1,X2))).
% 0.18/0.40 cnf(i_0_25, negated_conjecture, (xsd_string(esk2_0)|esk7_0!=esk6_0)).
% 0.18/0.40 cnf(i_0_24, negated_conjecture, (xsd_string(esk2_0)|esk8_0!=esk6_0)).
% 0.18/0.40 cnf(i_0_23, negated_conjecture, (xsd_string(esk2_0)|esk8_0!=esk7_0)).
% 0.18/0.40 cnf(i_0_41, negated_conjecture, (xsd_integer(esk2_0)|rp(esk3_0,esk4_0))).
% 0.18/0.40 cnf(i_0_40, negated_conjecture, (xsd_integer(esk2_0)|rp(esk3_0,esk5_0))).
% 0.18/0.40 cnf(i_0_38, negated_conjecture, (xsd_integer(esk2_0)|rq(esk3_0,esk6_0))).
% 0.18/0.40 cnf(i_0_37, negated_conjecture, (xsd_integer(esk2_0)|rq(esk3_0,esk7_0))).
% 0.18/0.40 cnf(i_0_17, plain, (cA(X1)|~rp(X2,X1))).
% 0.18/0.40 cnf(i_0_18, plain, (cB(X1)|~rq(X2,X1))).
% 0.18/0.40 cnf(i_0_36, negated_conjecture, (xsd_integer(esk2_0)|rq(esk3_0,esk8_0))).
% 0.18/0.40 cnf(i_0_31, negated_conjecture, (xsd_string(esk2_0)|rp(esk3_0,esk4_0))).
% 0.18/0.40 cnf(i_0_30, negated_conjecture, (xsd_string(esk2_0)|rp(esk3_0,esk5_0))).
% 0.18/0.40 cnf(i_0_28, negated_conjecture, (xsd_string(esk2_0)|rq(esk3_0,esk6_0))).
% 0.18/0.40 cnf(i_0_27, negated_conjecture, (xsd_string(esk2_0)|rq(esk3_0,esk7_0))).
% 0.18/0.40 cnf(i_0_26, negated_conjecture, (xsd_string(esk2_0)|rq(esk3_0,esk8_0))).
% 0.18/0.40 cnf(i_0_32, negated_conjecture, (X1=X2|X1=X3|X1=X4|X1=X5|X2=X3|X2=X4|X2=X5|X3=X4|X3=X5|X4=X5|xsd_integer(esk2_0)|~rr(esk3_0,X5)|~rr(esk3_0,X4)|~rr(esk3_0,X3)|~rr(esk3_0,X2)|~rr(esk3_0,X1))).
% 0.18/0.40 cnf(i_0_22, negated_conjecture, (X1=X2|X1=X3|X1=X4|X1=X5|X2=X3|X2=X4|X2=X5|X3=X4|X3=X5|X4=X5|xsd_string(esk2_0)|~rr(esk3_0,X5)|~rr(esk3_0,X4)|~rr(esk3_0,X3)|~rr(esk3_0,X2)|~rr(esk3_0,X1))).
% 0.18/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.40 # Begin printing tableau
% 0.18/0.40 # Found 21 steps
% 0.18/0.40 cnf(i_0_26, negated_conjecture, (xsd_string(esk2_0)|rq(esk3_0,esk8_0)), inference(start_rule)).
% 0.18/0.40 cnf(i_0_74, plain, (xsd_string(esk2_0)), inference(extension_rule, [i_0_16])).
% 0.18/0.40 cnf(i_0_119, plain, (~xsd_integer(esk2_0)), inference(extension_rule, [i_0_36])).
% 0.18/0.40 cnf(i_0_548, plain, (rq(esk3_0,esk8_0)), inference(etableau_closure_rule, [i_0_548, ...])).
% 0.18/0.40 cnf(i_0_75, plain, (rq(esk3_0,esk8_0)), inference(extension_rule, [i_0_20])).
% 0.18/0.40 cnf(i_0_613, plain, (rr(esk3_0,esk8_0)), inference(extension_rule, [i_0_22])).
% 0.18/0.40 cnf(i_0_637, plain, (~rr(esk3_0,esk8_0)), inference(closure_rule, [i_0_613])).
% 0.18/0.40 cnf(i_0_638, plain, (~rr(esk3_0,esk8_0)), inference(closure_rule, [i_0_613])).
% 0.18/0.40 cnf(i_0_639, plain, (~rr(esk3_0,esk8_0)), inference(closure_rule, [i_0_613])).
% 0.18/0.40 cnf(i_0_640, plain, (~rr(esk3_0,esk8_0)), inference(closure_rule, [i_0_613])).
% 0.18/0.40 cnf(i_0_625, plain, (esk8_0=esk8_0), inference(etableau_closure_rule, [i_0_625, ...])).
% 0.18/0.40 cnf(i_0_626, plain, (esk8_0=esk8_0), inference(etableau_closure_rule, [i_0_626, ...])).
% 0.18/0.40 cnf(i_0_627, plain, (esk8_0=esk8_0), inference(etableau_closure_rule, [i_0_627, ...])).
% 0.18/0.40 cnf(i_0_628, plain, (esk8_0=esk8_0), inference(etableau_closure_rule, [i_0_628, ...])).
% 0.18/0.40 cnf(i_0_629, plain, (esk8_0=esk8_0), inference(etableau_closure_rule, [i_0_629, ...])).
% 0.18/0.40 cnf(i_0_630, plain, (esk8_0=esk8_0), inference(etableau_closure_rule, [i_0_630, ...])).
% 0.18/0.40 cnf(i_0_631, plain, (esk8_0=esk8_0), inference(etableau_closure_rule, [i_0_631, ...])).
% 0.18/0.40 cnf(i_0_632, plain, (esk8_0=esk8_0), inference(etableau_closure_rule, [i_0_632, ...])).
% 0.18/0.40 cnf(i_0_633, plain, (esk# There were 13 total branch saturation attempts.
% 0.18/0.40 # There were 0 of these attempts blocked.
% 0.18/0.40 # There were 0 deferred branch saturation attempts.
% 0.18/0.40 # There were 9 free duplicated saturations.
% 0.18/0.40 # There were 13 total successful branch saturations.
% 0.18/0.40 # There were 0 successful branch saturations in interreduction.
% 0.18/0.40 # There were 0 successful branch saturations on the branch.
% 0.18/0.40 # There were 4 successful branch saturations after the branch.
% 0.18/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.40 # Begin clausification derivation
% 0.18/0.40
% 0.18/0.40 # End clausification derivation
% 0.18/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.40 cnf(i_0_13, plain, (~cowlNothing(X1))).
% 0.18/0.40 cnf(i_0_39, negated_conjecture, (xsd_integer(esk2_0)|esk5_0!=esk4_0|~xsd_string(esk2_0))).
% 0.18/0.40 cnf(i_0_35, negated_conjecture, (xsd_integer(esk2_0)|esk7_0!=esk6_0|~xsd_string(esk2_0))).
% 0.18/0.40 cnf(i_0_34, negated_conjecture, (xsd_integer(esk2_0)|esk8_0!=esk6_0|~xsd_string(esk2_0))).
% 0.18/0.40 cnf(i_0_33, negated_conjecture, (xsd_integer(esk2_0)|esk8_0!=esk7_0|~xsd_string(esk2_0))).
% 0.18/0.40 cnf(i_0_15, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.18/0.40 cnf(i_0_29, negated_conjecture, (xsd_string(esk2_0)|esk5_0!=esk4_0)).
% 0.18/0.40 cnf(i_0_19, plain, (~cB(X1)|~cA(X1))).
% 0.18/0.40 cnf(i_0_16, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.18/0.40 cnf(i_0_21, plain, (rr(X1,X2)|~rp(X1,X2))).
% 0.18/0.40 cnf(i_0_20, plain, (rr(X1,X2)|~rq(X1,X2))).
% 0.18/0.40 cnf(i_0_25, negated_conjecture, (xsd_string(esk2_0)|esk7_0!=esk6_0)).
% 0.18/0.41 cnf(i_0_24, negated_conjecture, (xsd_string(esk2_0)|esk8_0!=esk6_0)).
% 0.18/0.41 cnf(i_0_23, negated_conjecture, (xsd_string(esk2_0)|esk8_0!=esk7_0)).
% 0.18/0.41 cnf(i_0_41, negated_conjecture, (xsd_integer(esk2_0)|rp(esk3_0,esk4_0))).
% 0.18/0.41 cnf(i_0_40, negated_conjecture, (xsd_integer(esk2_0)|rp(esk3_0,esk5_0))).
% 0.18/0.41 cnf(i_0_38, negated_conjecture, (xsd_integer(esk2_0)|rq(esk3_0,esk6_0))).
% 0.18/0.41 cnf(i_0_37, negated_conjecture, (xsd_integer(esk2_0)|rq(esk3_0,esk7_0))).
% 0.18/0.41 cnf(i_0_17, plain, (cA(X1)|~rp(X2,X1))).
% 0.18/0.41 cnf(i_0_18, plain, (cB(X1)|~rq(X2,X1))).
% 0.18/0.41 cnf(i_0_36, negated_conjecture, (xsd_integer(esk2_0)|rq(esk3_0,esk8_0))).
% 0.18/0.41 cnf(i_0_31, negated_conjecture, (xsd_string(esk2_0)|rp(esk3_0,esk4_0))).
% 0.18/0.41 cnf(i_0_30, negated_conjecture, (xsd_string(esk2_0)|rp(esk3_0,esk5_0))).
% 0.18/0.41 cnf(i_0_28, negated_conjecture, (xsd_string(esk2_0)|rq(esk3_0,esk6_0))).
% 0.18/0.41 cnf(i_0_27, negated_conjecture, (xsd_string(esk2_0)|rq(esk3_0,esk7_0))).
% 0.18/0.41 cnf(i_0_26, negated_conjecture, (xsd_string(esk2_0)|rq(esk3_0,esk8_0))).
% 0.18/0.41 cnf(i_0_32, negated_conjecture, (X1=X2|X1=X3|X1=X4|X1=X5|X2=X3|X2=X4|X2=X5|X3=X4|X3=X5|X4=X5|xsd_integer(esk2_0)|~rr(esk3_0,X5)|~rr(esk3_0,X4)|~rr(esk3_0,X3)|~rr(esk3_0,X2)|~rr(esk3_0,X1))).
% 0.18/0.41 cnf(i_0_22, negated_conjecture, (X1=X2|X1=X3|X1=X4|X1=X5|X2=X3|X2=X4|X2=X5|X3=X4|X3=X5|X4=X5|xsd_string(esk2_0)|~rr(esk3_0,X5)|~rr(esk3_0,X4)|~rr(esk3_0,X3)|~rr(esk3_0,X2)|~rr(esk3_0,X1))).
% 0.18/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.41 # Begin printing tableau
% 0.18/0.41 # Found 21 steps
% 0.18/0.41 cnf(i_0_28, negated_conjecture, (xsd_string(esk2_0)|rq(esk3_0,esk6_0)), inference(start_rule)).
% 0.18/0.41 cnf(i_0_78, plain, (xsd_string(esk2_0)), inference(extension_rule, [i_0_16])).
% 0.18/0.41 cnf(i_0_119, plain, (~xsd_integer(esk2_0)), inference(extension_rule, [i_0_36])).
% 0.18/0.41 cnf(i_0_518, plain, (rq(esk3_0,esk8_0)), inference(etableau_closure_rule, [i_0_518, ...])).
% 0.18/0.41 cnf(i_0_79, plain, (rq(esk3_0,esk6_0)), inference(extension_rule, [i_0_20])).
% 0.18/0.41 cnf(i_0_583, plain, (rr(esk3_0,esk6_0)), inference(extension_rule, [i_0_22])).
% 0.18/0.41 cnf(i_0_607, plain, (~rr(esk3_0,esk6_0)), inference(closure_rule, [i_0_583])).
% 0.18/0.41 cnf(i_0_608, plain, (~rr(esk3_0,esk6_0)), inference(closure_rule, [i_0_583])).
% 0.18/0.41 cnf(i_0_609, plain, (~rr(esk3_0,esk6_0)), inference(closure_rule, [i_0_583])).
% 0.18/0.41 cnf(i_0_610, plain, (~rr(esk3_0,esk6_0)), inference(closure_rule, [i_0_583])).
% 0.18/0.41 cnf(i_0_595, plain, (esk6_0=esk6_0), inference(etableau_closure_rule, [i_0_595, ...])).
% 0.18/0.41 cnf(i_0_596, plain, (esk6_0=esk6_0), inference(etableau_closure_rule, [i_0_596, ...])).
% 0.18/0.41 cnf(i_0_597, plain, (esk6_0=esk6_0), inference(etableau_closure_rule, [i_0_597, ...])).
% 0.18/0.41 cnf(i_0_598, plain, (esk6_0=esk6_0), inference(etableau_closure_rule, [i_0_598, ...])).
% 0.18/0.41 cnf(i_0_599, plain, (esk6_0=esk6_0), inference(etableau_closure_rule, [i_0_599, ...])).
% 0.18/0.41 cnf(i_0_600, plain, (esk6_0=esk6_0), inference(etableau_closure_rule, [i_0_600, ...])).
% 0.18/0.41 cnf(i_0_601, plain, (esk6_0=esk6_0), inference(etableau_closure_rule, [i_0_601, ...])).
% 0.18/0.41 cnf(i_0_602, plain, (esk6_0=esk6_0), inference(etableau_closure_rule, [i_0_602, ...])).
% 0.18/0.41 cnf(i_0_603, plain, (esk6_0=esk6_0), inference(etableau_closure_rule, [i_0_603, ...])).
% 0.18/0.41 cnf(i_0_604, plain, (esk6_0=esk6_0), inference(etableau_closure_rule, [i_0_604, ...])).
% 0.18/0.41 cnf(i_0_605, plain, (xsd_string(esk2_0)), inference(etableau_closure_rule, [i_0_605, ...])).
% 0.18/0.41 # End printing tableau
% 0.18/0.41 # SZS output end
% 0.18/0.41 # Branches closed with saturation will be marked with an "s"
% 0.18/0.41 8_0=esk8_0), inference(etableau_closure_rule, [i_0_633, ...])).
% 0.18/0.41 cnf(i_0_634, plain, (esk8_0=esk8_0), inference(etableau_closure_rule, [i_0_634, ...])).
% 0.18/0.41 cnf(i_0_635, plain, (xsd_string(esk2_0)), inference(etableau_closure_rule, [i_0_635, ...])).
% 0.18/0.41 # End printing tableau
% 0.18/0.41 # SZS output end
% 0.18/0.41 # Branches closed with saturation will be marked with an "s"
% 0.18/0.41 # Child (5665) has found a proof.
% 0.18/0.41
% 0.18/0.41 # Proof search is over...
% 0.18/0.41 # Freeing feature tree
%------------------------------------------------------------------------------