%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS078+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 : n018.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:28 EDT 2022 % Result : Unsatisfiable 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 : KRS078+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 : n018.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 13:46:51 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic C07_19_nc_SAT001_MinMin_rr % 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 19 Number of unprocessed: 19 % 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.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 19 beginning clauses after preprocessing and clausification % 0.13/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.13/0.37 # No conjectures. % 0.13/0.37 # There are 19 start rule candidates: % 0.13/0.37 # Found 2 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 19 start rule tableaux created. % 0.13/0.37 # 17 extension rule candidate clauses % 0.13/0.37 # 2 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 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 Unsatisfiable 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_33, plain, (cUnsatisfiable(i2003_11_14_17_19_13721))). % 0.13/0.38 cnf(i_0_14, plain, (~cowlNothing(X1))). % 0.13/0.38 cnf(i_0_17, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.13/0.38 cnf(i_0_24, plain, (~cp(esk3_1(X1))|~cUnsatisfiable(X1))). % 0.13/0.38 cnf(i_0_25, plain, (~cq(esk3_1(X1))|~cUnsatisfiable(X1))). % 0.13/0.38 cnf(i_0_16, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.13/0.38 cnf(i_0_31, plain, (rinvR(X1,X2)|~rr(X2,X1))). % 0.13/0.38 cnf(i_0_32, plain, (rr(X1,X2)|~rinvR(X2,X1))). % 0.13/0.38 cnf(i_0_28, plain, (cp(X1)|~rs(esk2_1(X2),X1)|~cUnsatisfiable(X2))). % 0.13/0.38 cnf(i_0_30, plain, (rr(X1,esk1_1(X1))|~cUnsatisfiable(X1))). % 0.13/0.38 cnf(i_0_26, plain, (rs(X1,esk3_1(X1))|~cUnsatisfiable(X1))). % 0.13/0.38 cnf(i_0_29, plain, (rinvR(esk1_1(X1),esk2_1(X1))|~cUnsatisfiable(X1))). % 0.13/0.38 cnf(i_0_27, plain, (X1=X2|~rinvR(esk1_1(X3),X2)|~rinvR(esk1_1(X3),X1)|~cUnsatisfiable(X3))). % 0.13/0.38 cnf(i_0_18, plain, (cq(X1)|cp(X1)|cUnsatisfiable(X2)|esk6_2(X2,X3)!=esk5_2(X2,X3)|~rs(X2,X1)|~rr(X2,X3)|~rinvR(X3,X4)|~cp(esk4_3(X2,X3,X4)))). % 0.13/0.38 cnf(i_0_21, plain, (rs(X1,esk4_3(X2,X3,X1))|cq(X4)|cp(X4)|cUnsatisfiable(X2)|esk6_2(X2,X3)!=esk5_2(X2,X3)|~rs(X2,X4)|~rr(X2,X3)|~rinvR(X3,X1))). % 0.13/0.38 cnf(i_0_20, plain, (rinvR(X1,esk5_2(X2,X1))|cq(X3)|cp(X3)|cUnsatisfiable(X2)|~rs(X2,X3)|~rr(X2,X1)|~rinvR(X1,X4)|~cp(esk4_3(X2,X1,X4)))). % 0.13/0.38 cnf(i_0_23, plain, (rs(X1,esk4_3(X2,X3,X1))|rinvR(X3,esk5_2(X2,X3))|cq(X4)|cp(X4)|cUnsatisfiable(X2)|~rs(X2,X4)|~rr(X2,X3)|~rinvR(X3,X1))). % 0.13/0.38 cnf(i_0_19, plain, (rinvR(X1,esk6_2(X2,X1))|cq(X3)|cp(X3)|cUnsatisfiable(X2)|~rs(X2,X3)|~rr(X2,X1)|~rinvR(X1,X4)|~cp(esk4_3(X2,X1,X4)))). % 0.13/0.38 cnf(i_0_22, plain, (rs(X1,esk4_3(X2,X3,X1))|rinvR(X3,esk6_2(X2,X3))|cq(X4)|cp(X4)|cUnsatisfiable(X2)|~rs(X2,X4)|~rr(X2,X3)|~rinvR(X3,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 5 steps % 0.13/0.38 cnf(i_0_33, plain, (cUnsatisfiable(i2003_11_14_17_19_13721)), inference(start_rule)). % 0.13/0.38 cnf(i_0_34, plain, (cUnsatisfiable(i2003_11_14_17_19_13721)), inference(extension_rule, [i_0_24])). % 0.13/0.38 cnf(i_0_111, plain, (~cp(esk3_1(i2003_11_14_17_19_13721))), inference(extension_rule, [i_0_28])). % 0.13/0.38 cnf(i_0_125, plain, (~cUnsatisfiable(i2003_11_14_17_19_13721)), inference(closure_rule, [i_0_33])). % 0.13/0.38 cnf(i_0_124, plain, (~rs(esk2_1(i2003_11_14_17_19_13721),esk3_1(i2003_11_14_17_19_13721))), inference(etableau_closure_rule, [i_0_124, ...])). % 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 Unsatisfiable 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_33, plain, (cUnsatisfiable(i2003_11_14_17_19_13721))). % 0.13/0.38 cnf(i_0_14, plain, (~cowlNothing(X1))). % 0.13/0.38 cnf(i_0_17, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.13/0.38 cnf(i_0_24, plain, (~cp(esk3_1(X1))|~cUnsatisfiable(X1))). % 0.13/0.38 cnf(i_0_25, plain, (~cq(esk3_1(X1))|~cUnsatisfiable(X1))). % 0.13/0.38 cnf(i_0_16, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.13/0.38 cnf(i_0_31, plain, (rinvR(X1,X2)|~rr(X2,X1))). % 0.13/0.38 cnf(i_0_32, plain, (rr(X1,X2)|~rinvR(X2,X1))). % 0.13/0.38 cnf(i_0_28, plain, (cp(X1)|~rs(esk2_1(X2),X1)|~cUnsatisfiable(X2))). % 0.13/0.38 cnf(i_0_30, plain, (rr(X1,esk1_1(X1))|~cUnsatisfiable(X1))). % 0.13/0.38 cnf(i_0_26, plain, (rs(X1,esk3_1(X1))|~cUnsatisfiable(X1))). % 0.13/0.38 cnf(i_0_29, plain, (rinvR(esk1_1(X1),esk2_1(X1))|~cUnsatisfiable(X1))). % 0.13/0.38 cnf(i_0_27, plain, (X1=X2|~rinvR(esk1_1(X3),X2)|~rinvR(esk1_1(X3),X1)|~cUnsatisfiable(X3))). % 0.13/0.38 cnf(i_0_18, plain, (cq(X1)|cp(X1)|cUnsatisfiable(X2)|esk6_2(X2,X3)!=esk5_2(X2,X3)|~rs(X2,X1)|~rr(X2,X3)|~rinvR(X3,X4)|~cp(esk4_3(X2,X3,X4)))). % 0.13/0.38 cnf(i_0_21, plain, (rs(X1,esk4_3(X2,X3,X1))|cq(X4)|cp(X4)|cUnsatisfiable(X2)|esk6_2(X2,X3)!=esk5_2(X2,X3)|~rs(X2,X4)|~rr(X2,X3)|~rinvR(X3,X1))). % 0.13/0.38 cnf(i_0_20, plain, (rinvR(X1,esk5_2(X2,X1))|cq(X3)|cp(X3)|cUnsatisfiable(X2)|~rs(X2,X3)|~rr(X2,X1)|~rinvR(X1,X4)|~cp(esk4_3(X2,X1,X4)))). % 0.13/0.38 cnf(i_0_23, plain, (rs(X1,esk4_3(X2,X3,X1))|rinvR(X3,esk5_2(X2,X3))|cq(X4)|cp(X4)|cUnsatisfiable(X2)|~rs(X2,X4)|~rr(X2,X3)|~rinvR(X3,X1))). % 0.13/0.38 cnf(i_0_19, plain, (rinvR(X1,esk6_2(X2,X1))|cq(X3)|cp(X3)|cUnsatisfiable(X2)|~rs(X2,X3)|~rr(X2,X1)|~rinvR(X1,X4)|~cp(esk4_3(X2,X1,X4)))). % 0.13/0.38 cnf(i_0_22, plain, (rs(X1,esk4_3(X2,X3,X1))|rinvR(X3,esk6_2(X2,X3))|cq(X4)|cp(X4)|cUnsatisfiable(X2)|~rs(X2,X4)|~rr(X2,X3)|~rinvR(X3,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 7 steps % 0.13/0.38 cnf(i_0_30, plain, (rr(i2003_11_14_17_19_13721,esk1_1(i2003_11_14_17_19_13721))|~cUnsatisfiable(i2003_11_14_17_19_13721)), inference(start_rule)). % 0.13/0.38 cnf(i_0_52, plain, (~cUnsatisfiable(i2003_11_14_17_19_13721)), inference(closure_rule, [i_0_33])). % 0.13/0.38 cnf(i_0_51, plain, (rr(i2003_11_14_17_19_13721,esk1_1(i2003_11_14_17_19_13721))), inference(extension_rule, [i_0_31])). % 0.13/0.38 cnf(i_0_190, plain, (rinvR(esk1_1(i2003_11_14_17_19_13721),i2003_11_14_17_19_13721)), inference(extension_rule, [i_0_27])). % 0.13/0.38 cnf(i_0_213, plain, (~rinvR(esk1_1(i2003_11_14_17_19_13721),i2003_11_14_17_19_13721)), inference(closure_rule, [i_0_190])). % 0.13/0.38 cnf(i_0_214, plain, (~cUnsatisfiable(i2003_11_14_17_19_13721)), inference(closure_rule, [i_0_33])). % 0.13/0.38 cnf(i_0_211, plain, (i2003_11_14_17_19_13721=i2003_11_14_17_19_13721), inference(etableau_closure_rule, [i_0_211, ...])). % 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 (19062) has found a proof. % 0.13/0.38 % 0.13/0.38 # Proof search is over... % 0.13/0.38 # Freeing feature tree %------------------------------------------------------------------------------