TSTP Solution File: KRS165+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KRS165+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 : n024.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:44 EDT 2022
% Result : Theorem 0.19s 0.36s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS165+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 : n024.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 19:32:04 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.36 # No SInE strategy applied
% 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.36 #
% 0.19/0.36 # Presaturation interreduction done
% 0.19/0.36 # Number of axioms: 13 Number of unprocessed: 13
% 0.19/0.36 # Tableaux proof search.
% 0.19/0.36 # APR header successfully linked.
% 0.19/0.36 # Hello from C++
% 0.19/0.36 # The folding up rule is enabled...
% 0.19/0.36 # Local unification is enabled...
% 0.19/0.36 # Any saturation attempts will use folding labels...
% 0.19/0.36 # 13 beginning clauses after preprocessing and clausification
% 0.19/0.36 # Creating start rules for all 8 conjectures.
% 0.19/0.36 # There are 8 start rule candidates:
% 0.19/0.36 # Found 1 unit axioms.
% 0.19/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.36 # 8 start rule tableaux created.
% 0.19/0.36 # 12 extension rule candidate clauses
% 0.19/0.36 # 1 unit axiom clauses
% 0.19/0.36
% 0.19/0.36 # Requested 8, 32 cores available to the main process.
% 0.19/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.36 # There were 4 total branch saturation attempts.
% 0.19/0.36 # There were 0 of these attempts blocked.
% 0.19/0.36 # There were 0 deferred branch saturation attempts.
% 0.19/0.36 # There were 0 free duplicated saturations.
% 0.19/0.36 # There were 4 total successful branch saturations.
% 0.19/0.36 # There were 0 successful branch saturations in interreduction.
% 0.19/0.36 # There were 0 successful branch saturations on the branch.
% 0.19/0.36 # There were 4 successful branch saturations after the branch.
% 0.19/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.36 # Begin clausification derivation
% 0.19/0.36
% 0.19/0.36 # End clausification derivation
% 0.19/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.36 cnf(i_0_1, plain, (~cowlNothing(X1))).
% 0.19/0.36 cnf(i_0_7, negated_conjecture, (xsd_string(esk2_0)|~cAutomobile(esk4_0)|~cCar(esk3_0)|~xsd_integer(esk2_0))).
% 0.19/0.36 cnf(i_0_11, negated_conjecture, (xsd_integer(esk2_0)|~cAutomobile(esk4_0)|~cCar(esk3_0)|~xsd_string(esk2_0))).
% 0.19/0.36 cnf(i_0_8, negated_conjecture, (cCar(esk4_0)|xsd_string(esk2_0)|~cCar(esk3_0)|~xsd_integer(esk2_0))).
% 0.19/0.36 cnf(i_0_9, negated_conjecture, (cAutomobile(esk3_0)|xsd_string(esk2_0)|~cAutomobile(esk4_0)|~xsd_integer(esk2_0))).
% 0.19/0.36 cnf(i_0_3, plain, (xsd_integer(X1)|xsd_string(X1))).
% 0.19/0.36 cnf(i_0_5, plain, (cCar(X1)|~cAutomobile(X1))).
% 0.19/0.36 cnf(i_0_4, plain, (~xsd_integer(X1)|~xsd_string(X1))).
% 0.19/0.36 cnf(i_0_6, plain, (cAutomobile(X1)|~cCar(X1))).
% 0.19/0.36 cnf(i_0_12, negated_conjecture, (cCar(esk4_0)|xsd_integer(esk2_0)|~cCar(esk3_0))).
% 0.19/0.37 cnf(i_0_13, negated_conjecture, (cAutomobile(esk3_0)|xsd_integer(esk2_0)|~cAutomobile(esk4_0))).
% 0.19/0.37 cnf(i_0_10, negated_conjecture, (cAutomobile(esk3_0)|cCar(esk4_0)|xsd_string(esk2_0))).
% 0.19/0.37 cnf(i_0_14, negated_conjecture, (cAutomobile(esk3_0)|cCar(esk4_0)|xsd_integer(esk2_0))).
% 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.37 # Begin printing tableau
% 0.19/0.37 # Found 7 steps
% 0.19/0.37 cnf(i_0_14, negated_conjecture, (cAutomobile(esk3_0)|cCar(esk4_0)|xsd_integer(esk2_0)), inference(start_rule)).
% 0.19/0.37 cnf(i_0_15, plain, (cAutomobile(esk3_0)), inference(extension_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_45, plain, (cCar(esk3_0)), inference(extension_rule, [i_0_12])).
% 0.19/0.37 cnf(i_0_16, plain, (cCar(esk4_0)), inference(etableau_closure_rule, [i_0_16, ...])).
% 0.19/0.37 cnf(i_0_17, plain, (xsd_integer(esk2_0)), inference(etableau_closure_rule, [i_0_17, ...])).
% 0.19/0.37 cnf(i_0_62, plain, (cCar(esk4_0)), inference(etableau_closure_rule, [i_0_62, ...])).
% 0.19/0.37 cnf(i_0_63, plain, (xsd_integer(esk2_0)), inference(etableau_closure_rule, [i_0_63, ...])).
% 0.19/0.37 # End printing tableau
% 0.19/0.37 # SZS output end
% 0.19/0.37 # Branches closed with saturation will be marked with an "s"
% 0.19/0.37 # There were 4 total branch saturation attempts.
% 0.19/0.37 # There were 0 of these attempts blocked.
% 0.19/0.37 # There were 0 deferred branch saturation attempts.
% 0.19/0.37 # There were 0 free duplicated saturations.
% 0.19/0.37 # There were 4 total successful branch saturations.
% 0.19/0.37 # There were 0 successful branch saturations in interreduction.
% 0.19/0.37 # There were 0 successful branch saturations on the branch.
% 0.19/0.37 # There were 4 successful branch saturations after the branch.
% 0.19/0.37 # There were 4 total branch saturation attempts.
% 0.19/0.37 # There were 0 of these attempts blocked.
% 0.19/0.37 # There were 0 deferred branch saturation attempts.
% 0.19/0.37 # There were 0 free duplicated saturations.
% 0.19/0.37 # There were 4 total successful branch saturations.
% 0.19/0.37 # There were 0 successful branch saturations in interreduction.
% 0.19/0.37 # There were 0 successful branch saturations on the branch.
% 0.19/0.37 # There were 4 successful branch saturations after the branch.
% 0.19/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.37 # Begin clausification derivation
% 0.19/0.37
% 0.19/0.37 # End clausification derivation
% 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.37 cnf(i_0_1, plain, (~cowlNothing(X1))).
% 0.19/0.37 cnf(i_0_7, negated_conjecture, (xsd_string(esk2_0)|~cAutomobile(esk4_0)|~cCar(esk3_0)|~xsd_integer(esk2_0))).
% 0.19/0.37 cnf(i_0_11, negated_conjecture, (xsd_integer(esk2_0)|~cAutomobile(esk4_0)|~cCar(esk3_0)|~xsd_string(esk2_0))).
% 0.19/0.37 cnf(i_0_8, negated_conjecture, (cCar(esk4_0)|xsd_string(esk2_0)|~cCar(esk3_0)|~xsd_integer(esk2_0))).
% 0.19/0.37 cnf(i_0_9, negated_conjecture, (cAutomobile(esk3_0)|xsd_string(esk2_0)|~cAutomobile(esk4_0)|~xsd_integer(esk2_0))).
% 0.19/0.37 cnf(i_0_3, plain, (xsd_integer(X1)|xsd_string(X1))).
% 0.19/0.37 cnf(i_0_5, plain, (cCar(X1)|~cAutomobile(X1))).
% 0.19/0.37 cnf(i_0_4, plain, (~xsd_integer(X1)|~xsd_string(X1))).
% 0.19/0.37 cnf(i_0_6, plain, (cAutomobile(X1)|~cCar(X1))).
% 0.19/0.37 cnf(i_0_12, negated_conjecture, (cCar(esk4_0)|xsd_integer(esk2_0)|~cCar(esk3_0))).
% 0.19/0.37 cnf(i_0_13, negated_conjecture, (cAutomobile(esk3_0)|xsd_integer(esk2_0)|~cAutomobile(esk4_0))).
% 0.19/0.37 cnf(i_0_10, negated_conjecture, (cAutomobile(esk3_0)|cCar(esk4_0)|xsd_string(esk2_0))).
% 0.19/0.37 cnf(i_0_14, negated_conjecture, (cAutomobile(esk3_0)|cCar(esk4_0)|xsd_integer(esk2_0))).
% 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.37 # Begin printing tableau
% 0.19/0.37 # Found 7 steps
% 0.19/0.37 cnf(i_0_13, negated_conjecture, (cAutomobile(esk3_0)|xsd_integer(esk2_0)|~cAutomobile(esk4_0)), inference(start_rule)).
% 0.19/0.37 cnf(i_0_21, plain, (cAutomobile(esk3_0)), inference(extension_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_45, plain, (cCar(esk3_0)), inference(extension_rule, [i_0_12])).
% 0.19/0.37 cnf(i_0_22, plain, (xsd_integer(esk2_0)), inference(etableau_closure_rule, [i_0_22, ...])).
% 0.19/0.37 cnf(i_0_23, plain, (~cAutomobile(esk4_0)), inference(etableau_closure_rule, [i_0_23, ...])).
% 0.19/0.37 cnf(i_0_62, plain, (cCar(esk4_0)), inference(etableau_closure_rule, [i_0_62, ...])).
% 0.19/0.37 cnf(i_0_63, plain, (xsd_integer(esk2_0)), inference(etableau_closure_rule, [i_0_63, ...])).
% 0.19/0.37 # End printing tableau
% 0.19/0.37 # SZS output end
% 0.19/0.37 # Branches closed with saturation will be marked with an "s"
% 0.19/0.37 # There were 4 total branch saturation attempts.
% 0.19/0.37 # There were 0 of these attempts blocked.
% 0.19/0.37 # There were 0 deferred branch saturation attempts.
% 0.19/0.37 # There were 0 free duplicated saturations.
% 0.19/0.37 # There were 4 total successful branch saturations.
% 0.19/0.37 # There were 0 successful branch saturations in interreduction.
% 0.19/0.37 # There were 0 successful branch saturations on the branch.
% 0.19/0.37 # There were 4 successful branch saturations after the branch.
% 0.19/0.37 # Child (22581) has found a proof.
% 0.19/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.37 # Begin clausification derivation
% 0.19/0.37
% 0.19/0.37 # End clausification derivation
% 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.37 cnf(i_0_1, plain, (~cowlNothing(X1))).
% 0.19/0.37 cnf(i_0_7, negated_conjecture, (xsd_string(esk2_0)|~cAutomobile(esk4_0)|~cCar(esk3_0)|~xsd_integer(esk2_0))).
% 0.19/0.37 cnf(i_0_11, negated_conjecture, (xsd_integer(esk2_0)|~cAutomobile(esk4_0)|~cCar(esk3_0)|~xsd_string(esk2_0))).
% 0.19/0.37 cnf(i_0_8, negated_conjecture, (cCar(esk4_0)|xsd_string(esk2_0)|~cCar(esk3_0)|~xsd_integer(esk2_0))).
% 0.19/0.37 cnf(i_0_9, negated_conjecture, (cAutomobile(esk3_0)|xsd_string(esk2_0)|~cAutomobile(esk4_0)|~xsd_integer(esk2_0))).
% 0.19/0.37 cnf(i_0_3, plain, (xsd_integer(X1)|xsd_string(X1))).
% 0.19/0.37 cnf(i_0_5, plain, (cCar(X1)|~cAutomobile(X1))).
% 0.19/0.37 cnf(i_0_4, plain, (~xsd_integer(X1)|~xsd_string(X1))).
% 0.19/0.37 cnf(i_0_6, plain, (cAutomobile(X1)|~cCar(X1))).
% 0.19/0.37 cnf(i_0_12, negated_conjecture, (cCar(esk4_0)|xsd_integer(esk2_0)|~cCar(esk3_0))).
% 0.19/0.37 cnf(i_0_13, negated_conjecture, (cAutomobile(esk3_0)|xsd_integer(esk2_0)|~cAutomobile(esk4_0))).
% 0.19/0.37 cnf(i_0_10, negated_conjecture, (cAutomobile(esk3_0)|cCar(esk4_0)|xsd_string(esk2_0))).
% 0.19/0.37 cnf(i_0_14, negated_conjecture, (cAutomobile(esk3_0)|cCar(esk4_0)|xsd_integer(esk2_0))).
% 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.37 # Begin printing tableau
% 0.19/0.37 # Found 7 steps
% 0.19/0.37 cnf(i_0_12, negated_conjecture, (cCar(esk4_0)|xsd_integer(esk2_0)|~cCar(esk3_0)), inference(start_rule)).
% 0.19/0.37 cnf(i_0_24, plain, (cCar(esk4_0)), inference(extension_rule, [i_0_6])).
% 0.19/0.37 cnf(i_0_49, plain, (cAutomobile(esk4_0)), inference(extension_rule, [i_0_13])).
% 0.19/0.37 cnf(i_0_25, plain, (xsd_integer(esk2_0)), inference(etableau_closure_rule, [i_0_25, ...])).
% 0.19/0.37 cnf(i_0_26, plain, (~cCar(esk3_0)), inference(etableau_closure_rule, [i_0_26, ...])).
% 0.19/0.37 cnf(i_0_63, plain, (cAutomobile(esk3_0)), inference(etableau_closure_rule, [i_0_63, ...])).
% 0.19/0.37 cnf(i_0_64, plain, (xsd_integer(esk2_0)), inference(etableau_closure_rule, [i_0_64, ...])).
% 0.19/0.37 # End printing tableau
% 0.19/0.37 # SZS output end
% 0.19/0.37 # Branches closed with saturation will be marked with an "s"
% 0.19/0.37
% 0.19/0.37 # Proof search is over...
% 0.19/0.37 # Freeing feature tree
%------------------------------------------------------------------------------