%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM525+3 : TPTP v8.1.0. 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 : n011.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:41:58 EDT 2022 % Result : Theorem 0.20s 0.45s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : NUM525+3 : TPTP v8.1.0. Released v4.0.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.33 % Computer : n011.cluster.edu % 0.14/0.33 % Model : x86_64 x86_64 % 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.33 % Memory : 8042.1875MB % 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.33 % CPULimit : 300 % 0.14/0.33 % WCLimit : 600 % 0.14/0.33 % DateTime : Tue Jul 5 15:44:37 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.38 # No SInE strategy applied % 0.14/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N % 0.14/0.38 # and selection function SelectUnlessUniqMax. % 0.14/0.38 # % 0.14/0.38 # Presaturation interreduction done % 0.14/0.38 # Number of axioms: 96 Number of unprocessed: 91 % 0.14/0.38 # Tableaux proof search. % 0.14/0.38 # APR header successfully linked. % 0.14/0.38 # Hello from C++ % 0.14/0.38 # The folding up rule is enabled... % 0.14/0.38 # Local unification is enabled... % 0.14/0.38 # Any saturation attempts will use folding labels... % 0.14/0.38 # 91 beginning clauses after preprocessing and clausification % 0.14/0.38 # Creating start rules for all 1 conjectures. % 0.14/0.38 # There are 1 start rule candidates: % 0.14/0.38 # Found 24 unit axioms. % 0.14/0.38 # 1 start rule tableaux created. % 0.14/0.38 # 67 extension rule candidate clauses % 0.14/0.38 # 24 unit axiom clauses % 0.14/0.38 % 0.14/0.38 # Requested 8, 32 cores available to the main process. % 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.14/0.38 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.14/0.38 # We now have 11 tableaux to operate on % 0.20/0.45 # Creating equality axioms % 0.20/0.45 # Ran out of tableaux, making start rules for all clauses % 0.20/0.45 # There were 1 total branch saturation attempts. % 0.20/0.45 # There were 0 of these attempts blocked. % 0.20/0.45 # There were 0 deferred branch saturation attempts. % 0.20/0.45 # There were 0 free duplicated saturations. % 0.20/0.45 # There were 1 total successful branch saturations. % 0.20/0.45 # There were 0 successful branch saturations in interreduction. % 0.20/0.45 # There were 0 successful branch saturations on the branch. % 0.20/0.45 # There were 1 successful branch saturations after the branch. % 0.20/0.45 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.45 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.45 # Begin clausification derivation % 0.20/0.45 % 0.20/0.45 # End clausification derivation % 0.20/0.45 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.45 cnf(i_0_97, hypothesis, (sdtasdt0(xp,xq)=xn)). % 0.20/0.45 cnf(i_0_76, hypothesis, (aNaturalNumber0(xm))). % 0.20/0.45 cnf(i_0_2, plain, (aNaturalNumber0(sz00))). % 0.20/0.45 cnf(i_0_4, plain, (aNaturalNumber0(sz10))). % 0.20/0.45 cnf(i_0_77, hypothesis, (aNaturalNumber0(xn))). % 0.20/0.45 cnf(i_0_75, hypothesis, (aNaturalNumber0(xp))). % 0.20/0.45 cnf(i_0_98, hypothesis, (aNaturalNumber0(xq))). % 0.20/0.45 cnf(i_0_86, hypothesis, (isPrime0(xp))). % 0.20/0.45 cnf(i_0_91, hypothesis, (sdtasdt0(xp,esk8_0)=xn)). % 0.20/0.45 cnf(i_0_85, hypothesis, (sdtasdt0(xp,sdtasdt0(xm,xm))=sdtasdt0(xn,xn))). % 0.20/0.45 cnf(i_0_95, hypothesis, (aNaturalNumber0(esk7_0))). % 0.20/0.45 cnf(i_0_92, hypothesis, (aNaturalNumber0(esk8_0))). % 0.20/0.45 cnf(i_0_90, hypothesis, (doDivides0(xp,xn))). % 0.20/0.45 cnf(i_0_96, hypothesis, (sdtsldt0(xn,xp)=xq)). % 0.20/0.45 cnf(i_0_94, hypothesis, (sdtasdt0(xp,esk7_0)=sdtasdt0(xn,xn))). % 0.20/0.45 cnf(i_0_93, hypothesis, (doDivides0(xp,sdtasdt0(xn,xn)))). % 0.20/0.45 cnf(i_0_73, hypothesis, (xm!=sz00)). % 0.20/0.45 cnf(i_0_72, hypothesis, (xp!=sz00)). % 0.20/0.45 cnf(i_0_89, hypothesis, (xp!=sz10)). % 0.20/0.45 cnf(i_0_3, plain, (sz10!=sz00)). % 0.20/0.45 cnf(i_0_74, hypothesis, (xn!=sz00)). % 0.20/0.45 cnf(i_0_67, plain, (~isPrime0(sz00))). % 0.20/0.45 cnf(i_0_66, plain, (~isPrime0(sz10))). % 0.20/0.45 cnf(i_0_99, negated_conjecture, (sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq)))!=sdtasdt0(xn,xn))). % 0.20/0.45 cnf(i_0_32, plain, (sdtlseqdt0(X1,X1)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_15, plain, (sdtasdt0(sz00,X1)=sz00|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_16, plain, (sdtasdt0(X1,sz00)=sz00|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_13, plain, (sdtasdt0(sz10,X1)=X1|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_14, plain, (sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_23, plain, (X1=sz00|sdtpldt0(X2,X1)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_87, hypothesis, (X1=xp|X1=sz10|~doDivides0(X1,xp)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_88, hypothesis, (X1=xp|X1=sz10|sdtasdt0(X1,X2)!=xp|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.45 cnf(i_0_6, plain, (aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_24, plain, (X1=sz00|sdtpldt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_11, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_70, plain, (X1=sz10|X1=sz00|aNaturalNumber0(esk4_1(X1))|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_68, plain, (X1=sz10|X1=sz00|isPrime0(esk4_1(X1))|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_5, plain, (aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_33, plain, (X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_28, plain, (aNaturalNumber0(esk1_2(X1,X2))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_52, plain, (aNaturalNumber0(esk2_2(X1,X2))|~doDivides0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_45, plain, (X1=sz10|X1=sz00|sdtlseqdt0(sz10,X1)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_25, plain, (X1=sz00|X2=sz00|sdtasdt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_62, plain, (X1=sz10|X1=sz00|isPrime0(X1)|esk3_1(X1)!=sz10|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_61, plain, (X1=sz10|X1=sz00|isPrime0(X1)|esk3_1(X1)!=X1|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_7, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_64, plain, (X1=sz10|X1=sz00|isPrime0(X1)|aNaturalNumber0(esk3_1(X1))|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_69, plain, (X1=sz10|X1=sz00|doDivides0(esk4_1(X1),X1)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_59, plain, (X1=sz00|sdtlseqdt0(X2,X1)|~doDivides0(X2,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.45 cnf(i_0_49, plain, (X1=X2|iLess0(X1,X2)|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_20, plain, (X1=X2|sdtpldt0(X3,X1)!=sdtpldt0(X3,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))). % 0.20/0.45 cnf(i_0_47, plain, (X1=sz00|sdtlseqdt0(X2,sdtasdt0(X2,X1))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_51, plain, (sdtasdt0(X1,esk2_2(X1,X2))=X2|~doDivides0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.45 cnf(i_0_19, plain, (X1=X2|sdtpldt0(X1,X3)!=sdtpldt0(X2,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_12, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_22, plain, (X1=sz00|X2=X3|sdtasdt0(X1,X2)!=sdtasdt0(X1,X3)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_63, plain, (X1=sz10|X1=sz00|isPrime0(X1)|doDivides0(esk3_1(X1),X1)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_35, plain, (sdtlseqdt0(X1,X2)|sdtlseqdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_65, plain, (X1=sz10|X1=X2|~isPrime0(X2)|~doDivides0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_58, plain, (doDivides0(X1,X2)|~doDivides0(X1,sdtpldt0(X3,X2))|~doDivides0(X1,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_27, plain, (sdtpldt0(X1,esk1_2(X1,X2))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_21, plain, (X1=sz00|X2=X3|sdtasdt0(X2,X1)!=sdtasdt0(X3,X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.45 cnf(i_0_34, plain, (sdtlseqdt0(X1,X2)|~sdtlseqdt0(X3,X2)|~sdtlseqdt0(X1,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_8, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_56, plain, (doDivides0(X1,X2)|~doDivides0(X3,X2)|~doDivides0(X1,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_57, plain, (doDivides0(X1,sdtpldt0(X2,X3))|~doDivides0(X1,X3)|~doDivides0(X1,X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_60, plain, (sdtsldt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtsldt0(X2,X3))|X3=sz00|~doDivides0(X3,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3))). % 0.20/0.45 cnf(i_0_71, plain, (doDivides0(X1,X2)|doDivides0(X1,X3)|~isPrime0(X1)|~doDivides0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2))). % 0.20/0.45 cnf(i_0_39, plain, (X1=X2|sdtlseqdt0(sdtpldt0(X3,X1),sdtpldt0(X3,X2))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))). % 0.20/0.45 cnf(i_0_37, plain, (X1=X2|sdtlseqdt0(sdtpldt0(X1,X3),sdtpldt0(X2,X3))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_43, plain, (X1=sz00|X2=X3|sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))|~sdtlseqdt0(X2,X3)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_41, plain, (X1=sz00|X2=X3|sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))|~sdtlseqdt0(X2,X3)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.45 cnf(i_0_78, hypothesis, (X1=sz00|X2=sz00|X3=sz00|sdtasdt0(X1,sdtasdt0(X3,X3))!=sdtasdt0(X2,X2)|~isPrime0(X1)|~iLess0(X2,xn)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_80, hypothesis, (X1=sz00|X2=sz00|X3=sz10|X3=sz00|sdtasdt0(X3,sdtasdt0(X2,X2))!=sdtasdt0(X1,X1)|esk5_3(X1,X2,X3)!=sz10|~iLess0(X1,xn)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_79, hypothesis, (X1=sz00|X2=sz00|X3=sz10|X3=sz00|sdtasdt0(X3,sdtasdt0(X2,X2))!=sdtasdt0(X1,X1)|esk5_3(X1,X2,X3)!=X3|~iLess0(X1,xn)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_84, hypothesis, (X1=sz00|X2=sz00|X3=sz10|X3=sz00|aNaturalNumber0(esk5_3(X1,X2,X3))|sdtasdt0(X3,sdtasdt0(X2,X2))!=sdtasdt0(X1,X1)|~iLess0(X1,xn)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_83, hypothesis, (X1=sz00|X2=sz00|X3=sz10|X3=sz00|aNaturalNumber0(esk6_3(X1,X2,X3))|sdtasdt0(X3,sdtasdt0(X2,X2))!=sdtasdt0(X1,X1)|~iLess0(X1,xn)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_81, hypothesis, (X1=sz00|X2=sz00|X3=sz10|X3=sz00|doDivides0(esk5_3(X1,X2,X3),X3)|sdtasdt0(X3,sdtasdt0(X2,X2))!=sdtasdt0(X1,X1)|~iLess0(X1,xn)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_82, hypothesis, (sdtasdt0(esk5_3(X1,X2,X3),esk6_3(X1,X2,X3))=X3|X3=sz10|X3=sz00|X1=sz00|X2=sz00|sdtasdt0(X3,sdtasdt0(X2,X2))!=sdtasdt0(X1,X1)|~iLess0(X1,xn)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))). % 0.20/0.45 cnf(i_0_31, plain, (aNaturalNumber0(sdtmndt0(X1,X2))|~sdtlseqdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_50, plain, (doDivides0(X1,sdtasdt0(X1,X2))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.45 cnf(i_0_30, plain, (sdtpldt0(X1,sdtmndt0(X2,X1))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.45 cnf(i_0_55, plain, (X1=sz00|aNaturalNumber0(sdtsldt0(X2,X1))|~doDivides0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.45 cnf(i_0_26, plain, (sdtlseqdt0(X1,sdtpldt0(X1,X2))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.45 cnf(i_0_54, plain, (sdtasdt0(X1,sdtsldt0(X2,X1))=X2|X1=sz00|~doDivides0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.45 cnf(i_0_29, plain, (sdtmndt0(sdtpldt0(X1,X2),X1)=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.45 cnf(i_0_53, plain, (sdtsldt0(sdtasdt0(X1,X2),X1)=X2|X1=sz00|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.45 cnf(i_0_772, plain, (X100=X100)). % 0.20/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.45 # Begin printing tableau % 0.20/0.45 # Found 8 steps % 0.20/0.45 cnf(i_0_772, plain, (sdtpldt0(xm,xm)=sdtpldt0(xm,xm)), inference(start_rule)). % 0.20/0.45 cnf(i_0_1139, plain, (sdtpldt0(xm,xm)=sdtpldt0(xm,xm)), inference(extension_rule, [i_0_20])). % 0.20/0.45 cnf(i_0_1244, plain, (~aNaturalNumber0(xm)), inference(closure_rule, [i_0_76])). % 0.20/0.45 cnf(i_0_1245, plain, (~aNaturalNumber0(xm)), inference(closure_rule, [i_0_76])). % 0.20/0.45 cnf(i_0_1246, plain, (~aNaturalNumber0(xm)), inference(closure_rule, [i_0_76])). % 0.20/0.45 cnf(i_0_1242, plain, (xm=xm), inference(extension_rule, [i_0_775])). % 0.20/0.45 cnf(i_0_1576, plain, (xm=sz00), inference(closure_rule, [i_0_73])). % 0.20/0.45 cnf(i_0_1578, plain, (xm!=sz00), inference(etableau_closure_rule, [i_0_1578, ...])). % 0.20/0.45 # End printing tableau % 0.20/0.45 # SZS output end % 0.20/0.45 # Branches closed with saturation will be marked with an "s" % 0.20/0.46 # Child (16177) has found a proof. % 0.20/0.46 % 0.20/0.46 # Proof search is over... % 0.20/0.46 # Freeing feature tree %------------------------------------------------------------------------------