%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL641+1.001 : TPTP v9.3.1. Released v4.0.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 : n027.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 12:01:32 PM UTC 2026 % Result : CounterSatisfiable 0.13s 0.47s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL641+1.001 : TPTP v9.3.1. Released v4.0.0. % 0.00/0.04 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.09/0.35 % Computer : n027.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Sun Sep 6 00:06:28 UTC 2026 % 0.09/0.36 % CPUTime : % 0.13/0.40 # No SInE strategy applied % 0.13/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.40 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.40 # % 0.13/0.40 # Presaturation interreduction done % 0.13/0.40 # Number of axioms: 58 Number of unprocessed: 58 % 0.13/0.40 # Tableaux proof search. % 0.13/0.40 # APR header successfully linked. % 0.13/0.40 # Hello from C++ % 0.13/0.40 # The folding up rule is enabled... % 0.13/0.40 # Local unification is enabled... % 0.13/0.40 # Any saturation attempts will use folding labels... % 0.13/0.40 # 58 beginning clauses after preprocessing and clausification % 0.13/0.40 # Creating start rules for all 10 conjectures. % 0.13/0.40 # There are 10 start rule candidates: % 0.13/0.40 # Found 4 unit axioms. % 0.13/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.40 # 10 start rule tableaux created. % 0.13/0.40 # 54 extension rule candidate clauses % 0.13/0.40 # 4 unit axiom clauses % 0.13/0.40 % 0.13/0.40 # Requested 8, 32 cores available to the main process. % 0.13/0.47 # 2778918 Satisfiable branch % 0.13/0.47 # Satisfiable branch found. % 0.13/0.47 # There were 1 total branch saturation attempts. % 0.13/0.47 # There were 0 of these attempts blocked. % 0.13/0.47 # There were 0 deferred branch saturation attempts. % 0.13/0.47 # There were 0 free duplicated saturations. % 0.13/0.47 # There were 0 total successful branch saturations. % 0.13/0.47 # There were 0 successful branch saturations in interreduction. % 0.13/0.47 # There were 0 successful branch saturations on the branch. % 0.13/0.47 # There were 0 successful branch saturations after the branch. % 0.13/0.47 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.47 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.47 # Begin clausification derivation % 0.13/0.47 % 0.13/0.47 # End clausification derivation % 0.13/0.47 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.47 cnf(i_0_9, negated_conjecture, (r1(esk1_0,esk2_0))). % 0.13/0.47 cnf(i_0_8, negated_conjecture, (r1(esk2_0,esk3_0))). % 0.13/0.47 cnf(i_0_6, negated_conjecture, (r1(esk3_0,esk4_0))). % 0.13/0.47 cnf(i_0_7, negated_conjecture, (~p1(esk3_0))). % 0.13/0.47 cnf(i_0_5, negated_conjecture, (p1(X1)|~r1(esk4_0,X1))). % 0.13/0.47 cnf(i_0_1, negated_conjecture, (p1(esk5_1(X1))|p1(X1)|~r1(esk3_0,X1))). % 0.13/0.47 cnf(i_0_2, negated_conjecture, (p1(X1)|~p1(esk6_1(X1))|~r1(esk3_0,X1))). % 0.13/0.47 cnf(i_0_10, negated_conjecture, (epred1_1(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.47 cnf(i_0_4, negated_conjecture, (p1(X1)|r1(X1,esk5_1(X1))|~r1(esk3_0,X1))). % 0.13/0.47 cnf(i_0_15, plain, (p1(X1)|~epred1_1(X2)|~p1(esk16_3(X2,X3,X1))|~p1(esk17_1(X2))|~r1(X3,X1)|~r1(X2,X3))). % 0.13/0.47 cnf(i_0_3, negated_conjecture, (p1(X1)|r1(esk5_1(X1),esk6_1(X1))|~r1(esk3_0,X1))). % 0.13/0.47 cnf(i_0_12, plain, (p1(esk15_3(X1,X2,X3))|p1(X3)|~epred1_1(X1)|~p1(esk17_1(X1))|~r1(X2,X3)|~r1(X1,X2))). % 0.13/0.47 cnf(i_0_23, plain, (p1(X1)|~epred1_1(X2)|~p1(esk14_2(X2,X3))|~r1(X4,X1)|~r1(X3,X4)|~r1(X2,X3))). % 0.13/0.47 cnf(i_0_26, plain, (p1(X1)|p1(X2)|~epred1_1(X1)|~p1(esk12_2(X1,X3))|~p1(esk13_1(X1))|~r1(X1,X2)|~r1(X1,X3))). % 0.13/0.47 cnf(i_0_16, plain, (p1(X1)|r1(X2,esk17_1(X2))|~epred1_1(X2)|~p1(esk16_3(X2,X3,X1))|~r1(X3,X1)|~r1(X2,X3))). % 0.13/0.47 cnf(i_0_21, plain, (p1(X1)|r1(X1,esk15_3(X2,X3,X1))|~epred1_1(X2)|~p1(esk17_1(X2))|~r1(X3,X1)|~r1(X2,X3))). % 0.13/0.47 cnf(i_0_29, plain, (p1(X1)|p1(X2)|r1(X3,esk12_2(X1,X3))|~epred1_1(X1)|~p1(esk13_1(X1))|~r1(X1,X2)|~r1(X1,X3))). % 0.13/0.47 cnf(i_0_13, plain, (p1(esk15_3(X1,X2,X3))|p1(X3)|r1(X1,esk17_1(X1))|~epred1_1(X1)|~r1(X2,X3)|~r1(X1,X2))). % 0.13/0.47 cnf(i_0_24, plain, (p1(X1)|r1(X2,esk14_2(X3,X2))|~epred1_1(X3)|~r1(X4,X1)|~r1(X3,X2)|~r1(X2,X4))). % 0.13/0.47 cnf(i_0_27, plain, (p1(X1)|p1(X2)|r1(X1,esk13_1(X1))|~epred1_1(X1)|~p1(esk12_2(X1,X3))|~r1(X1,X2)|~r1(X1,X3))). % 0.13/0.47 cnf(i_0_14, plain, (p1(X1)|p1(X2)|~epred1_1(X3)|~p1(esk16_3(X3,X4,X2))|~p1(X5)|~r1(esk17_1(X3),X5)|~r1(X4,X2)|~r1(X5,X1)|~r1(X3,X4))). % 0.13/0.47 cnf(i_0_18, plain, (p1(X1)|r1(esk15_3(X2,X3,X1),esk16_3(X2,X3,X1))|~epred1_1(X2)|~p1(esk17_1(X2))|~r1(X3,X1)|~r1(X2,X3))). % 0.13/0.47 cnf(i_0_22, plain, (p1(X1)|r1(X1,esk15_3(X2,X3,X1))|r1(X2,esk17_1(X2))|~epred1_1(X2)|~r1(X3,X1)|~r1(X2,X3))). % 0.13/0.47 cnf(i_0_30, plain, (p1(X1)|p1(X2)|r1(X3,esk12_2(X1,X3))|r1(X1,esk13_1(X1))|~epred1_1(X1)|~r1(X1,X2)|~r1(X1,X3))). % 0.13/0.47 cnf(i_0_25, plain, (p1(X1)|p1(X2)|p1(X3)|~epred1_1(X1)|~p1(esk12_2(X1,X4))|~p1(X5)|~r1(esk13_1(X1),X5)|~r1(X5,X2)|~r1(X1,X3)|~r1(X1,X4))). % 0.13/0.47 cnf(i_0_11, plain, (p1(esk15_3(X1,X2,X3))|p1(X4)|p1(X3)|~epred1_1(X1)|~p1(X5)|~r1(esk17_1(X1),X5)|~r1(X2,X3)|~r1(X5,X4)|~r1(X1,X2))). % 0.13/0.47 cnf(i_0_41, plain, (p1(esk9_1(X1))|p1(X2)|p1(X3)|~epred1_1(X1)|~p1(esk8_2(X1,X4))|~p1(X5)|~p1(X1)|~r1(X5,X2)|~r1(X1,X3)|~r1(X1,X5)|~r1(X1,X4))). % 0.13/0.47 cnf(i_0_34, plain, (p1(esk7_2(X1,X2))|p1(esk9_1(X1))|p1(X3)|p1(X4)|~epred1_1(X1)|~p1(X5)|~p1(X1)|~r1(X5,X3)|~r1(X1,X4)|~r1(X1,X5)|~r1(X1,X2))). % 0.13/0.47 cnf(i_0_19, plain, (p1(X1)|r1(esk15_3(X2,X3,X1),esk16_3(X2,X3,X1))|r1(X2,esk17_1(X2))|~epred1_1(X2)|~r1(X3,X1)|~r1(X2,X3))). % 0.13/0.47 cnf(i_0_42, plain, (p1(X1)|p1(X2)|~epred1_1(X3)|~p1(esk8_2(X3,X4))|~p1(esk10_1(X3))|~p1(X5)|~p1(X3)|~r1(X5,X1)|~r1(X3,X2)|~r1(X3,X5)|~r1(X3,X4))). % 0.13/0.47 cnf(i_0_20, plain, (p1(X1)|p1(X2)|r1(X2,esk15_3(X3,X4,X2))|~epred1_1(X3)|~p1(X5)|~r1(esk17_1(X3),X5)|~r1(X4,X2)|~r1(X5,X1)|~r1(X3,X4))). % 0.13/0.47 cnf(i_0_35, plain, (p1(esk7_2(X1,X2))|p1(X3)|p1(X4)|~epred1_1(X1)|~p1(esk10_1(X1))|~p1(X5)|~p1(X1)|~r1(X5,X3)|~r1(X1,X4)|~r1(X1,X5)|~r1(X1,X2))). % 0.13/0.47 cnf(i_0_28, plain, (p1(X1)|p1(X2)|p1(X3)|r1(X4,esk12_2(X1,X4))|~epred1_1(X1)|~p1(X5)|~r1(esk13_1(X1),X5)|~r1(X5,X2)|~r1(X1,X3)|~r1(X1,X4))). % 0.13/0.47 cnf(i_0_17, plain, (p1(X1)|p1(X2)|r1(esk15_3(X3,X4,X2),esk16_3(X3,X4,X2))|~epred1_1(X3)|~p1(X5)|~r1(esk17_1(X3),X5)|~r1(X4,X2)|~r1(X5,X1)|~r1(X3,X4))). % 0.13/0.47 cnf(i_0_44, plain, (p1(X1)|p1(X2)|r1(X3,esk9_1(X3))|~epred1_1(X3)|~p1(esk8_2(X3,X4))|~p1(X5)|~p1(X3)|~r1(X5,X1)|~r1(X3,X2)|~r1(X3,X5)|~r1(X3,X4))). % 0.13/0.47 cnf(i_0_55, plain, (p1(esk9_1(X1))|p1(X2)|p1(X3)|r1(X4,esk7_2(X1,X4))|~epred1_1(X1)|~p1(X5)|~p1(X1)|~r1(X5,X2)|~r1(X1,X3)|~r1(X1,X5)|~r1(X1,X4))). % 0.13/0.47 cnf(i_0_56, plain, (p1(X1)|p1(X2)|r1(X3,esk7_2(X4,X3))|~epred1_1(X4)|~p1(esk10_1(X4))|~p1(X5)|~p1(X4)|~r1(X5,X1)|~r1(X4,X2)|~r1(X4,X5)|~r1(X4,X3))). % 0.13/0.47 cnf(i_0_43, plain, (p1(X1)|p1(X2)|r1(esk9_1(X3),esk10_1(X3))|~epred1_1(X3)|~p1(esk8_2(X3,X4))|~p1(X5)|~p1(X3)|~r1(X5,X1)|~r1(X3,X2)|~r1(X3,X5)|~r1(X3,X4))). % 0.13/0.47 cnf(i_0_37, plain, (p1(esk7_2(X1,X2))|p1(X3)|p1(X4)|r1(X1,esk9_1(X1))|~epred1_1(X1)|~p1(X5)|~p1(X1)|~r1(X5,X3)|~r1(X1,X4)|~r1(X1,X5)|~r1(X1,X2))). % 0.13/0.47 cnf(i_0_36, plain, (p1(esk7_2(X1,X2))|p1(X3)|p1(X4)|r1(esk9_1(X1),esk10_1(X1))|~epred1_1(X1)|~p1(X5)|~p1(X1)|~r1(X5,X3)|~r1(X1,X4)|~r1(X1,X5)|~r1(X1,X2))). % 0.13/0.47 cnf(i_0_49, plain, (p1(X1)|p1(X2)|r1(esk7_2(X3,X4),esk8_2(X3,X4))|~epred1_1(X3)|~p1(esk10_1(X3))|~p1(X5)|~p1(X3)|~r1(X5,X1)|~r1(X3,X2)|~r1(X3,X5)|~r1(X3,X4))). % 0.13/0.47 cnf(i_0_58, plain, (p1(X1)|p1(X2)|r1(X3,esk7_2(X4,X3))|r1(X4,esk9_1(X4))|~epred1_1(X4)|~p1(X5)|~p1(X4)|~r1(X5,X1)|~r1(X4,X2)|~r1(X4,X5)|~r1(X4,X3))). % 0.13/0.47 cnf(i_0_48, plain, (p1(esk9_1(X1))|p1(X2)|p1(X3)|r1(esk7_2(X1,X4),esk8_2(X1,X4))|~epred1_1(X1)|~p1(X5)|~p1(X1)|~r1(X5,X2)|~r1(X1,X3)|~r1(X1,X5)|~r1(X1,X4))). % 0.13/0.47 cnf(i_0_51, plain, (p1(X1)|p1(X2)|r1(esk7_2(X3,X4),esk8_2(X3,X4))|r1(X3,esk9_1(X3))|~epred1_1(X3)|~p1(X5)|~p1(X3)|~r1(X5,X1)|~r1(X3,X2)|~r1(X3,X5)|~r1(X3,X4))). % 0.13/0.47 cnf(i_0_57, plain, (p1(X1)|p1(X2)|r1(esk9_1(X3),esk10_1(X3))|r1(X4,esk7_2(X3,X4))|~epred1_1(X3)|~p1(X5)|~p1(X3)|~r1(X5,X1)|~r1(X3,X2)|~r1(X3,X5)|~r1(X3,X4))). % 0.13/0.47 cnf(i_0_50, plain, (p1(X1)|p1(X2)|r1(esk7_2(X3,X4),esk8_2(X3,X4))|r1(esk9_1(X3),esk10_1(X3))|~epred1_1(X3)|~p1(X5)|~p1(X3)|~r1(X5,X1)|~r1(X3,X2)|~r1(X3,X5)|~r1(X3,X4))). % 0.13/0.47 cnf(i_0_38, plain, (p1(X1)|p1(X2)|p1(X3)|p1(X4)|~epred1_1(X5)|~p1(esk8_2(X5,X6))|~p1(X7)|~p1(X8)|~p1(X5)|~r1(esk9_1(X5),X1)|~r1(X7,X3)|~r1(X8,X2)|~r1(X5,X4)|~r1(X5,X7)|~r1(X5,X6)|~r1(X1,X8))). % 0.13/0.47 cnf(i_0_39, plain, (p1(X1)|p1(X2)|p1(X3)|~epred1_1(X4)|~p1(esk8_2(X4,X5))|~p1(esk11_2(X4,X6))|~p1(X7)|~p1(X8)|~p1(X4)|~r1(esk9_1(X4),X6)|~r1(X7,X2)|~r1(X8,X1)|~r1(X6,X8)|~r1(X4,X3)|~r1(X4,X7)|~r1(X4,X5))). % 0.13/0.47 cnf(i_0_31, plain, (p1(esk7_2(X1,X2))|p1(X3)|p1(X4)|p1(X5)|p1(X6)|~epred1_1(X1)|~p1(X7)|~p1(X8)|~p1(X1)|~r1(esk9_1(X1),X3)|~r1(X7,X5)|~r1(X8,X4)|~r1(X1,X6)|~r1(X1,X7)|~r1(X1,X2)|~r1(X3,X8))). % 0.13/0.47 cnf(i_0_52, plain, (p1(X1)|p1(X2)|p1(X3)|p1(X4)|r1(X5,esk7_2(X6,X5))|~epred1_1(X6)|~p1(X7)|~p1(X8)|~p1(X6)|~r1(esk9_1(X6),X1)|~r1(X7,X3)|~r1(X8,X2)|~r1(X6,X4)|~r1(X6,X7)|~r1(X6,X5)|~r1(X1,X8))). % 0.13/0.47 cnf(i_0_32, plain, (p1(esk7_2(X1,X2))|p1(X3)|p1(X4)|p1(X5)|~epred1_1(X1)|~p1(esk11_2(X1,X6))|~p1(X7)|~p1(X8)|~p1(X1)|~r1(esk9_1(X1),X6)|~r1(X7,X4)|~r1(X8,X3)|~r1(X6,X8)|~r1(X1,X5)|~r1(X1,X7)|~r1(X1,X2))). % 0.13/0.47 cnf(i_0_53, plain, (p1(X1)|p1(X2)|p1(X3)|r1(X4,esk7_2(X5,X4))|~epred1_1(X5)|~p1(esk11_2(X5,X6))|~p1(X7)|~p1(X8)|~p1(X5)|~r1(esk9_1(X5),X6)|~r1(X7,X2)|~r1(X8,X1)|~r1(X6,X8)|~r1(X5,X3)|~r1(X5,X7)|~r1(X5,X4))). % 0.13/0.47 cnf(i_0_40, plain, (p1(X1)|p1(X2)|p1(X3)|r1(X4,esk11_2(X5,X4))|~epred1_1(X5)|~p1(esk8_2(X5,X6))|~p1(X7)|~p1(X8)|~p1(X5)|~r1(esk9_1(X5),X4)|~r1(X7,X2)|~r1(X8,X1)|~r1(X5,X3)|~r1(X5,X7)|~r1(X5,X6)|~r1(X4,X8))). % 0.13/0.47 cnf(i_0_45, plain, (p1(X1)|p1(X2)|p1(X3)|p1(X4)|r1(esk7_2(X5,X6),esk8_2(X5,X6))|~epred1_1(X5)|~p1(X7)|~p1(X8)|~p1(X5)|~r1(esk9_1(X5),X1)|~r1(X7,X3)|~r1(X8,X2)|~r1(X5,X4)|~r1(X5,X7)|~r1(X5,X6)|~r1(X1,X8))). % 0.13/0.47 cnf(i_0_33, plain, (p1(esk7_2(X1,X2))|p1(X3)|p1(X4)|p1(X5)|r1(X6,esk11_2(X1,X6))|~epred1_1(X1)|~p1(X7)|~p1(X8)|~p1(X1)|~r1(esk9_1(X1),X6)|~r1(X7,X4)|~r1(X8,X3)|~r1(X1,X5)|~r1(X1,X7)|~r1(X1,X2)|~r1(X6,X8))). % 0.13/0.47 cnf(i_0_54, plain, (p1(X1)|p1(X2)|p1(X3)|r1(X4,esk11_2(X5,X4))|r1(X6,esk7_2(X5,X6))|~epred1_1(X5)|~p1(X7)|~p1(X8)|~p1(X5)|~r1(esk9_1(X5),X4)|~r1(X7,X2)|~r1(X8,X1)|~r1(X5,X3)|~r1(X5,X7)|~r1(X5,X6)|~r1(X4,X8))). % 0.13/0.47 cnf(i_0_46, plain, (p1(X1)|p1(X2)|p1(X3)|r1(esk7_2(X4,X5),esk8_2(X4,X5))|~epred1_1(X4)|~p1(esk11_2(X4,X6))|~p1(X7)|~p1(X8)|~p1(X4)|~r1(esk9_1(X4),X6)|~r1(X7,X2)|~r1(X8,X1)|~r1(X6,X8)|~r1(X4,X3)|~r1(X4,X7)|~r1(X4,X5))). % 0.13/0.47 cnf(i_0_47, plain, (p1(X1)|p1(X2)|p1(X3)|r1(esk7_2(X4,X5),esk8_2(X4,X5))|r1(X6,esk11_2(X4,X6))|~epred1_1(X4)|~p1(X7)|~p1(X8)|~p1(X4)|~r1(esk9_1(X4),X6)|~r1(X7,X2)|~r1(X8,X1)|~r1(X4,X3)|~r1(X4,X7)|~r1(X4,X5)|~r1(X6,X8))). % 0.13/0.47 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.47 # Begin printing tableau % 0.13/0.47 # Found 9 steps % 0.13/0.47 cnf(i_0_1, negated_conjecture, (p1(esk5_1(esk3_0))|p1(esk3_0)|~r1(esk3_0,esk3_0)), inference(start_rule)). % 0.13/0.47 cnf(i_0_72, plain, (p1(esk3_0)), inference(closure_rule, [i_0_7])). % 0.13/0.47 cnf(i_0_71, plain, (p1(esk5_1(esk3_0))), inference(extension_rule, [i_0_14])). % 0.13/0.47 cnf(i_0_143, plain, (p1(esk3_0)), inference(closure_rule, [i_0_7])). % 0.13/0.47 cnf(i_0_144, plain, (p1(esk3_0)), inference(closure_rule, [i_0_7])). % 0.13/0.47 cnf(i_0_149, plain, (~r1(esk2_0,esk3_0)), inference(closure_rule, [i_0_8])). % 0.13/0.47 cnf(i_0_151, plain, (~r1(esk1_0,esk2_0)), inference(closure_rule, [i_0_9])). % 0.13/0.47 cnf(i_0_145, plain, (~epred1_1(esk1_0)), inference(extension_rule, [i_0_10])). % 0.13/0.47 cnf(i_0_662, plain, (~r1(esk1_0,esk2_0)), inference(closure_rule, [i_0_9])). % 0.13/0.47 # End printing tableau % 0.13/0.47 # SZS output end % 0.13/0.47 # Branches closed with saturation will be marked with an "s" % 0.13/0.47 # Child (2778918) has found a proof. % 0.13/0.47 % 0.13/0.47 # Proof search is over... % 0.13/0.47 # Freeing feature tree %------------------------------------------------------------------------------