TSTP Solution File: KRS119+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KRS119+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 : n028.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:36 EDT 2022
% Result : Unsatisfiable 0.21s 0.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : KRS119+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.36 % Computer : n028.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Tue Jun 7 08:40:59 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.39 # No SInE strategy applied
% 0.21/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.21/0.39 # and selection function SelectCQIPrecWNTNp.
% 0.21/0.39 #
% 0.21/0.39 # Presaturation interreduction done
% 0.21/0.39 # Number of axioms: 25 Number of unprocessed: 25
% 0.21/0.39 # Tableaux proof search.
% 0.21/0.39 # APR header successfully linked.
% 0.21/0.39 # Hello from C++
% 0.21/0.39 # The folding up rule is enabled...
% 0.21/0.39 # Local unification is enabled...
% 0.21/0.39 # Any saturation attempts will use folding labels...
% 0.21/0.39 # 25 beginning clauses after preprocessing and clausification
% 0.21/0.39 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.21/0.39 # No conjectures.
% 0.21/0.39 # There are 25 start rule candidates:
% 0.21/0.39 # Found 2 unit axioms.
% 0.21/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.21/0.39 # 25 start rule tableaux created.
% 0.21/0.39 # 23 extension rule candidate clauses
% 0.21/0.39 # 2 unit axiom clauses
% 0.21/0.39
% 0.21/0.39 # Requested 8, 32 cores available to the main process.
% 0.21/0.40 # There were 1 total branch saturation attempts.
% 0.21/0.40 # There were 0 of these attempts blocked.
% 0.21/0.40 # There were 0 deferred branch saturation attempts.
% 0.21/0.40 # There were 0 free duplicated saturations.
% 0.21/0.40 # There were 1 total successful branch saturations.
% 0.21/0.40 # There were 0 successful branch saturations in interreduction.
% 0.21/0.40 # There were 0 successful branch saturations on the branch.
% 0.21/0.40 # There were 1 successful branch saturations after the branch.
% 0.21/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.40 # Begin clausification derivation
% 0.21/0.40
% 0.21/0.40 # End clausification derivation
% 0.21/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.40 cnf(i_0_45, plain, (cUnsatisfiable(i2003_11_14_17_21_44786))).
% 0.21/0.40 cnf(i_0_20, plain, (~cowlNothing(X1))).
% 0.21/0.40 cnf(i_0_23, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.21/0.40 cnf(i_0_25, plain, (cp1(X1)|~cUnsatisfiable(X1))).
% 0.21/0.40 cnf(i_0_35, plain, (cp1(X1)|~ca_Ax2(X1))).
% 0.21/0.40 cnf(i_0_22, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.21/0.40 cnf(i_0_37, plain, (ca_Ax2(esk5_1(X1))|~ca_Vx3(X1))).
% 0.21/0.40 cnf(i_0_29, plain, (~ra_Px1(X1,X2)|~cp1(X1))).
% 0.21/0.40 cnf(i_0_30, plain, (cp1xcomp(X1)|~ra_Px1(X1,X2))).
% 0.21/0.40 cnf(i_0_41, plain, (rf(X1,X2)|~rinvF(X2,X1))).
% 0.21/0.40 cnf(i_0_43, plain, (rr(X1,X2)|~rinvR(X2,X1))).
% 0.21/0.40 cnf(i_0_26, plain, (ca_Vx3(esk1_1(X1))|~cUnsatisfiable(X1))).
% 0.21/0.40 cnf(i_0_40, plain, (rinvF(X1,X2)|~rf(X2,X1))).
% 0.21/0.40 cnf(i_0_42, plain, (rinvR(X1,X2)|~rr(X2,X1))).
% 0.21/0.40 cnf(i_0_32, plain, (ca_Ax2(X1)|~cp1xcomp(esk4_1(X1))|~cp1(X1))).
% 0.21/0.40 cnf(i_0_34, plain, (cp1xcomp(X1)|~rinvR(X2,X1)|~ca_Ax2(X2))).
% 0.21/0.40 cnf(i_0_28, plain, (ra_Px1(X1,esk2_1(X1))|cp1(X1))).
% 0.21/0.40 cnf(i_0_31, plain, (ra_Px1(X1,esk3_1(X1))|~cp1xcomp(X1))).
% 0.21/0.40 cnf(i_0_36, plain, (ca_Vx3(X1)|~rr(X1,X2)|~ca_Ax2(X2))).
% 0.21/0.40 cnf(i_0_27, plain, (rr(X1,esk1_1(X1))|~cUnsatisfiable(X1))).
% 0.21/0.40 cnf(i_0_38, plain, (rr(X1,esk5_1(X1))|~ca_Vx3(X1))).
% 0.21/0.40 cnf(i_0_39, plain, (X1=X2|~rf(X3,X2)|~rf(X3,X1))).
% 0.21/0.40 cnf(i_0_33, plain, (rinvR(X1,esk4_1(X1))|ca_Ax2(X1)|~cp1(X1))).
% 0.21/0.40 cnf(i_0_24, plain, (cUnsatisfiable(X1)|~rr(X1,X2)|~cp1(X1)|~ca_Vx3(X2))).
% 0.21/0.40 cnf(i_0_44, plain, (rr(X1,X2)|~rr(X3,X2)|~rr(X1,X3))).
% 0.21/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.40 # Begin printing tableau
% 0.21/0.40 # Found 4 steps
% 0.21/0.40 cnf(i_0_45, plain, (cUnsatisfiable(i2003_11_14_17_21_44786)), inference(start_rule)).
% 0.21/0.40 cnf(i_0_46, plain, (cUnsatisfiable(i2003_11_14_17_21_44786)), inference(extension_rule, [i_0_25])).
% 0.21/0.40 cnf(i_0_104, plain, (cp1(i2003_11_14_17_21_44786)), inference(extension_rule, [i_0_29])).
% 0.21/0.40 cnf(i_0_114, plain, (~ra_Px1(i2003_11_14_17_21_44786,X4)), inference(etableau_closure_rule, [i_0_114, ...])).
% 0.21/0.40 # End printing tableau
% 0.21/0.40 # SZS output end
% 0.21/0.40 # Branches closed with saturation will be marked with an "s"
% 0.21/0.40 # There were 1 total branch saturation attempts.
% 0.21/0.40 # There were 0 of these attempts blocked.
% 0.21/0.40 # There were 0 deferred branch saturation attempts.
% 0.21/0.40 # There were 0 free duplicated saturations.
% 0.21/0.40 # There were 1 total successful branch saturations.
% 0.21/0.40 # There were 0 successful branch saturations in interreduction.
% 0.21/0.40 # There were 0 successful branch saturations on the branch.
% 0.21/0.40 # There were 1 successful branch saturations after the branch.
% 0.21/0.40 # There were 1 total branch saturation attempts.
% 0.21/0.40 # There were 0 of these attempts blocked.
% 0.21/0.40 # There were 0 deferred branch saturation attempts.
% 0.21/0.40 # There were 0 free duplicated saturations.
% 0.21/0.40 # There were 1 total successful branch saturations.
% 0.21/0.40 # There were 0 successful branch saturations in interreduction.
% 0.21/0.40 # There were 0 successful branch saturations on the branch.
% 0.21/0.40 # There were 1 successful branch saturations after the branch.
% 0.21/0.40 # Child (31020) has found a proof.
% 0.21/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.40 # Begin clausification derivation
% 0.21/0.40
% 0.21/0.40 # End clausification derivation
% 0.21/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.40 cnf(i_0_45, plain, (cUnsatisfiable(i2003_11_14_17_21_44786))).
% 0.21/0.40 cnf(i_0_20, plain, (~cowlNothing(X1))).
% 0.21/0.40 cnf(i_0_23, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.21/0.40 cnf(i_0_25, plain, (cp1(X1)|~cUnsatisfiable(X1))).
% 0.21/0.40 cnf(i_0_35, plain, (cp1(X1)|~ca_Ax2(X1))).
% 0.21/0.40 cnf(i_0_22, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.21/0.40 cnf(i_0_37, plain, (ca_Ax2(esk5_1(X1))|~ca_Vx3(X1))).
% 0.21/0.40 cnf(i_0_29, plain, (~ra_Px1(X1,X2)|~cp1(X1))).
% 0.21/0.40 cnf(i_0_30, plain, (cp1xcomp(X1)|~ra_Px1(X1,X2))).
% 0.21/0.40 cnf(i_0_41, plain, (rf(X1,X2)|~rinvF(X2,X1))).
% 0.21/0.40 cnf(i_0_43, plain, (rr(X1,X2)|~rinvR(X2,X1))).
% 0.21/0.40 cnf(i_0_26, plain, (ca_Vx3(esk1_1(X1))|~cUnsatisfiable(X1))).
% 0.21/0.40 cnf(i_0_40, plain, (rinvF(X1,X2)|~rf(X2,X1))).
% 0.21/0.40 cnf(i_0_42, plain, (rinvR(X1,X2)|~rr(X2,X1))).
% 0.21/0.40 cnf(i_0_32, plain, (ca_Ax2(X1)|~cp1xcomp(esk4_1(X1))|~cp1(X1))).
% 0.21/0.40 cnf(i_0_34, plain, (cp1xcomp(X1)|~rinvR(X2,X1)|~ca_Ax2(X2))).
% 0.21/0.40 cnf(i_0_28, plain, (ra_Px1(X1,esk2_1(X1))|cp1(X1))).
% 0.21/0.40 cnf(i_0_31, plain, (ra_Px1(X1,esk3_1(X1))|~cp1xcomp(X1))).
% 0.21/0.40 cnf(i_0_36, plain, (ca_Vx3(X1)|~rr(X1,X2)|~ca_Ax2(X2))).
% 0.21/0.40 cnf(i_0_27, plain, (rr(X1,esk1_1(X1))|~cUnsatisfiable(X1))).
% 0.21/0.40 cnf(i_0_38, plain, (rr(X1,esk5_1(X1))|~ca_Vx3(X1))).
% 0.21/0.40 cnf(i_0_39, plain, (X1=X2|~rf(X3,X2)|~rf(X3,X1))).
% 0.21/0.40 cnf(i_0_33, plain, (rinvR(X1,esk4_1(X1))|ca_Ax2(X1)|~cp1(X1))).
% 0.21/0.40 cnf(i_0_24, plain, (cUnsatisfiable(X1)|~rr(X1,X2)|~cp1(X1)|~ca_Vx3(X2))).
% 0.21/0.40 cnf(i_0_44, plain, (rr(X1,X2)|~rr(X3,X2)|~rr(X1,X3))).
% 0.21/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.40 # Begin printing tableau
% 0.21/0.40 # Found 5 steps
% 0.21/0.40 cnf(i_0_25, plain, (cp1(i2003_11_14_17_21_44786)|~cUnsatisfiable(i2003_11_14_17_21_44786)), inference(start_rule)).
% 0.21/0.40 cnf(i_0_51, plain, (~cUnsatisfiable(i2003_11_14_17_21_44786)), inference(closure_rule, [i_0_45])).
% 0.21/0.40 cnf(i_0_50, plain, (cp1(i2003_11_14_17_21_44786)), inference(extension_rule, [i_0_29])).
% 0.21/0.40 cnf(i_0_112, plain, (~ra_Px1(i2003_11_14_17_21_44786,esk3_1(i2003_11_14_17_21_44786))), inference(extension_rule, [i_0_31])).
% 0.21/0.40 cnf(i_0_145, plain, (~cp1xcomp(i2003_11_14_17_21_44786)), inference(etableau_closure_rule, [i_0_145, ...])).
% 0.21/0.40 # End printing tableau
% 0.21/0.40 # SZS output end
% 0.21/0.40 # Branches closed with saturation will be marked with an "s"
% 0.21/0.40
% 0.21/0.40 # Proof search is over...
% 0.21/0.40 # Freeing feature tree
%------------------------------------------------------------------------------