%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS037+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 : n023.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:23 EDT 2022 % Result : Satisfiable 0.14s 0.37s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : KRS037+1 : TPTP v8.1.0. Released v3.1.0. % 0.10/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.33 % Computer : n023.cluster.edu % 0.14/0.33 % Model : x86_64 x86_64 % 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.33 % Memory : 8042.1875MB % 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.33 % CPULimit : 300 % 0.14/0.33 % WCLimit : 600 % 0.14/0.33 % DateTime : Tue Jun 7 17:22:53 EDT 2022 % 0.14/0.33 % CPUTime : % 0.14/0.36 # No SInE strategy applied % 0.14/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.14/0.36 # and selection function SelectCQIPrecWNTNp. % 0.14/0.36 # % 0.14/0.36 # Presaturation interreduction done % 0.14/0.36 # Number of axioms: 19 Number of unprocessed: 19 % 0.14/0.36 # Tableaux proof search. % 0.14/0.36 # APR header successfully linked. % 0.14/0.36 # Hello from C++ % 0.14/0.37 # The folding up rule is enabled... % 0.14/0.37 # Local unification is enabled... % 0.14/0.37 # Any saturation attempts will use folding labels... % 0.14/0.37 # 19 beginning clauses after preprocessing and clausification % 0.14/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.14/0.37 # No conjectures. % 0.14/0.37 # There are 19 start rule candidates: % 0.14/0.37 # Found 2 unit axioms. % 0.14/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.37 # 19 start rule tableaux created. % 0.14/0.37 # 17 extension rule candidate clauses % 0.14/0.37 # 2 unit axiom clauses % 0.14/0.37 % 0.14/0.37 # Requested 8, 32 cores available to the main process. % 0.14/0.37 # 2231 Satisfiable branch % 0.14/0.37 # 2235 Satisfiable branch % 0.14/0.37 # 2237 Satisfiable branch % 0.14/0.37 # Satisfiable branch found. % 0.14/0.37 # There were 1 total branch saturation attempts. % 0.14/0.37 # There were 0 of these attempts blocked. % 0.14/0.37 # There were 0 deferred branch saturation attempts. % 0.14/0.37 # There were 0 free duplicated saturations. % 0.14/0.37 # There were 0 total successful branch saturations. % 0.14/0.37 # There were 0 successful branch saturations in interreduction. % 0.14/0.37 # There were 0 successful branch saturations on the branch. % 0.14/0.37 # There were 0 successful branch saturations after the branch. % 0.14/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.37 # Begin clausification derivation % 0.14/0.37 % 0.14/0.37 # End clausification derivation % 0.14/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.37 cnf(i_0_34, plain, (cSatisfiable(i2003_11_14_17_15_51999))). % 0.14/0.37 cnf(i_0_15, plain, (~cowlNothing(X1))). % 0.14/0.37 cnf(i_0_18, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.14/0.37 cnf(i_0_23, plain, (cp1(X1)|~cSatisfiable(X1))). % 0.14/0.37 cnf(i_0_17, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.14/0.37 cnf(i_0_24, plain, (cp1(esk2_1(X1))|~cSatisfiable(X1))). % 0.14/0.37 cnf(i_0_30, plain, (rf(X1,X2)|~rinvF(X2,X1))). % 0.14/0.37 cnf(i_0_32, plain, (rr(X1,X2)|~rinvR(X2,X1))). % 0.14/0.37 cnf(i_0_29, plain, (rinvF(X1,X2)|~rf(X2,X1))). % 0.14/0.37 cnf(i_0_31, plain, (rinvR(X1,X2)|~rr(X2,X1))). % 0.14/0.37 cnf(i_0_27, plain, (rr(X1,esk1_1(X1))|~cSatisfiable(X1))). % 0.14/0.37 cnf(i_0_26, plain, (rr(esk1_1(X1),esk2_1(X1))|~cSatisfiable(X1))). % 0.14/0.37 cnf(i_0_28, plain, (X1=X2|~rf(X3,X2)|~rf(X3,X1))). % 0.14/0.37 cnf(i_0_33, plain, (rr(X1,X2)|~rr(X3,X2)|~rr(X1,X3))). % 0.14/0.37 cnf(i_0_25, plain, (cp1(X1)|~rr(X2,X1)|~rinvR(esk2_1(X3),X2)|~cp1(X2)|~cSatisfiable(X3))). % 0.14/0.37 cnf(i_0_19, plain, (cSatisfiable(X1)|~rr(X2,X3)|~rr(X1,X2)|~cp1(esk4_3(X1,X2,X3))|~cp1(X3)|~cp1(X1))). % 0.14/0.37 cnf(i_0_21, plain, (cp1(esk3_3(X1,X2,X3))|cSatisfiable(X1)|~rr(X2,X3)|~rr(X1,X2)|~cp1(X3)|~cp1(X1))). % 0.14/0.37 cnf(i_0_22, plain, (rinvR(X1,esk3_3(X2,X3,X1))|cSatisfiable(X2)|~rr(X3,X1)|~rr(X2,X3)|~cp1(X2)|~cp1(X1))). % 0.14/0.37 cnf(i_0_20, plain, (rr(esk3_3(X1,X2,X3),esk4_3(X1,X2,X3))|cSatisfiable(X1)|~rr(X2,X3)|~rr(X1,X2)|~cp1(X3)|~cp1(X1))). % 0.14/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.37 # Begin printing tableau % 0.14/0.37 # Found 8 steps % 0.14/0.37 cnf(i_0_31, plain, (rinvR(esk2_1(i2003_11_14_17_15_51999),esk2_1(i2003_11_14_17_15_51999))|~rr(esk2_1(i2003_11_14_17_15_51999),esk2_1(i2003_11_14_17_15_51999))), inference(start_rule)). % 0.14/0.37 cnf(i_0_51, plain, (rinvR(esk2_1(i2003_11_14_17_15_51999),esk2_1(i2003_11_14_17_15_51999))), inference(extension_rule, [i_0_25])). % 0.14/0.37 cnf(i_0_177, plain, (~cSatisfiable(i2003_11_14_17_15_51999)), inference(closure_rule, [i_0_34])). % 0.14/0.37 cnf(i_0_173, plain, (cp1(esk4_3(esk2_1(i2003_11_14_17_15_51999),esk2_1(i2003_11_14_17_15_51999),esk2_1(i2003_11_14_17_15_51999)))), inference(extension_rule, [i_0_19])). % 0.14/0.37 cnf(i_0_204, plain, (cSatisfiable(esk2_1(i2003_11_14_17_15_51999))), inference(extension_rule, [i_0_24])). % 0.14/0.37 cnf(i_0_205, plain, (~rr(esk2_1(i2003_11_14_17_15_51999),esk2_1(i2003_11_14_17_15_51999))), inference(extension_rule, [i_0_32])). % 0.14/0.37 cnf(i_0_227, plain, (~rinvR(esk2_1(i2003_11_14_17_15_51999),esk2_1(i2003_11_14_17_15_51999))), inference(closure_rule, [i_0_51])). % 0.14/0.37 cnf(i_0_206, plain, (~rr(esk2_1(i2003_11_14_17_15_51999),esk2_1(i2003_11_14_17_15_51999))), inference(closure_rule, [i_0_205])). % 0.14/0.37 # End printing tableau % 0.14/0.37 # SZS output end % 0.14/0.37 # Branches closed with saturation will be marked with an "s" % 0.14/0.37 # Satisfiable branch found. % 0.14/0.37 # There were 1 total branch saturation attempts. % 0.14/0.37 # There were 0 of these attempts blocked. % 0.14/0.37 # There were 0 deferred branch saturation attempts. % 0.14/0.37 # There were 0 free duplicated saturations. % 0.14/0.37 # There were 0 total successful branch saturations. % 0.14/0.37 # There were 0 successful branch saturations in interreduction. % 0.14/0.37 # There were 0 successful branch saturations on the branch. % 0.14/0.37 # There were 0 successful branch saturations after the branch. % 0.14/0.37 # Creating equality axioms % 0.14/0.37 # Ran out of tableaux, making start rules for all clauses % 0.14/0.37 # 2234 Satisfiable branch % 0.14/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.37 # Begin clausification derivation % 0.14/0.37 % 0.14/0.37 # End clausification derivation % 0.14/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.37 cnf(i_0_34, plain, (cSatisfiable(i2003_11_14_17_15_51999))). % 0.14/0.37 cnf(i_0_15, plain, (~cowlNothing(X1))). % 0.14/0.37 cnf(i_0_18, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.14/0.37 cnf(i_0_23, plain, (cp1(X1)|~cSatisfiable(X1))). % 0.14/0.37 cnf(i_0_17, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.14/0.37 cnf(i_0_24, plain, (cp1(esk2_1(X1))|~cSatisfiable(X1))). % 0.14/0.37 cnf(i_0_30, plain, (rf(X1,X2)|~rinvF(X2,X1))). % 0.14/0.37 cnf(i_0_32, plain, (rr(X1,X2)|~rinvR(X2,X1))). % 0.14/0.37 cnf(i_0_29, plain, (rinvF(X1,X2)|~rf(X2,X1))). % 0.14/0.37 cnf(i_0_31, plain, (rinvR(X1,X2)|~rr(X2,X1))). % 0.14/0.37 cnf(i_0_27, plain, (rr(X1,esk1_1(X1))|~cSatisfiable(X1))). % 0.14/0.37 cnf(i_0_26, plain, (rr(esk1_1(X1),esk2_1(X1))|~cSatisfiable(X1))). % 0.14/0.37 cnf(i_0_28, plain, (X1=X2|~rf(X3,X2)|~rf(X3,X1))). % 0.14/0.37 cnf(i_0_33, plain, (rr(X1,X2)|~rr(X3,X2)|~rr(X1,X3))). % 0.14/0.37 cnf(i_0_25, plain, (cp1(X1)|~rr(X2,X1)|~rinvR(esk2_1(X3),X2)|~cp1(X2)|~cSatisfiable(X3))). % 0.14/0.37 cnf(i_0_19, plain, (cSatisfiable(X1)|~rr(X2,X3)|~rr(X1,X2)|~cp1(esk4_3(X1,X2,X3))|~cp1(X3)|~cp1(X1))). % 0.14/0.37 cnf(i_0_21, plain, (cp1(esk3_3(X1,X2,X3))|cSatisfiable(X1)|~rr(X2,X3)|~rr(X1,X2)|~cp1(X3)|~cp1(X1))). % 0.14/0.37 cnf(i_0_22, plain, (rinvR(X1,esk3_3(X2,X3,X1))|cSatisfiable(X2)|~rr(X3,X1)|~rr(X2,X3)|~cp1(X2)|~cp1(X1))). % 0.14/0.37 cnf(i_0_20, plain, (rr(esk3_3(X1,X2,X3),esk4_3(X1,X2,X3))|cSatisfiable(X1)|~rr(X2,X3)|~rr(X1,X2)|~cp1(X3)|~cp1(X1))). % 0.14/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.37 # Begin printing tableau % 0.14/0.37 # Found 7 steps % 0.14/0.37 cnf(i_0_24, plain, (cp1(esk2_1(i2003_11_14_17_15_51999))|~cSatisfiable(i2003_11_14_17_15_51999)), inference(start_rule)). % 0.14/0.37 cnf(i_0_44, plain, (~cSatisfiable(i2003_11_14_17_15_51999)), inference(closure_rule, [i_0_34])). % 0.14/0.37 cnf(i_0_43, plain, (cp1(esk2_1(i2003_11_14_17_15_51999))), inference(extension_rule, [i_0_25])). % 0.14/0.37 cnf(i_0_122, plain, (~cSatisfiable(i2003_11_14_17_15_51999)), inference(closure_rule, [i_0_34])). % 0.14/0.37 cnf(i_0_118, plain, (cp1(esk4_3(esk2_1(i2003_11_14_17_15_51999),X6,esk2_1(i2003_11_14_17_15_51999)))), inference(extension_rule, [i_0_19])). % 0.14/0.37 cnf(i_0_153, plain, (~cp1(esk2_1(i2003_11_14_17_15_51999))), inference(closure_rule, [i_0_43])). % 0.14/0.37 cnf(i_0_154, plain, (~cp1(esk2_1(i2003_11_14_17_15_51999))), inference(closure_rule, [i_0_43])). % 0.14/0.37 # End printing tableau % 0.14/0.37 # SZS output end % 0.14/0.37 # Branches closed with saturation will be marked with an "s" % 0.14/0.37 # Satisfiable branch found. % 0.14/0.37 # There were 1 total branch saturation attempts. % 0.14/0.37 # There were 0 of these attempts blocked. % 0.14/0.37 # There were 0 deferred branch saturation attempts. % 0.14/0.37 # There were 0 free duplicated saturations. % 0.14/0.37 # There were 0 total successful branch saturations. % 0.14/0.37 # There were 0 successful branch saturations in interreduction. % 0.14/0.37 # There were 0 successful branch saturations on the branch. % 0.14/0.37 # There were 0 successful branch saturations after the branch. % 0.14/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.37 # Begin clausification derivation % 0.14/0.37 % 0.14/0.37 # End clausification derivation % 0.14/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.37 cnf(i_0_34, plain, (cSatisfiable(i2003_11_14_17_15_51999))). % 0.14/0.37 cnf(i_0_15, plain, (~cowlNothing(X1))). % 0.14/0.37 cnf(i_0_18, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.14/0.37 cnf(i_0_23, plain, (cp1(X1)|~cSatisfiable(X1))). % 0.14/0.37 cnf(i_0_17, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.14/0.37 cnf(i_0_24, plain, (cp1(esk2_1(X1))|~cSatisfiable(X1))). % 0.14/0.37 cnf(i_0_30, plain, (rf(X1,X2)|~rinvF(X2,X1))). % 0.14/0.37 cnf(i_0_32, plain, (rr(X1,X2)|~rinvR(X2,X1))). % 0.14/0.37 cnf(i_0_29, plain, (rinvF(X1,X2)|~rf(X2,X1))). % 0.14/0.37 cnf(i_0_31, plain, (rinvR(X1,X2)|~rr(X2,X1))). % 0.14/0.37 cnf(i_0_27, plain, (rr(X1,esk1_1(X1))|~cSatisfiable(X1))). % 0.14/0.37 cnf(i_0_26, plain, (rr(esk1_1(X1),esk2_1(X1))|~cSatisfiable(X1))). % 0.14/0.37 cnf(i_0_28, plain, (X1=X2|~rf(X3,X2)|~rf(X3,X1))). % 0.14/0.37 cnf(i_0_33, plain, (rr(X1,X2)|~rr(X3,X2)|~rr(X1,X3))). % 0.14/0.37 cnf(i_0_25, plain, (cp1(X1)|~rr(X2,X1)|~rinvR(esk2_1(X3),X2)|~cp1(X2)|~cSatisfiable(X3))). % 0.14/0.37 cnf(i_0_19, plain, (cSatisfiable(X1)|~rr(X2,X3)|~rr(X1,X2)|~cp1(esk4_3(X1,X2,X3))|~cp1(X3)|~cp1(X1))). % 0.14/0.37 cnf(i_0_21, plain, (cp1(esk3_3(X1,X2,X3))|cSatisfiable(X1)|~rr(X2,X3)|~rr(X1,X2)|~cp1(X3)|~cp1(X1))). % 0.14/0.37 cnf(i_0_22, plain, (rinvR(X1,esk3_3(X2,X3,X1))|cSatisfiable(X2)|~rr(X3,X1)|~rr(X2,X3)|~cp1(X2)|~cp1(X1))). % 0.14/0.37 cnf(i_0_20, plain, (rr(esk3_3(X1,X2,X3),esk4_3(X1,X2,X3))|cSatisfiable(X1)|~rr(X2,X3)|~rr(X1,X2)|~cp1(X3)|~cp1(X1))). % 0.14/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.37 # Begin printing tableau % 0.14/0.37 # Found 16 steps % 0.14/0.37 cnf(i_0_32, plain, (rr(esk1_1(i2003_11_14_17_15_51999),esk4_3(esk1_1(i2003_11_14_17_15_51999),esk2_1(i2003_11_14_17_15_51999),i2003_11_14_17_15_51999))|~rinvR(esk4_3(esk1_1(i2003_11_14_17_15_51999),esk2_1(i2003_11_14_17_15_51999),i2003_11_14_17_15_51999),esk1_1(i2003_11_14_17_15_51999))), inference(start_rule)). % 0.14/0.37 cnf(i_0_47, plain, (rr(esk1_1(i2003_11_14_17_15_51999),esk4_3(esk1_1(i2003_11_14_17_15_51999),esk2_1(i2003_11_14_17_15_51999),i2003_11_14_17_15_51999))), inference(extension_rule, [i_0_25])). % 0.14/0.37 cnf(i_0_122, plain, (~cSatisfiable(i2003_11_14_17_15_51999)), inference(closure_rule, [i_0_34])). % 0.14/0.37 cnf(i_0_118, plain, (cp1(esk4_3(esk1_1(i2003_11_14_17_15_51999),esk2_1(i2003_11_14_17_15_51999),i2003_11_14_17_15_51999))), inference(extension_rule, [i_0_19])). % 0.14/0.37 cnf(i_0_149, plain, (cSatisfiable(esk1_1(i2003_11_14_17_15_51999))), inference(extension_rule, [i_0_24])). % 0.14/0.37 cnf(i_0_150, plain, (~rr(esk2_1(i2003_11_14_17_15_51999),i2003_11_14_17_15_51999)), inference(extension_rule, [i_0_32])). % 0.14/0.37 cnf(i_0_151, plain, (~rr(esk1_1(i2003_11_14_17_15_51999),esk2_1(i2003_11_14_17_15_51999))), inference(extension_rule, [i_0_26])). % 0.14/0.37 cnf(i_0_188, plain, (~cSatisfiable(i2003_11_14_17_15_51999)), inference(closure_rule, [i_0_34])). % 0.14/0.37 cnf(i_0_153, plain, (~cp1(i2003_11_14_17_15_51999)), inference(extension_rule, [i_0_23])). % 0.14/0.37 cnf(i_0_192, plain, (~cSatisfiable(i2003_11_14_17_15_51999)), inference(closure_rule, [i_0_34])). % 0.14/0.37 cnf(i_0_154, plain, (~cp1(esk1_1(i2003_11_14_17_15_51999))), inference(extension_rule, [i_0_25])). % 0.14/0.37 cnf(i_0_232, plain, (~cp1(esk4_3(esk1_1(i2003_11_14_17_15_51999),esk2_1(i2003_11_14_17_15_51999),i2003_11_14_17_15_51999))), inference(closure_rule, [i_0_118])). % 0.14/0.37 cnf(i_0_233, plain, (~cSatisfiable(i2003_11_14_17_15_51999)), inference(closure_rule, [i_0_34])). % 0.14/0.37 cnf(i_0_120, plain, (~rinvR(esk2_1(i2003_11_14_17_15_51999),esk1_1(i2003_11_14_17_15_51999))), inference(extension_rule, [i_0_31])). % 0.14/0.37 cnf(i_0_243, plain, (~rr(esk1_1(i2003_11_14_17_15_51999),esk2_1(i2003_11_14_17_15_51999))), inference(extension_rule, [i_0_26])). % 0.14/0.37 cnf(i_0_289, plain, (~cSatisfiable(i2003_11_14_17_15_51999)), inference(closure_rule, [i_0_34])). % 0.14/0.37 # End printing tableau % 0.14/0.37 # SZS output end % 0.14/0.37 # Branches closed with saturation will be marked with an "s" % 0.14/0.37 # Satisfiable branch found. % 0.14/0.37 # There were 1 total branch saturation attempts. % 0.14/0.37 # There were 0 of these attempts blocked. % 0.14/0.37 # There were 0 deferred branch saturation attempts. % 0.14/0.37 # There were 0 free duplicated saturations. % 0.14/0.37 # There were 0 total successful branch saturations. % 0.14/0.37 # There were 0 successful branch saturations in interreduction. % 0.14/0.37 # There were 0 successful branch saturations on the branch. % 0.14/0.37 # There were 0 successful branch saturations after the branch. % 0.14/0.38 # Child (2235) has found a proof. % 0.14/0.38 % 0.14/0.38 # Proof search is over... % 0.14/0.38 # Freeing feature tree %------------------------------------------------------------------------------