%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS158+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 : n017.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:43 EDT 2022 % Result : Theorem 0.12s 0.38s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : KRS158+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.12/0.33 % Computer : n017.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 13:33:47 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_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 54 Number of unprocessed: 54 % 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 # 54 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 2 conjectures. % 0.12/0.36 # There are 2 start rule candidates: % 0.12/0.36 # Found 9 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 2 start rule tableaux created. % 0.12/0.36 # 45 extension rule candidate clauses % 0.12/0.36 # 9 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 2 % 0.12/0.36 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 8 tableaux to operate on % 0.12/0.38 # There were 5 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 5 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 5 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_56, plain, (cC2xcomp(iV16562))). % 0.12/0.38 cnf(i_0_52, plain, (cC2xcomp(iV16561))). % 0.12/0.38 cnf(i_0_55, plain, (cC10xcomp(iV16562))). % 0.12/0.38 cnf(i_0_46, plain, (cTOP(iV16560))). % 0.12/0.38 cnf(i_0_51, plain, (cC4xcomp(iV16561))). % 0.12/0.38 cnf(i_0_45, plain, (cTEST(iV16560))). % 0.12/0.38 cnf(i_0_47, plain, (rR1(iV16560,iV16562))). % 0.12/0.38 cnf(i_0_48, plain, (rR1(iV16560,iV16561))). % 0.12/0.38 cnf(i_0_1, plain, (~cowlNothing(X1))). % 0.12/0.38 cnf(i_0_4, plain, (~xsd_integer(X1)|~xsd_string(X1))). % 0.12/0.38 cnf(i_0_11, plain, (~cC10xcomp(X1)|~ra_Px3(X1,X2))). % 0.12/0.38 cnf(i_0_25, plain, (~ra_Px1(X1,X2)|~cC2(X1))). % 0.12/0.38 cnf(i_0_34, plain, (~cC4xcomp(X1)|~ra_Px6(X1,X2))). % 0.12/0.38 cnf(i_0_57, negated_conjecture, (~cC6(iV16561)|~cC18(iV16560)|~cC8(iV16560)|~cC16(iV16560)|~cC14(iV16560)|~cC12(iV16562)|~xsd_integer(esk12_0))). % 0.12/0.38 cnf(i_0_58, negated_conjecture, (~cC6(iV16561)|~cC18(iV16560)|~cC8(iV16560)|~cC16(iV16560)|~cC14(iV16560)|~cC12(iV16562)|~xsd_string(esk12_0))). % 0.12/0.38 cnf(i_0_20, plain, (cC14(X1)|~cC16(X1))). % 0.12/0.38 cnf(i_0_3, plain, (xsd_integer(X1)|xsd_string(X1))). % 0.12/0.38 cnf(i_0_22, plain, (cC16(X1)|~cC18(X1))). % 0.12/0.38 cnf(i_0_13, plain, (cC2xcomp(X1)|~cC12(X1))). % 0.12/0.38 cnf(i_0_36, plain, (cC2xcomp(X1)|~cC6(X1))). % 0.12/0.38 cnf(i_0_42, plain, (cC18(X1)|~cTEST(X1))). % 0.12/0.38 cnf(i_0_43, plain, (cTOP(X1)|~cTEST(X1))). % 0.12/0.38 cnf(i_0_19, plain, (cC8(X1)|~cC16(X1))). % 0.12/0.38 cnf(i_0_18, plain, (cC16(X1)|~cC8(X1)|~cC14(X1))). % 0.12/0.38 cnf(i_0_14, plain, (cC10xcomp(X1)|~cC12(X1))). % 0.12/0.38 cnf(i_0_23, plain, (cTOP(X1)|~cC18(X1))). % 0.12/0.38 cnf(i_0_37, plain, (cC4xcomp(X1)|~cC6(X1))). % 0.12/0.38 cnf(i_0_8, plain, (cC2xcomp(esk2_1(X1))|~cC10(X1))). % 0.12/0.38 cnf(i_0_16, plain, (cC12(esk4_1(X1))|~cC14(X1))). % 0.12/0.38 cnf(i_0_5, plain, (cC10(X1)|~ra_Px3(X1,X2))). % 0.12/0.38 cnf(i_0_26, plain, (cC2xcomp(X1)|~ra_Px1(X1,X2))). % 0.12/0.38 cnf(i_0_28, plain, (cC4(X1)|~ra_Px6(X1,X2))). % 0.12/0.38 cnf(i_0_12, plain, (cC12(X1)|~cC10xcomp(X1)|~cC2xcomp(X1))). % 0.12/0.38 cnf(i_0_39, plain, (cC6(esk10_1(X1))|~cC8(X1))). % 0.12/0.38 cnf(i_0_21, plain, (cC18(X1)|~cTOP(X1)|~cC16(X1))). % 0.12/0.38 cnf(i_0_54, plain, (cC2(X1)|~rR1(iV16562,X1))). % 0.12/0.38 cnf(i_0_50, plain, (cC2(X1)|~rR1(iV16561,X1))). % 0.12/0.38 cnf(i_0_35, plain, (cC6(X1)|~cC4xcomp(X1)|~cC2xcomp(X1))). % 0.12/0.38 cnf(i_0_31, plain, (cC2xcomp(esk8_1(X1))|~cC4(X1))). % 0.12/0.38 cnf(i_0_41, plain, (cTEST(X1)|~cC18(X1))). % 0.12/0.38 cnf(i_0_7, plain, (cC10(X1)|~cC2xcomp(X2)|~rR1(X1,X2))). % 0.12/0.38 cnf(i_0_30, plain, (cC4(X1)|~cC2xcomp(X2)|~rR1(X1,X2))). % 0.12/0.38 cnf(i_0_15, plain, (cC14(X1)|~cC12(X2)|~rR1(X1,X2))). % 0.12/0.38 cnf(i_0_38, plain, (cC8(X1)|~cC6(X2)|~rR1(X1,X2))). % 0.12/0.38 cnf(i_0_17, plain, (rR1(X1,esk4_1(X1))|~cC14(X1))). % 0.12/0.38 cnf(i_0_40, plain, (rR1(X1,esk10_1(X1))|~cC8(X1))). % 0.12/0.38 cnf(i_0_6, plain, (ra_Px3(X1,esk1_1(X1))|~cC10(X1))). % 0.12/0.38 cnf(i_0_9, plain, (rR1(X1,esk2_1(X1))|~cC10(X1))). % 0.12/0.38 cnf(i_0_32, plain, (rR1(X1,esk8_1(X1))|~cC4(X1))). % 0.12/0.38 cnf(i_0_10, plain, (cC10xcomp(X1)|ra_Px3(X1,esk3_1(X1)))). % 0.12/0.38 cnf(i_0_24, plain, (ra_Px1(X1,esk5_1(X1))|cC2(X1))). % 0.12/0.38 cnf(i_0_27, plain, (ra_Px1(X1,esk6_1(X1))|~cC2xcomp(X1))). % 0.12/0.38 cnf(i_0_29, plain, (ra_Px6(X1,esk7_1(X1))|~cC4(X1))). % 0.12/0.38 cnf(i_0_33, plain, (cC4xcomp(X1)|ra_Px6(X1,esk9_1(X1)))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 20 steps % 0.12/0.38 cnf(i_0_58, negated_conjecture, (~cC6(iV16561)|~cC18(iV16560)|~cC8(iV16560)|~cC16(iV16560)|~cC14(iV16560)|~cC12(iV16562)|~xsd_string(esk12_0)), inference(start_rule)). % 0.12/0.38 cnf(i_0_63, plain, (~cC14(iV16560)), inference(extension_rule, [i_0_15])). % 0.12/0.38 cnf(i_0_575, plain, (~rR1(iV16560,iV16562)), inference(closure_rule, [i_0_47])). % 0.12/0.38 cnf(i_0_574, plain, (~cC12(iV16562)), inference(extension_rule, [i_0_12])). % 0.12/0.38 cnf(i_0_1089, plain, (~cC10xcomp(iV16562)), inference(closure_rule, [i_0_55])). % 0.12/0.38 cnf(i_0_1090, plain, (~cC2xcomp(iV16562)), inference(closure_rule, [i_0_56])). % 0.12/0.38 cnf(i_0_59, plain, (~cC6(iV16561)), inference(extension_rule, [i_0_35])). % 0.12/0.38 cnf(i_0_1144, plain, (~cC4xcomp(iV16561)), inference(closure_rule, [i_0_51])). % 0.12/0.38 cnf(i_0_1145, plain, (~cC2xcomp(iV16561)), inference(closure_rule, [i_0_52])). % 0.12/0.38 cnf(i_0_60, plain, (~cC18(iV16560)), inference(extension_rule, [i_0_42])). % 0.12/0.38 cnf(i_0_1165, plain, (~cTEST(iV16560)), inference(closure_rule, [i_0_45])). % 0.12/0.38 cnf(i_0_61, plain, (~cC8(iV16560)), inference(extension_rule, [i_0_38])). % 0.12/0.38 cnf(i_0_1231, plain, (~rR1(iV16560,esk4_1(iV16560))), inference(extension_rule, [i_0_17])). % 0.12/0.38 cnf(i_0_1512, plain, (~cC14(iV16560)), inference(closure_rule, [i_0_63])). % 0.12/0.38 cnf(i_0_1230, plain, (~cC6(esk4_1(iV16560))), inference(extension_rule, [i_0_35])). % 0.12/0.38 cnf(i_0_62, plain, (~cC16(iV16560)), inference(etableau_closure_rule, [i_0_62, ...])). % 0.12/0.38 cnf(i_0_64, plain, (~cC12(iV16562)), inference(etableau_closure_rule, [i_0_64, ...])). % 0.12/0.38 cnf(i_0_65, plain, (~xsd_string(esk12_0)), inference(etableau_closure_rule, [i_0_65, ...])). % 0.12/0.38 cnf(i_0_1612, plain, (~cC4xcomp(esk4_1(iV16560))), inference(etableau_closure_rule, [i_0_1612, ...])). % 0.12/0.38 cnf(i_0_1613, plain, (~cC2xcomp(esk4_1(iV16560))), inference(etableau_closure_rule, [i_0_1613, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.39 # There were 5 total branch saturation attempts. % 0.12/0.39 # There were 0 of these attempts blocked. % 0.12/0.39 # There were 0 deferred branch saturation attempts. % 0.12/0.39 # There were 0 free duplicated saturations. % 0.12/0.39 # There were 5 total successful branch saturations. % 0.12/0.39 # There were 0 successful branch saturations in interreduction. % 0.12/0.39 # There were 0 successful branch saturations on the branch. % 0.12/0.39 # There were 5 successful branch saturations after the branch. % 0.12/0.39 # Child (2770) has found a proof. % 0.12/0.39 % 0.12/0.39 # Proof search is over... % 0.12/0.39 # Freeing feature tree %------------------------------------------------------------------------------