%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS090+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 : n019.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:31 EDT 2022 % Result : Unsatisfiable 0.19s 0.38s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : KRS090+1 : TPTP v8.1.0. Released v3.1.0. % 0.03/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 : n019.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 07:53:40 EDT 2022 % 0.13/0.34 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C47_F1_SE_CS_SP_PS_S0Y % 0.19/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.19/0.37 # % 0.19/0.37 # Presaturation interreduction done % 0.19/0.37 # Number of axioms: 47 Number of unprocessed: 45 % 0.19/0.37 # Tableaux proof search. % 0.19/0.37 # APR header successfully linked. % 0.19/0.37 # Hello from C++ % 0.19/0.37 # The folding up rule is enabled... % 0.19/0.37 # Local unification is enabled... % 0.19/0.37 # Any saturation attempts will use folding labels... % 0.19/0.37 # 45 beginning clauses after preprocessing and clausification % 0.19/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.19/0.37 # No conjectures. % 0.19/0.37 # There are 45 start rule candidates: % 0.19/0.37 # Found 2 unit axioms. % 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.37 # 45 start rule tableaux created. % 0.19/0.37 # 43 extension rule candidate clauses % 0.19/0.37 # 2 unit axiom clauses % 0.19/0.37 % 0.19/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.38 # Closed tableau found in foldup close cycle with 1 folds and 1 closures done. % 0.19/0.38 # There were 0 total branch saturation attempts. % 0.19/0.38 # There were 0 of these attempts blocked. % 0.19/0.38 # There were 0 deferred branch saturation attempts. % 0.19/0.38 # There were 0 free duplicated saturations. % 0.19/0.38 # There were 0 total successful branch saturations. % 0.19/0.38 # There were 0 successful branch saturations in interreduction. % 0.19/0.38 # There were 0 successful branch saturations on the branch. % 0.19/0.38 # There were 0 successful branch saturations after the branch. % 0.19/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.38 # Begin clausification derivation % 0.19/0.38 % 0.19/0.38 # End clausification derivation % 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.38 cnf(i_0_16, plain, (cTEST(i2003_11_14_17_19_57994))). % 0.19/0.38 cnf(i_0_1, plain, (~cowlNothing(X1))). % 0.19/0.38 cnf(i_0_4, plain, (~xsd_integer(X1)|~xsd_string(X1))). % 0.19/0.38 cnf(i_0_14, plain, (cC1(X1)|~cTEST(X1))). % 0.19/0.38 cnf(i_0_15, plain, (cC4(X1)|~cTEST(X1))). % 0.19/0.38 cnf(i_0_3, plain, (xsd_integer(X1)|xsd_string(X1))). % 0.19/0.38 cnf(i_0_13, plain, (cC5(X1)|~cTEST(X1))). % 0.19/0.38 cnf(i_0_5, plain, (epred1_1(X1)|~cC1(X1))). % 0.19/0.38 cnf(i_0_8, plain, (~cC3(X1)|~cA(X1))). % 0.19/0.38 cnf(i_0_10, plain, (cC2(esk1_1(X1))|~cC4(X1))). % 0.19/0.38 cnf(i_0_12, plain, (cC3(X1)|~cC5(X2)|~rR(X2,X1))). % 0.19/0.38 cnf(i_0_48, plain, (cA5(X1)|cB5(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_47, plain, (cA13(X1)|cB13(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_46, plain, (cB1(X1)|cA1(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_45, plain, (cB27(X1)|cA27(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_44, plain, (cB4(X1)|cA4(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_43, plain, (cA12(X1)|cB12(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_42, plain, (cA30(X1)|cB30(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_41, plain, (cB20(X1)|cA20(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_40, plain, (cA14(X1)|cB14(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_39, plain, (cA28(X1)|cB28(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_38, plain, (cB3(X1)|cA3(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_37, plain, (cA7(X1)|cB7(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_36, plain, (cA21(X1)|cB21(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_35, plain, (cA22(X1)|cB22(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_34, plain, (cA17(X1)|cB17(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_33, plain, (cA11(X1)|cB11(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_32, plain, (cA19(X1)|cB19(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_31, plain, (cB8(X1)|cA8(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_30, plain, (cB26(X1)|cA26(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_29, plain, (cB25(X1)|cA25(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_28, plain, (cB29(X1)|cA29(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_27, plain, (cA23(X1)|cB23(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_26, plain, (cA18(X1)|cB18(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_25, plain, (cA10(X1)|cB10(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_24, plain, (cA2(X1)|cB2(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_23, plain, (cB16(X1)|cA16(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_22, plain, (cA0(X1)|cB0(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_21, plain, (cA31(X1)|cB31(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_20, plain, (cA9(X1)|cB9(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_19, plain, (cA6(X1)|cB6(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_18, plain, (cA24(X1)|cB24(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_17, plain, (cA15(X1)|cB15(X1)|~epred1_1(X1))). % 0.19/0.38 cnf(i_0_6, plain, (cA(X1)|~cC2(X1))). % 0.19/0.38 cnf(i_0_11, plain, (rR(X1,esk1_1(X1))|~cC4(X1))). % 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.38 # Begin printing tableau % 0.19/0.38 # Found 10 steps % 0.19/0.38 cnf(i_0_10, plain, (cC2(esk1_1(i2003_11_14_17_19_57994))|~cC4(i2003_11_14_17_19_57994)), inference(start_rule)). % 0.19/0.38 cnf(i_0_65, plain, (cC2(esk1_1(i2003_11_14_17_19_57994))), inference(extension_rule, [i_0_6])). % 0.19/0.38 cnf(i_0_404, plain, (cA(esk1_1(i2003_11_14_17_19_57994))), inference(extension_rule, [i_0_8])). % 0.19/0.38 cnf(i_0_418, plain, (~cC3(esk1_1(i2003_11_14_17_19_57994))), inference(extension_rule, [i_0_12])). % 0.19/0.38 cnf(i_0_66, plain, (~cC4(i2003_11_14_17_19_57994)), inference(extension_rule, [i_0_15])). % 0.19/0.38 cnf(i_0_442, plain, (~cTEST(i2003_11_14_17_19_57994)), inference(closure_rule, [i_0_16])). % 0.19/0.38 cnf(i_0_435, plain, (~cC5(i2003_11_14_17_19_57994)), inference(extension_rule, [i_0_13])). % 0.19/0.38 cnf(i_0_1164, plain, (~cTEST(i2003_11_14_17_19_57994)), inference(closure_rule, [i_0_16])). % 0.19/0.38 cnf(i_0_436, plain, (~rR(i2003_11_14_17_19_57994,esk1_1(i2003_11_14_17_19_57994))), inference(extension_rule, [i_0_11])). % 0.19/0.38 cnf(i_0_1272, plain, (~cC4(i2003_11_14_17_19_57994)), inference(closure_rule, [i_0_66])). % 0.19/0.38 # End printing tableau % 0.19/0.38 # SZS output end % 0.19/0.38 # Branches closed with saturation will be marked with an "s" % 0.19/0.38 # Child (31423) has found a proof. % 0.19/0.38 % 0.19/0.38 # Proof search is over... % 0.19/0.38 # Freeing feature tree %------------------------------------------------------------------------------