TSTP Solution File: KRS117+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KRS117+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 : n019.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:35 EDT 2022
% Result : Unsatisfiable 0.20s 0.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS117+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/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 : n019.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 06:09:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.13/0.38 # and selection function SelectCQIPrecWNTNp.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 28 Number of unprocessed: 28
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # 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 # 28 beginning clauses after preprocessing and clausification
% 0.13/0.38 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.13/0.38 # No conjectures.
% 0.13/0.38 # There are 28 start rule candidates:
% 0.13/0.38 # Found 2 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 28 start rule tableaux created.
% 0.13/0.38 # 26 extension rule candidate clauses
% 0.13/0.38 # 2 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.39 # There were 1 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 1 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 1 successful branch saturations after the branch.
% 0.13/0.39 # There were 1 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 1 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 1 successful branch saturations after the branch.
% 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # Begin clausification derivation
% 0.20/0.39
% 0.20/0.39 # End clausification derivation
% 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.39 cnf(i_0_47, plain, (cUnsatisfiable(i2003_11_14_17_21_37349))).
% 0.20/0.39 cnf(i_0_20, plain, (~cowlNothing(X1))).
% 0.20/0.39 cnf(i_0_23, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.20/0.39 cnf(i_0_31, plain, (~ra_Px1(X1,X2)|~cc(X1))).
% 0.20/0.39 cnf(i_0_35, plain, (cc(X1)|~cd(X1))).
% 0.20/0.39 cnf(i_0_22, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.20/0.39 cnf(i_0_29, plain, (ccxcomp(X1)|~cUnsatisfiable(X1))).
% 0.20/0.39 cnf(i_0_32, plain, (ccxcomp(X1)|~ra_Px1(X1,X2))).
% 0.20/0.39 cnf(i_0_43, plain, (rf(X1,X2)|~rinvF(X2,X1))).
% 0.20/0.39 cnf(i_0_45, plain, (rr(X1,X2)|~rinvR(X2,X1))).
% 0.20/0.39 cnf(i_0_28, plain, (ca_Vx3(X1)|~rinvR(X2,X1)|~cUnsatisfiable(X2))).
% 0.20/0.39 cnf(i_0_36, plain, (ccxcomp(esk5_1(X1))|~cd(X1))).
% 0.20/0.39 cnf(i_0_26, plain, (cd(esk1_1(X1))|~cUnsatisfiable(X1))).
% 0.20/0.39 cnf(i_0_39, plain, (cd(esk6_1(X1))|~ca_Vx3(X1))).
% 0.20/0.39 cnf(i_0_42, plain, (rinvF(X1,X2)|~rf(X2,X1))).
% 0.20/0.39 cnf(i_0_44, plain, (rinvR(X1,X2)|~rr(X2,X1))).
% 0.20/0.39 cnf(i_0_30, plain, (ra_Px1(X1,esk3_1(X1))|cc(X1))).
% 0.20/0.39 cnf(i_0_48, plain, (rr(X1,X2)|~rf(X1,X2))).
% 0.20/0.39 cnf(i_0_38, plain, (ca_Vx3(X1)|~rinvF(X1,X2)|~cd(X2))).
% 0.20/0.39 cnf(i_0_34, plain, (cd(X1)|~rf(X1,X2)|~ccxcomp(X2)|~cc(X1))).
% 0.20/0.39 cnf(i_0_33, plain, (ra_Px1(X1,esk4_1(X1))|~ccxcomp(X1))).
% 0.20/0.39 cnf(i_0_37, plain, (rf(X1,esk5_1(X1))|~cd(X1))).
% 0.20/0.39 cnf(i_0_27, plain, (rinvF(X1,esk1_1(X1))|~cUnsatisfiable(X1))).
% 0.20/0.39 cnf(i_0_40, plain, (rinvF(X1,esk6_1(X1))|~ca_Vx3(X1))).
% 0.20/0.39 cnf(i_0_41, plain, (X1=X2|~rf(X3,X2)|~rf(X3,X1))).
% 0.20/0.39 cnf(i_0_46, plain, (rr(X1,X2)|~rr(X3,X2)|~rr(X1,X3))).
% 0.20/0.39 cnf(i_0_24, plain, (cUnsatisfiable(X1)|~rinvF(X1,X2)|~cd(X2)|~ccxcomp(X1)|~ca_Vx3(esk2_1(X1)))).
% 0.20/0.39 cnf(i_0_25, plain, (rinvR(X1,esk2_1(X1))|cUnsatisfiable(X1)|~rinvF(X1,X2)|~cd(X2)|~ccxcomp(X1))).
% 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.39 # Begin printing tableau
% 0.20/0.39 # Found 4 steps
% 0.20/0.39 cnf(i_0_47, plain, (cUnsatisfiable(i2003_11_14_17_21_37349)), inference(start_rule)).
% 0.20/0.39 cnf(i_0_49, plain, (cUnsatisfiable(i2003_11_14_17_21_37349)), inference(extension_rule, [i_0_29])).
% 0.20/0.39 cnf(i_0_123, plain, (ccxcomp(i2003_11_14_17_21_37349)), inference(extension_rule, [i_0_33])).
% 0.20/0.39 cnf(i_0_439, plain, (ra_Px1(i2003_11_14_17_21_37349,esk4_1(i2003_11_14_17_21_37349))), inference(etableau_closure_rule, [i_0_439, ...])).
% 0.20/0.39 # End printing tableau
% 0.20/0.39 # SZS output end
% 0.20/0.39 # Branches closed with saturation will be marked with an "s"
% 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # Begin clausification derivation
% 0.20/0.39
% 0.20/0.39 # End clausification derivation
% 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.39 cnf(i_0_47, plain, (cUnsatisfiable(i2003_11_14_17_21_37349))).
% 0.20/0.39 cnf(i_0_20, plain, (~cowlNothing(X1))).
% 0.20/0.39 cnf(i_0_23, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.20/0.39 cnf(i_0_31, plain, (~ra_Px1(X1,X2)|~cc(X1))).
% 0.20/0.39 cnf(i_0_35, plain, (cc(X1)|~cd(X1))).
% 0.20/0.39 cnf(i_0_22, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.20/0.39 cnf(i_0_29, plain, (ccxcomp(X1)|~cUnsatisfiable(X1))).
% 0.20/0.39 cnf(i_0_32, plain, (ccxcomp(X1)|~ra_Px1(X1,X2))).
% 0.20/0.39 cnf(i_0_43, plain, (rf(X1,X2)|~rinvF(X2,X1))).
% 0.20/0.39 cnf(i_0_45, plain, (rr(X1,X2)|~rinvR(X2,X1))).
% 0.20/0.39 cnf(i_0_28, plain, (ca_Vx3(X1)|~rinvR(X2,X1)|~cUnsatisfiable(X2))).
% 0.20/0.39 cnf(i_0_36, plain, (ccxcomp(esk5_1(X1))|~cd(X1))).
% 0.20/0.39 cnf(i_0_26, plain, (cd(esk1_1(X1))|~cUnsatisfiable(X1))).
% 0.20/0.39 cnf(i_0_39, plain, (cd(esk6_1(X1))|~ca_Vx3(X1))).
% 0.20/0.39 cnf(i_0_42, plain, (rinvF(X1,X2)|~rf(X2,X1))).
% 0.20/0.39 cnf(i_0_44, plain, (rinvR(X1,X2)|~rr(X2,X1))).
% 0.20/0.39 cnf(i_0_30, plain, (ra_Px1(X1,esk3_1(X1))|cc(X1))).
% 0.20/0.39 cnf(i_0_48, plain, (rr(X1,X2)|~rf(X1,X2))).
% 0.20/0.39 cnf(i_0_38, plain, (ca_Vx3(X1)|~rinvF(X1,X2)|~cd(X2))).
% 0.20/0.39 cnf(i_0_34, plain, (cd(X1)|~rf(X1,X2)|~ccxcomp(X2)|~cc(X1))).
% 0.20/0.39 cnf(i_0_33, plain, (ra_Px1(X1,esk4_1(X1))|~ccxcomp(X1))).
% 0.20/0.39 cnf(i_0_37, plain, (rf(X1,esk5_1(X1))|~cd(X1))).
% 0.20/0.39 cnf(i_0_27, plain, (rinvF(X1,esk1_1(X1))|~cUnsatisfiable(X1))).
% 0.20/0.39 cnf(i_0_40, plain, (rinvF(X1,esk6_1(X1))|~ca_Vx3(X1))).
% 0.20/0.39 cnf(i_0_41, plain, (X1=X2|~rf(X3,X2)|~rf(X3,X1))).
% 0.20/0.39 cnf(i_0_46, plain, (rr(X1,X2)|~rr(X3,X2)|~rr(X1,X3))).
% 0.20/0.39 cnf(i_0_24, plain, (cUnsatisfiable(X1)|~rinvF(X1,X2)|~cd(X2)|~ccxcomp(X1)|~ca_Vx3(esk2_1(X1)))).
% 0.20/0.39 cnf(i_0_25, plain, (rinvR(X1,esk2_1(X1))|cUnsatisfiable(X1)|~rinvF(X1,X2)|~cd(X2)|~ccxcomp(X1))).
% 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.39 # Begin printing tableau
% 0.20/0.39 # Found 7 steps
% 0.20/0.39 cnf(i_0_31, plain, (~ra_Px1(i2003_11_14_17_21_37349,esk4_1(i2003_11_14_17_21_37349))|~cc(i2003_11_14_17_21_37349)), inference(start_rule)).
% 0.20/0.39 cnf(i_0_53, plain, (~ra_Px1(i2003_11_14_17_21_37349,esk4_1(i2003_11_14_17_21_37349))), inference(extension_rule, [i_0_33])).
% 0.20/0.39 cnf(i_0_156, plain, (~ccxcomp(i2003_11_14_17_21_37349)), inference(extension_rule, [i_0_29])).
% 0.20/0.39 cnf(i_0_166, plain, (~cUnsatisfiable(i2003_11_14_17_21_37349)), inference(closure_rule, [i_0_47])).
% 0.20/0.39 cnf(i_0_54, plain, (~cc(i2003_11_14_17_21_37349)), inference(extension_rule, [i_0_30])).
% 0.20/0.39 cnf(i_0_262, plain, (ra_Px1(i2003_11_14_17_21_37349,esk3_1(i2003_11_14_17_21_37349))), inference(extension_rule, [i_0_32])).
% 0.20/0.39 cnf(i_0_270, plain, (ccxcomp(i2003_11_14_17_21_37349)), inference(etableau_closure_rule, [i_0_270, ...])).
% 0.20/0.39 # End printing tableau
% 0.20/0.39 # SZS output end
% 0.20/0.39 # Branches closed with saturation will be marked with an "s"
% 0.20/0.39 # There were 1 total branch saturation attempts.
% 0.20/0.39 # There were 0 of these attempts blocked.
% 0.20/0.39 # There were 0 deferred branch saturation attempts.
% 0.20/0.39 # There were 0 free duplicated saturations.
% 0.20/0.39 # There were 1 total successful branch saturations.
% 0.20/0.39 # There were 0 successful branch saturations in interreduction.
% 0.20/0.39 # There were 0 successful branch saturations on the branch.
% 0.20/0.39 # There were 1 successful branch saturations after the branch.
% 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # Begin clausification derivation
% 0.20/0.39
% 0.20/0.39 # End clausification derivation
% 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.39 cnf(i_0_47, plain, (cUnsatisfiable(i2003_11_14_17_21_37349))).
% 0.20/0.39 cnf(i_0_20, plain, (~cowlNothing(X1))).
% 0.20/0.39 cnf(i_0_23, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.20/0.39 cnf(i_0_31, plain, (~ra_Px1(X1,X2)|~cc(X1))).
% 0.20/0.39 cnf(i_0_35, plain, (cc(X1)|~cd(X1))).
% 0.20/0.39 cnf(i_0_22, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.20/0.39 cnf(i_0_29, plain, (ccxcomp(X1)|~cUnsatisfiable(X1))).
% 0.20/0.39 cnf(i_0_32, plain, (ccxcomp(X1)|~ra_Px1(X1,X2))).
% 0.20/0.39 cnf(i_0_43, plain, (rf(X1,X2)|~rinvF(X2,X1))).
% 0.20/0.39 cnf(i_0_45, plain, (rr(X1,X2)|~rinvR(X2,X1))).
% 0.20/0.39 cnf(i_0_28, plain, (ca_Vx3(X1)|~rinvR(X2,X1)|~cUnsatisfiable(X2))).
% 0.20/0.39 cnf(i_0_36, plain, (ccxcomp(esk5_1(X1))|~cd(X1))).
% 0.20/0.39 cnf(i_0_26, plain, (cd(esk1_1(X1))|~cUnsatisfiable(X1))).
% 0.20/0.39 cnf(i_0_39, plain, (cd(esk6_1(X1))|~ca_Vx3(X1))).
% 0.20/0.39 cnf(i_0_42, plain, (rinvF(X1,X2)|~rf(X2,X1))).
% 0.20/0.39 cnf(i_0_44, plain, (rinvR(X1,X2)|~rr(X2,X1))).
% 0.20/0.39 cnf(i_0_30, plain, (ra_Px1(X1,esk3_1(X1))|cc(X1))).
% 0.20/0.39 cnf(i_0_48, plain, (rr(X1,X2)|~rf(X1,X2))).
% 0.20/0.39 cnf(i_0_38, plain, (ca_Vx3(X1)|~rinvF(X1,X2)|~cd(X2))).
% 0.20/0.39 cnf(i_0_34, plain, (cd(X1)|~rf(X1,X2)|~ccxcomp(X2)|~cc(X1))).
% 0.20/0.39 cnf(i_0_33, plain, (ra_Px1(X1,esk4_1(X1))|~ccxcomp(X1))).
% 0.20/0.39 cnf(i_0_37, plain, (rf(X1,esk5_1(X1))|~cd(X1))).
% 0.20/0.39 cnf(i_0_27, plain, (rinvF(X1,esk1_1(X1))|~cUnsatisfiable(X1))).
% 0.20/0.39 cnf(i_0_40, plain, (rinvF(X1,esk6_1(X1))|~ca_Vx3(X1))).
% 0.20/0.39 cnf(i_0_41, plain, (X1=X2|~rf(X3,X2)|~rf(X3,X1))).
% 0.20/0.39 cnf(i_0_46, plain, (rr(X1,X2)|~rr(X3,X2)|~rr(X1,X3))).
% 0.20/0.39 cnf(i_0_24, plain, (cUnsatisfiable(X1)|~rinvF(X1,X2)|~cd(X2)|~ccxcomp(X1)|~ca_Vx3(esk2_1(X1)))).
% 0.20/0.39 cnf(i_0_25, plain, (rinvR(X1,esk2_1(X1))|cUnsatisfiable(X1)|~rinvF(X1,X2)|~cd(X2)|~ccxcomp(X1))).
% 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.39 # Begin printing tableau
% 0.20/0.39 # Found 7 steps
% 0.20/0.39 cnf(i_0_35, plain, (cc(esk1_1(i2003_11_14_17_21_37349))|~cd(esk1_1(i2003_11_14_17_21_37349))), inference(start_rule)).
% 0.20/0.39 cnf(i_0_55, plain, (cc(esk1_1(i2003_11_14_17_21_37349))), inference(extension_rule, [i_0_31])).
% 0.20/0.39 cnf(i_0_117, plain, (~ra_Px1(esk1_1(i2003_11_14_17_21_37349),esk4_1(esk1_1(i2003_11_14_17_21_37349)))), inference(extension_rule, [i_0_33])).
% 0.20/0.39 cnf(i_0_158, plain, (~ccxcomp(esk1_1(i2003_11_14_17_21_37349))), inference(extension_rule, [i_0_29])).
% 0.20/0.39 cnf(i_0_56, plain, (~cd(esk1_1(i2003_11_14_17_21_37349))), inference(extension_rule, [i_0_26])).
% 0.20/0.39 cnf(i_0_249, plain, (~cUnsatisfiable(i2003_11_14_17_21_37349)), inference(closure_rule, [i_0_47])).
% 0.20/0.39 cnf(i_0_166, plain, (~cUnsatisfiable(esk1_1(i2003_11_14_17_21_37349))), inference(etableau_closure_rule, [i_0_166, ...])).
% 0.20/0.39 # End printing tableau
% 0.20/0.39 # SZS output end
% 0.20/0.39 # Branches closed with saturation will be marked with an "s"
% 0.20/0.39 # Child (9333) has found a proof.
% 0.20/0.39
% 0.20/0.39 # Proof search is over...
% 0.20/0.39 # Freeing feature tree
%------------------------------------------------------------------------------