%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM375+1.010 : TPTP v8.1.0. Released v3.2.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 : n023.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 : Mon Jul 18 09:40:28 EDT 2022 % Result : Unsatisfiable 0.20s 0.44s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.12 % Problem : NUM375+1.010 : TPTP v8.1.0. Released v3.2.0. % 0.08/0.13 % 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 : n023.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 : Thu Jul 7 20:08:11 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 212 Number of unprocessed: 212 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.40 # The folding up rule is enabled... % 0.12/0.40 # Local unification is enabled... % 0.12/0.40 # Any saturation attempts will use folding labels... % 0.12/0.40 # 212 beginning clauses after preprocessing and clausification % 0.12/0.40 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.12/0.40 # No conjectures. % 0.12/0.40 # There are 212 start rule candidates: % 0.12/0.40 # Found 210 unit axioms. % 0.12/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.40 # 212 start rule tableaux created. % 0.12/0.40 # 2 extension rule candidate clauses % 0.12/0.40 # 210 unit axiom clauses % 0.12/0.40 % 0.12/0.40 # Requested 8, 32 cores available to the main process. % 0.20/0.44 # Creating equality axioms % 0.20/0.44 # Ran out of tableaux, making start rules for all clauses % 0.20/0.44 # There were 1 total branch saturation attempts. % 0.20/0.44 # There were 0 of these attempts blocked. % 0.20/0.44 # There were 0 deferred branch saturation attempts. % 0.20/0.44 # There were 0 free duplicated saturations. % 0.20/0.44 # There were 1 total successful branch saturations. % 0.20/0.44 # There were 0 successful branch saturations in interreduction. % 0.20/0.44 # There were 0 successful branch saturations on the branch. % 0.20/0.44 # There were 1 successful branch saturations after the branch. % 0.20/0.44 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.44 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.44 # Begin clausification derivation % 0.20/0.44 % 0.20/0.44 # End clausification derivation % 0.20/0.44 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.44 cnf(i_0_212, plain, (succ(n0)=n1)). % 0.20/0.44 cnf(i_0_211, plain, (succ(n1)=n2)). % 0.20/0.44 cnf(i_0_210, plain, (succ(n2)=n3)). % 0.20/0.44 cnf(i_0_209, plain, (succ(n3)=n4)). % 0.20/0.44 cnf(i_0_208, plain, (succ(n4)=n5)). % 0.20/0.44 cnf(i_0_207, plain, (succ(n5)=n6)). % 0.20/0.44 cnf(i_0_206, plain, (succ(n6)=n7)). % 0.20/0.44 cnf(i_0_205, plain, (succ(n7)=n8)). % 0.20/0.44 cnf(i_0_204, plain, (succ(n8)=n9)). % 0.20/0.44 cnf(i_0_203, plain, (succ(n9)=n10)). % 0.20/0.44 cnf(i_0_202, plain, (succ(n10)=n0)). % 0.20/0.44 cnf(i_0_201, plain, (pred(n0)=n10)). % 0.20/0.44 cnf(i_0_200, plain, (pred(n1)=n0)). % 0.20/0.44 cnf(i_0_199, plain, (pred(n2)=n1)). % 0.20/0.44 cnf(i_0_198, plain, (pred(n3)=n2)). % 0.20/0.44 cnf(i_0_197, plain, (pred(n4)=n3)). % 0.20/0.44 cnf(i_0_196, plain, (pred(n5)=n4)). % 0.20/0.44 cnf(i_0_195, plain, (pred(n6)=n5)). % 0.20/0.44 cnf(i_0_194, plain, (pred(n7)=n6)). % 0.20/0.44 cnf(i_0_193, plain, (pred(n8)=n7)). % 0.20/0.44 cnf(i_0_192, plain, (pred(n9)=n8)). % 0.20/0.44 cnf(i_0_191, plain, (pred(n10)=n9)). % 0.20/0.44 cnf(i_0_190, plain, (sum(n0,n0)=n0)). % 0.20/0.44 cnf(i_0_189, plain, (sum(n0,n1)=n1)). % 0.20/0.44 cnf(i_0_188, plain, (sum(n0,n2)=n2)). % 0.20/0.44 cnf(i_0_187, plain, (sum(n0,n3)=n3)). % 0.20/0.44 cnf(i_0_186, plain, (sum(n0,n4)=n4)). % 0.20/0.44 cnf(i_0_185, plain, (sum(n0,n5)=n5)). % 0.20/0.44 cnf(i_0_184, plain, (sum(n0,n6)=n6)). % 0.20/0.44 cnf(i_0_183, plain, (sum(n0,n7)=n7)). % 0.20/0.44 cnf(i_0_182, plain, (sum(n0,n8)=n8)). % 0.20/0.44 cnf(i_0_181, plain, (sum(n0,n9)=n9)). % 0.20/0.44 cnf(i_0_180, plain, (sum(n0,n10)=n10)). % 0.20/0.44 cnf(i_0_179, plain, (sum(n1,n0)=n1)). % 0.20/0.44 cnf(i_0_178, plain, (sum(n1,n1)=n2)). % 0.20/0.44 cnf(i_0_177, plain, (sum(n1,n2)=n3)). % 0.20/0.44 cnf(i_0_176, plain, (sum(n1,n3)=n4)). % 0.20/0.44 cnf(i_0_175, plain, (sum(n1,n4)=n5)). % 0.20/0.44 cnf(i_0_174, plain, (sum(n1,n5)=n6)). % 0.20/0.44 cnf(i_0_173, plain, (sum(n1,n6)=n7)). % 0.20/0.44 cnf(i_0_172, plain, (sum(n1,n7)=n8)). % 0.20/0.44 cnf(i_0_171, plain, (sum(n1,n8)=n9)). % 0.20/0.44 cnf(i_0_170, plain, (sum(n1,n9)=n10)). % 0.20/0.44 cnf(i_0_169, plain, (sum(n1,n10)=n0)). % 0.20/0.44 cnf(i_0_168, plain, (sum(n2,n0)=n2)). % 0.20/0.44 cnf(i_0_167, plain, (sum(n2,n1)=n3)). % 0.20/0.44 cnf(i_0_166, plain, (sum(n2,n2)=n4)). % 0.20/0.44 cnf(i_0_165, plain, (sum(n2,n3)=n5)). % 0.20/0.44 cnf(i_0_164, plain, (sum(n2,n4)=n6)). % 0.20/0.44 cnf(i_0_163, plain, (sum(n2,n5)=n7)). % 0.20/0.44 cnf(i_0_162, plain, (sum(n2,n6)=n8)). % 0.20/0.44 cnf(i_0_161, plain, (sum(n2,n7)=n9)). % 0.20/0.44 cnf(i_0_160, plain, (sum(n2,n8)=n10)). % 0.20/0.44 cnf(i_0_159, plain, (sum(n2,n9)=n0)). % 0.20/0.44 cnf(i_0_158, plain, (sum(n2,n10)=n1)). % 0.20/0.44 cnf(i_0_157, plain, (sum(n3,n0)=n3)). % 0.20/0.44 cnf(i_0_156, plain, (sum(n3,n1)=n4)). % 0.20/0.44 cnf(i_0_155, plain, (sum(n3,n2)=n5)). % 0.20/0.44 cnf(i_0_154, plain, (sum(n3,n3)=n6)). % 0.20/0.44 cnf(i_0_153, plain, (sum(n3,n4)=n7)). % 0.20/0.44 cnf(i_0_152, plain, (sum(n3,n5)=n8)). % 0.20/0.44 cnf(i_0_151, plain, (sum(n3,n6)=n9)). % 0.20/0.44 cnf(i_0_150, plain, (sum(n3,n7)=n10)). % 0.20/0.44 cnf(i_0_149, plain, (sum(n3,n8)=n0)). % 0.20/0.44 cnf(i_0_148, plain, (sum(n3,n9)=n1)). % 0.20/0.44 cnf(i_0_147, plain, (sum(n3,n10)=n2)). % 0.20/0.44 cnf(i_0_146, plain, (sum(n4,n0)=n4)). % 0.20/0.44 cnf(i_0_145, plain, (sum(n4,n1)=n5)). % 0.20/0.44 cnf(i_0_144, plain, (sum(n4,n2)=n6)). % 0.20/0.44 cnf(i_0_143, plain, (sum(n4,n3)=n7)). % 0.20/0.44 cnf(i_0_142, plain, (sum(n4,n4)=n8)). % 0.20/0.44 cnf(i_0_141, plain, (sum(n4,n5)=n9)). % 0.20/0.44 cnf(i_0_140, plain, (sum(n4,n6)=n10)). % 0.20/0.44 cnf(i_0_139, plain, (sum(n4,n7)=n0)). % 0.20/0.44 cnf(i_0_138, plain, (sum(n4,n8)=n1)). % 0.20/0.44 cnf(i_0_137, plain, (sum(n4,n9)=n2)). % 0.20/0.44 cnf(i_0_136, plain, (sum(n4,n10)=n3)). % 0.20/0.44 cnf(i_0_135, plain, (sum(n5,n0)=n5)). % 0.20/0.44 cnf(i_0_134, plain, (sum(n5,n1)=n6)). % 0.20/0.44 cnf(i_0_133, plain, (sum(n5,n2)=n7)). % 0.20/0.44 cnf(i_0_132, plain, (sum(n5,n3)=n8)). % 0.20/0.44 cnf(i_0_131, plain, (sum(n5,n4)=n9)). % 0.20/0.44 cnf(i_0_130, plain, (sum(n5,n5)=n10)). % 0.20/0.44 cnf(i_0_129, plain, (sum(n5,n6)=n0)). % 0.20/0.44 cnf(i_0_128, plain, (sum(n5,n7)=n1)). % 0.20/0.44 cnf(i_0_127, plain, (sum(n5,n8)=n2)). % 0.20/0.44 cnf(i_0_126, plain, (sum(n5,n9)=n3)). % 0.20/0.44 cnf(i_0_125, plain, (sum(n5,n10)=n4)). % 0.20/0.44 cnf(i_0_124, plain, (sum(n6,n0)=n6)). % 0.20/0.44 cnf(i_0_123, plain, (sum(n6,n1)=n7)). % 0.20/0.44 cnf(i_0_122, plain, (sum(n6,n2)=n8)). % 0.20/0.44 cnf(i_0_121, plain, (sum(n6,n3)=n9)). % 0.20/0.44 cnf(i_0_120, plain, (sum(n6,n4)=n10)). % 0.20/0.44 cnf(i_0_119, plain, (sum(n6,n5)=n0)). % 0.20/0.44 cnf(i_0_118, plain, (sum(n6,n6)=n1)). % 0.20/0.44 cnf(i_0_117, plain, (sum(n6,n7)=n2)). % 0.20/0.44 cnf(i_0_116, plain, (sum(n6,n8)=n3)). % 0.20/0.44 cnf(i_0_115, plain, (sum(n6,n9)=n4)). % 0.20/0.44 cnf(i_0_114, plain, (sum(n6,n10)=n5)). % 0.20/0.44 cnf(i_0_113, plain, (sum(n7,n0)=n7)). % 0.20/0.44 cnf(i_0_112, plain, (sum(n7,n1)=n8)). % 0.20/0.44 cnf(i_0_111, plain, (sum(n7,n2)=n9)). % 0.20/0.44 cnf(i_0_110, plain, (sum(n7,n3)=n10)). % 0.20/0.44 cnf(i_0_109, plain, (sum(n7,n4)=n0)). % 0.20/0.44 cnf(i_0_108, plain, (sum(n7,n5)=n1)). % 0.20/0.44 cnf(i_0_107, plain, (sum(n7,n6)=n2)). % 0.20/0.44 cnf(i_0_106, plain, (sum(n7,n7)=n3)). % 0.20/0.44 cnf(i_0_105, plain, (sum(n7,n8)=n4)). % 0.20/0.44 cnf(i_0_104, plain, (sum(n7,n9)=n5)). % 0.20/0.44 cnf(i_0_103, plain, (sum(n7,n10)=n6)). % 0.20/0.44 cnf(i_0_102, plain, (sum(n8,n0)=n8)). % 0.20/0.44 cnf(i_0_101, plain, (sum(n8,n1)=n9)). % 0.20/0.44 cnf(i_0_100, plain, (sum(n8,n2)=n10)). % 0.20/0.44 cnf(i_0_99, plain, (sum(n8,n3)=n0)). % 0.20/0.44 cnf(i_0_98, plain, (sum(n8,n4)=n1)). % 0.20/0.44 cnf(i_0_97, plain, (sum(n8,n5)=n2)). % 0.20/0.44 cnf(i_0_96, plain, (sum(n8,n6)=n3)). % 0.20/0.44 cnf(i_0_95, plain, (sum(n8,n7)=n4)). % 0.20/0.44 cnf(i_0_94, plain, (sum(n8,n8)=n5)). % 0.20/0.44 cnf(i_0_93, plain, (sum(n8,n9)=n6)). % 0.20/0.44 cnf(i_0_92, plain, (sum(n8,n10)=n7)). % 0.20/0.44 cnf(i_0_91, plain, (sum(n9,n0)=n9)). % 0.20/0.44 cnf(i_0_90, plain, (sum(n9,n1)=n10)). % 0.20/0.44 cnf(i_0_89, plain, (sum(n9,n2)=n0)). % 0.20/0.44 cnf(i_0_88, plain, (sum(n9,n3)=n1)). % 0.20/0.44 cnf(i_0_87, plain, (sum(n9,n4)=n2)). % 0.20/0.44 cnf(i_0_86, plain, (sum(n9,n5)=n3)). % 0.20/0.44 cnf(i_0_85, plain, (sum(n9,n6)=n4)). % 0.20/0.44 cnf(i_0_84, plain, (sum(n9,n7)=n5)). % 0.20/0.44 cnf(i_0_83, plain, (sum(n9,n8)=n6)). % 0.20/0.44 cnf(i_0_82, plain, (sum(n9,n9)=n7)). % 0.20/0.44 cnf(i_0_81, plain, (sum(n9,n10)=n8)). % 0.20/0.44 cnf(i_0_80, plain, (sum(n10,n0)=n10)). % 0.20/0.44 cnf(i_0_79, plain, (sum(n10,n1)=n0)). % 0.20/0.44 cnf(i_0_78, plain, (sum(n10,n2)=n1)). % 0.20/0.44 cnf(i_0_77, plain, (sum(n10,n3)=n2)). % 0.20/0.44 cnf(i_0_76, plain, (sum(n10,n4)=n3)). % 0.20/0.44 cnf(i_0_75, plain, (sum(n10,n5)=n4)). % 0.20/0.44 cnf(i_0_74, plain, (sum(n10,n6)=n5)). % 0.20/0.44 cnf(i_0_73, plain, (sum(n10,n7)=n6)). % 0.20/0.44 cnf(i_0_72, plain, (sum(n10,n8)=n7)). % 0.20/0.44 cnf(i_0_71, plain, (sum(n10,n9)=n8)). % 0.20/0.44 cnf(i_0_70, plain, (sum(n10,n10)=n9)). % 0.20/0.44 cnf(i_0_67, plain, (sum(pred(sum(esk1_0,succ(esk2_0))),sum(esk2_0,pred(sum(esk1_0,esk2_0))))=esk3_0)). % 0.20/0.44 cnf(i_0_55, plain, (n0!=n1)). % 0.20/0.44 cnf(i_0_54, plain, (n0!=n2)). % 0.20/0.44 cnf(i_0_45, plain, (n2!=n1)). % 0.20/0.44 cnf(i_0_53, plain, (n0!=n3)). % 0.20/0.44 cnf(i_0_44, plain, (n3!=n1)). % 0.20/0.44 cnf(i_0_36, plain, (n3!=n2)). % 0.20/0.44 cnf(i_0_52, plain, (n0!=n4)). % 0.20/0.44 cnf(i_0_43, plain, (n4!=n1)). % 0.20/0.44 cnf(i_0_35, plain, (n4!=n2)). % 0.20/0.44 cnf(i_0_28, plain, (n4!=n3)). % 0.20/0.44 cnf(i_0_51, plain, (n0!=n5)). % 0.20/0.44 cnf(i_0_42, plain, (n5!=n1)). % 0.20/0.44 cnf(i_0_34, plain, (n5!=n2)). % 0.20/0.44 cnf(i_0_27, plain, (n5!=n3)). % 0.20/0.44 cnf(i_0_21, plain, (n5!=n4)). % 0.20/0.44 cnf(i_0_50, plain, (n0!=n6)). % 0.20/0.44 cnf(i_0_41, plain, (n6!=n1)). % 0.20/0.44 cnf(i_0_33, plain, (n6!=n2)). % 0.20/0.44 cnf(i_0_26, plain, (n6!=n3)). % 0.20/0.44 cnf(i_0_20, plain, (n6!=n4)). % 0.20/0.44 cnf(i_0_15, plain, (n6!=n5)). % 0.20/0.44 cnf(i_0_49, plain, (n0!=n7)). % 0.20/0.44 cnf(i_0_40, plain, (n7!=n1)). % 0.20/0.44 cnf(i_0_32, plain, (n7!=n2)). % 0.20/0.44 cnf(i_0_25, plain, (n7!=n3)). % 0.20/0.44 cnf(i_0_19, plain, (n7!=n4)). % 0.20/0.44 cnf(i_0_14, plain, (n7!=n5)). % 0.20/0.44 cnf(i_0_10, plain, (n7!=n6)). % 0.20/0.44 cnf(i_0_48, plain, (n0!=n8)). % 0.20/0.44 cnf(i_0_39, plain, (n8!=n1)). % 0.20/0.44 cnf(i_0_31, plain, (n8!=n2)). % 0.20/0.44 cnf(i_0_24, plain, (n8!=n3)). % 0.20/0.44 cnf(i_0_18, plain, (n8!=n4)). % 0.20/0.44 cnf(i_0_13, plain, (n8!=n5)). % 0.20/0.44 cnf(i_0_9, plain, (n8!=n6)). % 0.20/0.44 cnf(i_0_6, plain, (n8!=n7)). % 0.20/0.44 cnf(i_0_47, plain, (n0!=n9)). % 0.20/0.44 cnf(i_0_38, plain, (n9!=n1)). % 0.20/0.44 cnf(i_0_30, plain, (n9!=n2)). % 0.20/0.44 cnf(i_0_23, plain, (n9!=n3)). % 0.20/0.44 cnf(i_0_17, plain, (n9!=n4)). % 0.20/0.44 cnf(i_0_12, plain, (n9!=n5)). % 0.20/0.44 cnf(i_0_8, plain, (n9!=n6)). % 0.20/0.44 cnf(i_0_5, plain, (n9!=n7)). % 0.20/0.44 cnf(i_0_3, plain, (n9!=n8)). % 0.20/0.44 cnf(i_0_46, plain, (n0!=n10)). % 0.20/0.44 cnf(i_0_37, plain, (n10!=n1)). % 0.20/0.44 cnf(i_0_29, plain, (n10!=n2)). % 0.20/0.44 cnf(i_0_22, plain, (n10!=n3)). % 0.20/0.44 cnf(i_0_16, plain, (n10!=n4)). % 0.20/0.44 cnf(i_0_11, plain, (n10!=n5)). % 0.20/0.44 cnf(i_0_7, plain, (n10!=n6)). % 0.20/0.44 cnf(i_0_4, plain, (n10!=n7)). % 0.20/0.44 cnf(i_0_2, plain, (n10!=n8)). % 0.20/0.44 cnf(i_0_1, plain, (n10!=n9)). % 0.20/0.44 cnf(i_0_66, plain, (esk3_0!=n0)). % 0.20/0.44 cnf(i_0_65, plain, (esk3_0!=n1)). % 0.20/0.44 cnf(i_0_64, plain, (esk3_0!=n2)). % 0.20/0.44 cnf(i_0_63, plain, (esk3_0!=n3)). % 0.20/0.44 cnf(i_0_62, plain, (esk3_0!=n4)). % 0.20/0.44 cnf(i_0_61, plain, (esk3_0!=n5)). % 0.20/0.44 cnf(i_0_60, plain, (esk3_0!=n6)). % 0.20/0.44 cnf(i_0_59, plain, (esk3_0!=n7)). % 0.20/0.44 cnf(i_0_58, plain, (esk3_0!=n8)). % 0.20/0.44 cnf(i_0_57, plain, (esk3_0!=n9)). % 0.20/0.44 cnf(i_0_56, plain, (esk3_0!=n10)). % 0.20/0.44 cnf(i_0_69, plain, (esk1_0=n10|esk1_0=n9|esk1_0=n8|esk1_0=n7|esk1_0=n6|esk1_0=n5|esk1_0=n4|esk1_0=n3|esk1_0=n2|esk1_0=n1|esk1_0=n0)). % 0.20/0.44 cnf(i_0_68, plain, (esk2_0=n10|esk2_0=n9|esk2_0=n8|esk2_0=n7|esk2_0=n6|esk2_0=n5|esk2_0=n4|esk2_0=n3|esk2_0=n2|esk2_0=n1|esk2_0=n0)). % 0.20/0.44 cnf(i_0_1039, plain, (X7=X7)). % 0.20/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.44 # Begin printing tableau % 0.20/0.44 # Found 5 steps % 0.20/0.44 cnf(i_0_1039, plain, (n0=n0), inference(start_rule)). % 0.20/0.44 cnf(i_0_1278, plain, (n0=n0), inference(extension_rule, [i_0_1043])). % 0.20/0.44 cnf(i_0_1308, plain, (succ(n0)=succ(n0)), inference(extension_rule, [i_0_1042])). % 0.20/0.44 cnf(i_0_1338, plain, (succ(n0)!=n1), inference(closure_rule, [i_0_212])). % 0.20/0.44 cnf(i_0_1336, plain, (succ(n0)=n1), inference(etableau_closure_rule, [i_0_1336, ...])). % 0.20/0.44 # End printing tableau % 0.20/0.44 # SZS output end % 0.20/0.44 # Branches closed with saturation will be marked with an "s" % 0.20/0.45 # Child (1679) has found a proof. % 0.20/0.45 % 0.20/0.45 # Proof search is over... % 0.20/0.45 # Freeing feature tree %------------------------------------------------------------------------------