%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS089+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 : n026.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:30 EDT 2022 % Result : Unsatisfiable 0.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : KRS089+1 : TPTP v8.1.0. Released v3.1.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n026.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue Jun 7 20:22:16 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.12/0.36 # and selection function SelectCQIPrecWNTNp. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 14 Number of unprocessed: 14 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 14 beginning clauses after preprocessing and clausification % 0.12/0.36 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.12/0.36 # No conjectures. % 0.12/0.36 # There are 14 start rule candidates: % 0.12/0.36 # Found 3 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 14 start rule tableaux created. % 0.12/0.36 # 11 extension rule candidate clauses % 0.12/0.36 # 3 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # Closed tableau found in foldup close cycle with 4 folds and 1 closures done. % 0.12/0.37 # There were 0 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 0 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 0 successful branch saturations after the branch. % 0.12/0.37 # Closed tableau found in foldup close cycle with 4 folds and 1 closures done. % 0.12/0.37 # There were 0 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 0 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 0 successful branch saturations after the branch. % 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_28, plain, (cUnsatisfiable(i2003_11_14_17_19_53168))). % 0.12/0.37 cnf(i_0_23, plain, (rp(X1,ispy))). % 0.12/0.37 cnf(i_0_12, plain, (~cowlNothing(X1))). % 0.12/0.37 cnf(i_0_15, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.12/0.37 cnf(i_0_18, plain, (esk2_1(X1)!=esk1_1(X1)|~cUnsatisfiable(X1))). % 0.12/0.37 cnf(i_0_17, plain, (esk3_1(X1)!=esk1_1(X1)|~cUnsatisfiable(X1))). % 0.12/0.37 cnf(i_0_14, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.12/0.37 cnf(i_0_16, plain, (esk3_1(X1)!=esk2_1(X1)|~cUnsatisfiable(X1))). % 0.12/0.37 cnf(i_0_25, plain, (rinvP(X1,X2)|~rp(X2,X1))). % 0.12/0.37 cnf(i_0_24, plain, (rp(X1,X2)|~rinvP(X2,X1))). % 0.12/0.37 cnf(i_0_21, plain, (rr(X1,esk1_1(X1))|~cUnsatisfiable(X1))). % 0.12/0.37 cnf(i_0_20, plain, (rr(X1,esk2_1(X1))|~cUnsatisfiable(X1))). % 0.12/0.37 cnf(i_0_19, plain, (rr(X1,esk3_1(X1))|~cUnsatisfiable(X1))). % 0.12/0.37 cnf(i_0_26, plain, (X1=X2|X1=X3|X2=X3|~rinvP(ispy,X3)|~rinvP(ispy,X2)|~rinvP(ispy,X1))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 13 steps % 0.12/0.37 cnf(i_0_18, plain, (esk2_1(i2003_11_14_17_19_53168)!=esk1_1(i2003_11_14_17_19_53168)|~cUnsatisfiable(i2003_11_14_17_19_53168)), inference(start_rule)). % 0.12/0.37 cnf(i_0_35, plain, (~cUnsatisfiable(i2003_11_14_17_19_53168)), inference(closure_rule, [i_0_28])). % 0.12/0.37 cnf(i_0_34, plain, (esk2_1(i2003_11_14_17_19_53168)!=esk1_1(i2003_11_14_17_19_53168)), inference(extension_rule, [i_0_26])). % 0.12/0.37 cnf(i_0_80, plain, (esk3_1(i2003_11_14_17_19_53168)=esk1_1(i2003_11_14_17_19_53168)), inference(extension_rule, [i_0_17])). % 0.12/0.37 cnf(i_0_115, plain, (~cUnsatisfiable(i2003_11_14_17_19_53168)), inference(closure_rule, [i_0_28])). % 0.12/0.37 cnf(i_0_81, plain, (~rinvP(ispy,esk3_1(i2003_11_14_17_19_53168))), inference(extension_rule, [i_0_25])). % 0.12/0.37 cnf(i_0_125, plain, (~rp(esk3_1(i2003_11_14_17_19_53168),ispy)), inference(closure_rule, [i_0_23])). % 0.12/0.37 cnf(i_0_82, plain, (~rinvP(ispy,esk1_1(i2003_11_14_17_19_53168))), inference(extension_rule, [i_0_25])). % 0.12/0.37 cnf(i_0_151, plain, (~rp(esk1_1(i2003_11_14_17_19_53168),ispy)), inference(closure_rule, [i_0_23])). % 0.12/0.37 cnf(i_0_83, plain, (~rinvP(ispy,esk2_1(i2003_11_14_17_19_53168))), inference(extension_rule, [i_0_25])). % 0.12/0.37 cnf(i_0_177, plain, (~rp(esk2_1(i2003_11_14_17_19_53168),ispy)), inference(closure_rule, [i_0_23])). % 0.12/0.37 cnf(i_0_79, plain, (esk3_1(i2003_11_14_17_19_53168)=esk2_1(i2003_11_14_17_19_53168)), inference(extension_rule, [i_0_16])). % 0.12/0.37 cnf(i_0_185, plain, (~cUnsatisfiable(i2003_11_14_17_19_53168)), inference(closure_rule, [i_0_28])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_28, plain, (cUnsatisfiable(i2003_11_14_17_19_53168))). % 0.12/0.37 cnf(i_0_23, plain, (rp(X1,ispy))). % 0.12/0.37 cnf(i_0_12, plain, (~cowlNothing(X1))). % 0.12/0.37 cnf(i_0_15, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.12/0.37 cnf(i_0_18, plain, (esk2_1(X1)!=esk1_1(X1)|~cUnsatisfiable(X1))). % 0.12/0.37 cnf(i_0_17, plain, (esk3_1(X1)!=esk1_1(X1)|~cUnsatisfiable(X1))). % 0.12/0.37 cnf(i_0_14, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.12/0.37 cnf(i_0_16, plain, (esk3_1(X1)!=esk2_1(X1)|~cUnsatisfiable(X1))). % 0.12/0.37 cnf(i_0_25, plain, (rinvP(X1,X2)|~rp(X2,X1))). % 0.12/0.37 cnf(i_0_24, plain, (rp(X1,X2)|~rinvP(X2,X1))). % 0.12/0.37 cnf(i_0_21, plain, (rr(X1,esk1_1(X1))|~cUnsatisfiable(X1))). % 0.12/0.37 cnf(i_0_20, plain, (rr(X1,esk2_1(X1))|~cUnsatisfiable(X1))). % 0.12/0.37 cnf(i_0_19, plain, (rr(X1,esk3_1(X1))|~cUnsatisfiable(X1))). % 0.12/0.37 cnf(i_0_26, plain, (X1=X2|X1=X3|X2=X3|~rinvP(ispy,X3)|~rinvP(ispy,X2)|~rinvP(ispy,X1))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 13 steps % 0.12/0.37 cnf(i_0_17, plain, (esk3_1(i2003_11_14_17_19_53168)!=esk1_1(i2003_11_14_17_19_53168)|~cUnsatisfiable(i2003_11_14_17_19_53168)), inference(start_rule)). % 0.12/0.37 cnf(i_0_37, plain, (~cUnsatisfiable(i2003_11_14_17_19_53168)), inference(closure_rule, [i_0_28])). % 0.12/0.37 cnf(i_0_36, plain, (esk3_1(i2003_11_14_17_19_53168)!=esk1_1(i2003_11_14_17_19_53168)), inference(extension_rule, [i_0_26])). % 0.12/0.37 cnf(i_0_80, plain, (esk2_1(i2003_11_14_17_19_53168)=esk1_1(i2003_11_14_17_19_53168)), inference(extension_rule, [i_0_18])). % 0.12/0.37 cnf(i_0_113, plain, (~cUnsatisfiable(i2003_11_14_17_19_53168)), inference(closure_rule, [i_0_28])). % 0.12/0.37 cnf(i_0_81, plain, (~rinvP(ispy,esk2_1(i2003_11_14_17_19_53168))), inference(extension_rule, [i_0_25])). % 0.12/0.37 cnf(i_0_123, plain, (~rp(esk2_1(i2003_11_14_17_19_53168),ispy)), inference(closure_rule, [i_0_23])). % 0.12/0.37 cnf(i_0_82, plain, (~rinvP(ispy,esk1_1(i2003_11_14_17_19_53168))), inference(extension_rule, [i_0_25])). % 0.12/0.37 cnf(i_0_149, plain, (~rp(esk1_1(i2003_11_14_17_19_53168),ispy)), inference(closure_rule, [i_0_23])). % 0.12/0.37 cnf(i_0_83, plain, (~rinvP(ispy,esk3_1(i2003_11_14_17_19_53168))), inference(extension_rule, [i_0_25])). % 0.12/0.37 cnf(i_0_175, plain, (~rp(esk3_1(i2003_11_14_17_19_53168),ispy)), inference(closure_rule, [i_0_23])). % 0.12/0.37 cnf(i_0_79, plain, (esk3_1(i2003_11_14_17_19_53168)=esk2_1(i2003_11_14_17_19_53168)), inference(extension_rule, [i_0_16])). % 0.12/0.37 cnf(i_0_183, plain, (~cUnsatisfiable(i2003_11_14_17_19_53168)), inference(closure_rule, [i_0_28])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # Child (7325) has found a proof. % 0.12/0.37 % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------