TSTP Solution File: KRS152+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KRS152+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:41 EDT 2022
% Result : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS152+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/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.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 7 09:09:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 27 Number of unprocessed: 27
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 27 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 2 conjectures.
% 0.13/0.38 # There are 2 start rule candidates:
% 0.13/0.38 # Found 7 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 2 start rule tableaux created.
% 0.13/0.38 # 20 extension rule candidate clauses
% 0.13/0.38 # 7 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 2
% 0.13/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.38 # Returning from population with 28 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 28 tableaux to operate on
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 1 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 1 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_27, plain, (cC2(iV21081))).
% 0.13/0.38 cnf(i_0_28, plain, (cC4(iV21081))).
% 0.13/0.38 cnf(i_0_20, plain, (cTEST(iV21080))).
% 0.13/0.38 cnf(i_0_24, plain, (rR1(iV21080,iV21081))).
% 0.13/0.38 cnf(i_0_25, plain, (~cC6(iV21081))).
% 0.13/0.38 cnf(i_0_23, plain, (~cC8(iV21080))).
% 0.13/0.38 cnf(i_0_1, plain, (~cowlNothing(X1))).
% 0.13/0.38 cnf(i_0_29, negated_conjecture, (xsd_string(esk4_0)|~cC12(iV21080)|~cC10(iV21081)|~xsd_integer(esk4_0))).
% 0.13/0.38 cnf(i_0_4, plain, (~xsd_integer(X1)|~xsd_string(X1))).
% 0.13/0.38 cnf(i_0_13, plain, (~cC6(X1)|~cC2(X1))).
% 0.13/0.38 cnf(i_0_18, plain, (~cTEST(X1)|~cC8(X1))).
% 0.13/0.38 cnf(i_0_22, plain, (~cC6(X1)|~rR1(iV21080,X1))).
% 0.13/0.38 cnf(i_0_30, negated_conjecture, (~cC12(iV21080)|~cC10(iV21081)|~xsd_string(esk4_0))).
% 0.13/0.38 cnf(i_0_3, plain, (xsd_integer(X1)|xsd_string(X1))).
% 0.13/0.38 cnf(i_0_19, plain, (cC12(X1)|~cTEST(X1))).
% 0.13/0.38 cnf(i_0_7, plain, (cC2(X1)|~cC10(X1))).
% 0.13/0.38 cnf(i_0_6, plain, (cC4(X1)|~cC10(X1))).
% 0.13/0.38 cnf(i_0_12, plain, (cC4(X1)|~cC6(X1))).
% 0.13/0.38 cnf(i_0_5, plain, (cC10(X1)|~cC4(X1)|~cC2(X1))).
% 0.13/0.38 cnf(i_0_8, plain, (cC12(X1)|~rR1(X1,X2)|~cC10(X2))).
% 0.13/0.38 cnf(i_0_14, plain, (cC8(X1)|~cC6(X2)|~rR1(X1,X2))).
% 0.13/0.38 cnf(i_0_11, plain, (cC6(X1)|cC2(X1)|~cC4(X1))).
% 0.13/0.38 cnf(i_0_9, plain, (cC10(esk1_1(X1))|~cC12(X1))).
% 0.13/0.38 cnf(i_0_17, plain, (cTEST(X1)|cC8(X1)|~cC12(X1))).
% 0.13/0.38 cnf(i_0_15, plain, (cC6(esk2_1(X1))|~cC8(X1))).
% 0.13/0.38 cnf(i_0_10, plain, (rR1(X1,esk1_1(X1))|~cC12(X1))).
% 0.13/0.38 cnf(i_0_16, plain, (rR1(X1,esk2_1(X1))|~cC8(X1))).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 6 steps
% 0.13/0.38 cnf(i_0_27, plain, (cC2(iV21081)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_1526, plain, (cC2(iV21081)), inference(extension_rule, [i_0_5])).
% 0.13/0.38 cnf(i_0_1600, plain, (~cC4(iV21081)), inference(closure_rule, [i_0_28])).
% 0.13/0.38 cnf(i_0_1599, plain, (cC10(iV21081)), inference(extension_rule, [i_0_8])).
% 0.13/0.38 cnf(i_0_1651, plain, (~rR1(iV21080,iV21081)), inference(closure_rule, [i_0_24])).
% 0.13/0.38 cnf(i_0_1650, plain, (cC12(iV21080)), inference(etableau_closure_rule, [i_0_1650, ...])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 1 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 1 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_27, plain, (cC2(iV21081))).
% 0.13/0.38 cnf(i_0_28, plain, (cC4(iV21081))).
% 0.13/0.38 cnf(i_0_20, plain, (cTEST(iV21080))).
% 0.13/0.38 cnf(i_0_24, plain, (rR1(iV21080,iV21081))).
% 0.13/0.38 cnf(i_0_25, plain, (~cC6(iV21081))).
% 0.13/0.38 cnf(i_0_23, plain, (~cC8(iV21080))).
% 0.13/0.38 cnf(i_0_1, plain, (~cowlNothing(X1))).
% 0.13/0.38 cnf(i_0_29, negated_conjecture, (xsd_string(esk4_0)|~cC12(iV21080)|~cC10(iV21081)|~xsd_integer(esk4_0))).
% 0.13/0.38 cnf(i_0_4, plain, (~xsd_integer(X1)|~xsd_string(X1))).
% 0.13/0.38 cnf(i_0_13, plain, (~cC6(X1)|~cC2(X1))).
% 0.13/0.38 cnf(i_0_18, plain, (~cTEST(X1)|~cC8(X1))).
% 0.13/0.38 cnf(i_0_22, plain, (~cC6(X1)|~rR1(iV21080,X1))).
% 0.13/0.38 cnf(i_0_30, negated_conjecture, (~cC12(iV21080)|~cC10(iV21081)|~xsd_string(esk4_0))).
% 0.13/0.38 cnf(i_0_3, plain, (xsd_integer(X1)|xsd_string(X1))).
% 0.13/0.38 cnf(i_0_19, plain, (cC12(X1)|~cTEST(X1))).
% 0.13/0.38 cnf(i_0_7, plain, (cC2(X1)|~cC10(X1))).
% 0.13/0.38 cnf(i_0_6, plain, (cC4(X1)|~cC10(X1))).
% 0.13/0.38 cnf(i_0_12, plain, (cC4(X1)|~cC6(X1))).
% 0.13/0.38 cnf(i_0_5, plain, (cC10(X1)|~cC4(X1)|~cC2(X1))).
% 0.13/0.38 cnf(i_0_8, plain, (cC12(X1)|~rR1(X1,X2)|~cC10(X2))).
% 0.13/0.38 cnf(i_0_14, plain, (cC8(X1)|~cC6(X2)|~rR1(X1,X2))).
% 0.13/0.38 cnf(i_0_11, plain, (cC6(X1)|cC2(X1)|~cC4(X1))).
% 0.13/0.38 cnf(i_0_9, plain, (cC10(esk1_1(X1))|~cC12(X1))).
% 0.13/0.38 cnf(i_0_17, plain, (cTEST(X1)|cC8(X1)|~cC12(X1))).
% 0.13/0.38 cnf(i_0_15, plain, (cC6(esk2_1(X1))|~cC8(X1))).
% 0.13/0.38 cnf(i_0_10, plain, (rR1(X1,esk1_1(X1))|~cC12(X1))).
% 0.13/0.38 cnf(i_0_16, plain, (rR1(X1,esk2_1(X1))|~cC8(X1))).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 6 steps
% 0.13/0.38 cnf(i_0_28, plain, (cC4(iV21081)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_1527, plain, (cC4(iV21081)), inference(extension_rule, [i_0_5])).
% 0.13/0.38 cnf(i_0_1649, plain, (~cC2(iV21081)), inference(closure_rule, [i_0_27])).
% 0.13/0.38 cnf(i_0_1647, plain, (cC10(iV21081)), inference(extension_rule, [i_0_8])).
% 0.13/0.38 cnf(i_0_1669, plain, (~rR1(iV21080,iV21081)), inference(closure_rule, [i_0_24])).
% 0.13/0.38 cnf(i_0_1668, plain, (cC12(iV21080)), inference(etableau_closure_rule, [i_0_1668, ...])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # Child (6100) has found a proof.
% 0.13/0.38
% 0.13/0.38 # Proof search is over...
% 0.13/0.38 # Freeing feature tree
%------------------------------------------------------------------------------