%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS070+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 : n029.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:27 EDT 2022 % Result : Unsatisfiable 0.16s 0.41s % Output : CNFRefutation 0.16s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.14 % Problem : KRS070+1 : TPTP v8.1.0. Released v3.1.0. % 0.14/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.16/0.37 % Computer : n029.cluster.edu % 0.16/0.37 % Model : x86_64 x86_64 % 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.37 % Memory : 8042.1875MB % 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.37 % CPULimit : 300 % 0.16/0.37 % WCLimit : 600 % 0.16/0.37 % DateTime : Tue Jun 7 10:37:05 EDT 2022 % 0.16/0.37 % CPUTime : % 0.16/0.40 # No SInE strategy applied % 0.16/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.16/0.40 # and selection function SelectCQIPrecWNTNp. % 0.16/0.40 # % 0.16/0.40 # Presaturation interreduction done % 0.16/0.40 # Number of axioms: 25 Number of unprocessed: 25 % 0.16/0.40 # Tableaux proof search. % 0.16/0.40 # APR header successfully linked. % 0.16/0.40 # Hello from C++ % 0.16/0.40 # The folding up rule is enabled... % 0.16/0.40 # Local unification is enabled... % 0.16/0.40 # Any saturation attempts will use folding labels... % 0.16/0.40 # 25 beginning clauses after preprocessing and clausification % 0.16/0.40 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.16/0.40 # No conjectures. % 0.16/0.40 # There are 25 start rule candidates: % 0.16/0.40 # Found 2 unit axioms. % 0.16/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.16/0.40 # 25 start rule tableaux created. % 0.16/0.40 # 23 extension rule candidate clauses % 0.16/0.40 # 2 unit axiom clauses % 0.16/0.40 % 0.16/0.40 # Requested 8, 32 cores available to the main process. % 0.16/0.41 # Creating equality axioms % 0.16/0.41 # Ran out of tableaux, making start rules for all clauses % 0.16/0.41 # Creating equality axioms % 0.16/0.41 # Ran out of tableaux, making start rules for all clauses % 0.16/0.41 # Creating equality axioms % 0.16/0.41 # Ran out of tableaux, making start rules for all clauses % 0.16/0.41 # There were 1 total branch saturation attempts. % 0.16/0.41 # There were 0 of these attempts blocked. % 0.16/0.41 # There were 0 deferred branch saturation attempts. % 0.16/0.41 # There were 0 free duplicated saturations. % 0.16/0.41 # There were 1 total successful branch saturations. % 0.16/0.41 # There were 0 successful branch saturations in interreduction. % 0.16/0.41 # There were 0 successful branch saturations on the branch. % 0.16/0.41 # There were 1 successful branch saturations after the branch. % 0.16/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.16/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.16/0.41 # Begin clausification derivation % 0.16/0.41 % 0.16/0.41 # End clausification derivation % 0.16/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.16/0.41 cnf(i_0_45, plain, (cUnsatisfiable(i2003_11_14_17_18_32242))). % 0.16/0.41 cnf(i_0_28, plain, (~cowlNothing(X1))). % 0.16/0.41 cnf(i_0_31, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.16/0.41 cnf(i_0_30, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.16/0.41 cnf(i_0_35, plain, (cc1(esk2_1(X1))|~cUnsatisfiable(X1))). % 0.16/0.41 cnf(i_0_38, plain, (cc2(esk1_1(X1))|~cUnsatisfiable(X1))). % 0.16/0.41 cnf(i_0_46, plain, (rrx(X1,X2)|~rrx3(X1,X2))). % 0.16/0.41 cnf(i_0_53, plain, (rrx(X1,X2)|~rrx4(X1,X2))). % 0.16/0.41 cnf(i_0_52, plain, (rrx1(X1,X2)|~rrx3(X1,X2))). % 0.16/0.41 cnf(i_0_50, plain, (rrx1a(X1,X2)|~rrx3a(X1,X2))). % 0.16/0.41 cnf(i_0_49, plain, (rrx2(X1,X2)|~rrx4(X1,X2))). % 0.16/0.41 cnf(i_0_51, plain, (rrx2a(X1,X2)|~rrx4a(X1,X2))). % 0.16/0.41 cnf(i_0_47, plain, (rrxa(X1,X2)|~rrx3a(X1,X2))). % 0.16/0.41 cnf(i_0_48, plain, (rrxa(X1,X2)|~rrx4a(X1,X2))). % 0.16/0.41 cnf(i_0_36, plain, (rrx3(X1,esk2_1(X1))|~cUnsatisfiable(X1))). % 0.16/0.41 cnf(i_0_39, plain, (rrx4(X1,esk1_1(X1))|~cUnsatisfiable(X1))). % 0.16/0.41 cnf(i_0_37, plain, (~rrx3(X1,X2)|~cc2(X2)|~cc1(X2)|~cUnsatisfiable(X1))). % 0.16/0.41 cnf(i_0_40, plain, (X1=X2|~rrx(X3,X2)|~rrx(X3,X1))). % 0.16/0.41 cnf(i_0_41, plain, (X1=X2|~rrx3(X3,X2)|~rrx3(X3,X1))). % 0.16/0.41 cnf(i_0_42, plain, (X1=X2|~rrx3a(X3,X2)|~rrx3a(X3,X1))). % 0.16/0.41 cnf(i_0_43, plain, (X1=X2|~rrx4(X3,X2)|~rrx4(X3,X1))). % 0.16/0.41 cnf(i_0_44, plain, (X1=X2|~rrx4a(X3,X2)|~rrx4a(X3,X1))). % 0.16/0.41 cnf(i_0_32, plain, (cc1(esk3_1(X1))|cUnsatisfiable(X1)|~rrx4(X1,X2)|~rrx3(X1,X3)|~cc2(X2)|~cc1(X3))). % 0.16/0.41 cnf(i_0_33, plain, (cc2(esk3_1(X1))|cUnsatisfiable(X1)|~rrx4(X1,X2)|~rrx3(X1,X3)|~cc2(X2)|~cc1(X3))). % 0.16/0.41 cnf(i_0_34, plain, (rrx3(X1,esk3_1(X1))|cUnsatisfiable(X1)|~rrx4(X1,X2)|~rrx3(X1,X3)|~cc2(X2)|~cc1(X3))). % 0.16/0.41 cnf(i_0_316, plain, (X122=X122)). % 0.16/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.16/0.41 # Begin printing tableau % 0.16/0.41 # Found 5 steps % 0.16/0.41 cnf(i_0_316, plain, (i2003_11_14_17_18_32242=i2003_11_14_17_18_32242), inference(start_rule)). % 0.16/0.41 cnf(i_0_403, plain, (i2003_11_14_17_18_32242=i2003_11_14_17_18_32242), inference(extension_rule, [i_0_320])). % 0.16/0.41 cnf(i_0_478, plain, (~cUnsatisfiable(i2003_11_14_17_18_32242)), inference(closure_rule, [i_0_45])). % 0.16/0.41 cnf(i_0_476, plain, (cUnsatisfiable(i2003_11_14_17_18_32242)), inference(extension_rule, [i_0_35])). % 0.16/0.41 cnf(i_0_483, plain, (cc1(esk2_1(i2003_11_14_17_18_32242))), inference(etableau_closure_rule, [i_0_483, ...])). % 0.16/0.41 # End printing tableau % 0.16/0.41 # SZS output end % 0.16/0.41 # Branches closed with saturation will be marked with an "s" % 0.16/0.41 # There were 1 total branch saturation attempts. % 0.16/0.41 # There were 0 of these attempts blocked. % 0.16/0.41 # There were 0 deferred branch saturation attempts. % 0.16/0.41 # There were 0 free duplicated saturations. % 0.16/0.41 # There were 1 total successful branch saturations. % 0.16/0.41 # There were 0 successful branch saturations in interreduction. % 0.16/0.41 # There were 0 successful branch saturations on the branch. % 0.16/0.41 # There were 1 successful branch saturations after the branch. % 0.16/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.16/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.16/0.41 # Begin clausification derivation % 0.16/0.41 % 0.16/0.41 # End clausification derivation % 0.16/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.16/0.41 cnf(i_0_45, plain, (cUnsatisfiable(i2003_11_14_17_18_32242))). % 0.16/0.41 cnf(i_0_28, plain, (~cowlNothing(X1))). % 0.16/0.41 cnf(i_0_31, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.16/0.41 cnf(i_0_30, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.16/0.41 cnf(i_0_35, plain, (cc1(esk2_1(X1))|~cUnsatisfiable(X1))). % 0.16/0.41 cnf(i_0_38, plain, (cc2(esk1_1(X1))|~cUnsatisfiable(X1))). % 0.16/0.41 cnf(i_0_46, plain, (rrx(X1,X2)|~rrx3(X1,X2))). % 0.16/0.41 cnf(i_0_53, plain, (rrx(X1,X2)|~rrx4(X1,X2))). % 0.16/0.41 cnf(i_0_52, plain, (rrx1(X1,X2)|~rrx3(X1,X2))). % 0.16/0.41 cnf(i_0_50, plain, (rrx1a(X1,X2)|~rrx3a(X1,X2))). % 0.16/0.41 cnf(i_0_49, plain, (rrx2(X1,X2)|~rrx4(X1,X2))). % 0.16/0.41 cnf(i_0_51, plain, (rrx2a(X1,X2)|~rrx4a(X1,X2))). % 0.16/0.41 cnf(i_0_47, plain, (rrxa(X1,X2)|~rrx3a(X1,X2))). % 0.16/0.41 cnf(i_0_48, plain, (rrxa(X1,X2)|~rrx4a(X1,X2))). % 0.16/0.41 cnf(i_0_36, plain, (rrx3(X1,esk2_1(X1))|~cUnsatisfiable(X1))). % 0.16/0.41 cnf(i_0_39, plain, (rrx4(X1,esk1_1(X1))|~cUnsatisfiable(X1))). % 0.16/0.41 cnf(i_0_37, plain, (~rrx3(X1,X2)|~cc2(X2)|~cc1(X2)|~cUnsatisfiable(X1))). % 0.16/0.41 cnf(i_0_40, plain, (X1=X2|~rrx(X3,X2)|~rrx(X3,X1))). % 0.16/0.41 cnf(i_0_41, plain, (X1=X2|~rrx3(X3,X2)|~rrx3(X3,X1))). % 0.16/0.41 cnf(i_0_42, plain, (X1=X2|~rrx3a(X3,X2)|~rrx3a(X3,X1))). % 0.16/0.41 cnf(i_0_43, plain, (X1=X2|~rrx4(X3,X2)|~rrx4(X3,X1))). % 0.16/0.41 cnf(i_0_44, plain, (X1=X2|~rrx4a(X3,X2)|~rrx4a(X3,X1))). % 0.16/0.41 cnf(i_0_32, plain, (cc1(esk3_1(X1))|cUnsatisfiable(X1)|~rrx4(X1,X2)|~rrx3(X1,X3)|~cc2(X2)|~cc1(X3))). % 0.16/0.41 cnf(i_0_33, plain, (cc2(esk3_1(X1))|cUnsatisfiable(X1)|~rrx4(X1,X2)|~rrx3(X1,X3)|~cc2(X2)|~cc1(X3))). % 0.16/0.41 cnf(i_0_34, plain, (rrx3(X1,esk3_1(X1))|cUnsatisfiable(X1)|~rrx4(X1,X2)|~rrx3(X1,X3)|~cc2(X2)|~cc1(X3))). % 0.16/0.41 cnf(i_0_316, plain, (X122=X122)). % 0.16/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.16/0.41 # Begin printing tableau % 0.16/0.41 # Found 5 steps % 0.16/0.41 cnf(i_0_316, plain, (i2003_11_14_17_18_32242=i2003_11_14_17_18_32242), inference(start_rule)). % 0.16/0.41 cnf(i_0_403, plain, (i2003_11_14_17_18_32242=i2003_11_14_17_18_32242), inference(extension_rule, [i_0_320])). % 0.16/0.41 cnf(i_0_478, plain, (~cUnsatisfiable(i2003_11_14_17_18_32242)), inference(closure_rule, [i_0_45])). % 0.16/0.41 cnf(i_0_476, plain, (cUnsatisfiable(i2003_11_14_17_18_32242)), inference(extension_rule, [i_0_35])). % 0.16/0.41 cnf(i_0_483, plain, (cc1(esk2_1(i2003_11_14_17_18_32242))), inference(etableau_closure_rule, [i_0_483, ...])). % 0.16/0.41 # End printing tableau % 0.16/0.41 # SZS output end % 0.16/0.41 # Branches closed with saturation will be marked with an "s" % 0.16/0.41 # There were 2 total branch saturation attempts. % 0.16/0.41 # There were 0 of these attempts blocked. % 0.16/0.41 # There were 0 deferred branch saturation attempts. % 0.16/0.41 # There were 0 free duplicated saturations. % 0.16/0.41 # There were 2 total successful branch saturations. % 0.16/0.41 # There were 0 successful branch saturations in interreduction. % 0.16/0.41 # There were 0 successful branch saturations on the branch. % 0.16/0.41 # There were 2 successful branch saturations after the branch. % 0.16/0.41 # There were 1 total branch saturation attempts. % 0.16/0.41 # There were 0 of these attempts blocked. % 0.16/0.41 # There were 0 deferred branch saturation attempts. % 0.16/0.41 # There were 0 free duplicated saturations. % 0.16/0.41 # There were 1 total successful branch saturations. % 0.16/0.41 # There were 0 successful branch saturations in interreduction. % 0.16/0.41 # There were 0 successful branch saturations on the branch. % 0.16/0.41 # There were 1 successful branch saturations after the branch. % 0.16/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.16/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.16/0.41 # Begin clausification derivation % 0.16/0.41 % 0.16/0.41 # End clausification derivation % 0.16/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.16/0.41 cnf(i_0_45, plain, (cUnsatisfiable(i2003_11_14_17_18_32242))). % 0.16/0.41 cnf(i_0_28, plain, (~cowlNothing(X1))). % 0.16/0.41 cnf(i_0_31, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.16/0.41 cnf(i_0_30, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.16/0.41 cnf(i_0_35, plain, (cc1(esk2_1(X1))|~cUnsatisfiable(X1))). % 0.16/0.41 cnf(i_0_38, plain, (cc2(esk1_1(X1))|~cUnsatisfiable(X1))). % 0.16/0.41 cnf(i_0_46, plain, (rrx(X1,X2)|~rrx3(X1,X2))). % 0.16/0.41 cnf(i_0_53, plain, (rrx(X1,X2)|~rrx4(X1,X2))). % 0.16/0.41 cnf(i_0_52, plain, (rrx1(X1,X2)|~rrx3(X1,X2))). % 0.16/0.41 cnf(i_0_50, plain, (rrx1a(X1,X2)|~rrx3a(X1,X2))). % 0.16/0.41 cnf(i_0_49, plain, (rrx2(X1,X2)|~rrx4(X1,X2))). % 0.16/0.41 cnf(i_0_51, plain, (rrx2a(X1,X2)|~rrx4a(X1,X2))). % 0.16/0.41 cnf(i_0_47, plain, (rrxa(X1,X2)|~rrx3a(X1,X2))). % 0.16/0.41 cnf(i_0_48, plain, (rrxa(X1,X2)|~rrx4a(X1,X2))). % 0.16/0.41 cnf(i_0_36, plain, (rrx3(X1,esk2_1(X1))|~cUnsatisfiable(X1))). % 0.16/0.41 cnf(i_0_39, plain, (rrx4(X1,esk1_1(X1))|~cUnsatisfiable(X1))). % 0.16/0.41 cnf(i_0_37, plain, (~rrx3(X1,X2)|~cc2(X2)|~cc1(X2)|~cUnsatisfiable(X1))). % 0.16/0.41 cnf(i_0_40, plain, (X1=X2|~rrx(X3,X2)|~rrx(X3,X1))). % 0.16/0.41 cnf(i_0_41, plain, (X1=X2|~rrx3(X3,X2)|~rrx3(X3,X1))). % 0.16/0.41 cnf(i_0_42, plain, (X1=X2|~rrx3a(X3,X2)|~rrx3a(X3,X1))). % 0.16/0.41 cnf(i_0_43, plain, (X1=X2|~rrx4(X3,X2)|~rrx4(X3,X1))). % 0.16/0.41 cnf(i_0_44, plain, (X1=X2|~rrx4a(X3,X2)|~rrx4a(X3,X1))). % 0.16/0.41 cnf(i_0_32, plain, (cc1(esk3_1(X1))|cUnsatisfiable(X1)|~rrx4(X1,X2)|~rrx3(X1,X3)|~cc2(X2)|~cc1(X3))). % 0.16/0.41 cnf(i_0_33, plain, (cc2(esk3_1(X1))|cUnsatisfiable(X1)|~rrx4(X1,X2)|~rrx3(X1,X3)|~cc2(X2)|~cc1(X3))). % 0.16/0.41 cnf(i_0_34, plain, (rrx3(X1,esk3_1(X1))|cUnsatisfiable(X1)|~rrx4(X1,X2)|~rrx3(X1,X3)|~cc2(X2)|~cc1(X3))). % 0.16/0.41 cnf(i_0_316, plain, (X122=X122)). % 0.16/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.16/0.41 # Begin printing tableau % 0.16/0.41 # Found 5 steps % 0.16/0.41 cnf(i_0_316, plain, (i2003_11_14_17_18_32242=i2003_11_14_17_18_32242), inference(start_rule)). % 0.16/0.41 cnf(i_0_403, plain, (i2003_11_14_17_18_32242=i2003_11_14_17_18_32242), inference(extension_rule, [i_0_320])). % 0.16/0.41 cnf(i_0_478, plain, (~cUnsatisfiable(i2003_11_14_17_18_32242)), inference(closure_rule, [i_0_45])). % 0.16/0.41 cnf(i_0_476, plain, (cUnsatisfiable(i2003_11_14_17_18_32242)), inference(extension_rule, [i_0_35])). % 0.16/0.41 cnf(i_0_483, plain, (cc1(esk2_1(i2003_11_14_17_18_32242))), inference(etableau_closure_rule, [i_0_483, ...])). % 0.16/0.41 # End printing tableau % 0.16/0.41 # SZS output end % 0.16/0.41 # Branches closed with saturation will be marked with an "s" % 0.16/0.41 # Child (17884) has found a proof. % 0.16/0.41 % 0.16/0.41 # Proof search is over... % 0.16/0.41 # Freeing feature tree %------------------------------------------------------------------------------