TSTP Solution File: KRS135+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KRS135+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:38 EDT 2022
% Result : Theorem 0.21s 0.38s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : KRS135+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 7 18:28:21 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.38 # No SInE strategy applied
% 0.21/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.21/0.38 #
% 0.21/0.38 # Presaturation interreduction done
% 0.21/0.38 # Number of axioms: 8 Number of unprocessed: 8
% 0.21/0.38 # Tableaux proof search.
% 0.21/0.38 # APR header successfully linked.
% 0.21/0.38 # Hello from C++
% 0.21/0.38 # The folding up rule is enabled...
% 0.21/0.38 # Local unification is enabled...
% 0.21/0.38 # Any saturation attempts will use folding labels...
% 0.21/0.38 # 8 beginning clauses after preprocessing and clausification
% 0.21/0.38 # Creating start rules for all 4 conjectures.
% 0.21/0.38 # There are 4 start rule candidates:
% 0.21/0.38 # Found 1 unit axioms.
% 0.21/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.21/0.38 # 4 start rule tableaux created.
% 0.21/0.38 # 7 extension rule candidate clauses
% 0.21/0.38 # 1 unit axiom clauses
% 0.21/0.38
% 0.21/0.38 # Requested 8, 32 cores available to the main process.
% 0.21/0.38 # There are not enough tableaux to fork, creating more from the initial 4
% 0.21/0.38 # There were 4 total branch saturation attempts.
% 0.21/0.38 # There were 0 of these attempts blocked.
% 0.21/0.38 # There were 0 deferred branch saturation attempts.
% 0.21/0.38 # There were 0 free duplicated saturations.
% 0.21/0.38 # There were 4 total successful branch saturations.
% 0.21/0.38 # There were 0 successful branch saturations in interreduction.
% 0.21/0.38 # There were 0 successful branch saturations on the branch.
% 0.21/0.38 # There were 4 successful branch saturations after the branch.
% 0.21/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38 # Begin clausification derivation
% 0.21/0.38
% 0.21/0.38 # End clausification derivation
% 0.21/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.38 cnf(i_0_1, plain, (~cowlNothing(X1))).
% 0.21/0.38 cnf(i_0_6, negated_conjecture, (xsd_string(esk2_0)|~cA(esk4_0)|~xsd_integer(esk2_0))).
% 0.21/0.38 cnf(i_0_8, negated_conjecture, (xsd_integer(esk2_0)|~cA(esk4_0)|~xsd_string(esk2_0))).
% 0.21/0.38 cnf(i_0_7, negated_conjecture, (rprop(esk3_0,esk4_0)|xsd_string(esk2_0)|~xsd_integer(esk2_0))).
% 0.21/0.38 cnf(i_0_9, negated_conjecture, (rprop(esk3_0,esk4_0)|xsd_integer(esk2_0)|~xsd_string(esk2_0))).
% 0.21/0.38 cnf(i_0_3, plain, (xsd_integer(X1)|xsd_string(X1))).
% 0.21/0.38 cnf(i_0_5, plain, (cA(X1)|~rprop(X2,X1))).
% 0.21/0.38 cnf(i_0_4, plain, (~xsd_integer(X1)|~xsd_string(X1))).
% 0.21/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.38 # Begin printing tableau
% 0.21/0.38 # Found 7 steps
% 0.21/0.38 cnf(i_0_6, negated_conjecture, (xsd_string(esk2_0)|~cA(esk4_0)|~xsd_integer(esk2_0)), inference(start_rule)).
% 0.21/0.38 cnf(i_0_20, plain, (~cA(esk4_0)), inference(extension_rule, [i_0_5])).
% 0.21/0.38 cnf(i_0_205, plain, (~rprop(esk3_0,esk4_0)), inference(extension_rule, [i_0_9])).
% 0.21/0.38 cnf(i_0_19, plain, (xsd_string(esk2_0)), inference(etableau_closure_rule, [i_0_19, ...])).
% 0.21/0.38 cnf(i_0_21, plain, (~xsd_integer(esk2_0)), inference(etableau_closure_rule, [i_0_21, ...])).
% 0.21/0.38 cnf(i_0_263, plain, (xsd_integer(esk2_0)), inference(etableau_closure_rule, [i_0_263, ...])).
% 0.21/0.38 cnf(i_0_264, plain, (~xsd_string(esk2_0)), inference(etableau_closure_rule, [i_0_264, ...])).
% 0.21/0.38 # End printing tableau
% 0.21/0.38 # SZS output end
% 0.21/0.38 # Branches closed with saturation will be marked with an "s"
% 0.21/0.38 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.38 # We now have 4 tableaux to operate on
% 0.21/0.38 # Found closed tableau during pool population.
% 0.21/0.38 # Proof search is over...
% 0.21/0.38 # Freeing feature tree
%------------------------------------------------------------------------------