%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS081+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:29 EDT 2022 % Result : Unsatisfiable 7.54s 1.37s % Output : CNFRefutation 7.54s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : KRS081+1 : TPTP v8.1.0. Released v3.1.0. % 0.03/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 11:07:02 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.38 # No SInE strategy applied % 0.19/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.38 # % 0.19/0.38 # Presaturation interreduction done % 0.19/0.38 # Number of axioms: 52 Number of unprocessed: 52 % 0.19/0.38 # Tableaux proof search. % 0.19/0.38 # APR header successfully linked. % 0.19/0.38 # Hello from C++ % 0.19/0.38 # The folding up rule is enabled... % 0.19/0.38 # Local unification is enabled... % 0.19/0.38 # Any saturation attempts will use folding labels... % 0.19/0.38 # 52 beginning clauses after preprocessing and clausification % 0.19/0.38 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.19/0.38 # No conjectures. % 0.19/0.38 # There are 52 start rule candidates: % 0.19/0.38 # Found 2 unit axioms. % 0.19/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.38 # 52 start rule tableaux created. % 0.19/0.38 # 50 extension rule candidate clauses % 0.19/0.38 # 2 unit axiom clauses % 0.19/0.38 % 0.19/0.38 # Requested 8, 32 cores available to the main process. % 7.54/1.36 # Creating equality axioms % 7.54/1.36 # Ran out of tableaux, making start rules for all clauses % 7.54/1.37 # Creating equality axioms % 7.54/1.37 # Ran out of tableaux, making start rules for all clauses % 7.54/1.37 # There were 54 total branch saturation attempts. % 7.54/1.37 # There were 0 of these attempts blocked. % 7.54/1.37 # There were 0 deferred branch saturation attempts. % 7.54/1.37 # There were 52 free duplicated saturations. % 7.54/1.37 # There were 54 total successful branch saturations. % 7.54/1.37 # There were 0 successful branch saturations in interreduction. % 7.54/1.37 # There were 0 successful branch saturations on the branch. % 7.54/1.37 # There were 2 successful branch saturations after the branch. % 7.54/1.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.54/1.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.54/1.37 # Begin clausification derivation % 7.54/1.37 % 7.54/1.37 # End clausification derivation % 7.54/1.37 # Begin listing active clauses obtained from FOF to CNF conversion % 7.54/1.37 cnf(i_0_66, plain, (cUnsatisfiable(i2003_11_14_17_19_24236))). % 7.54/1.37 cnf(i_0_14, plain, (~cowlNothing(X1))). % 7.54/1.37 cnf(i_0_59, plain, (~cp2(X1)|~cp1(X1))). % 7.54/1.37 cnf(i_0_56, plain, (~cp3(X1)|~cp1(X1))). % 7.54/1.37 cnf(i_0_58, plain, (~cp4(X1)|~cp1(X1))). % 7.54/1.37 cnf(i_0_16, plain, (xsd_string(X1)|xsd_integer(X1))). % 7.54/1.37 cnf(i_0_51, plain, (cp(esk2_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_57, plain, (~cp5(X1)|~cp1(X1))). % 7.54/1.37 cnf(i_0_60, plain, (~cp3(X1)|~cp2(X1))). % 7.54/1.37 cnf(i_0_62, plain, (~cp4(X1)|~cp2(X1))). % 7.54/1.37 cnf(i_0_61, plain, (~cp5(X1)|~cp2(X1))). % 7.54/1.37 cnf(i_0_64, plain, (~cp4(X1)|~cp3(X1))). % 7.54/1.37 cnf(i_0_63, plain, (~cp5(X1)|~cp3(X1))). % 7.54/1.37 cnf(i_0_65, plain, (~cp5(X1)|~cp4(X1))). % 7.54/1.37 cnf(i_0_17, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 7.54/1.37 cnf(i_0_46, plain, (cp(esk4_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_42, plain, (cp(esk6_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_35, plain, (cp(esk8_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_39, plain, (cp1(esk7_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_36, plain, (cp1(esk8_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_47, plain, (cp2(esk4_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_33, plain, (cp2(esk9_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_54, plain, (cp3(esk1_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_41, plain, (cp3(esk6_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_52, plain, (cp4(esk2_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_49, plain, (cp4(esk3_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_44, plain, (cp5(esk5_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_55, plain, (rr(X1,esk1_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_53, plain, (rr(X1,esk2_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_50, plain, (rr(X1,esk3_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_48, plain, (rr(X1,esk4_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_45, plain, (rr(X1,esk5_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_43, plain, (rr(X1,esk6_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_40, plain, (rr(X1,esk7_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_37, plain, (rr(X1,esk8_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_34, plain, (rr(X1,esk9_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_38, plain, (X1=X2|X1=X3|X1=X4|X1=X5|X2=X3|X2=X4|X2=X5|X3=X4|X3=X5|X4=X5|~rr(X6,X5)|~rr(X6,X4)|~rr(X6,X3)|~rr(X6,X2)|~rr(X6,X1)|~cUnsatisfiable(X6))). % 7.54/1.37 cnf(i_0_27, plain, (cUnsatisfiable(X1)|esk11_1(X1)!=esk10_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_26, plain, (cUnsatisfiable(X1)|esk12_1(X1)!=esk10_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_23, plain, (cUnsatisfiable(X1)|esk12_1(X1)!=esk11_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_25, plain, (cUnsatisfiable(X1)|esk13_1(X1)!=esk10_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_22, plain, (cUnsatisfiable(X1)|esk13_1(X1)!=esk11_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_20, plain, (cUnsatisfiable(X1)|esk13_1(X1)!=esk12_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_24, plain, (cUnsatisfiable(X1)|esk14_1(X1)!=esk10_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_21, plain, (cUnsatisfiable(X1)|esk14_1(X1)!=esk11_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_19, plain, (cUnsatisfiable(X1)|esk14_1(X1)!=esk12_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_18, plain, (cUnsatisfiable(X1)|esk14_1(X1)!=esk13_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_32, plain, (rr(X1,esk10_1(X1))|cUnsatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_31, plain, (rr(X1,esk11_1(X1))|cUnsatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_30, plain, (rr(X1,esk12_1(X1))|cUnsatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_29, plain, (rr(X1,esk13_1(X1))|cUnsatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_28, plain, (rr(X1,esk14_1(X1))|cUnsatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_341433, plain, (X75=X75)). % 7.54/1.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 7.54/1.37 # Begin printing tableau % 7.54/1.37 # Found 5 steps % 7.54/1.37 cnf(i_0_341433, plain, (i2003_11_14_17_19_24236=i2003_11_14_17_19_24236), inference(start_rule)). % 7.54/1.37 cnf(i_0_341894, plain, (i2003_11_14_17_19_24236=i2003_11_14_17_19_24236), inference(extension_rule, [i_0_341437])). % 7.54/1.37 cnf(i_0_342348, plain, (~cUnsatisfiable(i2003_11_14_17_19_24236)), inference(closure_rule, [i_0_66])). % 7.54/1.37 cnf(i_0_342346, plain, (cUnsatisfiable(i2003_11_14_17_19_24236)), inference(extension_rule, [i_0_35])). % 7.54/1.37 cnf(i_0_342353, plain, (cp(esk8_1(i2003_11_14_17_19_24236))), inference(etableau_closure_rule, [i_0_342353, ...])). % 7.54/1.37 # End printing tableau % 7.54/1.37 # SZS output end % 7.54/1.37 # Branches closed with saturation will be marked with an "s" % 7.54/1.37 # There were 54 total branch saturation attempts. % 7.54/1.37 # There were 0 of these attempts blocked. % 7.54/1.37 # There were 0 deferred branch saturation attempts. % 7.54/1.37 # There were 52 free duplicated saturations. % 7.54/1.37 # There were 54 total successful branch saturations. % 7.54/1.37 # There were 0 successful branch saturations in interreduction. % 7.54/1.37 # There were 0 successful branch saturations on the branch. % 7.54/1.37 # There were 2 successful branch saturations after the branch. % 7.54/1.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.54/1.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.54/1.37 # Begin clausification derivation % 7.54/1.37 % 7.54/1.37 # End clausification derivation % 7.54/1.37 # Begin listing active clauses obtained from FOF to CNF conversion % 7.54/1.37 cnf(i_0_66, plain, (cUnsatisfiable(i2003_11_14_17_19_24236))). % 7.54/1.37 cnf(i_0_14, plain, (~cowlNothing(X1))). % 7.54/1.37 cnf(i_0_59, plain, (~cp2(X1)|~cp1(X1))). % 7.54/1.37 cnf(i_0_56, plain, (~cp3(X1)|~cp1(X1))). % 7.54/1.37 cnf(i_0_58, plain, (~cp4(X1)|~cp1(X1))). % 7.54/1.37 cnf(i_0_16, plain, (xsd_string(X1)|xsd_integer(X1))). % 7.54/1.37 cnf(i_0_51, plain, (cp(esk2_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_57, plain, (~cp5(X1)|~cp1(X1))). % 7.54/1.37 cnf(i_0_60, plain, (~cp3(X1)|~cp2(X1))). % 7.54/1.37 cnf(i_0_62, plain, (~cp4(X1)|~cp2(X1))). % 7.54/1.37 cnf(i_0_61, plain, (~cp5(X1)|~cp2(X1))). % 7.54/1.37 cnf(i_0_64, plain, (~cp4(X1)|~cp3(X1))). % 7.54/1.37 cnf(i_0_63, plain, (~cp5(X1)|~cp3(X1))). % 7.54/1.37 cnf(i_0_65, plain, (~cp5(X1)|~cp4(X1))). % 7.54/1.37 cnf(i_0_17, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 7.54/1.37 cnf(i_0_46, plain, (cp(esk4_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_42, plain, (cp(esk6_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_35, plain, (cp(esk8_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_39, plain, (cp1(esk7_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_36, plain, (cp1(esk8_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_47, plain, (cp2(esk4_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_33, plain, (cp2(esk9_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_54, plain, (cp3(esk1_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_41, plain, (cp3(esk6_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_52, plain, (cp4(esk2_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_49, plain, (cp4(esk3_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_44, plain, (cp5(esk5_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_55, plain, (rr(X1,esk1_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_53, plain, (rr(X1,esk2_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_50, plain, (rr(X1,esk3_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_48, plain, (rr(X1,esk4_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_45, plain, (rr(X1,esk5_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_43, plain, (rr(X1,esk6_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_40, plain, (rr(X1,esk7_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_37, plain, (rr(X1,esk8_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_34, plain, (rr(X1,esk9_1(X1))|~cUnsatisfiable(X1))). % 7.54/1.37 cnf(i_0_38, plain, (X1=X2|X1=X3|X1=X4|X1=X5|X2=X3|X2=X4|X2=X5|X3=X4|X3=X5|X4=X5|~rr(X6,X5)|~rr(X6,X4)|~rr(X6,X3)|~rr(X6,X2)|~rr(X6,X1)|~cUnsatisfiable(X6))). % 7.54/1.37 cnf(i_0_27, plain, (cUnsatisfiable(X1)|esk11_1(X1)!=esk10_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_26, plain, (cUnsatisfiable(X1)|esk12_1(X1)!=esk10_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_23, plain, (cUnsatisfiable(X1)|esk12_1(X1)!=esk11_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_25, plain, (cUnsatisfiable(X1)|esk13_1(X1)!=esk10_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_22, plain, (cUnsatisfiable(X1)|esk13_1(X1)!=esk11_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_20, plain, (cUnsatisfiable(X1)|esk13_1(X1)!=esk12_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_24, plain, (cUnsatisfiable(X1)|esk14_1(X1)!=esk10_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_21, plain, (cUnsatisfiable(X1)|esk14_1(X1)!=esk11_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_19, plain, (cUnsatisfiable(X1)|esk14_1(X1)!=esk12_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_18, plain, (cUnsatisfiable(X1)|esk14_1(X1)!=esk13_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_32, plain, (rr(X1,esk10_1(X1))|cUnsatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_31, plain, (rr(X1,esk11_1(X1))|cUnsatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_30, plain, (rr(X1,esk12_1(X1))|cUnsatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_29, plain, (rr(X1,esk13_1(X1))|cUnsatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_28, plain, (rr(X1,esk14_1(X1))|cUnsatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~rr(X1,X10)|~cp5(X6)|~cp4(X8)|~cp4(X9)|~cp3(X5)|~cp3(X10)|~cp2(X2)|~cp2(X7)|~cp1(X3)|~cp1(X4)|~cp(X3)|~cp(X5)|~cp(X7)|~cp(X9))). % 7.54/1.37 cnf(i_0_300198, plain, (X75=X75)). % 7.54/1.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 7.54/1.37 # Begin printing tableau % 7.54/1.37 # Found 5 steps % 7.54/1.37 cnf(i_0_300198, plain, (i2003_11_14_17_19_24236=i2003_11_14_17_19_24236), inference(start_rule)). % 7.54/1.37 cnf(i_0_300659, plain, (i2003_11_14_17_19_24236=i2003_11_14_17_19_24236), inference(extension_rule, [i_0_300202])). % 7.54/1.37 cnf(i_0_301113, plain, (~cUnsatisfiable(i2003_11_14_17_19_24236)), inference(closure_rule, [i_0_66])). % 7.54/1.37 cnf(i_0_301111, plain, (cUnsatisfiable(i2003_11_14_17_19_24236)), inference(extension_rule, [i_0_47])). % 7.54/1.37 cnf(i_0_301118, plain, (cp2(esk4_1(i2003_11_14_17_19_24236))), inference(etableau_closure_rule, [i_0_301118, ...])). % 7.54/1.37 # End printing tableau % 7.54/1.37 # SZS output end % 7.54/1.37 # Branches closed with saturation will be marked with an "s" % 7.54/1.37 # Child (6467) has found a proof. % 7.54/1.37 # Creating equality axioms % 7.54/1.37 # Ran out of tableaux, making start rules for all clauses % 7.54/1.37 % 7.54/1.37 # Proof search is over... % 7.54/1.37 # Freeing feature tree %------------------------------------------------------------------------------