%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ALG080+1 : TPTP v8.1.0. Released v2.7.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 : Thu Jul 14 16:51:28 EDT 2022 % Result : Theorem 0.19s 0.40s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.11 % Problem : ALG080+1 : TPTP v8.1.0. Released v2.7.0. % 0.07/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 : Wed Jun 8 15:05: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: 166 Number of unprocessed: 166 % 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.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 166 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 61 conjectures. % 0.12/0.37 # There are 61 start rule candidates: % 0.12/0.37 # Found 156 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 61 start rule tableaux created. % 0.12/0.37 # 10 extension rule candidate clauses % 0.12/0.37 # 156 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.40 # Creating equality axioms % 0.19/0.40 # Ran out of tableaux, making start rules for all clauses % 0.19/0.40 # There were 1 total branch saturation attempts. % 0.19/0.40 # There were 0 of these attempts blocked. % 0.19/0.40 # There were 0 deferred branch saturation attempts. % 0.19/0.40 # There were 0 free duplicated saturations. % 0.19/0.40 # There were 1 total successful branch saturations. % 0.19/0.40 # There were 0 successful branch saturations in interreduction. % 0.19/0.40 # There were 0 successful branch saturations on the branch. % 0.19/0.40 # There were 1 successful branch saturations after the branch. % 0.19/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.40 # Begin clausification derivation % 0.19/0.40 % 0.19/0.40 # End clausification derivation % 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.40 cnf(i_0_156, negated_conjecture, (epred1_0)). % 0.19/0.40 cnf(i_0_105, negated_conjecture, (h(j(e20))=e20)). % 0.19/0.40 cnf(i_0_104, negated_conjecture, (h(j(e21))=e21)). % 0.19/0.40 cnf(i_0_103, negated_conjecture, (h(j(e22))=e22)). % 0.19/0.40 cnf(i_0_102, negated_conjecture, (h(j(e23))=e23)). % 0.19/0.40 cnf(i_0_101, negated_conjecture, (h(j(e24))=e24)). % 0.19/0.40 cnf(i_0_100, negated_conjecture, (j(h(e10))=e10)). % 0.19/0.40 cnf(i_0_99, negated_conjecture, (j(h(e11))=e11)). % 0.19/0.40 cnf(i_0_98, negated_conjecture, (j(h(e12))=e12)). % 0.19/0.40 cnf(i_0_97, negated_conjecture, (j(h(e13))=e13)). % 0.19/0.40 cnf(i_0_96, negated_conjecture, (j(h(e14))=e14)). % 0.19/0.40 cnf(i_0_70, plain, (op1(e10,e10)=e10)). % 0.19/0.40 cnf(i_0_69, plain, (op1(e10,e11)=e11)). % 0.19/0.40 cnf(i_0_68, plain, (op1(e10,e12)=e12)). % 0.19/0.40 cnf(i_0_67, plain, (op1(e10,e13)=e13)). % 0.19/0.40 cnf(i_0_66, plain, (op1(e10,e14)=e14)). % 0.19/0.40 cnf(i_0_65, plain, (op1(e11,e10)=e11)). % 0.19/0.40 cnf(i_0_64, plain, (op1(e11,e11)=e10)). % 0.19/0.40 cnf(i_0_63, plain, (op1(e11,e12)=e14)). % 0.19/0.40 cnf(i_0_62, plain, (op1(e11,e13)=e12)). % 0.19/0.40 cnf(i_0_61, plain, (op1(e11,e14)=e13)). % 0.19/0.40 cnf(i_0_60, plain, (op1(e12,e10)=e12)). % 0.19/0.40 cnf(i_0_59, plain, (op1(e12,e11)=e14)). % 0.19/0.40 cnf(i_0_58, plain, (op1(e12,e12)=e13)). % 0.19/0.40 cnf(i_0_57, plain, (op1(e12,e13)=e10)). % 0.19/0.40 cnf(i_0_56, plain, (op1(e12,e14)=e11)). % 0.19/0.40 cnf(i_0_55, plain, (op1(e13,e10)=e13)). % 0.19/0.40 cnf(i_0_54, plain, (op1(e13,e11)=e12)). % 0.19/0.40 cnf(i_0_53, plain, (op1(e13,e12)=e11)). % 0.19/0.40 cnf(i_0_52, plain, (op1(e13,e13)=e14)). % 0.19/0.40 cnf(i_0_51, plain, (op1(e13,e14)=e10)). % 0.19/0.40 cnf(i_0_50, plain, (op1(e14,e10)=e14)). % 0.19/0.40 cnf(i_0_49, plain, (op1(e14,e11)=e13)). % 0.19/0.40 cnf(i_0_48, plain, (op1(e14,e12)=e10)). % 0.19/0.40 cnf(i_0_47, plain, (op1(e14,e13)=e11)). % 0.19/0.40 cnf(i_0_46, plain, (op1(e14,e14)=e12)). % 0.19/0.40 cnf(i_0_95, plain, (op2(e20,e20)=e20)). % 0.19/0.40 cnf(i_0_94, plain, (op2(e20,e21)=e21)). % 0.19/0.40 cnf(i_0_93, plain, (op2(e20,e22)=e22)). % 0.19/0.40 cnf(i_0_92, plain, (op2(e20,e23)=e23)). % 0.19/0.40 cnf(i_0_91, plain, (op2(e20,e24)=e24)). % 0.19/0.40 cnf(i_0_90, plain, (op2(e21,e20)=e21)). % 0.19/0.40 cnf(i_0_89, plain, (op2(e21,e21)=e22)). % 0.19/0.40 cnf(i_0_88, plain, (op2(e21,e22)=e24)). % 0.19/0.40 cnf(i_0_87, plain, (op2(e21,e23)=e20)). % 0.19/0.40 cnf(i_0_86, plain, (op2(e21,e24)=e23)). % 0.19/0.40 cnf(i_0_85, plain, (op2(e22,e20)=e22)). % 0.19/0.40 cnf(i_0_84, plain, (op2(e22,e21)=e20)). % 0.19/0.40 cnf(i_0_83, plain, (op2(e22,e22)=e23)). % 0.19/0.40 cnf(i_0_82, plain, (op2(e22,e23)=e24)). % 0.19/0.40 cnf(i_0_81, plain, (op2(e22,e24)=e21)). % 0.19/0.40 cnf(i_0_80, plain, (op2(e23,e20)=e23)). % 0.19/0.40 cnf(i_0_79, plain, (op2(e23,e21)=e24)). % 0.19/0.40 cnf(i_0_78, plain, (op2(e23,e22)=e20)). % 0.19/0.40 cnf(i_0_77, plain, (op2(e23,e23)=e21)). % 0.19/0.40 cnf(i_0_76, plain, (op2(e23,e24)=e22)). % 0.19/0.40 cnf(i_0_75, plain, (op2(e24,e20)=e24)). % 0.19/0.40 cnf(i_0_74, plain, (op2(e24,e21)=e23)). % 0.19/0.40 cnf(i_0_73, plain, (op2(e24,e22)=e21)). % 0.19/0.40 cnf(i_0_72, plain, (op2(e24,e23)=e22)). % 0.19/0.40 cnf(i_0_71, plain, (op2(e24,e24)=e20)). % 0.19/0.40 cnf(i_0_155, negated_conjecture, (op2(h(e10),h(e10))=h(e10))). % 0.19/0.40 cnf(i_0_154, negated_conjecture, (op2(h(e10),h(e11))=h(e11))). % 0.19/0.40 cnf(i_0_153, negated_conjecture, (op2(h(e10),h(e12))=h(e12))). % 0.19/0.40 cnf(i_0_152, negated_conjecture, (op2(h(e10),h(e13))=h(e13))). % 0.19/0.40 cnf(i_0_151, negated_conjecture, (op2(h(e10),h(e14))=h(e14))). % 0.19/0.40 cnf(i_0_150, negated_conjecture, (op2(h(e11),h(e10))=h(e11))). % 0.19/0.40 cnf(i_0_149, negated_conjecture, (op2(h(e11),h(e11))=h(e10))). % 0.19/0.40 cnf(i_0_148, negated_conjecture, (op2(h(e11),h(e12))=h(e14))). % 0.19/0.40 cnf(i_0_147, negated_conjecture, (op2(h(e11),h(e13))=h(e12))). % 0.19/0.40 cnf(i_0_146, negated_conjecture, (op2(h(e11),h(e14))=h(e13))). % 0.19/0.40 cnf(i_0_145, negated_conjecture, (op2(h(e12),h(e10))=h(e12))). % 0.19/0.40 cnf(i_0_144, negated_conjecture, (op2(h(e12),h(e11))=h(e14))). % 0.19/0.40 cnf(i_0_143, negated_conjecture, (op2(h(e12),h(e12))=h(e13))). % 0.19/0.40 cnf(i_0_142, negated_conjecture, (op2(h(e12),h(e13))=h(e10))). % 0.19/0.40 cnf(i_0_141, negated_conjecture, (op2(h(e12),h(e14))=h(e11))). % 0.19/0.40 cnf(i_0_140, negated_conjecture, (op2(h(e13),h(e10))=h(e13))). % 0.19/0.40 cnf(i_0_139, negated_conjecture, (op2(h(e13),h(e11))=h(e12))). % 0.19/0.40 cnf(i_0_138, negated_conjecture, (op2(h(e13),h(e12))=h(e11))). % 0.19/0.40 cnf(i_0_137, negated_conjecture, (op2(h(e13),h(e13))=h(e14))). % 0.19/0.40 cnf(i_0_136, negated_conjecture, (op2(h(e13),h(e14))=h(e10))). % 0.19/0.40 cnf(i_0_135, negated_conjecture, (op2(h(e14),h(e10))=h(e14))). % 0.19/0.40 cnf(i_0_134, negated_conjecture, (op2(h(e14),h(e11))=h(e13))). % 0.19/0.40 cnf(i_0_133, negated_conjecture, (op2(h(e14),h(e12))=h(e10))). % 0.19/0.40 cnf(i_0_132, negated_conjecture, (op2(h(e14),h(e13))=h(e11))). % 0.19/0.40 cnf(i_0_131, negated_conjecture, (op2(h(e14),h(e14))=h(e12))). % 0.19/0.40 cnf(i_0_130, negated_conjecture, (op1(j(e20),j(e20))=j(e20))). % 0.19/0.40 cnf(i_0_129, negated_conjecture, (op1(j(e20),j(e21))=j(e21))). % 0.19/0.40 cnf(i_0_128, negated_conjecture, (op1(j(e20),j(e22))=j(e22))). % 0.19/0.40 cnf(i_0_127, negated_conjecture, (op1(j(e20),j(e23))=j(e23))). % 0.19/0.40 cnf(i_0_126, negated_conjecture, (op1(j(e20),j(e24))=j(e24))). % 0.19/0.40 cnf(i_0_125, negated_conjecture, (op1(j(e21),j(e20))=j(e21))). % 0.19/0.40 cnf(i_0_124, negated_conjecture, (op1(j(e21),j(e21))=j(e22))). % 0.19/0.40 cnf(i_0_123, negated_conjecture, (op1(j(e21),j(e22))=j(e24))). % 0.19/0.40 cnf(i_0_122, negated_conjecture, (op1(j(e21),j(e23))=j(e20))). % 0.19/0.40 cnf(i_0_121, negated_conjecture, (op1(j(e21),j(e24))=j(e23))). % 0.19/0.40 cnf(i_0_120, negated_conjecture, (op1(j(e22),j(e20))=j(e22))). % 0.19/0.40 cnf(i_0_119, negated_conjecture, (op1(j(e22),j(e21))=j(e20))). % 0.19/0.40 cnf(i_0_118, negated_conjecture, (op1(j(e22),j(e22))=j(e23))). % 0.19/0.40 cnf(i_0_117, negated_conjecture, (op1(j(e22),j(e23))=j(e24))). % 0.19/0.40 cnf(i_0_116, negated_conjecture, (op1(j(e22),j(e24))=j(e21))). % 0.19/0.40 cnf(i_0_115, negated_conjecture, (op1(j(e23),j(e20))=j(e23))). % 0.19/0.40 cnf(i_0_114, negated_conjecture, (op1(j(e23),j(e21))=j(e24))). % 0.19/0.40 cnf(i_0_113, negated_conjecture, (op1(j(e23),j(e22))=j(e20))). % 0.19/0.40 cnf(i_0_112, negated_conjecture, (op1(j(e23),j(e23))=j(e21))). % 0.19/0.40 cnf(i_0_111, negated_conjecture, (op1(j(e23),j(e24))=j(e22))). % 0.19/0.40 cnf(i_0_110, negated_conjecture, (op1(j(e24),j(e20))=j(e24))). % 0.19/0.40 cnf(i_0_109, negated_conjecture, (op1(j(e24),j(e21))=j(e23))). % 0.19/0.40 cnf(i_0_108, negated_conjecture, (op1(j(e24),j(e22))=j(e21))). % 0.19/0.40 cnf(i_0_107, negated_conjecture, (op1(j(e24),j(e23))=j(e22))). % 0.19/0.40 cnf(i_0_106, negated_conjecture, (op1(j(e24),j(e24))=j(e20))). % 0.19/0.40 cnf(i_0_10, plain, (e11!=e10)). % 0.19/0.40 cnf(i_0_9, plain, (e12!=e10)). % 0.19/0.40 cnf(i_0_6, plain, (e12!=e11)). % 0.19/0.40 cnf(i_0_8, plain, (e13!=e10)). % 0.19/0.40 cnf(i_0_5, plain, (e13!=e11)). % 0.19/0.40 cnf(i_0_3, plain, (e13!=e12)). % 0.19/0.40 cnf(i_0_7, plain, (e14!=e10)). % 0.19/0.40 cnf(i_0_4, plain, (e14!=e11)). % 0.19/0.40 cnf(i_0_2, plain, (e14!=e12)). % 0.19/0.40 cnf(i_0_1, plain, (e14!=e13)). % 0.19/0.40 cnf(i_0_45, plain, (e10!=e20)). % 0.19/0.40 cnf(i_0_40, plain, (e11!=e20)). % 0.19/0.40 cnf(i_0_35, plain, (e12!=e20)). % 0.19/0.40 cnf(i_0_30, plain, (e13!=e20)). % 0.19/0.40 cnf(i_0_25, plain, (e14!=e20)). % 0.19/0.40 cnf(i_0_44, plain, (e10!=e21)). % 0.19/0.40 cnf(i_0_39, plain, (e11!=e21)). % 0.19/0.40 cnf(i_0_34, plain, (e12!=e21)). % 0.19/0.40 cnf(i_0_29, plain, (e13!=e21)). % 0.19/0.40 cnf(i_0_24, plain, (e14!=e21)). % 0.19/0.40 cnf(i_0_20, plain, (e21!=e20)). % 0.19/0.40 cnf(i_0_43, plain, (e10!=e22)). % 0.19/0.40 cnf(i_0_38, plain, (e11!=e22)). % 0.19/0.40 cnf(i_0_33, plain, (e12!=e22)). % 0.19/0.40 cnf(i_0_28, plain, (e13!=e22)). % 0.19/0.40 cnf(i_0_23, plain, (e14!=e22)). % 0.19/0.40 cnf(i_0_19, plain, (e22!=e20)). % 0.19/0.40 cnf(i_0_16, plain, (e22!=e21)). % 0.19/0.40 cnf(i_0_42, plain, (e10!=e23)). % 0.19/0.40 cnf(i_0_37, plain, (e11!=e23)). % 0.19/0.40 cnf(i_0_32, plain, (e12!=e23)). % 0.19/0.40 cnf(i_0_27, plain, (e13!=e23)). % 0.19/0.40 cnf(i_0_22, plain, (e14!=e23)). % 0.19/0.40 cnf(i_0_18, plain, (e23!=e20)). % 0.19/0.40 cnf(i_0_15, plain, (e23!=e21)). % 0.19/0.40 cnf(i_0_13, plain, (e23!=e22)). % 0.19/0.40 cnf(i_0_41, plain, (e10!=e24)). % 0.19/0.40 cnf(i_0_36, plain, (e11!=e24)). % 0.19/0.40 cnf(i_0_31, plain, (e12!=e24)). % 0.19/0.40 cnf(i_0_26, plain, (e13!=e24)). % 0.19/0.40 cnf(i_0_21, plain, (e14!=e24)). % 0.19/0.40 cnf(i_0_17, plain, (e24!=e20)). % 0.19/0.40 cnf(i_0_14, plain, (e24!=e21)). % 0.19/0.40 cnf(i_0_12, plain, (e24!=e22)). % 0.19/0.40 cnf(i_0_11, plain, (e24!=e23)). % 0.19/0.40 cnf(i_0_166, plain, (h(e10)=e24|h(e10)=e23|h(e10)=e22|h(e10)=e21|h(e10)=e20)). % 0.19/0.40 cnf(i_0_165, plain, (h(e11)=e24|h(e11)=e23|h(e11)=e22|h(e11)=e21|h(e11)=e20)). % 0.19/0.40 cnf(i_0_164, plain, (h(e12)=e24|h(e12)=e23|h(e12)=e22|h(e12)=e21|h(e12)=e20)). % 0.19/0.40 cnf(i_0_163, plain, (h(e13)=e24|h(e13)=e23|h(e13)=e22|h(e13)=e21|h(e13)=e20)). % 0.19/0.40 cnf(i_0_162, plain, (h(e14)=e24|h(e14)=e23|h(e14)=e22|h(e14)=e21|h(e14)=e20)). % 0.19/0.40 cnf(i_0_161, plain, (j(e20)=e14|j(e20)=e13|j(e20)=e12|j(e20)=e11|j(e20)=e10)). % 0.19/0.40 cnf(i_0_160, plain, (j(e21)=e14|j(e21)=e13|j(e21)=e12|j(e21)=e11|j(e21)=e10)). % 0.19/0.40 cnf(i_0_159, plain, (j(e22)=e14|j(e22)=e13|j(e22)=e12|j(e22)=e11|j(e22)=e10)). % 0.19/0.40 cnf(i_0_158, plain, (j(e23)=e14|j(e23)=e13|j(e23)=e12|j(e23)=e11|j(e23)=e10)). % 0.19/0.40 cnf(i_0_157, plain, (j(e24)=e14|j(e24)=e13|j(e24)=e12|j(e24)=e11|j(e24)=e10)). % 0.19/0.40 cnf(i_0_578, plain, (X1=X1)). % 0.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.40 # Begin printing tableau % 0.19/0.40 # Found 6 steps % 0.19/0.40 cnf(i_0_578, plain, (X6=X6), inference(start_rule)). % 0.19/0.40 cnf(i_0_792, plain, (X6=X6), inference(extension_rule, [i_0_582])). % 0.19/0.40 cnf(i_0_852, plain, (h(j(e20))!=e20), inference(closure_rule, [i_0_105])). % 0.19/0.40 cnf(i_0_850, plain, (op1(X6,h(j(e20)))=op1(X6,e20)), inference(extension_rule, [i_0_583])). % 0.19/0.40 cnf(i_0_1322, plain, (h(j(e20))!=e20), inference(closure_rule, [i_0_105])). % 0.19/0.40 cnf(i_0_1320, plain, (op2(op1(X6,h(j(e20))),h(j(e20)))=op2(op1(X6,e20),e20)), inference(etableau_closure_rule, [i_0_1320, ...])). % 0.19/0.40 # End printing tableau % 0.19/0.40 # SZS output end % 0.19/0.40 # Branches closed with saturation will be marked with an "s" % 0.19/0.41 # Child (13793) has found a proof. % 0.19/0.41 % 0.19/0.41 # Proof search is over... % 0.19/0.41 # Freeing feature tree %------------------------------------------------------------------------------