TSTP Solution File: KRS163+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KRS163+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 : 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 03:00:43 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.12/0.12 % Problem : KRS163+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/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 : Tue Jun 7 16:31:21 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: 8 Number of unprocessed: 8
% 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 # 8 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 2 conjectures.
% 0.12/0.36 # There are 2 start rule candidates:
% 0.12/0.36 # Found 3 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 2 start rule tableaux created.
% 0.12/0.36 # 5 extension rule candidate clauses
% 0.12/0.36 # 3 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 2
% 0.12/0.36 # Creating equality axioms
% 0.12/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.36 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 10 tableaux to operate on
% 0.12/0.37 # There were 1 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 1 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 1 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_11, plain, (cA(ia))).
% 0.12/0.37 cnf(i_0_13, plain, (cB(ib))).
% 0.12/0.37 cnf(i_0_7, plain, (~cowlNothing(X1))).
% 0.12/0.37 cnf(i_0_17, negated_conjecture, (ib=ia|xsd_integer(esk2_0)|cowlNothing(esk1_0)|~xsd_string(esk2_0))).
% 0.12/0.37 cnf(i_0_16, negated_conjecture, (ib=ia|xsd_string(esk2_0)|cowlNothing(esk1_0)|~xsd_integer(esk2_0))).
% 0.12/0.37 cnf(i_0_9, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.12/0.37 cnf(i_0_10, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.12/0.37 cnf(i_0_15, plain, (~cB(X1)|~cA(X1))).
% 0.12/0.37 cnf(i_0_110, plain, (X21=X21)).
% 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 5 steps
% 0.12/0.37 cnf(i_0_11, plain, (cA(ia)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_119, plain, (cA(ia)), inference(extension_rule, [i_0_114])).
% 0.12/0.37 cnf(i_0_158, plain, (cA(ia)), inference(extension_rule, [i_0_15])).
% 0.12/0.37 cnf(i_0_159, plain, ($false), inference(closure_rule, [i_0_110])).
% 0.12/0.37 cnf(i_0_177, plain, (~cB(ia)), inference(etableau_closure_rule, [i_0_177, ...])).
% 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 1 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 1 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 1 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_11, plain, (cA(ia))).
% 0.12/0.37 cnf(i_0_13, plain, (cB(ib))).
% 0.12/0.37 cnf(i_0_7, plain, (~cowlNothing(X1))).
% 0.12/0.37 cnf(i_0_17, negated_conjecture, (ib=ia|xsd_integer(esk2_0)|cowlNothing(esk1_0)|~xsd_string(esk2_0))).
% 0.12/0.37 cnf(i_0_16, negated_conjecture, (ib=ia|xsd_string(esk2_0)|cowlNothing(esk1_0)|~xsd_integer(esk2_0))).
% 0.12/0.37 cnf(i_0_9, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.12/0.37 cnf(i_0_10, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.12/0.37 cnf(i_0_15, plain, (~cB(X1)|~cA(X1))).
% 0.12/0.37 cnf(i_0_110, plain, (X21=X21)).
% 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 5 steps
% 0.12/0.37 cnf(i_0_11, plain, (cA(ia)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_119, plain, (cA(ia)), inference(extension_rule, [i_0_15])).
% 0.12/0.37 cnf(i_0_141, plain, (~cB(ia)), inference(extension_rule, [i_0_115])).
% 0.12/0.37 cnf(i_0_199, plain, (~cB(ib)), inference(closure_rule, [i_0_13])).
% 0.12/0.37 cnf(i_0_198, plain, (ib!=ia), inference(etableau_closure_rule, [i_0_198, ...])).
% 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 1 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 1 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 1 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_11, plain, (cA(ia))).
% 0.12/0.37 cnf(i_0_13, plain, (cB(ib))).
% 0.12/0.37 cnf(i_0_7, plain, (~cowlNothing(X1))).
% 0.12/0.37 cnf(i_0_17, negated_conjecture, (ib=ia|xsd_integer(esk2_0)|cowlNothing(esk1_0)|~xsd_string(esk2_0))).
% 0.12/0.37 cnf(i_0_16, negated_conjecture, (ib=ia|xsd_string(esk2_0)|cowlNothing(esk1_0)|~xsd_integer(esk2_0))).
% 0.12/0.37 cnf(i_0_9, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.12/0.37 cnf(i_0_10, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.12/0.37 cnf(i_0_15, plain, (~cB(X1)|~cA(X1))).
% 0.12/0.37 cnf(i_0_110, plain, (X21=X21)).
% 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 5 steps
% 0.12/0.37 cnf(i_0_13, plain, (cB(ib)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_120, plain, (cB(ib)), inference(extension_rule, [i_0_15])).
% 0.12/0.37 cnf(i_0_178, plain, (~cA(ib)), inference(extension_rule, [i_0_114])).
% 0.12/0.37 cnf(i_0_200, plain, (~cA(ia)), inference(closure_rule, [i_0_11])).
% 0.12/0.37 cnf(i_0_199, plain, (ia!=ib), inference(etableau_closure_rule, [i_0_199, ...])).
% 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 (19049) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------